메뉴 건너뛰기




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

Robust path choice in networks with failures

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
Times cited : (13)

References (22)
  • 2
    • 0024069648 scopus 로고
    • Stochastic shortest paths with recourse
    • [2] G. Andreatta and L. Romeo, Stochastic shortest paths with recourse, Networks 18 (1988), 193-204.
    • (1988) Networks , vol.18 , pp. 193-204
    • Andreatta, G.1    Romeo, L.2
  • 3
    • 0001539380 scopus 로고
    • Does providing information to drivers reduce traffic congestion?
    • [3] R. Arnott, A. de Palma, and R. Lindsey, Does providing information to drivers reduce traffic congestion? Trans Res A 25 (1991), 309-318.
    • (1991) Trans Res A , vol.25 , pp. 309-318
    • Arnott, R.1    De Palma, A.2    Lindsey, R.3
  • 4
    • 0000099850 scopus 로고
    • Dynamic network models and driver information systems
    • [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.
    • (1992) Trans Res A , vol.25 , pp. 251-266
    • Ben-Akiva, M.E.1    De Palma, A.2    Kaysi, I.3
  • 6
    • 0003161907 scopus 로고
    • An analysis of stochastic shortest path problems
    • [6] D.P. Bertsekas and J.N. Tsitsiklis, An analysis of stochastic shortest path problems, Math Oper Res 16 (1991). 580-595.
    • (1991) Math Oper Res , vol.16 , pp. 580-595
    • Bertsekas, D.P.1    Tsitsiklis, J.N.2
  • 7
    • 34250513249 scopus 로고
    • Über ein paradoxon aus der verkehrsplanung
    • [7] D. Braess, Über ein Paradoxon aus der Verkehrsplanung, Unternehmensforschung 12 (1968), 258-268.
    • (1968) Unternehmensforschung , vol.12 , pp. 258-268
    • Braess, D.1
  • 10
    • 27844494376 scopus 로고    scopus 로고
    • Traffic modeling and variational inequalities using GAMS
    • Ph.L. Toint, M. Labbe, K. Tanczos, and G. Laporte (Editors), NATO ASI Series F, Springer-Verlag, Berlin
    • [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.
    • (1997) Operations Research and Decision Aid Methodologies in Traffic and Transportation Management
    • Dirkse, S.P.1    Ferris, M.C.2
  • 11
    • 0028549244 scopus 로고
    • Day-to-day dynamic network disequilibria and idealized traveller information systems
    • [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.
    • (1994) Oper Res , vol.42 , pp. 1120-1136
    • Friesz, T.L.1    Bernstein, D.2    Mehta, N.J.3    Tobin, R.L.4    Ganjalizadeh, S.5
  • 12
    • 85037804832 scopus 로고    scopus 로고
    • Dynamic network flow with uncertain arc capacities: Formulation and problem structure
    • School of Industrial and Systems Engineering, Georgia Institute of Technology, June
    • [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.
    • (1996) Report LEC-96-08
    • Glockner, G.D.1    Nemhauser, G.L.2
  • 14
    • 0000490803 scopus 로고
    • Braess' paradox of traffic flow
    • [14] J.D. Murchland, Braess' paradox of traffic flow, Trans Res 4 (1970), 391-394.
    • (1970) Trans Res , vol.4 , pp. 391-394
    • Murchland, J.D.1
  • 16
    • 0011991248 scopus 로고    scopus 로고
    • Stochastic shortest path problems with recourse
    • [16] G.H. Polychronopoulos and J.N. Tsitsiklis, Stochastic shortest path problems with recourse, Networks 27 (1996), 133-143.
    • (1996) Networks , vol.27 , pp. 133-143
    • Polychronopoulos, G.H.1    Tsitsiklis, J.N.2
  • 17
    • 77957806193 scopus 로고
    • Stochastic and dynamic networks and routing
    • M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam
    • [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.
    • (1995) Network Routing , pp. 141-295
    • Powell, W.B.1    Jaillet, P.2    Odoni, A.3
  • 19
    • 0000365133 scopus 로고    scopus 로고
    • Decomposition methods in stochastic programming
    • [19] A. Ruszczyński, Decomposition methods in stochastic programming, Math Program 79 (1997), 333-353.
    • (1997) Math Program , vol.79 , pp. 333-353
    • Ruszczyński, A.1
  • 21
    • 0000974429 scopus 로고
    • The modelling of dynamic route guidance systems
    • [21] D.P. Watling and T. van Vuren, The modelling of dynamic route guidance systems, Trans Res Part C 1 (1993), 159-182.
    • (1993) Trans Res Part C , vol.1 , pp. 159-182
    • Watling, D.P.1    Van Vuren, T.2
  • 22
    • 0002975395 scopus 로고
    • Large scale linear programming techniques in stochastic programming
    • Yu.M. Ermoliev and R.J.-B. Wets (Editors), Springer-Verlag, Berlin
    • [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.
    • (1988) Numerical Techniques for Stochastic Optimization , pp. 65-93
    • Wets, R.J.-B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.