Reformulation and sampling to solve a stochastic network interdiction problem

The Network Interdiction Problem involves interrupting an adversary’s ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this paper, we study a stochastic version of the network interdiction problem in which the successful destruction of an arc of the network is a Bernoulli random variable, and the objective is to minimize the maximum expected flow of the adversary. Using duality and linearization techniques, an equivalent deterministic mixed integer program is formulated. The structure of the reformulation allows for the application of decomposition techniques for its solution. Using a parallel algorithm designed to run on a distributed computing platform known as a computational grid, we give computational results showing the efficacy of a sampling-based approach to solving the problem.

[1]  Qun Chen,et al.  FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver , 2000, SIAM J. Optim..

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

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

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

[5]  Stephen J. Wright.  Computational Grids for Stochastic Programming , 2005 .

[6]  Kelly James Cormican.  Computational Methods for Deterministic and Stochastic Network Interdiction Problems. , 1995 .

[7]  J. Dupacová,et al.  ASYMPTOTIC BEHAVIOR OF STATISTICAL ESTIMATORS AND OF OPTIMAL SOLUTIONS OF STOCHASTIC OPTIMIZATION PROBLEMS , 1988 .

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

[9]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[10]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[11]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[12]  David P. Morton,et al.  A Stochastic Program for Interdicting Smuggled Nuclear Material , 2003 .

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

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

[15]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[16]  J. Cruz,et al.  On the Stackelberg strategy in nonzero-sum games , 1973 .

[17]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[18]  Alexander Shapiro,et al.  The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..

[19]  T. Santoso.  A stochastic programming approach for supply chain network design under uncertainty , 2004 .

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

[21]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[22]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[23]  Qun Chen,et al.  FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver , 2001, Ann. Oper. Res..

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

[25]  Miron Livny,et al.  Mechanisms for High Throughput Computing , 1997 .

[26]  Stephen J. Wright,et al.  Decomposition Algorithms for Stochastic Programming on a Computational Grid , 2001, Comput. Optim. Appl..

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

[28]  Matti Koivu,et al.  Variance reduction in sample approximations of stochastic programs , 2005, Math. Program..

[29]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[30]  Jeff T. Linderoth,et al.  An enabling framework for master-worker applications on the Computational Grid , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.