Identification Methods of Critical Combination of Vulnerable Links in Transportation Networks
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.
KeywordsBi-level Nonlinear programming Discrete network design problem (DNDP) Vulnerability analysis
This research is supported by the National Natural Science Foundation of China (No. 51608115); the Natural Science Foundation of Jiangsu Province (No. BK20150613) and the Scientific Research Foundation of the Graduate School of Southeast University (No. YBJJ1840).
- 1.Chen B, Lam WHK, Sumalee A, Li Q, Li Z (2012) Vulnerability analysis for large-scale and congested road networks with demand uncertainty. Transp Res Part A 46:501–516Google Scholar
- 6.Ma J, Cheng L, Li D (2018) Road maintenance optimization model based on dynamic programming in urban traffic network. J Adv Transp. In press Google Scholar
- 10.Wang DZW et al (2016) Identification of critical combination of vulnerable links in transportation networks–a global optimisation approach. Transp A: Transp Sci 12(4):346–365Google Scholar
- 12.Zhu S, Levinson D, Liu HX, Harder K (2010) The traffic and behavioral effects of the I-35W Mississippi River bridge collapse. Transp Res Part A 44(10):771–784Google Scholar