A tractable class of algorithms for reliable routing in stochastic networks

Transportation Research Part C: Emerging Technologies

Volumn 20, Issue 1, 2012, Pages 199-217

  Samaranayake, S ^a   Blandin, S ^a   Bayen, A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adaptive routing; Dynamic programming; Real time algorithms; Stochastic routing; Traffic information systems

Indexed keywords

ADAPTIVE ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; OPTIMAL SYSTEMS; ROUTING ALGORITHMS; STOCHASTIC SYSTEMS; TRAFFIC CONTROL; TRAVEL TIME;

ADAPTIVE OPTIMAL STRATEGY; ADAPTIVE ROUTING; MOBILE PHONE APPLICATIONS; REAL TIME ALGORITHMS; SPATIOTEMPORAL CORRELATION; STOCHASTIC ROUTING; TRAFFIC INFORMATION SYSTEMS; TRAVEL TIME VARIABILITIES;

REAL TIME SYSTEMS;

ALGORITHM; MOBILE COMMUNICATION; PROBABILITY; STOCHASTICITY; TRAFFIC MANAGEMENT; TRANSPORTATION SYSTEM; TRAVEL TIME;

CALIFORNIA; UNITED STATES;

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

References (30)

1. Abraham, I., Fiat, A., Goldberg, A., Werneck, R., 2010. Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA10). Society for Industrial and Applied Mathematics.
2. Assaf D., Levikson B. Closure of phase type distributions under operations arising in reliability theory. The Annals of Probability 1982, 10(1):265-269.
3. Astarita, V., 1996. A continuous time link model for dynamic network loading based on travel time function. In: 13th International Symposium on Transportation and Traffic Theory, Lyon, France, pp. 79-102.
4. Aubin J. Viability Theory 2001, Springer.
5. Bellman R., Kalaba R. Numerical Inversion of the Laplace Transform 1966, American Elsevier Publishing Company.
6. Bertsekas D. Dynamic Programming and Optimal Control 2005, Athena Scientific.
7. Bertsekas D., Tsitsiklis J. Neuro-dynamic Programming 1996, Athena Scientific.
8. Block H., Savits T. The IFRA closure problem. The Annals of Probability 1976, 4(6):1030-1032.
9. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms 2001, The MIT Press.
10. Dean B. Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 2004, 44:41-46.
11. Dijkstra E. A note on two problems on connection with graphs. Numerishe Mathematik 1959, 1:269-271.
12. Dreyfus S. An appraisal of some shortest-path algorithms. Operations Research 1969, 17:395-412.
13. Fan Y., Nie Y. Optimal routing for maximizing travel time reliability. Networks and Spatial Economics 2006, 3(6):333-344.
14. Fan Y., Kalaba R., Moore J. Arriving on time. Journal of Optimization Theory and Applications 2005, 127(3):497-513.
15. Frank H. Shortest paths in probabilistic graphs. Operations Research 1969, 17:583-599.
16. Fu L., Rilett L. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B 1998, 32(7):499-516.
17. Geisberger R., Sanders P., Schultes D., Delling D. Contraction hierarchies: faster and simpler hierarchical routing in road networks. Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08) 2008, 319-333. Springer.
18. Goldberg, A.V., Kaplan, H., Werneck, R., 2007. Better landmarks within reach. In: Workshop on Experimental Algorithms (WEA), Rome, Italy.
19. Hall R. The fastest path through a network with random time-dependent travel times. Transportation Science 1986, 20(3):182.
20. Herring, R., Hofleitner, A., Bayen, A., 2010. Estimating arterial traffic conditions using sparse probe data. In: 13th International Conference on Intelligent Transportation Systems, Madeira Island, Portugal.
21. L'Ecuyer, P., 2008. Stochastic simulation in Java. <>. http://www.iro.umontreal.ca/simardr/ssj/indexe.html.
22. Loui R. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 1983, 26(9):670-676.
23. Mobile Millennium, 2008. <>. http://traffic.berkeley.edu.
24. Miller-Hooks E., Mahmassani H. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 2000, 34(2):198-215.
25. Nie Y., Fan Y. Arriving-on-time problem. Transportation Research Record 2006, 193-200.
26. Orda A., Rom R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM 1990, 37(3):607-625.
27. Sedgewick R. Algorithms in C 1990, Addison Wesley Publishing Company.
28. Waller S., Ziliaskopoulos A. On the online shortest path problem with limited arc cost dependencies. Networks 2002, 40(4):216-227.
29. Wendykier, P., 2009. Jtransforms. <>. http://sites.google.com/site/piotrwendykier/software/jtransforms.
30. Work D., Blandin S., Tossavainen O.-P., Piccoli B., Bayen A. A traffic model for velocity data assimilation. AMRX - Applied Mathematics Research eXpress 2010, 1:1-35.