Engineering Commons^™

Robust Maximum Flow Network Interdiction Problem, Darshan Rajesh Chauhan

Dissertations and Theses

In this thesis, a maximum flow-based network interdiction problem considering uncertainties in arc capacities and interdiction resource consumption is solved. The problem consists of two entities with opposing objectives: the goal of the adversary is to maximize the flow of illicit drugs through the network, while the goal of the interdictor is to minimize the maximum flow by completely interdicting arcs given a specified amount of resources. Lack of complete information about the usage patterns of the transportation network by the adversary results in an uncertain estimate of arc capacity and resources required for interdiction by the interdictor. To account …