论文信息 - Heuristic Algorithm for Identifying Critical Nodes in Graphs

Heuristic Algorithm for Identifying Critical Nodes in Graphs

The paper presents Greedy Randomized Adaptive Search Procedure with Path Relinking (GRASP with PR) for the Critical Node Detection Problem (CNDP). An evolutionary Path Relinking mechanism is added to GRASP with PR to intensify. Our computational experiments show that this algorithm is a competitive method compared with the previously proposed methods for solving CNDP such as Variable Neighborhood Search and Simulated Annealing.

Dalaijargal Purevsuren | Nwe Nwe Htay Win | Gang Cui | Xiu-Feng Wang

[1] Panos M. Pardalos,et al. Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[2] Fred Glover,et al. Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[3] Maurício Resende,et al. GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[4] Marco Di Summa,et al. Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth , 2013, Discret. Appl. Math..

[5] Mauricio G. C. Resende,et al. Hybridizations of GRASP with Path-Relinking , 2013, Hybrid Metaheuristics.

[6] Roberto Aringhieri,et al. VNS solutions for the Critical Node Problem , 2015, Electron. Notes Discret. Math..

[7] Mario Ventresca,et al. A derandomized approximation algorithm for the critical node detection problem , 2014, Comput. Oper. Res..

[8] Mario Ventresca,et al. Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem , 2012, Comput. Oper. Res..

[9] Marco Di Summa,et al. Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[10] M. Resende,et al. GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[11] Marco Di Summa,et al. Branch and cut algorithms for detecting critical nodes in undirected graphs , 2012, Computational Optimization and Applications.