We study a shortest-path interdiction problem in which the interdictor acts first to lengthen a subset of arcs, and an evader acts second to select a shortest path across the network. In this problem, the cost for an evader's arc consists of a base cost if the arc is not interdicted, plus an additional cost that is incurred if the arc is interdicted. The interdictor is not aware of the base costs when the interdiction action is taken, but does know that the base cost values are uniformly distributed within given (arc-specific) intervals. The evader, on the other hand, observes the exact value of the base costs, plus the additional costs due to interdiction actions. The interdictor's problem is thus to maximize the expected minimum cost attainable by the evader. We provide a partitioning algorithm for computing an exact optimal solution to this problem, leveraging bounds gleaned from Jensen's inequality as proposed in an earlier study on a maximum-flow interdiction problem. We also provide several algorithmic strategies for accelerating the convergence of the algorithm and demonstrate their effectiveness on randomly generated instances.
ASJC Scopus subject areas
- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management