Interdiction of a Markovian Evader

Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an "interdictor" and an "evader". The evader tries to move from a source node to the target node along a path of the least cost while the interdictor attempts to frustrate this motion by cutting edges or nodes. The interdiction objective is to find the optimal set of edges to cut given that there is a finite interdiction budget and the interdictor must move first. We reformulate the interdiction problem for stochastic evaders by introducing a model in which the evader follows a Markovian random walk guided by the least-cost path to the target. This model can represent incomplete knowledge about the evader, and the resulting model is a nonlinear 0-1 optimization problem. We then introduce an optimization heuristic based on betweenness centrality that can rapidly find high-quality interdiction solutions by providing a global view of the network.

[1]  Feng Pan,et al.  Optimal Interdiction of Unreactive Markovian Evaders , 2009, CPAIOR.

[2]  François Fouss,et al.  Randomized Shortest-Path Problems: Two Related Models , 2009, Neural Computation.

[3]  Madhav V. Marathe,et al.  Parametric Probabilistic Routing in Sensor Networks , 2005, Mob. Networks Appl..

[4]  David P. Morton,et al.  Models for nuclear smuggling interdiction , 2007 .

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

[6]  Zheng Cao,et al.  Optimal Stopping Analysis of a Radiation Detection System to Protect Cities from a Nuclear Terrorist Attack , 2008, Risk analysis : an official publication of the Society for Risk Analysis.

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

[8]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

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

[10]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

[12]  Mel Krajden,et al.  Modeling Control Strategies of Respiratory Pathogens , 2005, Emerging infectious diseases.

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

[14]  Matthew D. Bailey,et al.  Shortest path network interdiction with asymmetric information , 2008 .

[15]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

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

[17]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[18]  Feng Pan,et al.  Minimizing a stochastic maximum‐reliability path , 2008, Networks.

[19]  Vladimir Gurvich,et al.  Inapproximability Bounds for Shortest-Path Network Interdiction Problems , 2005 .

[20]  Jeff T. Linderoth,et al.  Reformulation and sampling to solve a stochastic network interdiction problem , 2008, Networks.

[21]  David P. Morton,et al.  Combinatorial Design of a Stochastic Markov Decision Process , 2009 .

[22]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

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

[24]  Nasrullah Memon,et al.  Practical Algorithms for Destabilizing Terrorist Networks , 2006, ISI.