Expected shortest paths in dynamic and stochastic traffic networks

Transportation Research Part B: Methodological

Volumn 32, Issue 7, 1998, Pages 499-516

  Fu, Liping ^a   Rilett, L R ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Dynamic and stochastic network; Intelligent Transportation Systems; k shortest path problem; Route Guidance Systems; Shortest path problem; Traffic network

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOTOR TRANSPORTATION; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; TRANSPORTATION ROUTES;

INTELLIGENT TRANSPORTATION SYSTEMS; ROUTE GUIDANCE SYSTEMS; SHORTEST PATH PROBLEM;

INTELLIGENT VEHICLE HIGHWAY SYSTEMS;

EID: 0032157717     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(98)00016-2     Document Type: Article

References (21)

1. Bellman, E. (1958) On a routing problem. Quarterly of Applied Mathematics 16, 87-90.
2. Chabini, I. (1997) A new algorithm for shortest paths in discrete dynamic networks. Proceeding of the 8th International Federation of Automatic Control (IFAC) Symposium on Transportation Systems, Vol. 2, eds M. Papageorgiu and A. Pouliezos, pp. 551-556. Chania, Greece.
3. Denardo, E. (1982) Dynamic Programming: Models and Applications. Prentice-Hall, Inc, NJ.
4. Dijkstra, E. W. (1959) A note on two problems in connection with graphs. Numerical Mathematics 1, 269-271.
5. Dreyfus, S. (1969) An appraisal of some shortest path algorithms. Operations Research 17, 395-412.
6. Frank, H. (1969) Shortest paths in probability graphs. Operations Research 17, 583-599.
7. Fu, L. (1996) Vehicle routing and scheduling in dynamic and stochastic traffic networks. Ph.D. dissertation, University of Alberta, Edmonton, Alberta.
8. Gary, R. M. and Johson, D. S. (1979) Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, St. Francisco.
9. Hall, R. (1986) The fastest path through a network with random time-dependent travel time. Transportation Science 20(3), 182-188.
10. Kaufman, E., Lee, J. and Smith, R. L. (1990) Anticipatory Traffic Modeling and Route Guidance in Intelligent Vehicle-Highway Systems. IVHS Technical Report-90-2, University of Michigan.
11. Kaufman, E., Lee, J. and Smith, R. L. (1993) Fastest paths in time-dependent networks for intelligent vehicle highway systems application. IVHS Journal 1(1), 1-11.
12. Loui, P. (1983) Optimal paths in graphs with stochastic or multidimensional weights. Comm. ACM 26, 670-676.
13. Mirchandani, B. P. and Soroush, H. (1986) Routes and flows in stochastic networks. Advanced Schools on Stochastic in Combinatorial Optimization, eds G. Angrealtta, F. Mason and P. Serafini, pp. 129-177, CISM. Udine, Italy.
14. Mirchandani, B. P. (1976) Shortest distance and reliability of probabilistic networks. Computer and Operations Research 3, 347-676.
15. Murthy, I. and Sarkar, S. (1996) A relaxation-based pruning technique for a class of stochastic shortest path problems. Transportation Science 30(3), 220-236.
16. Orda, A. and Rom, R. (1990) Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM 37, 607-625.
17. Rilett, L. R. (1992) Modeling of TravTek's Dynamic Route Guidance Logic Using the Integration Model. Ph.D. dissertation, Queen's University, Kingston, Ontario.
18. Ross, M. S. (1989) Introduction to Probability Models, 3 edn. Academic Press Inc. San Diego, CA.
19. Shier, D. (1979) On algorithms for finding the k shortest paths in a network. Networks 9, 195-214.
20. Turner, Shawn M., Brydia Robert E., Liu Jyh C. and Eisele William L. (1997) ITS Data Management System: Year One Activities, Report No. FHWA/TX-98/1752-2. Texas Department of Transportation, Texas Transportation Institute, September, 1997.
21. Ziliaskopoulos, A. K. and Mahassani, H. S. (1993) Time-dependent, shortest-path algorithm for real-time intelligent vehicle system applications. Transportation Research Record 1408, TRB, National Research Council, Washington, DC., pp. 94-100.