Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 94, Issue -, Pages 189-203Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2016.09.013
Keywords
K reliable shortest paths problem; Travel time uncertainty; Reliability
Categories
Funding
- National Natural Science Foundation of China [41571149, 41231171, 41201466]
- Research Committee of the Hong Kong Polytechnic University [87PV, 1-BBA8]
- Research Institute of Sustainable Urban Development of the Hong Kong Polytechnic University [1-ZVEW]
Ask authors/readers for more resources
This paper investigates the problem of finding the K reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. The KRSP problem extends the classical K loopless shortest paths problem to the stochastic networks by explicitly considering travel time reliability. In this study, a deviation path approach is established for finding K alpha-reliable paths in stochastic networks. A deviation path algorithm is proposed to exactly solve the KRSP problem in large-scale networks. The A* technique is introduced to further improve the KRSP finding performance. A case study using real traffic information is performed to validate the proposed algorithm. The results indicate that the proposed algorithm can determine KRSP under various travel time reliability values within reasonable computational times. The introduced A* technique can significantly improve KRSP finding performance. (C) 2016 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available