Reliable route guidance: A case study from Chicago
Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5–15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.
Volume (Year): 46 (2012)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lo, Hong K. & Luo, X.W. & Siu, Barbara W.Y., 2006. "Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 792-806, November.
- Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
- Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
- Liu, Henry X. & Recker, Will & Chen, Anthony, 2004. "Uncovering the contribution of travel time reliability to dynamic route choice using real-time loop data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(6), pages 435-453, July.
- Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
- Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
- Hall, Randolph W., 1983. "Travel outcome and performance: The effect of uncertainty on accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 17(4), pages 275-290, August.
- Carraway, Robert L. & Morin, Thomas L. & Moskowitz, Herbert, 1990. "Generalized dynamic programming for multicriteria optimization," European Journal of Operational Research, Elsevier, vol. 44(1), pages 95-104, January.
- Jonathan F. Bard & James E. Bennett, 1991. "Arc Reduction and Path Preference in Stochastic Acyclic Networks," Management Science, INFORMS, vol. 37(2), pages 198-215, February.
- Hadar, Josef & Russell, William R, 1969. "Rules for Ordering Uncertain Prospects," American Economic Review, American Economic Association, vol. 59(1), pages 25-34, March.
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:46:y:2012:i:2:p:403-419. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.