Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems

Yang Gao, Yi Chang Chiu

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

2 Scopus citations


This paper proposes a Hierarchical Time-Dependent Shortest Path (HTDSP) algorithm system that applies the hierarchical search strategy in dynamic traffic networks with discrete and deterministic travel costs. Four types of TDSP query experiments, namely, quasi-normal one-to-one queries, random one-to-one queries, one-to-all queries and all-to-one queries, were conducted on an urban street network of Tucson, Arizona. The numerical results suggest that the proposed algorithm provides near optimal solutions at low computational cost for both single and multiple sources TDSP queries. The flexibility and efficiency of the proposed HTDSP system implies its suitability for large-scale dynamic traffic assignment and online routing applications in which origin destination and departure time are required in a highly disaggregate manner.

Original languageEnglish (US)
Title of host publication2011 14th International IEEE Conference on Intelligent Transportation Systems, ITSC 2011
Number of pages6
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


Other14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011
Country/TerritoryUnited States
CityWashington, DC

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this