Implementing an alt algorithm for large-scale time-dependent networks

Genaro Peque, Junji Urata, Takamasa Iryo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

ALT algorithms have been successfully applied to time-independent transportation networks but applying it to time-dependent transportation networks is not straightforward. The difficulty arises when a driver has to recalculate the shortest path to his/her destination at the time of hisÆer departure by considering the effect of other vehicles on the travel time. While this doesn't pose a substantial negative computational effect when the number of drivers is small, this is crucial when simulating large-scale time-dependent transportation networks with millions of vehicles and a very large time horizon. This is called the time-dependent shortest path (TDSP) problem. Hence, we are motivated in reducing the shortest path query times. By explicitly choosing a region in the network to select a landmark from using a weighted variant of the avoid landmark selection algorithm, we are able to reduce the shortest path query times without increasing the landmark generation times and space (memory) consumption.

Original languageEnglish
Title of host publicationTransport and Society - Proceeding of the 22nd International Conference of Hong Kong Society for Transportation Studies, HKSTS 2017
EditorsAnthony Chen, Tony N.N. Sze
PublisherHong Kong Society for Transportation Studies Limited
Pages515-522
Number of pages8
ISBN (Electronic)9789881581464
Publication statusPublished - 2017 Jan 1
Externally publishedYes
Event22nd International Conference of Hong Kong Society for Transportation Studies: Transport and Society, HKSTS 2017 - Hong Kong, Hong Kong
Duration: 2017 Dec 92017 Dec 11

Publication series

NameTransport and Society - Proceeding of the 22nd International Conference of Hong Kong Society for Transportation Studies, HKSTS 2017

Other

Other22nd International Conference of Hong Kong Society for Transportation Studies: Transport and Society, HKSTS 2017
CountryHong Kong
CityHong Kong
Period17/12/917/12/11

Keywords

  • ALT algorithm
  • Large-scale simulation
  • Shortest path problem
  • Time-dependent networks

ASJC Scopus subject areas

  • Transportation

Fingerprint Dive into the research topics of 'Implementing an alt algorithm for large-scale time-dependent networks'. Together they form a unique fingerprint.

  • Cite this

    Peque, G., Urata, J., & Iryo, T. (2017). Implementing an alt algorithm for large-scale time-dependent networks. In A. Chen, & T. N. N. Sze (Eds.), Transport and Society - Proceeding of the 22nd International Conference of Hong Kong Society for Transportation Studies, HKSTS 2017 (pp. 515-522). (Transport and Society - Proceeding of the 22nd International Conference of Hong Kong Society for Transportation Studies, HKSTS 2017). Hong Kong Society for Transportation Studies Limited.