Every disruptive event in a transportation network has costly consequences both for users and for managing companies. To prevent large declines in the desired level of mobility, it is important to locate the most important nodes of the network, and to strengthen them. In this paper, we focus on underground networks. We introduce a methodology based on graph theory to locate the most important nodes, and we apply it to Washington D.C. network as a case study, and to the underground networks of 34 cities all over the world.

A topological analysis of underground network performance under disruptive events

l. mussone;R. notari;h Viseh
2020

Abstract

Every disruptive event in a transportation network has costly consequences both for users and for managing companies. To prevent large declines in the desired level of mobility, it is important to locate the most important nodes of the network, and to strengthen them. In this paper, we focus on underground networks. We introduce a methodology based on graph theory to locate the most important nodes, and we apply it to Washington D.C. network as a case study, and to the underground networks of 34 cities all over the world.
ETC 2020
2313-1853
transportation networks, graphs, underground, disruptions
File in questo prodotto:
File Dimensione Formato  
ETC-2020-MVN_sub.pdf

accesso aperto

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 998.71 kB
Formato Adobe PDF
998.71 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/1147706
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact