Dynamic measures for transportation networks

Most complex network analyses of transportation systems use simplified static representations obtained from existing connections in a time horizon. In static representations, travel times, waiting times and compatibility of schedules are neglected, thus losing relevant information. To obtain a more accurate description of transportation networks, the authors use a dynamic representation that considers synced paths and that includes waiting times to compute shortest paths. The authors use the shortest paths to define dynamic network, node and edge measures to analyse the topology of transportation networks, comparable with measures obtained from static representations. The authors illustrate the application of these measures with a toy model and a real transportation network built from schedules of a low-cost carrier. Results show remarkable differences between measures of static and dynamic representations, demonstrating the limitations of the static representation to obtain accurate information of transportation networks.

• Record URL:
  • https://doi.org/10.1371/journal.pone.0242875
• Supplemental Notes:
  • © 2020 Oriol Lordan and Jose M. Sallan.
• Authors:
  • Lordan, Oriol
  • Sallan, Jose M
• Publication Date: 2020

Language

• English

Media Info

• Media Type: Web
• Features: Figures; References; Tables;
• Pagination: e0242875
• Serial:
  • PLoS One
  • Volume: 15
  • Issue Number: 12
  • Publisher: Public Library of Science
  • EISSN: 1932-6203
  • Serial URL: https://journals.plos.org/plosone/
• Publication flags:

  Open Access (libre)

Subject/Index Terms

• TRT Terms: Complex systems; Dynamic models; Networks; Shortest path algorithms; Travel time; Waiting time
• Subject Areas: Planning and Forecasting; Transportation (General);

Filing Info

• Accession Number: 01762949
• Record Type: Publication
• Files: TRIS
• Created Date: Jan 29 2021 4:27PM