Abstract
This chapter presents two global optimization approaches for identifying the most critical combination of vulnerable links in a transportation network. The first approach is formulated with a bi-level framework. It can be applied to small-scale networks. The second proposed approach formulates this problem as a Mixed-integer Nonlinear Programming (MINLP). We revised the [MINLP] into a nicer form [RMINLP] to simplify the vulnerability problem into a discrete Network Design Problem (DNDP), so that it can be solved by many existing algorithms for DNDPs, and expand its scope of application. A numerical example of Sioux-Falls network is used to illustrate the two proposed approaches. The test results show that both approaches can provide a global optimization solution, while the second approach has a better property in computing efficiency.
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.
