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 条
  • [1] Graph-theoretic constraints on vesicle traffic networks
    Mani, Somya
    Krishnan, Kesav
    Thattai, Mukund
    JOURNAL OF BIOSCIENCES, 2022, 47 (01)
  • [2] Graph-theoretic constraints on vesicle traffic networks
    Somya Mani
    Kesav Krishnan
    Mukund Thattai
    Journal of Biosciences, 2022, 47
  • [3] Modelling road traffic Noise under heterogeneous traffic conditions using the graph-theoretic approach
    Towseef Ahmed Gilani
    Mohammad Shafi Mir
    Environmental Science and Pollution Research, 2021, 28 : 36651 - 36668
  • [4] Graph-theoretic surrogate measures for analysing the resilience of water distribution networks
    Herrera, Manuel
    Abraham, Edo
    Stoianov, Ivan
    COMPUTING AND CONTROL FOR THE WATER INDUSTRY (CCWI2015): SHARING THE BEST PRACTICE IN WATER MANAGEMENT, 2015, 119 : 1241 - 1248
  • [5] Modelling road traffic Noise under heterogeneous traffic conditions using the graph-theoretic approach
    Gilani, Towseef Ahmed
    Mir, Mohammad Shafi
    ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH, 2021, 28 (27) : 36651 - 36668
  • [6] Maximizing Closeness in Bipartite Networks: A Graph-Theoretic Analysis
    Hayat, Fazal
    Otera, Daniele Ettore
    MATHEMATICS, 2024, 12 (13)
  • [7] Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
    Zelazo, Daniel
    Mesbahi, Mehran
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (05) : 971 - 982
  • [8] GRAPH-THEORETIC MEASURES OF MULTIVARIATE ASSOCIATION AND PREDICTION
    FRIEDMAN, JH
    RAFSKY, LC
    ANNALS OF STATISTICS, 1983, 11 (02): : 377 - 391
  • [9] A graph-theoretic decomposition technique for fixed channel assignment problems in cellular radio networks
    Ali, SZ
    IEEE 55TH VEHICULAR TECHNOLOGY CONFERENCE, VTC SPRING 2002, VOLS 1-4, PROCEEDINGS, 2002, : 1064 - 1068
  • [10] Channel Assignment in Multi-Radio Wireless Mesh Networks: A Graph-Theoretic Approach
    Sridhar, Srikrishna
    Guo, Jun
    Jha, Sanjay
    2009 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORKS (COMSNETS 2009), 2009, : 180 - +