Abstract
This paper is concerned with the problem of designing a survivable capacitated fixed-charge network. This problem is about selecting a set of fixed-charge arcs inorder to build a survivable network with the cost being kept to a minimum and the flow requirements being satisfied. The system is subject to failure and capacity restriction. Failure is defined as simultaneous failure of arcs. To solve the problem, first a mixed integer linear program is introduced. Then, an appropriate Benders Decomposition (BD) method is developed. Finally, in order to reduce the number of iterations of using the BD approach, a new strategy is proposed on the basis of s-t cut theorem. Using this strategy, the length of time required to solve the problem was reduced by 35% on average.Keywords: Benders Decomposition, Network Design, Survivable
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
