A bi-level programming model for protection of hierarchical facilities under imminent attacks

Disorders caused by deliberate sabotage and terrorist attacks have always been considered as a major threat by the governments. Hence, identifying and planning for strengthening of critical facilities have become a priority for more security and safety. This paper presents a bi-level formulation of the r-interdiction median problem with fortification for critical hierarchical facilities. In the developed bi-level formulation, the defender, as the leader, decides to protect a certain number of facilities in each level of the hierarchical system in order to minimize the impact of the most disruptive attacks to unprotected facilities. On the other hand the attacker, as the follower, with full information about protected facilities, makes his interdiction plan to maximize the total post-attack cost incurred to the defender. We develop three metaheuristic algorithms and an exhaustive enumeration method to solve the introduced problem. Extensive computational tests on a set of randomly generated instances demonstrate the effectiveness of the developed algorithms. The paper extends the r-interdiction median problem to consider hierarchical facilitiesA mixed integer bi-level programming is provided for protection of hierarchical facilitiesThree metaheuristic algorithms based on VDNS, SA and hybrid SA-VDNS are developed.Numerical studies are conduced to test the model and the metaheuristic algorithms.

[1]  Heinrich von Stackelberg,et al.  Stackelberg (Heinrich von) - The Theory of the Market Economy, translated from the German and with an introduction by Alan T. PEACOCK. , 1953 .

[2]  Richard D. Wollmer,et al.  Removing Arcs from a Network , 1964 .

[3]  Richard L. Church,et al.  Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems , 2004 .

[4]  Richard L. Church,et al.  On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions , 2010, Electron. Notes Discret. Math..

[5]  Daniel Aloise,et al.  A simple and effective genetic algorithm for the two-stage capacitated facility location problem , 2014, Comput. Ind. Eng..

[6]  Maria Paola Scaparra,et al.  Hedging against disruptions with ripple effects in location analysis , 2012 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  F.D. Galiana,et al.  A mixed-integer LP procedure for the analysis of electric grid security under disruptive threat , 2005, IEEE Transactions on Power Systems.

[9]  Deniz Aksen,et al.  A bilevel partial interdiction problem with capacitated facilities and demand outsourcing , 2014, Comput. Oper. Res..

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  J. Bard,et al.  An algorithm for the discrete bilevel programming problem , 1992 .

[12]  R. Kevin Wood,et al.  Shortest‐path network interdiction , 2002, Networks.

[13]  Vedat Verter,et al.  Incorporating the threat of terrorist attacks in the design of public service facility networks , 2012, Optim. Lett..

[14]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[15]  John D. Moteff,et al.  Critical Infrastructure and Key Assets: Definition and Identification , 2004 .

[16]  Deniz Aksen,et al.  A bilevel fixed charge location model for facilities under imminent attack , 2012, Comput. Oper. Res..

[17]  Richard L. Church,et al.  Production , Manufacturing and Logistics An exact solution approach for the interdiction median problem with fortification , 2008 .

[18]  Maria Paola Scaparra,et al.  Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification , 2011, Comput. Oper. Res..

[19]  W. C. Turner,et al.  Optimal interdiction policy for a flow network , 1971 .

[20]  Mercedes Landete,et al.  Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem , 2012, Eur. J. Oper. Res..

[21]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[22]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[23]  Necati Aras,et al.  The budget constrained r-interdiction median problem with capacity expansion , 2010, Central Eur. J. Oper. Res..

[24]  J. C. Smith,et al.  Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .

[25]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[26]  Alan W. McMasters,et al.  Optimal interdiction of a supply network , 1970 .

[27]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[28]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[29]  R. D. Galvão,et al.  A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro , 2002, Eur. J. Oper. Res..

[30]  Haldun Süral,et al.  A review of hierarchical facility location models , 2007, Comput. Oper. Res..

[31]  Richard L. Church,et al.  Protecting Critical Assets: The r-interdiction median problem with fortification , 2007 .

[32]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[33]  David P. Morton,et al.  Stochastic Network Interdiction , 1998, Oper. Res..

[34]  Marianthi G. Ierapetritou,et al.  Resolution method for mixed integer bi-level linear problems based on decomposition technique , 2009, J. Glob. Optim..

[35]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[36]  Reza Zanjirani Farahani,et al.  Hierarchical facility location problem: Models, classifications, techniques, and applications , 2014, Comput. Ind. Eng..