Exploring the robustness of urban bus network: A case from Southern China

被引:11
作者
Cao, Na [1 ]
Cao, Haiqing [1 ]
机构
[1] Capital Univ Econ & Business, Sch Management & Engn, Beijing 100070, Peoples R China
关键词
Urban bus network; Directed graphs; Centrality; Network analysis; RAILWAY NETWORK;
D O I
10.1016/j.cjph.2020.03.012
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The robustness of urban bus network is essential to a city that heavily relies on buses as its main transportation solution. In this paper, the urban bus network has been modeled as a directed and space L network, and Changsha, a transportation hub of nearly 8 million people and hundreds of bus lines in southern China, is taken as a case. Based on the quantitative analyses of the topological properties, it is found that Changsha urban bus network is a scale-free network, not a small-world network. To evaluate the robustness of the network, five scenarios of network failure are simulated, including a random failure and four types of intentional attacks that differed in key node identification methods (i.e., unweighted degree or betweenness centrality) and attack strategies (i.e., normal or cascading attack). It is revealed that intentional attacks are more destructive than a random failure, and cascading attacks are more disruptive than normal attacks in the urban bus network. In addition, the key nodes identification methods are found to play a critical role in the robustness of the urban bus network. Specifically, cascading attack could be more disruptive when the betweenness centrality is used to identify key nodes; in contrast, normal attack could be more disruptive when the unweighted degree is used to identify key nodes. Our results could provide reference for risk management of urban bus network.
引用
收藏
页码:389 / 397
页数:9
相关论文
共 30 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], 2019, WORLD METRO DATABASE
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   The architecture of complex weighted networks [J].
Barrat, A ;
Barthélemy, M ;
Pastor-Satorras, R ;
Vespignani, A .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (11) :3747-3752
[5]   Resilience of public transport networks against attacks [J].
Berche, B. ;
von Ferber, C. ;
Holovatch, T. ;
Holovatch, Yu. .
EUROPEAN PHYSICAL JOURNAL B, 2009, 71 (01) :125-137
[6]   A manipulator game model of urban public traffic network [J].
Chang, Hui ;
Xu, Xiu-Lian ;
Hu, Chin-Kun ;
Fu, Chunhua ;
Feng, Ai-xia ;
He, Da-Ren .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 416 :378-385
[7]   A study on some urban bus transport networks [J].
Chen, Yong-Zhou ;
Li, Nan ;
He, Da-Ren .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 376 :747-754
[8]   Resilience of the Internet to random breakdowns [J].
Cohen, R ;
Erez, K ;
ben-Avraham, D ;
Havlin, S .
PHYSICAL REVIEW LETTERS, 2000, 85 (21) :4626-4628
[9]   Model for cascading failures in complex networks [J].
Crucitti, P ;
Latora, V ;
Marchiori, M .
PHYSICAL REVIEW E, 2004, 69 (04) :4
[10]   Network Centrality of Metro Systems [J].
Derrible, Sybil .
PLOS ONE, 2012, 7 (07)