Criticality analysis in road networks with graph-theoretic measures, traffic assignment, and simulation

被引:4
|
作者
Mylonas, Chrysostomos [1 ]
Mitsakis, Evangelos [2 ]
Kepaptsoglou, Konstantinos [1 ]
机构
[1] Natl Tech Univ Athens, Sch Rural Surveying & Geoinformat Engn, Athens, Greece
[2] Hellenic Inst Transport, Ctr Res & Technol Hellas, Hellas, Greece
关键词
Road networks; Criticality; Complex network theory; Traffic assignment and simulation; Network efficiency; Macroscopic fundamental diagram; VULNERABILITY ANALYSIS; LINK CRITICALITY; ROBUSTNESS; CENTRALITY; SCALE; INDEX; POWER;
D O I
10.1016/j.physa.2023.129197
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Criticality serves as a foundational concept in the evaluation of the impact of disruptive events on the operation of road networks supporting the identification of road links whose unavailability affects to the greatest extent the mobility of people and goods. Several methods and techniques have been suggested so far for the quantification of criticality in road networks drawing from complex network theory, strategic transportation modeling, and traffic simulation. The current article provides a concise yet comprehensive overview of the relevant literature. Subsequently, it formulates a series of hybrid graph-theoretic measures that aim to evaluate, in a computationally efficient manner, the criticality of a road network's links by respecting their topological attributes and incorporating the inputs/outputs of user equilibrium-based traffic assignment models, assuming that all links are available and operational. Moreover, it formulates a flow reduction-based criticality metric, quantified through microscopic traffic simulation based on the well-established theory on the Macroscopic Fundamental Diagram. The validity and application potential of both approaches are experimentally scrutinized in two tailor-made case studies. The results of the first case study reveal that traffic volume centrality and two variations of a hybrid measure estimating the demand weighted decrease in network efficiency or the increase in total travel time complement each other and sufficiently explain road link criticality, as assessed through two different metrics of increased computational intensity and accuracy. Building upon this finding, an algorithmic procedure for combining the previously mentioned measures is proposed, enabling the targeted sampling of critical road link candidates. The results of the second case study reveal that the macroscopic flow-density relationship may not provide valid insights into road link criticality due to the weak correlation of average network flow reduction with average travel time increase as well as the occasional and paradoxical increase in average network flow after certain road infrastructure disruptions. It is experimentally proven that this is attributed to the shifted route choice behavior of road users. It is also shown that the macroscopic flow-density relationship can adequately assess the impact of disruptive events when route choices are kept fixed.
引用
收藏
页数:28
相关论文
共 50 条
  • [21] Disturbed Connectivity of EEG Functional Networks in Alcoholism: A Graph-Theoretic Analysis
    Cao, Rui
    Wu, Zheng
    Li, Haifang
    Xiang, Jie
    Chen, Junjie
    BIO-MEDICAL MATERIALS AND ENGINEERING, 2014, 24 (06) : 2927 - 2936
  • [22] Graph-Theoretic Analyses of MIMO Channels in Diffusive Networks
    Koorehdavoudi, Kasra
    Roy, Sandip
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 222 - 229
  • [23] Graph-Theoretic Topological Control of Biological Genetic Networks
    Aswani, Anil
    Boyd, Nicholas
    Tomlin, Claire
    2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 1700 - +
  • [24] Graph-Theoretic Connectivity Control of Mobile Robot Networks
    Zavlanos, Michael M.
    Egerstedt, Magnus B.
    Pappas, George J.
    PROCEEDINGS OF THE IEEE, 2011, 99 (09) : 1525 - 1540
  • [25] A Graph-Theoretic Approach to Design of Probabilistic Boolean Networks
    Kobayashi, Koichi
    IFAC PAPERSONLINE, 2018, 51 (33): : 217 - 222
  • [26] A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks
    Gozupek, Didem
    Shalom, Mordechai
    Alagoz, Fatih
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (01) : 317 - 328
  • [27] Multi-layer assignment steganography using graph-theoretic approach
    Hanzhou Wu
    Hongxia Wang
    Hong Zhao
    Xiuying Yu
    Multimedia Tools and Applications, 2015, 74 : 8171 - 8196
  • [28] Identifiability of Undirected Dynamical Networks: A Graph-Theoretic Approach
    van Waarde, Henk J.
    Tesi, Pietro
    Camlibel, M. Kanat
    IEEE CONTROL SYSTEMS LETTERS, 2018, 2 (04): : 683 - 688
  • [29] A Graph-Theoretic Approach to Distributed Control over Networks
    Swigart, John
    Lall, Sanjay
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 5409 - 5414
  • [30] Optimizing Mixing in Pervasive Networks: A Graph-Theoretic Perspective
    Jadliwala, Murtuza
    Bilogrevic, Igor
    Hubaux, Jean-Pierre
    COMPUTER SECURITY - ESORICS 2011, 2011, 6879 : 548 - 567