Networks and Spatial Economics

, Volume 13, Issue 2, pp 123–148 | Cite as

Finding Reliable Shortest Paths in Road Networks Under Uncertainty

  • Bi Yu Chen
  • William H. K. Lam
  • Agachai Sumalee
  • Qingquan Li
  • Hu Shao
  • Zhixiang Fang


The aim of this study is to investigate the solution algorithm for solving the problem of determining reliable shortest paths in road networks with stochastic travel times. The availability of reliable shortest paths enables travelers, in the face of travel time uncertainty, to plan their trips with a pre-specified on-time arrival probability. In this study, the reliable shortest path between origin and destination nodes is determined using a multiple-criteria shortest path approach when link travel times follow normal distributions. The dominance conditions involved in such problems are established, thereby reducing the number of generated non-dominated paths during the search processes. Two solution algorithms, multi-criteria label-setting and A* algorithms, are proposed and their complexities analyzed. Computational results using large scale networks are presented. Numerical examples using data from a real-world advanced traveller information system is also given to illustrate the applicability of the solution algorithms in practice.


Reliable shortest path problem Travel time reliability Advanced traveller information system Pre-trip planning application 


  1. Bellman R (1958) On a routing problem. Q Appl Math 16:87–90Google Scholar
  2. Brumbaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. Eur J Oper Res 43:216–224CrossRefGoogle Scholar
  3. Chan KS, Lam WHK, Tam ML (2009) Real-time estimation of arterial travel times with spatial travel time covariance relationships. Transp Res Rec 2121:102–109CrossRefGoogle Scholar
  4. Chen A, Ji ZW (2005) Path finding under uncertainty. J Adv Transp 39:19–37CrossRefGoogle Scholar
  5. Chen A, Yang C, Kongsomsaksakul S, Lee M (2007a) Network-based accessibility measures for vulnerability analysis of degradable transportation networks. Netw Spat Econ 7:241–256CrossRefGoogle Scholar
  6. Chen YY, Bell MGH, Bogenberger K (2007b) Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system. IEEE Trans Intell Transp Syst 8:14–20CrossRefGoogle Scholar
  7. Chen BY, Lam WHK, Tam ML (2008) Using a multi-criteria approach to solve path finding problem in road network with uncertainty. In: Proceeding of 13th Conference of the Hong Kong Society for Transportation Studies. Hong Kong, China, pp 229–238Google Scholar
  8. Chen BY, Lam WHK, Sumalee A, Shao H (2011) An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem. Math Comput Model 54:1428–1439CrossRefGoogle Scholar
  9. Chen BY, Lam WHK, Sumalee A, Li QQ, Li ZC (2012a) Vulnerability analysis for large-scale and congested road networks with demand uncertainty. Transp Res A Policy Pract 46:501–516CrossRefGoogle Scholar
  10. Chen BY, Lam WHK, Sumalee A, Li ZL (2012b) Reliable shortest path finding in stochastic networks with spatial correlated link travel times. Int J Geogr Inf Sci 26:365–386CrossRefGoogle Scholar
  11. Chen BY, Lam WHK, Sumalee A, Li QQ, Tam ML (2012c) Reliable shortest path problems in stochastic time-dependent networks. J Intell Transp Syst. Accepted for publicationGoogle Scholar
  12. Fan YY, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6:333–344CrossRefGoogle Scholar
  13. Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17:583–599CrossRefGoogle Scholar
  14. Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34:596–615CrossRefGoogle Scholar
  15. Fu LP (2001) An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transp Res B Methodol 35:749–765CrossRefGoogle Scholar
  16. Hart EP, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Man Cybern Syst Hum 4:100–107Google Scholar
  17. Hutson KR, Shier DR (2009) Extended dominance and a stochastic shortest path problem. Comput Oper Res 36:584–596CrossRefGoogle Scholar
  18. Lam TC, Small KA (2001) The value of time and reliability: measurement from a value pricing experiment. Transp Res E Logist Transp Rev 37:231–251CrossRefGoogle Scholar
  19. Lam WHK, Chan KS, Shi JWZ (2002) A traffic flow simulator for short-term travel time forecasting. J Adv Transp 36:265–291CrossRefGoogle Scholar
  20. Li ZC, Huang HJ, Lam WHK (2012) Modelling heterogeneous drivers’ response to route guidance and parking information system in stochastic and time-dependent networks. Transportmetrica 8:105–129CrossRefGoogle Scholar
  21. Miller-Hooks ED, Mahmassani HS (2003) Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. Eur J Oper Res 146:67–82CrossRefGoogle Scholar
  22. Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3:347–355CrossRefGoogle Scholar
  23. Nie Y, Wu X (2009) Shortest path problem considering on-time arrival probability. Transp Res B Methodol 43:597–613CrossRefGoogle Scholar
  24. Nie Y, Wu X (2011) Optimal path problems with second-order stochastic dominance constraints. Netw Spat Econ. doi:10.1007/s11067-011-9167-6
  25. Nikolova E (2006) Stochastic shortest paths via quasi-convex maximization. In: Proceedings of 2006 European Symposium of Algorithms. Zurich, Switzerland, pp 552–563Google Scholar
  26. Nikolova E (2010) High-performance heuristics for optimization in stochastic traffic engineering problems. In: Lirkov I, Margenov S, Wasniewski J (eds) Large-scale scientific computing. Springer, New York, pp 352–360CrossRefGoogle Scholar
  27. Rakha H, El-Shawarby I, Arafeh M, Dion F (2006) Estimating path travel time reliability. In: Proceedings of 2006 IEEE Intelligent Transportation Systems Conference. Toronto, Canada, pp 236–241Google Scholar
  28. Reinhardt LB, Pisinger D (2011) Multi-objective and multi-constrained non-additive shortest path problems. Comput Oper Res 38:605–616CrossRefGoogle Scholar
  29. Sen S, Pillai R, Joshi S, Rathi AK (2001) A mean-variance model for route guidance in advanced traveler information systems. Transp Sci 35:37–49CrossRefGoogle Scholar
  30. Shao H, Lam WHK, Chan KS (2004) The problem of searching the reliable path for transportation networks with uncertainty. In: Proceeding of 9th Conference of the Hong Kong Society for Transportation Studies. Hong Kong, China, pp 226–234Google Scholar
  31. Shao H, Lam WHK, Tam ML (2006) A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand. Netw Spat Econ 6:173–204CrossRefGoogle Scholar
  32. Skriver AJV, Andersen KA (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27:507–524CrossRefGoogle Scholar
  33. Tam ML, Lam WHK (2008) Using automatic vehicle identification data for travel time estimation in Hong Kong. Transportmetrica 4:179–194CrossRefGoogle Scholar
  34. Tam ML, Lam WHK, Lo HP (2008) Modeling air passenger travel behavior on airport ground access mode choices. Transportmetrica 4:135–153CrossRefGoogle Scholar
  35. Tian LJ, Huang HJ, Gao ZY (2012) A cumulative perceived value-based dynamic user equilibrium model considering the travelers’ risk evaluation on arrival time. Netw Spat Econ. doi:10.1007/s11067-011-9168-5
  36. Waller ST, Ziliaskopoulos AK (2002) On the online shortest path problem with limited arc cost dependencies. Networks 40:216–227CrossRefGoogle Scholar
  37. Wu X, Nie Y (2011) Modeling heterogeneous risk-taking behavior in route choice: a stochastic dominance approach. Transp Res A Policy Pract 45:896–915CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Bi Yu Chen
    • 1
    • 2
  • William H. K. Lam
    • 1
    • 3
  • Agachai Sumalee
    • 1
  • Qingquan Li
    • 2
  • Hu Shao
    • 4
  • Zhixiang Fang
    • 2
  1. 1.Department of Civil and Structural EngineeringThe Hong Kong Polytechnic UniversityHung HomHong Kong
  2. 2.State Key Laboratory of Information Engineering in Surveying, Mapping and Remote SensingWuhan UniversityWuhanChina
  3. 3.School of Traffic & TransportationBeijing Jiaotong UniversityBeijingChina
  4. 4.Department of MathematicsChina University of Mining and TechnologyXuzhouChina

Personalised recommendations