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 条
  • [41] Graph-Theoretic Approach for the Dynamic Simulation of Flexible Multibody Systems
    Richard, M. J.
    Bouazara, M.
    ADVANCES IN MECHANICAL ENGINEERING, 2012,
  • [42] COMPETITIVE TRAFFIC ASSIGNMENT IN ROAD NETWORKS
    Krylatov, Alexander Y.
    Zakharov, Victor V.
    Malygin, Igor G.
    TRANSPORT AND TELECOMMUNICATION JOURNAL, 2016, 17 (03) : 212 - 221
  • [43] Graph-theoretic characterizations of monotonicity of chemical networks in reaction coordinates
    Angeli, David
    De Leenheer, Patrick
    Sontag, Eduardo
    JOURNAL OF MATHEMATICAL BIOLOGY, 2010, 61 (04) : 581 - 616
  • [44] Graph-Theoretic Approach for Increasing Participation in Networks With Assorted Resources
    Abbas, Waseem
    Laszka, Aron
    Shabbir, Mudassir
    Koutsoukos, Xenofon
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (03): : 930 - 946
  • [45] Graph-theoretic characterizations of monotonicity of chemical networks in reaction coordinates
    David Angeli
    Patrick De Leenheer
    Eduardo Sontag
    Journal of Mathematical Biology, 2010, 61 : 581 - 616
  • [46] A Graph-Theoretic Condition for Global Identifiability of Weighted Consensus Networks
    Nabavi, Seyedbehzad
    Chakrabortty, Aranya
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (02) : 497 - 502
  • [47] GRAPH-THEORETIC STATE MODELS FOR PIECEWISE ANALYSIS OF LARGE-SCALE ELECTRICAL NETWORKS
    CHANDRASHEKAR, M
    KESAVAN, HK
    INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 1977, 5 (01) : 23 - 34
  • [48] Graph-theoretic design and analysis of key predistribution schemes
    Kendall, Michelle
    Martin, Keith M.
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 81 (01) : 11 - 34
  • [49] A graph-theoretic visualization approach to network risk analysis
    O'Hare, Scott
    Noel, Steven
    Prole, Kenneth
    VISUALIZATION FOR COMPUTER SECURITY, PROCEEDINGS, 2008, 5210 : 60 - +
  • [50] Graph-theoretic analysis of multistationarity using degree theory
    Conradi, Carsten
    Mincheva, Maya
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2017, 133 : 76 - 90