On the Online Shortest Path Problem with Limited Arc Cost Dependencies

Networks

Volumn 40, Issue 4, 2002, Pages 216-227

  Waller, S Travis ^a   Ziliaskopoulos, Athanasios K ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Northwestern University   (United States)

Author keywords

Online algorithms; Shortest paths; Stochastic optimization

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS;

STOCHASTIC OPTIMIZATION;

RANDOM PROCESSES;

EID: 0141541629     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10049     Document Type: Article

References (7)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice-Hall, Upper Saddle River, NJ, 1993.
2. G. Andreatta and L. Romeo, Stochastic shortest paths with recourse, Networks 18 (1988), 193-204.
3. J.S. Croucher, A note on the stochastic shortest route problem, Nav Res Log Q 25 (1978), 729-732.
4. L. Fu and L.R. Rilett, Expected shortest paths in dynamic and stochastic traffic networks, Trans Res Part B Method 32 (1998), 499-516.
5. R. Hall, The fastest path through a network with random time-dependent travel times, Transp Sci 20 (1986), 182-188.
6. E. Miller-Hooks and H.S. Mahmassani, Least expected time paths in stochastic, time-varying transportation networks, Trans Sci 34 (2000), 198-215.
7. G.H. Polychronopoulos and J.T. Tsitsiklis, Stochastic shortest path problems with recourse, Networks 27 (1996), 133-143.