Shortest path problem considering on-time arrival probability

Transportation Research Part B: Methodological

Volumn 43, Issue 6, 2009, Pages 597-613

 

^a Marco)   (United States)

Author keywords

A priori shortest path; Arriving on time; Bellman's principle of optimality; First order stochastic dominance; Label correcting

Indexed keywords

DISTRIBUTION FUNCTIONS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; TRAVEL TIME;

ARRIVING ON-TIME; BELLMAN'S PRINCIPLE; FIRST-ORDER STOCHASTIC DOMINANCES; LABEL CORRECTING; SHORTEST PATH;

STOCHASTIC SYSTEMS;

ALGORITHM; COMPLEXITY; PROBABILITY; STOCHASTICITY; TRAVEL TIME;

EID: 67349275585     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.01.008     Document Type: Article

References (39)

1. Andreatta G., and Romeo L. Stochastic shortest paths with recourse. Networks 18 3 (1988) 193-204
2. Bellman R. On a routing problem. Quarter Application Mathematics 16 1 (1958) 87-90
3. Brumbaugh-Smith J., and Shier D. An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43 2 (1989) 216-224
4. Carraway R.L., Morin T.L., and Moskowitz H. Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research 44 1 (1990) 95-104
5. Cheung R.K. Iterative methods for dynamic stochastic shortest path problems. Naval Research Logistics 45 8 (1998) 769-789
6. Cheung R.K. A note on the stochastic shortest route problem. Naval Research Logistics 25 4 (1998) 729-732
7. Eiger A., Mirchandani P.B., and Soroush H. Path preferences and optimal paths in probabilistic networks. Transportation Science 19 1 (1985) 75-84
8. Fan Y., Kalaba R., and Moore J. Arriving on time. Journal of Optimization Theory and Applications 127 3 (2005) 497-513
9. Fan Y., Kalaba R., and Moore J. Shortest paths in stochastic networks with correlated link costs. Computers and Mathematics with Applications 49 9-10 (2005) 1549-1564
10. Fan Y., and Nie Y. Optimal routing for maximizing the travel time reliability. Networks and Spatial Economics 3 6 (2006) 333-344
11. Frank H. Shortest paths in probabilistic graphs. Operations Research 17 4 (1969) 583-599
12. Fu L. An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transportation Research Part B 35 8 (2001) 749-765
13. Fu L., and Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B 32 7 (1998) 499-516
14. Gao S., and Chabini I. Optimal routing policy problems in stochastic time-dependent networks. Transportation Research Part B 40 2 (2006) 93-122
15. Hall R.W. The fastest path through a network with random time-dependent travel time. Transportation Science 20 3 (1986) 182-188
16. Hansen, P. 1979. Bicriterion path problems, In: Fandel, G., Gal, T. (Eds.), Multiple criteria decision making theory and application, pp. 109-127.
17. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research 25 2 (1985) 281-291
18. Loui R.P. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 26 9 (1983) 670-676
19. Miller-Hooks, E. 1997, Optimal routing in time-varying, stochastic networks: algorithms and implementations. Ph.D. Thesis. Department of Civil Engineering, University of Texas at Austin.
20. Miller-Hooks E.D. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37 1 (2001) 35-52
21. Miller-Hooks E.D., and Mahmassani H.S. Least possible time paths in stochastic, time-varying networks. Computers and Operations Research 25 2 (1998) 1107-1125
22. Miller-Hooks E.D., and Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 34 2 (2000) 198-215
23. Miller-Hooks E.D., and Mahmassani H.S. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research 146 2 (2003) 67-82
24. Miller-Hooks, E. Mahmassani, H., 1998b. On the generation of nondominated paths in stochastic, time-varying networks. In: Proceedings of TRISTAN III (Triennial Symposium on Transportation Analysis)', San Juan.
25. Miller-Hooks E., and Mahmassani H. Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transportation Research Record 1645 (1998) 143-151
26. Mirchandani P.B. Shortest distance and reliability of probabilistic networks. Computers and Operations Research 3 4 (1976) 347-355
27. Montemanni R., and Gambardella L. An exact algorithm for the robust shortest path problem with interval data. Computers and Operations Research 31 10 (2004) 1667-1680
28. Muller A., and Stoyan D. Comparison Methods for Stochastic Models and Risks (2002), John Wiley & Sons, Chichester, UK
29. Murthy I., and Sarkar S. A relaxation-based pruning technique for a class of stochastic shortest path problems. Transportation Science 30 3 (1996) 220-236
30. Murthy I., and Sarkar S. Stochastic shortest path problems with piecewise linear concave linear functions. Management Science 44 11 (1998) 125-136
31. Nie Y., and Fan Y. Arriving-on-time problem: Discrete algorithm that ensures convergence. Transportation Research Record 1964 (2006) 193-200
32. Polychronopoulos G.H., and Tsitsiklis J.N. Stochastic shortest path problems with recourse. Networks 27 2 (1996) 133-143
33. Provan J.S. A polynomial-time algorithm to find shortest paths with recourse. Networks 41 2 (2003) 115-125
34. Sen S., Pillai R., Joshi S., and Rathi A. A mean-variance model for route guidance in advanced traveler information systems. Transportation Science 35 1 (2001) 37-49
35. Sigal C.E., Alan A., Pritsker B., and Solberg J.J. The stochastic shortest route problem. Operations Research 28 5 (1980) 1122-1129
36. Sivakumar R., and Batta R. The variance-constrained shortest path problem. Transportation Science 28 4 (1994) 309-316
37. von Neumann J., and Morgenstern O. Theory of Games and Economic Behavior (1967), Wiley, New York
38. Waller S.T., and Ziliaskopoulos A.K. On the online shortest path problem with limited arc cost dependencies. Networks 40 4 (2002) 216-227
39. Yu G., and Yang J. On the robust shortest path problem. Computers and Operations Research 25 6 (1998) 457-468