Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 45, Issue 10, Pages 1660-1679Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2011.06.004
Keywords
Shortest path algorithm; Path travel time reliability; Reliable route; Lagrangian relaxation method
Categories
Funding
- Safe Trip 21 project
- Research and Innovative Technology Administration (RITA), US Department of Transportation
Ask authors/readers for more resources
Path travel time reliability is an essential measure of the quality of service for transportation systems and an important attribute in travelers' route and departure time scheduling. This paper investigates a fundamental problem of finding the most reliable path under different spatial correlation assumptions, where the path travel time variability is represented by its standard deviation. To handle the non-linear and non-additive cost functions introduced by the quadratic forms of the standard deviation term, a Lagrangian substitution approach is adopted to estimate the lower bound of the most reliable path solution through solving a sequence of standard shortest path problems. A subgradient algorithm is used to iteratively improve the solution quality by reducing the optimality gap. To characterize the link travel time correlation structure associated with the end-to-end trip time reliability measure, this research develops a sampling-based method to dynamically construct a proxy objective function in terms of travel time observations from multiple days. The proposed algorithms are evaluated under a large-scale Bay Area, California network with real-world measurements. (C) 2011 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