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

کلیدواژه ها:

Combinatorial Optimization ، Heuristic Search ، GRASP with Path Relinking ، Critical Node Detection Problem