Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Journal of Advanced Transportation

Volumn 50, Issue 7, 2016, Pages 1413-1431

  Chen, Bi Yu ^a,b   Lam, William H K ^b   Li, Qingquan ^a,c  

^a WUHAN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c SHENZHEN UNIVERSITY   (China)

Author keywords

reliable shortest path; route guidance systems; spatial correlation; travel time reliability

Indexed keywords

ALGORITHMS; GRAPH THEORY; RELIABILITY; REMOTE CONTROL; ROADS AND STREETS; STOCHASTIC SYSTEMS; TRAFFIC CONGESTION; TRAFFIC CONTROL; TRANSPORTATION;

COMPUTATIONAL RESULTS; ROUTE GUIDANCE SYSTEM (RGS); ROUTE GUIDANCE SYSTEMS; SHORTEST PATH; SHORTEST PATH FINDINGS; SPATIAL CORRELATIONS; TRAVEL TIME CORRELATIONS; TRAVEL TIME RELIABILITY;

TRAVEL TIME;

EID: 84984679655     PISSN: 01976729     EISSN: 20423195     Source Type: Journal    
DOI: 10.1002/atr.1408     Document Type: Article

References (45)

1. Bast H, Funke S, Sanders P Schultes D. Fast routing in road networks with transit nodes. Science 2007; 316: 566–566.
2. Bates J, Polak J, Jones P Cook A. The valuation of reliability for personal travel. Transportation Research Part E 2001; 37: 191–229.
3. Bell MGH. Hyperstar: a multi-path astar algorithm for risk averse vehicle navigation. Transportation Research Part B 2009; 43: 97–107.
4. Carrion C, Levinson D. Value of travel time reliability: a review of current evidence. Transportation Research Part A 2012; 46: 720–741.
5. Chan KS, Lam WHK Tam ML. Real-time estimation of arterial travel times with spatial travel time covariance relationships. Transportation Research Record 2009; 2121: 102–109.
6. Chen A, Ji ZW. Path finding under uncertainty. Journal of Advanced Transportation 2005; 39: 19–37.
7. Chen BY, Lam WHK, Sumalee A Li ZL. Reliable shortest path finding in stochastic networks with spatial correlated link travel times. International Journal of Geographical Information Science 2012; 26: 365–386.
8. Chen BY, Lam WHK, Sumalee A, Li QQ, Shao H Fang ZX. Finding reliable shortest paths in road networks under uncertainty. Networks & Spatial Economics 2013a; 13: 123–148.
9. Chen BY, Lam WHK, Li QQ, Sumalee A Yan K. Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property. IEEE Transactions on Intelligent Transportation Systems 2013b; 14: 1907–1917.
10. Chen BY, Lam WHK, Sumalee A, Li QQ Tam ML. Reliable shortest path problems in stochastic time-dependent networks. Journal of Intelligent Transportation Systems 2014; 18: 177–189.
11. Chen BY, Shi C, Zhang J, Lam WHK, Li QQ Xiang S. Most reliable path-finding algorithm for maximizing on-time arrival probability. Transportmetrica B 2016a. DOI:10.1080/21680566.2016.1169953.
12. Chen BY, Yuan H, Li QQ, Shaw S-L, Lam WHK Chen X. Spatiotemporal data model for network time geographic analysis in the era of big data. International Journal of Geographical Information Science 2016b; 30: 1041–1071.
13. El Esawey M, Sayed T. Travel time estimation in urban networks using limited probes data. Canadian Journal of Civil Engineering 2011; 38: 305–318.
14. Fan YY, Nie Y. Optimal routing for maximizing the travel time reliability. Networks & Spatial Economics 2006; 6: 333–344.
15. Frank H. Shortest paths in probabilistic graphs. Operations Research 1969; 17: 583–599.
16. Fredman ML, Tarjan RE. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association of Computing Machinery 1987; 34: 596–615.
17. Fu L, Sun D Rilett LR. Heuristic shortest path algorithms for transportation applications: state of the art. Computers & Operations Research 2006; 33: 3324–3343.
18. Fu X, Lam WHK Chen BY. A reliability-based traffic assignment model for multi-modal transport network under demand uncertainty. Journal of Advanced Transportation 2014a; 48: 66–85.
19. Fu X, Lam WHK Meng Q. Modelling impacts of adverse weather conditions on activity-travel pattern scheduling in multi-modal transit networks. Transportmetrica B 2014b; 2: 151–167.
20. Gajewski BJ, Rilett LR. Estimating link travel time correlation: an application of bayesian smoothing splines. Journal of Transportation and Statistics 2003; 7(2–3): 53–70.
21. Geisberger R, Sanders P, Schultes D Vetter C. Exact routing in large road networks using contraction hierarchies. Transportation Science 2012; 46: 388–404.
22. Gutierrez E, Medaglia AL. Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks. Annals of Operations Research 2008; 157: 169–182.
23. Huang B, Wu Q Zhan FB. A shortest path algorithm with novel heuristics for dynamic transportation networks. International Journal of Geographical Information Science 2007; 21(6): 625–644.
24. Ji ZW, Kim YS Chen A. Multi-objective alpha-reliable path finding in stochastic networks with correlated link costs: a simulation-based multi-objective genetic algorithm approach (SMOGA). Expert Systems with Applications 2011; 38: 1515–1528.
25. Kaparias I, Bell MGH Belzner H. A new measure of travel time reliability for in-vehicle navigation systems. Journal of Intelligent Transportation Systems 2008; 12: 202–211.
26. Khani A, Boyles SD. An exact algorithm for the mean-standard deviation shortest path problem. Transportation Research Part B 2015; 81: 252–266.
27. Lam TC, Small KA. The value of time and reliability: measurement from a value pricing experiment. Transportation Research Part E 2001; 37(2–3): 231–251.
28. Li QQ, Chen BY, Wang Y Lam WHK. A hybrid link-node approach for finding shortest paths in road networks with turn restrictions. Transactions in GIS 2015; 19: 915–929.
29. Li ZC, Huang HJ Lam WHK. Modelling heterogeneous drivers' response to route guidance and parking information system in stochastic and time-dependent networks. Transportmetrica 2012; 8: 105–129.
30. Ma J, Fukuda D Schmöcker J-D. Faster hyperpath generating algorithms for vehicle navigation. Transportmetrica A 2013; 9: 925–948.
31. Ma J, Fukuda D. A hyperpath-based network generalized extreme-value model for route choice under uncertainties. Transportation Research Part C 2015; 59: 19–31.
32. Miller HJ, Shaw SL. Geographic Information Systems for Transportation: Principles and ApplicationsOxford University Press: New York, 2001.
33. Nie Y, Wu X. Shortest path problem considering on-time arrival probability. Transportation Research Part B 2009a; 43(6): 597–613.
34. Nie Y, Wu X. Reliable a priori shortest path problem with limited spatial and temporal dependencies. In 18th International Symposium on Transportation and Traffic Theory 2009: Golden Jubilee, (Eds) 2009b 169–195.
35. Rakha, H., El-Shawarby, I., Arafeh, M. and Dion, F., 2006, Estimating path travel-time reliability. In: 2006 IEEE Intelligent Transportation Systems Conference, Toronto, Canada, pp. 236-241.
36. Srinivasan KK, Prakash AA Seshadri R. Finding most reliable paths on networks with correlated and shifted log-normal travel times. Transportation Research Part B 2014; 66: 110–128.
37. Susilawati S, Taylor MAP Somenahalli S. Distributions of travel time variability on urban roads. Journal of Advanced Transportation 2013; 47: 720–736.
38. Tam ML, Lam WHK. Using automatic vehicle identification data for travel time estimation in Hong Kong. Transportmetrica 2008; 4(3): 179–194.
39. Taylor MAP. Travel through time: the story of research on travel time reliability. Transportmetrica B 2013; 1: 174–194.
40. Tobler WR. A computer movie simulating urban growth in the Detroit Region. Economic Geography 1970; 46: 234–240.
41. Waller ST, Ziliaskopoulos AK. On the online shortest path problem with limited arc cost dependencies. Networks 2002; 40: 216–227.
42. Xing T, Zhou X. Reformulation and solution algorithms for absolute and percentile robust shortest path problems. IEEE Transactions on Intelligent Transportation Systems 2013; 14: 943–954.
43. Yang L, Zhou X. Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem. Transportation Research Part B 2014; 59: 22–44.
44. Zeng W, Miwa T, Wakita Y Morikawa T. Application of Lagrangian relaxation approach to a-reliable path finding in stochastic networks with correlated link travel times. Transportation Research Part C 2015; 56: 309–334.
45. Zhou Y, Wang W, He D Wang Z. A fewest-turn-and-shortest path algorithm based on breadth-first search. Geo-spatial Information Science 2014; 17: 201–207.