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 Citations (Scopus)

Abstract

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 publicationIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
Pages728-733
Number of pages6
DOIs
StatePublished - 2011
Event14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011 - Washington, DC, United States
Duration: Oct 5 2011Oct 7 2011

Other

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

Fingerprint

Costs
Experiments

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this

Gao, Y., & Chiu, Y-C. (2011). Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC (pp. 728-733). [6083070] https://doi.org/10.1109/ITSC.2011.6083070

Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems. / Gao, Yang; Chiu, Yi-Chang.

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. p. 728-733 6083070.

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

Gao, Y & Chiu, Y-C 2011, Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems. in IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC., 6083070, pp. 728-733, 14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011, Washington, DC, United States, 10/5/11. https://doi.org/10.1109/ITSC.2011.6083070
Gao Y, Chiu Y-C. Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. p. 728-733. 6083070 https://doi.org/10.1109/ITSC.2011.6083070
Gao, Yang ; Chiu, Yi-Chang. / Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems. IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. pp. 728-733
@inproceedings{45a0df6faff34c5ca2b57fe255d53497,
title = "Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems",
abstract = "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.",
author = "Yang Gao and Yi-Chang Chiu",
year = "2011",
doi = "10.1109/ITSC.2011.6083070",
language = "English (US)",
isbn = "9781457721984",
pages = "728--733",
booktitle = "IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC",

}

TY - GEN

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

AU - Gao, Yang

AU - Chiu, Yi-Chang

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=83755178805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755178805&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2011.6083070

DO - 10.1109/ITSC.2011.6083070

M3 - Conference contribution

SN - 9781457721984

SP - 728

EP - 733

BT - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

ER -