Survivable multi-commodity network flow design: case of node capacities and arc failure

Majid Anisi and Hasan Salehi Fathabadi

International Journal of Operational Research, 2019, vol. 35, issue 3, 355-365

Abstract: This paper is focused on the design of a survivable network with node capacities and flow restrictions. The goal is to design a survivable network at minimum cost so that feasible flows exist at the time of multiple simultaneous failure arcs (failure scenario). To solve this problem Benders' decomposition (BD) was initially proposed and, then, a new strategy was presented to obtain specific failure scenarios. We computationally demonstrated that BD using this strategy could obtain the optimal solution faster. This strategy reduced iterations more greatly than the BD approach. Using this strategy, the length CPU time required for solving the problem was reduced by 30% on average.

Keywords: survivable; network design; Benders' decomposition; node capacities. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101199 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:35:y:2019:i:3:p:355-365

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().