Dynamic journeying under uncertainty

European Journal of Operational Research

Volumn 225, Issue 3, 2013, Pages 455-471

  Häme, Lauri ^a   Hakula, Harri ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Itinerary planning problem; Markov decision processes; Stochastic processes; Stochastic shortest path problem; Transportation

Indexed keywords

APPROXIMATE METHODS; ARRIVAL TIME; AS PATHS; BACKWARD INDUCTION; HISTORY INDEPENDENCE; MARKOV DECISION PROCESSES; MULTI-MODAL; NUMERICAL EXPERIMENTS; OPTIMAL POLICIES; PLANNING PROBLEM; PUBLIC TRANSPORT; PUBLIC TRANSPORT NETWORKS; STOCHASTIC SHORTEST PATH PROBLEM; TIME HORIZONS; TRANSPORT NETWORKS; TRANSPORT SERVICES; TRANSPORTATION NETWORK; TRANSPORTATION PROBLEM;

APPROXIMATION THEORY; GRAPH THEORY; LEARNING ALGORITHMS; MULTIMODAL TRANSPORTATION; RANDOM PROCESSES; TRANSPORTATION;

MARKOV PROCESSES;

EID: 84870252383     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.10.027     Document Type: Article

References (67)

1. K.N. Androutsopoulos, and K.G. Zografos Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network European Journal of Operational Research 192 2009 18 28
2. A. Azaron, and F. Kianfar Dynamic shortest path in stochastic dynamic networks: ship routing problem European Journal of Operational Research 144 2003 138 156
3. Bander, J., White, C.C., 1991. A new route optimization algorithm for rapid decision support. In: Proc. Vehicle Navigat. Inf. Syst. Conf. Part 2, vol. P-253, pp. 709-728.
4. J.L. Bander, and C.C. White III A heuristic search approach for a nonstationary shortest path problem with terminal costs Transportation Science 36 2002 218 230
5. J.F. Bard, and J.E. Bennett Arc reduction and path preference in stochastic acyclic networks Management Science 37 2 1991 198 215
6. R. Bellman A Markovian decision process Journal of Mathematics and Mechanics 6 1957
7. D.P. Bertsekas Dynamic Programming and Optimal Control 1995 Athena Scientific
8. D.J. Bertsimas, P. Jaillet, and A.R. Odoni A priori optimization Operations Research 38 1990 1019 1033
9. Boyan, J., Mitzenmacher, M., 2001. Improved results for route planning in stochastic transportation networks. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, pp. 895-902.
10. D. Brownstone, and K.A. Small Valuing time and reliability: assessing the evidence from road pricing demonstrations Transportation Research Part A 39 2005 279 293
11. J. Brub, J. Potvin, and J. Vaucher Time-dependent shortest paths through fixed sequence of nodes: application to a travel planning problem Computers & Operations Research 33 6 2006 1838 1856
12. X. Cai, T. Kloks, and C.K. Wong Time-varying shortest path problems with constraints Networks 29 3 1997 141 149
13. I. Chabini Discrete dynamic shortest path problems in transportation applications Transportation Research Record 1645 1998 170 175
14. R.K. Cheung Iterative methods for dynamic stochastic shortest path problems Naval Research Logistics 45 1998 769 789
15. R.K. Cheung, and B. Muralidharan Dynamic routing for priority shipments in LTL service networks Transportation Science 34 2000 86 98
16. Y.S. Chiang, and P.O. Roberts A note on transit time and reliability for regular-route trucking Transport Research Part B 14s 1-2 1980 59 65
17. K.L. Cooke, and E. Halsey The shortest route through a network with time-dependent intermodal transit times Journal of Mathematical Analysis and Applications 14 1966 493 498
18. Datar, M., Ranade, A., 2000. Commuting with delay prone buses. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 22-29.
19. C. Davies, and P. Lingras Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks European Journal of Operational Research 144 2003 27 38
20. Y. Fan, R. Kalaba, and J. Moore Arriving on time Journal of Optimization Theory and Applications 127 3 2005 497 513
21. Y. Fan, R. Kalaba, and J. Moore Shortest paths in stochastic networks with correlated link costs Computers and Mathematics with Applications 49 2005 1549 1564
22. M.C. Ferris, and A. Ruszczynski Robust path choice in networks with failures Networks 35 2000 181 194
23. M. Fosgerau, and A. Karlström The value of reliability Transportation Research Part B 44 2010 38 49
24. L. Fu, and L. Rillet Expected shortest paths in dynamic and stochastic traffic networks Transportation Research 32 7 1998 499 516
25. R.W. Hall The fastest path through a network with random time-dependent travel times Transportation Science 20 3 1986 182 188
26. H. Hamacher, S. Ruzika, and S. Tjandra Algorithms for time-dependent bicriteria shortest path problems Discrete Optimization 3 3 2006 238 254
27. Helsinki City Transport, November 2011. Helsinki City Transport Annual Reports. < http://www.hel.fi/hki/hkl/en/About+HKL/Annual+Reports >.
28. Helsinki Region Traffic, October 2010. Kalkati.net XML representation of helsinki regional transport authority (HSL) timetable data. < http://developer.reittiopas.fi/ >.
29. M. Horn An extended model and procedural framework for planning multi-modal passenger journeys Transportation Research Part B 37 7 2003 641 660
30. Huang, R., Peng, Z.R., 2001. An integration of network data model and routing algorithms for online transit trip planning. In: Proc. 80th Annu. Meeting Transp. Res. Board. Washington, DC.
31. Huang, R., Peng, Z.R., 2002. Schedule-based path finding algorithms for online transit trip planning. In: Proc. 81st Annu. Meeting Transp. Res. Board. Washington, DC.
32. P. Jaillet Shortest path problems with node failures Networks 22 1992 589 605
33. H. Jula, M. Dessouky, and P.A. Ioannou Truck route planning in nonstationary stochastic networks with time windows at customer locations IEEE Transactions on Intelligent Transportation Systems 7 1 2006 51 62
34. J. Kamburowski A note on the stochastic shortest route problem Operations Research 33 6 1985 696 698
35. E.P.C. Kao A preference order dynamic program for a stochastic traveling salesman problem Operations Research 26 6 1978 1033 1045
36. A.S. Kenyon, and D.P. Morton Stochastic vehicle routing with random travel times Transportation Science 37 1 2003 69 82
37. S. Kim, M. Lewis, and C. White III Optimal vehicle routing with real-time traffic information IEEE Transactions on Intelligent Transportation Systems 6 2 2005 178 188
38. S. Kim, M. Lewis, and C.C. White III State space reduction for non-stationary stochastic shortest path problems with real-time traffic congestion information IEEE Transactions on Intelligent Transportation Systems 6 3 2005 273 284
39. M. Kostreva, and M. Wiecek Time dependency in multiple objective dynamic programming Journal of Mathematical Analysis and Applications 173 1 1993 289 307
40. T.C. Lam, and K.A. Small The value of time and reliability: measurement from a value pricing experiment Transportation Research Part E: Logistics and Transportation Review 37 2-3 2001 231 251
41. R.P. Loui Optimal paths in graphs with stochastic or multidimensional weights Communications of the ACM 26 1983 670 676
42. E.D. Miller-Hooks, and H.S. Mahmassani Least expected time paths in stochastic, time-varying transportation networks Transportation Science 34 2000 198 215
43. P.B. Mirchandani, and H. Soroush Optimal paths in probabilistic networks: a case with temporary preferences Computers & Operations Research 12 1985 365 383
44. P. Modesti, and A. Siomachen A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks European Journal of Operational Research 111 3 1998 495 508
45. I. Murthy, and S. Sarkar Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function European Journal of Operational Research 103 1997 209 229
46. Y.M. Nie, and X. Wu Shortest path problem considering on-time arrival probability Transportation Research Part B 43 2009 597 613
47. Nikolova, E., Brand, M., Karger, D., 2006a. Optimal route planning under uncertainty. In: Proceedings of International Conference on Planning and Scheduling, Lake District, England.
48. Nikolova, E., Kelner, J., Brand, M., Mitzenmacher, M., 2006b. Stochastic shortest paths via quasi-convex maximization. In: Proceedings of European Symposium of Algorithms, Zurich, Switzerland, pp. 552-563.
49. S. Peer, and D.K. Sharma Finding the shortest path in stochastic networks Computers and Mathematics with Applications 53 2007 729 740
50. Z.R. Peng, and R. Huang Design and development of interactive trip planning for web-based transit information systems Transportation Research: Part C 8 1 2000 409 425
51. G.H. Polychronopoulos, and J.N. Tsitsiklis Stochastic shortest path problems with recourse Networks 27 1996 133 143
52. H.E. Psaraftis, and J.N. Tsitsiklis Dynamic shortest paths in acyclic networks with markovian arc costs Operations Research 41 1 1993 91 101
53. L. Pun-Cheng An interactive web-based public transport enquiry system with real-time optimal route computation IEEE Transactions on Intelligent Transportation Systems 13 2 2012 983 988
54. M.L. Puterman Markov Decision Processes: Discrete Stochastic Dynamic Programming first ed. 1994 John Wiley & Sons Inc. New York, NY, USA
55. Ritzerveld, N.G.H., 2007. Doctoral Thesis, Leiden University.
56. R.A. Russell, and T.L. Urban Vehicle routing with soft time windows and Erlang travel times Journal of the Operational Research Society 59 2007 1220 1228
57. C.E. Sigal, A.A.B. Pritsker, and J.J. Solberg The stochastic shortest route problem Operations Research 28 5 1980 1122 1129
58. K. Small, C. Winston, and J. Yan Uncovering the distribution of motorists' preferences for travel time and reliability Econometrica 73 4 2005 1367 1382
59. M.C. Tan, C.O. Tong, S.C. Wong, and J. Xu An algorithm for finding reasonable paths in transit networks Journal of Advanced Transportation 41 3 2007 285 305
60. B. Thomas, and C. White The dynamic shortest path problem with anticipation European Journal of Operational Research 176 2 2007 836 854
61. C.O. Tong, and A.J. Richardson A computer model for finding the time dependent minimum path in transit systems with fixed schedules Journal of Advanced Transportation 18 2 1984 145 161
62. C.O. Tong, and S.C. Wong A stochastic transit assignment model using a dynamic schedule-based network Transportation Research Part B 33 2 1999 107 121
63. S. Waller, and A. Ziliaskopoulos On the online shortest path problem with limited arc cost dependencies Networks 40 4 2002 216 227
64. S.C. Wong, and C.O. Tong Estimation of time-dependent origin-destination matrices for transit networks Transportation Research Part B 32 1 1998 35 48
65. A. Ziliaskopoulos, and H. Mahmassani Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications Transportation Research Record 1408 1993 94 100
66. A. Ziliaskopoulos, and W. Wardell An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays European Journal of Operational Research 125 3 2000 486 502
67. K.G. Zografos, and K.N. Androutsopoulos Algorithms for itinerary planning in multimodal transportation networks IEEE Transactions on Intelligent Transportation Systems 9 1 2008