Memetic search for identifying critical nodes in sparse graphs

05/11/2017
by   Yangming Zhou, et al.
0

Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As useful models for a variety of practical applications, these problems are computational challenging. In this paper, we study the classic critical node problem (CNP) and introduce an effective memetic algorithm for solving CNP. The proposed algorithm combines a double backbone-based crossover operator (to generate promising offspring solutions), a component-based neighborhood search procedure (to find high-quality local optima) and a rank-based pool updating strategy (to guarantee a healthy population). Specially, the component-based neighborhood search integrates two key techniques, i.e., two-phase node exchange strategy and node weighting scheme. The double backbone-based crossover extends the idea of general backbone-based crossovers. Extensive evaluations on 42 synthetic and real-world benchmark instances show that the proposed algorithm discovers 21 new upper bounds and matches 18 previous best-known upper bounds. We also demonstrate the relevance of our algorithm for effectively solving a variant of the classic CNP, called the cardinality-constrained critical node problem. Finally, we investigate the usefulness of each key algorithmic component.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2022

Frequent Itemset-driven Search for Finding Minimum Node Separators in Complex Networks

Finding an optimal set of critical nodes in a complex network has been a...
research
09/12/2019

Variable Population Memetic Search: A Case Study on the Critical Node Problem

Population-based memetic algorithms have been successfully applied to so...
research
05/18/2014

A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs

This paper introduces an effective memetic algorithm for the linear orde...
research
01/12/2021

A threshold search based memetic algorithm for the disjunctively constrained knapsack problem

The disjunctively constrained knapsack problem consists in packing a sub...
research
12/03/2021

Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems

Detecting critical nodes in sparse networks is important in a variety of...
research
12/03/2021

Learning to Search in Local Branching

Finding high-quality solutions to mixed-integer linear programming probl...
research
09/07/2021

A new neighborhood structure for job shop scheduling problems

Job shop scheduling problem (JSP) is a widely studied NP-complete combin...

Please sign up or login with your details

Forgot password? Click here to reset