A tractable class of algorithms for reliable routing in stochastic networks

Procedia - Social and Behavioral Sciences

Volumn 17, Issue , 2011, Pages 341-363

  Samaranayake, S ^a   Blandina, 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

EID: 79960101957     PISSN: 18770428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.sbspro.2011.04.521     Document Type: Conference Paper

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., 1982. Closure of phase type distributions under operations arising in reliability theory. The Annals of Probability 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., 2001. Viability Theory. Springer.
5. Bellman, R., Kalaba, R., 1966. Numerical Inversion of the Laplace Transform. American Elsevier Publishing Company.
6. Bertsekas, D., 2005. Dynamic Programming and Optimal Control. Athena Scientific.
7. Bertsekas, D., Tsitsiklis, J., 1996. Neuro-dynamic Programming. Athena Scientific.
8. Block, H., Savits, T., 1976. The ifra closure problem. The Annals of Probability 4 (6), 1030-1032.
9. Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C., 2001. Introduction to Algorithms. The MIT Press.
10. Dean, B., 2004. Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44, 41-46. (Pubitemid 39055268)
11. Dijkstra, E., 1959. A note on two problems on connection with graphs. Numerishe Mathematik 1, 269-271.
12. Dreyfus, S., 1969. An appraisal of some shortest-path algorithms. Operations Research 17, 395-412.
13. Fan, Y., Kalaba, R., Moore, J., 2005. Arriving on time. Journal of Optimization Theory and Applications 127 (3), 497-513. (Pubitemid 41806937)
14. Fan, Y., Nie, Y., 2006. Optimal routing for maximizing travel time reliability. Networks and Spatial Economics 3 (6), 333-344. (Pubitemid 44314624)
15. Frank, H., 1969. Shortest paths in probabilistic graphs. Operations Research 17, 583-599.
16. Fu, L., Rilett, L., 1998. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B 32 (7), 499-516. (Pubitemid 128407016)
17. Geisberger, R., Sanders, P., Schultes, D., Delling, D., 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Springer, pp. 319-333.
18. Goldberg, A. V., Kaplan, H., Werneck, R., 2007. Better landmarks within reach. In: Workshop on Experimental Algorithms (WEA), Rome, Italy.
19. Hall, R., 1986. The fastest path through a network with random time-dependent travel times. Transportation Science 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., 1983. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM. 26 (9), 670-676. (Pubitemid 14466773)
23. Miller-Hooks, E., Mahmassani, H., 2000. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 34 (2), 198-215.
24. Nie, Y., Fan, Y., 2006. Arriving-on-time problem. Transportation Research Record, 193-200.
25. Orda, A., Rom, R., 1990. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM 37 (3), 607-625. (Pubitemid 20723071)
26. Sedgewick, R., 1990. Algorithms in C. Addison Wesley Publishing Company.
27. Mobile Millennium, 2008. http://traffic.berkeley.edu.
28. Waller, S., Ziliaskopoulos, A., 2002. On the online shortest path problem with limited arc cost dependencies. Networks 40 (4), 216-227. (Pubitemid 37218333)
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., 2010. A traffic model for velocity data assimilation. AMRX Applied Mathematics Research eXpress 1, 1-35.