Least possible time paths in stochastic, time-varying networks

Computers and Operations Research

Volumn 25, Issue 12, 1998, Pages 1107-1125

  Miller Hooks, Elise D ^a,b,c,d   Mahmassani, Hani S ^c  

^a Duke University   (United States)

^b NATIONAL INSTITUTE OF ENVIRONMENTAL HEALTH SCIENCES   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d LAFAYETTE COLLEGE   (United States)

Author keywords

Shortest paths; Stochastic dynamic networks

Indexed keywords

ALGORITHMS; FUNCTIONS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; TIME VARYING NETWORKS;

STOCHASTIC DYNAMIC NETWORKS;

OPERATIONS RESEARCH;

EID: 0032358743     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00027-6     Document Type: Article

References (25)

1. Frank, H., Shortest paths in probabilistic graphs. Operations Research, 1969, 17, 583-599.
2. Kulkarni, V., Shortest paths in networks with exponentially distributed arc lengths. Networks, 1986, 16, 255-274.
3. Corea, G. and Kulkarni, V., Shortest paths in stochastic networks with arc lengths having discrete distributions. Networks, 1993, 23, 175-183.
4. Sigal, C., Pritsker, A. and Solberg, J., The stochastic shortest route problem. Operations Research, 1980, 28, 1122-1129.
5. Loui, R., Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM, 1983, 26, 670-676.
6. Eiger, A., Mirchandani, P. and Soroush, H., Path preferences and optimal paths in probabilistic networks. Transportation Science, 1985, 19, 75-84.
7. Mirchandani, P. and Soroush, H., Optimal paths in probabilistic networks: a case with temporary preferences. Computers and Operations Research, 1985, 12, 365-381.
8. Malcolm, D., Roseboom, J. and Clark, C., Application of technique for research and development program evaluation. Operations Research, 1959, 7, 646-669.
9. Charnes, A., Cooper, W. and Thompson, G., Critical path analyses via chance constrained and stochastic programming. Operations Research, 1964, 12, 460-470.
10. Van Slyke, R., Monte Carlo Methods and the PERT Problem. Rand Research Memorandum, RM-3367-PR, 1963.
11. Miller-Hooks, E. and Mahmassani, H., On the generation of nondominated paths in stochastic, time-varying networks, Proceedings of TRISTAN III (Triennial Symposium on Transportation Analysis), 1998, in press.
12. Hall, R., The fastest path through a network with random time-dependent travel times. Transportation Science, 1986, 20, 192-199.
13. Miller-Hooks, E., Optimal routing in time-varying, stochastic networks: algorithms and implementations, Ph.D. thesis, Department of Civil Engineering, University of Texas at Austin, 1997.
14. Kaufman, D. and Smith, R., Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal, 1993, 1, 1-11.
15. Ziliaskopoulos, A. and Mahmassani, H., Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transportation Research Record, 1993, 1408, 94-100.
16. Ahuja, R., Magnanti, T. and Orlin, J., Network Flows. Prentice-Hall, NJ, Chap. 5, 1993.
17. Bellman, R., On a routing problem. Quarterly Applied Mathematics, 1958, 16, 87-90.
18. Miller-Hooks, E. and Mahmassani, H., Path comparisons for a priori and time-adaptive route choice in stochastic, time-dependent networks, working paper, 1998.
19. Ziliaskopoulos, A., Design and implementation of some k shortest path algorithms with application to intelligent vehicle highway systems. Master's Report, The University of Texas at Austin, 1992.
20. Ziliaskopoulos, A., Optimum path algorithms on multidimensional networks: analysis and design, implementation and computational experience. Ph.D. thesis, Department of Civil Engineering, University of Texas at Austin, 1994.
21. Ahuja, R., Network flows. In Handbooks in Operations Research and Management Science. Vol. 1, Optimization, ed. G. Nemhauser, A. Kan and M. Todd. North-Holland, New York, 1989.
22. Glover, F., Klingman, D., Phillips, N. and Schneider, R., New polynomial shortest path algorithms and their computational attributes. Medical Science, 1985, 31, 1106-1128.
23. Pape, U., Implementation and efficiency of Moore-algorithms for the shortest route problem. Mathematical Programming, 1974, 7, 212-222.
24. Pallottino, S., Shortest-path methods: complexity, interrelations and new propositions. Networks, 1984, 14, 257-267.
25. Gallo, G. and Pallottino, S., Shortest path methods: a unifying approach. In Mathematical Programming Study 26. North-Holland, Amsterdam, 1986, 38-64.