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

Genaro Peque, Junji Urata, Takamasa Iryo

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルTransport and Society - Proceeding of the 22nd International Conference of Hong Kong Society for Transportation Studies, HKSTS 2017
編集者Anthony Chen, Tony N.N. Sze
出版社Hong Kong Society for Transportation Studies Limited
ページ515-522
ページ数8
ISBN(電子版)9789881581464
出版ステータスPublished - 2017 1月 1
外部発表はい
イベント22nd International Conference of Hong Kong Society for Transportation Studies: Transport and Society, HKSTS 2017 - Hong Kong, Hong Kong
継続期間: 2017 12月 92017 12月 11

出版物シリーズ

名前Transport 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
国/地域Hong Kong
CityHong Kong
Period17/12/917/12/11

ASJC Scopus subject areas

  • 輸送

フィンガープリント

「Implementing an alt algorithm for large-scale time-dependent networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル