Variable time discretization for a time-dependent shortest path algorithm

Ye Tian, Yi Chang Chiu, Yang Gao

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

1 Scopus citations

Abstract

This paper introduces a variable time discretization strategy for a time-dependent A* shortest path algorithm. The strategy is aimed at determining the optimal memory allocation for time-dependent travel times data in order to achieve a desirable compromise between accuracy and memory usage. The proposed strategy is based on the dispersion index of the travel times/costs over the entire analysis period, as a result, producing different intervals for each link. The links with travel times that have a higher variance and a lower mean will need to have a shorter time discretization length due to greater fluctuation in travel times. The proposed strategy is implemented in the time-dependent A* algorithm and tested with a numerical experiment on a Tucson, AZ, traffic network. The results show that with the same amount of computer memory usage, the proposed variable time discretization strategy achieves much higher accuracy than that of uniform time discretization.

Original languageEnglish (US)
Title of host publication2011 14th International IEEE Conference on Intelligent Transportation Systems, ITSC 2011
Pages588-593
Number of pages6
DOIs
StatePublished - Dec 22 2011
Event14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011 - Washington, DC, United States
Duration: Oct 5 2011Oct 7 2011

Publication series

NameIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Other

Other14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011
CountryUnited States
CityWashington, DC
Period10/5/1110/7/11

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Variable time discretization for a time-dependent shortest path algorithm'. Together they form a unique fingerprint.

  • Cite this

    Tian, Y., Chiu, Y. C., & Gao, Y. (2011). Variable time discretization for a time-dependent shortest path algorithm. In 2011 14th International IEEE Conference on Intelligent Transportation Systems, ITSC 2011 (pp. 588-593). [6082871] (IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC). https://doi.org/10.1109/ITSC.2011.6082871