Investigating transport network vulnerability by capacity weighted spectral analysis
檔案
本條目沒有附加檔案。
日期
2017-05-01
類型
期刊名稱
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
卷期與頁次
第 99 卷,頁 251–266
ISSN
0191-2615
語言
英文
摘要
Transport networks operating at or near capacity are vulnerable to disruptions, so flow bottlenecks are potent sources of vulnerability. This paper presents an efficient method for finding transport network cuts, which may constitute such bottlenecks. Methods for assessing network vulnerability found in the literature require origin-destination demands and path assignment. However, in transport network planning and design, demand information is often missing, out of date, partial or inaccurate. Capacity weighted spectral partitioning is proposed to identify potential flow bottlenecks in the network, without reference to demand information or path assignments. This method identifies the network cut with least capacity, taking into account the relative sizes of the sub-networks either side of the cut. Spectral analysis has the added advantage of tractability, even for large networks, as shown by numerical examples for a five-node illustrative example, the Sioux Falls road network and the Gifu Prefecture road network. (C) 2017 Elsevier Ltd. All rights reserved.
所屬典藏
期刊論文引用此條目
Bell, M. G. H., Kurauchi, F., Perera, S., & Wong, W. (2017). Investigating transport network vulnerability by capacity weighted spectral analysis. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 99, 251–266. https://doi.org/10.1016/j.trb.2017.03.002
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/145516