Modeling strategic strikes against transportation networks.

Abstract

We present deterministic and probabilistic models for the analysis of strategic strikes against transportation networks. The deterministic models use integer programming to solve problems on single and multicommodity networks. The aims of a network interdictor are (a) to minimize the maximum network flow with a fixed amount of interdiction resources, or (b) to minimize the total effort and mission turnaround time if given sufficient resources to stop the flow completely. In the case of a multicommodity network, the interdictor also aims to utilize minimum resources to achieve a disconnecting set which severs the paths connecting all sources to their respective sinks. In the probabilistic model, arc capacity is not a factor and the objective of a single interdictor is to minimize the probability of infiltration by a single evader through a network while the objective of the evader is just the opposite.