Research Specifications

Home \Dynamic Network Interdiction ...
Title
Dynamic Network Interdiction Problem with Uncertain Data
Type of Research Article
Keywords
Network interdiction; bi-level programming; uncertainty theory; mixed integer nonlinear programming; generalized benders’ decomposition
Abstract
This paper proposes an uncertain multi-period bi-level network interdiction problem with uncertain arc capacities. It is proved that there exists an equivalence relationship between uncertain multi-period network interdiction problem and the obtained deterministic correspondent. Application of the generalized Benders’ decomposition algorithm is considered as the solution approach to the resulting mixed-integer nonlinear programming problem. Finally, a numerical example is presented to illustrate the model and the algorithm.
Researchers (First Researcher)، Alireza Ghaffari-Hadigheh (Second Researcher)