Abstract

The paper deals with a transportation network protection problem. The aim is to limit losses due to disasters by choosing an optimal retrofiting plan. The mathematical model given by Lu, Gupte, Huang [11] is a mixed integer non linear optimization problem. Existing solution methods are complicated and their computing time is long. Hence, it is necessary to develop efficient solution methods for the considered model. Our approach is based on DC (difference of two convex functions) programming and DC algorithm (DCA). The original model is first reformulated as a DC program by using exact penalty techniques. We then apply DCA to solve the resulting problem. Numerical results on a small network are reported to see the behavior of DCA. It shows that DCA is fast and the proposed approach is promissing.

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 call

Disclaimer: 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.