Heuristics for Multi-Stage Interdiction of Stochastic Networks

  title={Heuristics for Multi-Stage Interdiction of Stochastic Networks},
  author={Harald Held and David L. Woodruff},
  journal={Journal of Heuristics},
We describe and compare heuristic solution methods for a multi-stage stochastic network interdiction problem. The problem is to maximize the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain. In this formulation, interdiction subject to a budget constraint is followed by operation of the network, which is then followed by a second interdiction subject to a second budget constraint. Computational results demonstrate and… 

Network Interdiction under Uncertainty

The modified augmented weighted Tchebychev norm is presented, which can be used to generate a complete efficient set of solutions to a discrete multi-objective optimization problem, and which tends to scale better than competing methods as the number of objectives grows.

Robust location of hidden interdictions on a shortest path network

Abstract We study a version of the shortest path network interdiction problem in which the follower seeks a path of minimum length on a network and the leader seeks to maximize the follower’s path

Algorithms for Network Interdiction and Fortification Games

This chapter explores models and algorithms applied to a class of Stackelberg games on networks, a network exists over which an operator wishes to execute some function, such as finding a shortest path, shipping a maximum flow, or transmitting a minimum cost multicommodity flow.

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting

The stochastic interdiction median problem with disruption intensity levels

This paper shows that the initial two stage stochastic formulation can be reformulated into a deterministic counterpart whose size is polynomial in the number of facilities and intensity levels and observes that the most efficient of the deterministic formulations provide great scalability with respect to variations in the input parameters and size of the instances solved.

Stochastic network interdiction games

A new solution algorithm is developed, based on parsimonious integration of branch and bound techniques with increasingly accurate lower bounds, for the solutions of different classes of stochastic network interdiction problems.

Assessing the effectiveness of k-shortest path sets in problems of network interdiction

It is shown that the k-shortest path set approach performs better on heterogeneous networks and that only a small number need be used for k to achieve strong interdiction solutions.



A decomposition algorithm applied to planning the interdiction of stochastic networks

The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz.

Stochastic Network Interdiction

We describe discrete stochastic network interdiction of shortest-path, and maximum-reliability-path, networks. A nested “max–min” model is reformulated using duality and, if necessary, an equivalent

Interdicting Stochastic Networks with Binary Interdiction Effort

We provide formulations, test instances and benchmark results for a new class of network interdiction problems. The formulations are appropriate for computer, terrorist or drug transportation

A problem in network interdiction

Suppose we are given a network G=(V,E) with arc distances and a linear cost function for lengthening arcs. In this note, we consider a network-interdiction problem in which the shortest path from

Shortest‐path network interdiction

Computational results demonstrate orders‐of‐magnitude improvements of the decomposition algorithms over direct solution of the MIP and show that SVIs also help solve the original MIP faster.

Applying the Minimum Risk Criterion in Stochastic Recourse Programs

Stability properties of the recourse function as a function of the first-stage decision, as well as of the underlying probability distribution of random parameters, are established, which leads to stability results for the optimal solution of the minimum risk problem when the underlying probabilities distribution is subjected to perturbations.

Finding the most vital arcs in a network

Semi-greedy heuristics: An empirical study

Maximizing the minimum source-sink path subject to a budget constraint

Given a linear cost function for lengthening arcs, a technique is shown for maximizing, within a budget, the shortest source—sink path length in a graph. The computation is equivalent to the

Grasp: An Annotated Bibliography

This paper is an annotated bibliography of the GRASP literature from 1989 to 2001, covering a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.