An Optimization Approach for Deriving Upper and Lower Bounds of Transportation Network Vulnerability under Simultaneous Disruptions of Multiple Links

This paper aims to develop an optimization approach for deriving the upper and lower bounds of transportation network vulnerability under simultaneous disruptions of multiple links without the need to evaluate all possible combinations as in the enumerative approach. Mathematically, the authors formulate the upper and lower bounds of network vulnerability as a binary integer bi-level program (BLP). The upper-level subprogram maximizes or minimizes the remaining network throughput under a given number of disrupted links, which corresponds to the upper and lower vulnerability bounds. The lower-level subprogram checks the connectivity of each origin-destination (O-D) pair under a network disruption scenario without path enumeration. Two alternative modeling approaches are provided for the lower-level subprogram: the virtual link capacity-based maximum flow problem formulation and the virtual link cost-based shortest path problem formulation. Computationally, the BLP model can be equivalently reformulated as a single-level mixed integer linear program by making use of the optimality conditions of the lower-level subprograms and linearization techniques for the complementarity conditions and bilinear terms. Numerical examples are also provided to systematically demonstrate the validity, capability, and flexibility of the proposed optimization model. The vulnerability envelope constructed by the upper and lower bounds is able to effectively consider all possible combinations without the need to perform a full network scan, thus avoiding the combinatorial complexity of enumerating multi-disruption scenarios. Using the vulnerability envelope as a network performance assessment tool, planners and managers can more cost-effectively plan for system protection against disruptions, and prioritize system improvements to minimize disruption risks with limited resources.

• Record URL:
  https://doi.org/10.1016/j.trpro.2017.05.036
• Record URL:
  http://www.sciencedirect.com/science/article/pii/S2352146517303149
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/23521465
• Supplemental Notes:
  • © 2017 Xiangdong Xu et al. Elsevier B.V.
• Authors:
  • Xu, Xiangdong
  • Chen, Anthony
  • Yang, Chao
• Conference:
  • 22nd International Symposium on Transportation and Traffic Theory
  • Location: Chicago Illinois, United States
  • Date: 2017-6-24 to 2017-6-26
• Publication Date: 2017

Language

• English

Media Info

• Media Type: Digital/other
• Features: Figures; References;
• Pagination: pp 645-663
• Serial:
  • Transportation Research Procedia
  • Volume: 23
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 2352-1465
  • Serial URL: http://www.sciencedirect.com/science/journal/23521465/
• Publication flags:

  Open Access (libre)

Subject/Index Terms

• TRT Terms: Mathematical analysis; Network analysis (Planning); Optimization; Origin and destination; Performance measurement; Risk assessment; Service disruption; Transportation planning
• Subject Areas: Data and Information Technology; Highways; Planning and Forecasting;

Filing Info

• Accession Number: 01642107
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 19 2017 3:44PM