Models for nuclear smuggling interdiction

We describe two stochastic network interdiction models for thwarting nuclear smuggling. In the first model, the smuggler travels through a transportation network on a path that maximizes the probability of evading detection, and the interdictor installs radiation sensors to minimize that evasion probability. The problem is stochastic because the smuggler's origin-destination pair is known only through a probability distribution at the time when the sensors are installed. In this model, the smuggler knows the locations of all sensors and the interdictor and the smuggler “agree” on key network parameters, namely the probabilities the smuggler will be detected while traversing the arcs of the transportation network. Our second model differs in that the interdictor and smuggler can have differing perceptions of these network parameters. This model captures the case in which the smuggler is aware of only a subset of the sensor locations. For both models, we develop the important special case in which the sensors can only be installed at border crossings of a single country so that the resulting model is defined on a bipartite network. In this special case, a class of valid inequalities reduces the computation time for the identical-perceptions model.

[1]  Eitan Israeli,et al.  System Interdiction and Defense. , 1999 .

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

[3]  David P. Morton,et al.  Restricted-Recourse Bounds for Stochastic Linear Programming , 1999, Oper. Res..

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

[5]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[6]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[7]  Jonathan F. Bard,et al.  Practical Bilevel Optimization , 1998 .

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

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

[10]  Omar Ben-Ayed,et al.  Bilevel linear programming , 1993, Comput. Oper. Res..

[11]  R. Vohra,et al.  Finding the most vital arcs in a network , 1989 .

[12]  Richard D. Wollmer,et al.  Two stage linear programming under uncertainty with 0–1 integer first stage variables , 1980, Math. Program..

[13]  Brian K. Reed Models for Proliferation Interdiction Response Analysis. , 1994 .

[14]  Eric M. Skroch How to optimally interdict a belligerent project to develop a nuclear weapon , 2004 .

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

[16]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

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

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

[19]  A. K. Mittal,et al.  The k most vital arcs in the shortest path problem , 1990 .

[20]  Alan Washburn,et al.  Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..

[21]  David L. Woodruff,et al.  Interdicting Stochastic Networks with Binary Interdiction Effort , 2003 .

[22]  Andrew J. Schaefer,et al.  SPAR: stochastic programming with adversarial recourse , 2006, Oper. Res. Lett..

[23]  Christodoulos A. Floudas Generalized Benders Decomposition , 2009, Encyclopedia of Optimization.

[24]  H. W. Corley,et al.  Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..

[25]  D. Y. Ball U.S. second line of defense: preventing nuclear smuggling across Russia's borders , 1998 .

[26]  Maw-Sheng Chern,et al.  Interdicting the activities of a linear program — A parametric analysis , 1995 .

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

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

[29]  J. Bard Some properties of the bilevel programming problem , 1991 .

[30]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .