The problem of the network flow interdiction

In this paper, we state the problem of the network flow interdiction in a set of initial and destination nodes so that each initial is capable of only delivering products to certain pre-determined destinations. The network user’s purpose is to deliver the highest value of flow from the sources to the sinks and the network interdictor’s purpose is to reduce the highest value of flow being used. In this paper, the networks flow interdiction in multi-source and multi-sink conditions are addressed in a way that the parameters of arc capacity are trapezoidal fuzzy sets.

Keywords:

Interdiction problem , network flow , Fuzzy sets , Simplex Method , ranking function , duality , bi-level programming , decomposition