標題: Investigating transport network vulnerability by capacity weighted spectral analysis
作者: Bell, Michael G. H.
Kurauchi, Fumitaka
Perera, Supun
Wong, Walter
運輸與物流管理系 註:原交通所+運管所
Department of Transportation and Logistics Management
關鍵字: Network vulnerability;Network capacity;Spectral analysis;Graph Laplacian;Eigen values;Eigen vectors
公開日期: 1-May-2017
摘要: 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.
URI: http://dx.doi.org/10.1016/j.trb.2017.03.002
http://hdl.handle.net/11536/145516
ISSN: 0191-2615
DOI: 10.1016/j.trb.2017.03.002
期刊: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume: 99
起始頁: 251
結束頁: 266
Appears in Collections:Articles