Production , Manufacturing and Logistics An exact solution approach for the interdiction median problem with fortification

Systematic approaches to security investment decisions are crucial for improved homeland security. We present an optimization modeling approach for allocating protection resources among a system of facilities so that the disruptive effects of possible intentional attacks to the system are minimized. This paper is based upon the p-median service protocol for an operating set of p facilities. The primary objective is to identify the subset of q facilities which, when fortified, provides the best protection against the worst-case loss of r non-fortified facilities. This problem, known as the r-interdiction median problem with fortification (IMF), was first formulated as a mixed-integer program by Church and Scaparra [R.L. Church, M.P. Scaparra, Protecting critical assets: The r-interdiction median problem with fortification, Geographical Analysis 39 (2007) 129-146]. In this paper, we reformulate the IMF as a maximal covering problem with precedence constraints, which is amenable to a new solution approach. This new approach produces good approximations to the best fortification strategies. Furthermore, it provides upper and lower bounds that can be used to reduce the size of the original model. The reduced model can readily be solved to optimality by general-purpose MIP solvers. Computational results on two geographical data sets with different structural characteristics show the effectiveness of the proposed methodology for solving IMF instances of considerable size.

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

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

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

[4]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[5]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[6]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[7]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

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

[9]  B. Golden A problem in network interdiction , 1978 .

[10]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[11]  Richard L. Church,et al.  COBRA: A New Formulation of the Classic p-Median Location Problem , 2003, Ann. Oper. Res..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[14]  Mark S. Daskin,et al.  Planning for Disruptions in Supply Chain Networks , 2006 .

[15]  J. Salmeron,et al.  Analysis of electric grid security under terrorist threat , 2004, IEEE Transactions on Power Systems.

[16]  Delbert Ray Fulkerson,et al.  Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..

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

[18]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

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

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

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

[22]  S. Hakimi Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .