Algorithms and Analysis for the Critical Facilities Identification Problem in Network Based on P-median Model

Vulnerability to sudden service disruption due to deliberate sabotage and terrorist attacks is one of the major threats for network system.Much attention focuses on the need to identify critical facilities for hardening facilities against attacks.In order to identify critical facility that affected the system most after their disruptions,R-interdiction model based on P-median problem is presented.Three heuristics: greedy search,neighborhood search and Tabu search are proposed for this model.Then these heuristics are compared by three test examples: Galvao、Europe 150 and USA 263.Computational results indicate that Tabu search consistently have the best performance.Finally we include that R-interdiction problem can increase the robustness of network by comparing the solutions of P-median problem and R-interdiction problem.