Optimal routing for maximizing the travel time reliability

Networks and Spatial Economics

Volumn 6, Issue 3-4, 2006, Pages 333-344

  Fan, Yueyue ^a   Nie, Yu ^a  

^a University of California   (United States)

Author keywords

Dynamic programming; Reliability; Shortest path problem; Stochastic networks; Successive approximation

Indexed keywords

CONVERGENCE PROPERTIES; MAXIMUM RELIABILITY; PERFORMANCE CRITERION; SCIENCE AND ENGINEERING; SHORTEST PATH PROBLEM; STOCHASTIC NETWORKS; SUCCESSIVE APPROXIMATIONS; TRAVEL TIME RELIABILITY;

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; OPTIMIZATION;

RELIABILITY;

EID: 33748131797     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-006-9287-6     Document Type: Article

References (24)

1. Bellman RE (1958) On a routing problem. Q Appl Math 16:87-90
2. Bellman RE, Dreyfus S (1962) Applied dynamic programming. Princeton University Press, New Jersey
3. Bellman R, Kalaba R (1965) Dynamic programming and modern control theory. McGraw-Hill, New York
4. Bertsekas DP, Tsitsiklis JN (1996) Neuro-dynamic programming. Athena Scientific, Belmont, Massachusetts
5. Dean BC (2004) Algorithms for minimum-cost path in time-dependent networks with waiting policies. Networks 44:41-46
6. Dijkstra EW (1959) A note on two problems on connexion with graphs. Numer Math 1:269-271
7. Dreyfus SE (1969) An appraisal of some shortest-path algorithms. Oper Res 17:395-412
8. Eiger A, Mirchandani P, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transp Sci 19:75-84
9. Fan YY (2003) Optimal routing through stochastic networks. Dissertation, University of Southern California
10. Fan YY, Kalaba RE, Moore JE (2005a) Shortest paths in stochastic networks with correlated link costs. Comput Math Appl 49:1549-1564
11. Fan YY, Kalaba RE, Moore JE (2005b) Arriving on time. J Optim Theory Appl 127:497-513
12. Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17:583-599
13. Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transp Sci 20:182-188
14. Howard R (1960) Dynamic Programming and Markov Processes. Technology Press of MIT and John Wiley & Sons, Inc., New York
15. Loui P (1983) Optimal paths in graphs with stochastic or multidimentional weights. Commun ACM 26:670-676
16. Maher M, Zhang YL (2000) Route choice to maximize the probability of arrival within a specified time. In: Bell MGH, Cassir C (eds.) Reliability of transport networks. Research Studies Press
17. Mikhlin SG, Smolitskiy KL (1967) Approximate methods for solution of differential and integral equations. Elsevier, New York
18. Miller-Hooks ED, Mahmassani HS (2002) Least expected time paths in stochastic, time-varying transportation networks. Transp Sci 34:198-215
19. Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3:347-355
20. Murthy I, Sarkar S (1998) Stochastic shortest path problems with piecewise linear concave utility functions. Manage Sci 44:125-136
21. Ohtsubo Y (2003) Minimizing risk models in stochastic shortest path problems. Math Methods Oper Res 57:79-88
22. Sigal CE, Pritsker AAB, Solberg JJ (1980) The stochastic shortest route problem. Oper Res 28:1122-1129
23. Waller ST, Ziliaskopoulos AK (2002) On the online shortest path problem with limited arc cost dependencies. Networks 40:216-227
24. White DJ (1993) Minimizing a threshold probability in discounted Markov decision processes. J Math Anal Appl 173:634-646