Robust path choice in networks with failures

Networks

Volumn 35, Issue 3, 2000, Pages 181-194

  Ferris, Michael C ^a   Ruszczyński, Andrzej ^b,c  

^a University of Wisconsin   (United States)

^b University of Wisconsin Madison   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Lookahead strategies; Networks with failures; Robust routing; Stochastic programming

Indexed keywords

EID: 0034179187     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(200005)35:3<181::AID-NET2>3.0.CO;2-Y     Document Type: Article

References (22)

1. [1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. [2] G. Andreatta and L. Romeo, Stochastic shortest paths with recourse, Networks 18 (1988), 193-204.
3. [3] R. Arnott, A. de Palma, and R. Lindsey, Does providing information to drivers reduce traffic congestion? Trans Res A 25 (1991), 309-318.
4. [4] M.E. Ben-Akiva, A. de Palma, and I. Kaysi, Dynamic network models and driver information systems, Trans Res A 25 (1992), 251-266.
5. [5] D.P. Bertsekas, Dynamic programming and optimal control, Athena, Belmont, MA, 1995.
6. [6] D.P. Bertsekas and J.N. Tsitsiklis, An analysis of stochastic shortest path problems, Math Oper Res 16 (1991). 580-595.
7. [7] D. Braess, Über ein Paradoxon aus der Verkehrsplanung, Unternehmensforschung 12 (1968), 258-268.
8. [8] A. Brooke, D. Kendrick, and A. Meeraus, GAMS: A User's Guide, Scientific Press, South San Francisco, CA, 1988.
9. [9] K.L. Chung, Markov chains with stationary transition probabilities, Springer-Verlag, Berlin, 1960.
10. [10] S.P. Dirkse and M.C. Ferris, "Traffic modeling and variational inequalities using GAMS," Operations research and decision aid methodologies in traffic and transportation management, Ph.L. Toint, M. Labbe, K. Tanczos, and G. Laporte (Editors), NATO ASI Series F, Springer-Verlag, Berlin, 1997.
11. [11] T.L. Friesz, D. Bernstein, N.J. Mehta, R.L. Tobin, and S. Ganjalizadeh, Day-to-day dynamic network disequilibria and idealized traveller information systems, Oper Res 42 (1994), 1120-1136.
12. [12] G.D. Glockner and G.L. Nemhauser, Dynamic network flow with uncertain arc capacities: formulation and problem structure, Report LEC-96-08, School of Industrial and Systems Engineering, Georgia Institute of Technology, June 1996.
13. [13] P. Kall and S.W. Wallace, Stochastic programming, Wiley, Chichester, 1994.
14. [14] J.D. Murchland, Braess' paradox of traffic flow, Trans Res 4 (1970), 391-394.
15. [15] M. Patriksson, The traffic assignment problem, models and methods, VSP, Utrecht, NL, 1994.
16. [16] G.H. Polychronopoulos and J.N. Tsitsiklis, Stochastic shortest path problems with recourse, Networks 27 (1996), 133-143.
17. [17] W.B. Powell, P. Jaillet, and A. Odoni, "Stochastic and dynamic networks and routing," Network routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam, 1995, pp. 141-295.
18. [18] A. Prékopa, Stochastic programming, Kluwer, Dordrecht, 1995.
19. [19] A. Ruszczyński, Decomposition methods in stochastic programming, Math Program 79 (1997), 333-353.
20. [20] Y. Sheffi, Urban transportation networks, Prentice-Hall, Englewood Cliffs, NJ, 1985.
21. [21] D.P. Watling and T. van Vuren, The modelling of dynamic route guidance systems, Trans Res Part C 1 (1993), 159-182.
22. [22] R.J.-B. Wets, "Large scale linear programming techniques in stochastic programming," Numerical techniques for stochastic optimization, Yu.M. Ermoliev and R.J.-B. Wets (Editors), Springer-Verlag, Berlin, 1988, pp. 65-93.