Quickest flow over time network interdiction: mathematical formulation and a solution method

Abstract

This paper proposes a new problem entitled as “the quickest flow over time network interdiction problem”. This problem stands for removing some of network links using a limited interdiction resource with the aim of maximizing the minimum time required to transfer a predefined flow value through a given network. We formulate the quickest flow problem as a linear fractional programming problem and then, we transform it to a linear formulation. Using the linear formulation of the quickest flow problem we formulate the quickest flow network interdiction problem as a mixed integer linear programming problem. We also provide an improved formulation for the quickest flow network interdiction problem which is computationally more efficient than basic linear formulation. Finally, we apply the basic and improved formulations of the quickest flow network interdiction problem on a real world network and several grid networks.