A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation

Xianbiao Hu, Yi Chang Chiu

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm in order to find K Shortest Paths between two given locations. The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process, during which the overlap and travel time deviation issues between the K paths will be considered. The proposed algorithm balancing overlap and travel time deviation is developed in this research. A numerical analysis is conducted on the Tucson I-10 network, the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time, which indicates that the result of the proposed algorithm is satisfactory.

Original languageEnglish (US)
Pages (from-to)371-394
Number of pages24
JournalInternational Journal of Transportation Science and Technology
Volume4
Issue number4
DOIs
StatePublished - 2015

Keywords

  • Active Traffic and Demand Management (ATDM)
  • Constrained Shortest Path, Route Overlap
  • K shortest Paths Algorithm (KSP)
  • Route Choice
  • Time Dependent Shortest Path (TDSP)
  • Travel time Deviation

ASJC Scopus subject areas

  • Transportation
  • Automotive Engineering
  • Civil and Structural Engineering
  • Management, Monitoring, Policy and Law

Fingerprint Dive into the research topics of 'A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation'. Together they form a unique fingerprint.

  • Cite this