TY - JOUR
T1 - Vulnerability analysis of cut-capacity structure and OD demand using Gomory-Hu tree method
AU - Sugiura, Satoshi
AU - Chen, Anthony
N1 - Funding Information:
This research was jointly supported by the National Natural Science Foundation of China (Project No. 72071174), the Research Grants Council of the Hong Kong Special Administrative Region (Project No. 15267116), the Hong Kong Branch of National Rail Transit Electrification and Automation Engineering Technology Research Center (K-BBY1), the Committee on Advanced Road Technology under the authority of the Ministry of Land, Infrastructure, Transport, and Tourism in Japan (Project name “Research on the evaluation of spatial economic impacts of building bus termini“, Principal Investigator: Prof. Yuki Takayama, Kanazawa University).
Publisher Copyright:
© 2021
PY - 2021/11
Y1 - 2021/11
N2 - Vulnerability analysis of transportation networks has rapidly become important in recent decades given the increasing numbers of transportation disasters. In this paper, we describe a method for calculating the minimum cuts between all pairs of nodes in a transportation network and develop two indices for analyzing vulnerability; these are derived from topology-based vulnerability/demand-accountable analyses and enable evaluation of cuts without assuming route-choice behaviors. We show that such analyses can be performed using a Gomory–Hu tree to reduce the computational load. This method is efficient, requiring only N − 1 calculations of the maximum flow problem even though the number of node pairs is N2, where N is the number of nodes. In addition, we show that the total demand passing each minimum cut, which is necessary for demand-accountable analysis, can be obtained by network loading onto the tree using the Gomory–Hu tree features. We apply the proposed method to the central region of Japan to illustrate the applicability of the two indices for identifying vulnerable links in the road network.
AB - Vulnerability analysis of transportation networks has rapidly become important in recent decades given the increasing numbers of transportation disasters. In this paper, we describe a method for calculating the minimum cuts between all pairs of nodes in a transportation network and develop two indices for analyzing vulnerability; these are derived from topology-based vulnerability/demand-accountable analyses and enable evaluation of cuts without assuming route-choice behaviors. We show that such analyses can be performed using a Gomory–Hu tree to reduce the computational load. This method is efficient, requiring only N − 1 calculations of the maximum flow problem even though the number of node pairs is N2, where N is the number of nodes. In addition, we show that the total demand passing each minimum cut, which is necessary for demand-accountable analysis, can be obtained by network loading onto the tree using the Gomory–Hu tree features. We apply the proposed method to the central region of Japan to illustrate the applicability of the two indices for identifying vulnerable links in the road network.
KW - Connectivity analysis
KW - Gomory–Hu tree
KW - Minimum cut
KW - Network vulnerability
UR - http://www.scopus.com/inward/record.url?scp=85115773555&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2021.08.013
DO - 10.1016/j.trb.2021.08.013
M3 - Journal article
AN - SCOPUS:85115773555
SN - 0191-2615
VL - 153
SP - 111
EP - 127
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -