A Stochastic Program for Interdicting Smuggled Nuclear Material

This paper describes a stochastic network interdiction model for identifying locations for installing detectors sensitive to nuclear material. A nuclear material smuggler selects a path through a transportation network that maximizes the probability of avoiding detection An interdictor installs sensors to minimize that maximum probability. This problem is formulated as a bi-level stochastic mixed-integer program. The program is stochastic because the evader’s origin and destination are unknown at the time the detectors are installed. The model is reformulated as a two-stage stochastic mixed-integer program with recourse and is shown to be strongly NP-Hard. We describe an application of our model to help strengthen the overall capability of preventing the illicit trafficking of nuclear materials.

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

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

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

[4]  Robert F. Dell,et al.  Optimization and Persistence , 1997 .

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

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

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

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

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

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

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

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

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

[14]  Heather Fry,et al.  A user’s guide , 2003 .

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

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

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

[18]  Jonathan F. Bard,et al.  A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

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

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

[21]  Samir Khuller,et al.  The complexity of finding most vital arcs and nodes , 1995 .

[22]  Eitan Israeli System Interdiction and Defense. , 1999 .

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

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