Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

Transportation Research Part C: Emerging Technologies

Volumn 56, Issue , 2015, Pages 309-334

  Zeng, Weiliang ^a   Miwa, Tomio ^a   Wakita, Yukiko ^a   Morikawa, Takayuki ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

Cholesky decomposition; Correlated link travel time; Lagrangian relaxation; Navigation system; Reliable path; Stochastic network

Indexed keywords

LAGRANGE MULTIPLIERS; NAVIGATION SYSTEMS; STOCHASTIC SYSTEMS; TRAFFIC CONTROL;

CHOLESKY DECOMPOSITION; CORRELATED LINK; LAGRANGIAN RELAXATION; RELIABLE PATH; STOCHASTIC NETWORKS;

TRAVEL TIME;

DECOMPOSITION ANALYSIS; LAGRANGIAN ANALYSIS; MATRIX; NAVIGATION; STOCHASTICITY; TRAVEL TIME;

EID: 84943802475     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2015.04.018     Document Type: Article

References (72)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications 1993, Prentice-Hall, Upper Saddle River, NJ, pp. 598-648.
2. Bates J., Polak J., Jones P., Cook A. The valuation of reliability for personal travel. Transport. Res. Part E: Logistics Transport. Rev. 2001, 37(2):191-229.
3. Bell M.G. A game theory approach to measuring the performance reliability of transport networks. Transport. Res. Part B: Methodol. 2000, 34(6):533-545.
4. Bell M.G. Hyperstar: a multi-path Astar algorithm for risk averse vehicle navigation. Transport. Res. Part B: Methodol. 2009, 43(1):97-107.
5. Cao P., Miwa T., Morikawa T. Modeling distribution of travel time in signalized road section using truncated distribution. Proc.-Social Behav. Sci. 2014, 138:137-147.
6. Chang T.S., Nozick L.K., Turnquist M.A. Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments. Transport. Sci. 2005, 39(3):383-399.
7. Chen A., Ji Z. Path finding under uncertainty. J. Adv. Transport. 2005, 39(1):19-37.
8. Chen A., Yang H., Lo H.K., Tang W.H. Capacity reliability of a road network: an assessment methodology and numerical results. Transport. Res. Part B: Methodol. 2002, 36(3):225-252.
9. Chen B.Y., Lam W.H., Sumalee A., Li Z.L. Reliable shortest path finding in stochastic networks with spatial correlated link travel times. Int. J. Geograph. Inform. Sci. 2012, 26(2):365-386.
10. Chen B.Y., Lam W.H.K., Li Q.Q., Sumalee A., Yan K. Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property. IEEE Trans. Intell. Transport. Syst. 2013, 14:1907-1917.
11. Chen B.Y., Lam W.H.K., Sumalee A., Li Q., Shao H., Fang Z. Finding reliable shortest paths in road networks under uncertainty. Netw. Spatial Econ. 2013, 13(2):123-148.
12. Chen B.Y., Lam W.H., Sumalee A., Li Q., Tam M.L. Reliable shortest path problems in stochastic time-dependent networks. J. Intell. Transport. Syst. 2014, 18(2):177-189.
13. Croarkin, C., Tobias, P., 2006. NIST/SEMATECH e-handbook of statistical methods. National Institute of Standards and Technology,. http://www.itl.nist.gov/div898/handbook.
14. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1959, 1(1):269-271.
15. Fan Y.Y., Kalaba R.E., Moore J.E. Arriving on time. J. Optim. Theory Appl. 2005, 127(3):497-513.
16. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 1981, 27(1):1-18.
17. Frank H. Shortest paths in probabilistic graphs. Oper. Res. 1969, 17(4):583-599.
18. Fu L.P., Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transport. Res. Part B - Methodol. 1998, 32:499-516.
19. Gajewski B.J., Rilett L.R. Estimating link travel time correlation: an application of Bayesian smoothing splines. J. Transport. Stat. 2004, 7(2/3):53-70.
20. Gao S., Huang H. Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transport. Res. Part C: Emerg. Technol. 2012, 21(1):196-213.
21. Golub, G.H., Loan, C.V., 1989. Matrix computations. Johns Hopkins series in the mathematical sciences.
22. Guignard M., Kim S. Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Programm. 1987, 39(2):215-228.
23. Hall R.W. Travel outcome and performance: the effect of uncertainty on accessibility. Transport. Res. Part B: Methodol. 1983, 17(4):275-290.
24. Hall R.W. The fastest path through a network with random time-dependent travel times. Transport. Sci. 1986, 20(3):182-188.
25. Handler G.Y., Zang I. A dual algorithm for the constrained shortest path problem. Networks 1980, 10(4):293-309.
26. Hart P.E., Nilsson N.J., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 1968, 4(2):100-107.
27. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Math. Programm. 1974, 6(1):62-88.
28. Hollander Y., Liu R. Estimation of the distribution of travel times by repeated simulation. Transport. Res. Part C: Emerg. Technol. 2008, 16(2):212-231.
29. Jenelius E., Koutsopoulos H.N. Travel time estimation for urban road networks using low frequency probe vehicle data. Transport. Res. Part B: Methodol. 2013, 53:64-81.
30. Ji Z., Kim Y.S., Chen A. Multi-objective α-reliable path finding in stochastic networks with correlated link costs: a simulation-based multi-objective genetic algorithm approach (SMOGA). Expert Syst. Appl. 2011, 38(3):1515-1528.
31. Jornsten K., Nasberg M. A new Lagrangian relaxation approach to the generalized assignment problem. Eur. J. Oper. Res. 1986, 27(3):313-323.
32. Kaparias I., Bell M.G., Belzner H. A new measure of travel time reliability for in-vehicle navigation systems. J. Intell. Transport. Syst. 2008, 12(4):202-211.
33. Lam T.C., Small K.A. The value of time and reliability: measurement from a value pricing experiment. Transport. Res. Part E: Logistics Transport. Rev. 2001, 37(2):231-251.
34. Lo H.K., Luo X.W., Siu B.W. Degradable transport network: travel time budget of travelers with heterogeneous risk aversion. Transport. Res. Part B: Methodol. 2006, 40(9):792-806.
35. Lomax, T., Schrank, D., Turner, S., Margiotta, R., 2003. Selecting travel reliability measures. Texas Transportation Institute, Cambridge Systematics Inc.
36. Miller-Hooks E.D. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 2001, 37(1):35-52.
37. Miller-Hooks E.D., Mahmassani H.S. Least possible time paths in stochastic, time-varying networks. Comput. Oper. Res. 1998, 25(12):1107-1125.
38. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transport. Sci. 2000, 34(2):198-215.
39. Miller-Hooks E.D., Mahmassani H. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. Eur. J. Oper. Res. 2003, 146(1):67-82.
40. Mirchandani P.B. Shortest distance and reliability of probabilistic networks. Comput. Oper. Res. 1976, 3(4):347-355.
41. Miwa T., Kiuchi D., Yamamoto T., Morikawa T. Development of map matching algorithm for low frequency probe data. Transport. Res. Part C: Emerg. Technol. 2012, 22:132-145.
42. Nazemi A., Omidi F. An efficient dynamic model for solving the shortest path problem. Transport. Res. Part C: Emerg. Technol. 2013, 26:1-19.
43. Ng M., Waller S.T. A computationally efficient methodology to characterize travel time reliability using the fast Fourier transform. Transport. Res. Part B: Methodol. 2010, 44(10):1202-1219.
44. Ng M., Kockelman K., Waller S. Relaxing the multivariate normality assumption in the simulation of transportation system dependencies: an old technique in a new domain. Transport. Lett. 2010, 2(2):63-74.
45. Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 1988, 37(2):176-186.
46. Nie Y., Fan Y. Arriving-on-time problem: discrete algorithm that ensures convergence. Transport. Res. Rec.: J. Transport. Res. Board 2006, 1964(1):193-200.
47. Nie, Y.M., Wu, X., 2009a. Reliable a priori shortest path problem with limited spatial and temporal dependencies. In: Transportation and Traffic Theory 2009: Golden Jubilee, pp. 169-195.
48. Nie Y.M., Wu X. Shortest path problem considering on-time arrival probability. Transport. Res. Part B: Methodol. 2009, 43(6):597-613.
49. Nie Y.M., Wu X., Dillenburg J.F., Nelson P.C. Reliable route guidance: a case study from Chicago. Transport. Res. Part A: Policy Pract. 2012, 46(2):403-419.
50. Polus A. A study of travel time and reliability on arterial routes. Transportation 1979, 8(2):141-151.
51. Prakash A.A., Srinivasan K. A sample-based algorithm to determine minimum robust cost path with correlated link travel times. Transport. Res. Rec.: J. Transport. Res. Board 2014, 2467(1):110-119.
52. Rachtan P., Huang H., Gao S. Spatiotemporal link speed correlations. Transport. Res. Rec.: J. Transport. Res. Board 2013, 2390(1):34-43.
53. Rakha H., El-Shawarby I., Arafeh M. Trip travel-time reliability: issues and proposed solutions. J. Intell. Transport. Syst. 2010, 14(4):232-250.
54. Samaranayake S., Blandin S., Bayen A. A tractable class of algorithms for reliable routing in stochastic networks. Transport. Res. Part C: Emerg. Technol. 2012, 20(1):199-217.
55. Schmocker, J.D., Bell, M.G., Kurauchi, F., Shimamoto, H., 2009. A game theoretic approach to the determination of hyperpaths in transportation networks. In: Transportation and Traffic Theory 2009: Golden Jubilee, pp. 1-18.
56. Schmocker J.D., Shimamoto H., Kurauchi F. Generation and calibration of transit hyperpaths. Transport. Res. Part C: Emerg. Technol. 2013, 36:406-418.
57. Sen S., Pillai R., Joshi S., Rathi A.K. A mean-variance model for route guidance in advanced traveler information systems. Transport. Sci. 2001, 35(1):37-49.
58. Seshadri R., Srinivasan K.K. Algorithm for determining most reliable travel time path on network with normally distributed and correlated link travel times. Transport. Res. Rec.: J. Transport. Res. Board 2010, 2196(1):83-92.
59. Shao H., Lam W.H., Meng Q., Tam M.L. Demand-driven traffic assignment problem based on travel time reliability. Transport. Res. Rec.: J. Transport. Res. Board 2006, 1985(1):220-230.
60. Sivakumar R.A., Batta R. The variance-constrained shortest path problem. Transport. Sci. 1994, 28(4):309-316.
61. Spiess H., Florian M. Optimal strategies: a new assignment model for transit networks. Transport. Res. Part B: Methodol. 1989, 23(2):83-102.
62. Srinivasan K.K., Prakash A.A., Seshadri R. Finding most reliable paths on networks with correlated and shifted log-normal travel times. Transport. Res. Part B: Methodol. 2013, 66:110-128.
63. Taş D., Dellaert N., van Woensel T., de Kok T. The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transport. Res. Part C: Emerg. Technol. 2014, 48:66-83.
64. Van Lint J.W.C., van Zuylen H.J., Tu H. Travel time unreliability on freeways: why measures based on variance tell only half the story. Transport. Res. Part A: Policy Pract. 2008, 42(1):258-277.
65. Wang Y., Dong W., Zhang L., Chin D., Papageorgiou M., Rose G., Young W. Speed modeling and travel time estimation based on truncated normal and lognormal distributions. Transport. Res. Rec.: J. Transport. Res. Board 2012, 2315(1):66-72.
66. Wang J.Y., Ehrgott M., Chen A. A bi-objective user equilibrium model of travel time reliability in a road network. Transport. Res. Part B: Methodol. 2014, 66:4-15.
67. Watling D. User equilibrium traffic network assignment with stochastic travel times and late arrival penalty. Eur. J. Oper. Res. 2006, 175(3):1539-1556.
68. Xiao L., Lo H.K. Adaptive vehicle routing for risk-averse travelers. Transport. Res. Part C: Emerg. Technol. 2013, 36:460-479.
69. Xing T., Zhou X. Finding the most reliable path with and without link travel time correlation: a Lagrangian substitution based approach. Transport. Res. Part B: Methodol. 2011, 45(10):1660-1679.
70. Xing T., Zhou X. Reformulation and solution algorithms for absolute and percentile robust shortest path problems. IEEE Trans. Intell. Transport. Syst. 2013, 14(2):943-954.
71. Yang L., Zhou X. Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem. Transport. Res. Part B: Methodol. 2014, 59:22-44.
72. Zockaie A., Nie Y.M., Wu X., Mahmassani H.S. Impacts of correlations on reliable shortest path finding. Transport. Res. Rec.: J. Transport. Res. Board 2013, 2334(1):1-9.