Edge-based graph neural network for ranking critical road segments in a network
PLOS ONE · 21.12.2023 · 18 (12) · e0296045
DOI: 10.1371/journal.pone.0296045 ↗Kurz gefasst
Fachartikel in der Zeitschrift PLOS ONE, online erschienen am 21.12.2023. Verfasst von Debasish Jana und 3 weiteren Autor:innen. Beteiligte Einrichtung: Samueli Civil and Environmental Engineering, University of California Los Angeles, Los Angeles, California, United States of America. Hauptthemen laut MEDLINE: Disasters, Natural Disasters. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 92 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Los Angeles Bureau of Engineering.
Abstract (Originalsprache)
Transportation networks play a crucial role in society by enabling the smooth movement of people and goods during regular times and acting as arteries for evacuations during catastrophes and natural disasters. Identifying the critical road segments in a large and complex network is essential for planners and emergency managers to enhance the network’s efficiency, robustness, and resilience to such stressors. We propose a novel approach to rapidly identify critical and vital network components (road segments in a transportation network) for resilience improvement or post-disaster recovery. We pose the transportation network as a graph with roads as edges and intersections as nodes and deploy a Graph Neural Network (GNN) trained on a broad range of network parameter changes and disruption events to rank the importance of road segments. The trained GNN model can rapidly estimate the criticality rank of individual road segments in the modified network resulting from an interruption. We address two main limitations in the existing literature that can arise in capital planning or during emergencies: ranking a complete network after changes to components and addressing situations in post-disaster recovery sequencing where some critical segments cannot be recovered. Importantly, our approach overcomes the computational overhead associated with the repeated calculation of network performance metrics, which can limit its use in large networks. To highlight scenarios where our method can prove beneficial, we present examples of synthetic graphs and two real-world transportation networks. Through these examples, we show how our method can support planners and emergency managers in undertaking rapid decisions for planning infrastructure hardening measures in large networks or during emergencies, which otherwise would require repeated ranking calculations for the entire network.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- Samueli Civil and Environmental Engineering, University of California Los Angeles, Los Angeles, California, United States of America.
- Samueli Mechanical and Aerospace Engineering, University of California Los Angeles, Los Angeles, California, United States of America.
ORCID-Profile: Debasish Jana, Sven Malama
Förderung
- Los Angeles Bureau of Engineering
Zitieren
APA
Jana, D., Malama, S., Narasimhan, S., & Taciroglu, E. (2023). Edge-based graph neural network for ranking critical road segments in a network. PLOS ONE, 18(12), e0296045. https://doi.org/10.1371/journal.pone.0296045
Vancouver
Jana D, Malama S, Narasimhan S, Taciroglu E. Edge-based graph neural network for ranking critical road segments in a network. PLOS ONE. 2023;18(12):e0296045. doi:10.1371/journal.pone.0296045
BibTeX
@article{Jana2023,
author = {Jana, Debasish and Malama, Sven and Narasimhan, Sriram and Taciroglu, Ertugrul},
title = {Edge-based graph neural network for ranking critical road segments in a network},
journal = {PLOS ONE},
year = {2023},
volume = {18},
number = {12},
pages = {e0296045},
doi = {10.1371/journal.pone.0296045}
}
EUVIMED