2024-03-28T12:07:53Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/832132022-11-17T02:08:08Zhdl_2115_20045hdl_2115_139Vulnerability analysis of cut-capacity structure and OD demand using Gomory-Hu tree methodSugiura, SatoshiChen, AnthonyNetwork vulnerabilityConnectivity analysisMinimum cutGomory-Hu tree514Vulnerability 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.ElsevierJournal Articlehttp://hdl.handle.net/2115/832130191-2615Transportation Research Part B: Methodological1531111272021-11enginfo:doi/10.1016/j.trb.2021.08.013none