메뉴 건너뛰기




Volumn 40, Issue 12, 2013, Pages 2852-2863

Dynamic shortest path problems: Hybrid routing policies considering network disruptions

Author keywords

Disruption handling; Dynamic programming; Dynamic shortest path problem; Offline routing; Online routing; Transportation

Indexed keywords

DISRUPTION HANDLING; DYNAMIC SHORTEST PATH; NETWORK DISRUPTIONS; OFFLINE; ONLINE ROUTING; TRAFFIC NETWORKS; TRANSITION PROBABILITIES; TRANSPORTATION COST;

EID: 84880395368     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.06.014     Document Type: Article
Times cited : (31)

References (24)
  • 1
    • 84880337845 scopus 로고    scopus 로고
    • Inrix. Traffic Scorecard; 2012. URL.
    • Inrix. Traffic Scorecard; 2012. URL: http://scorecard.inrix.com/ scorecard/.
  • 2
    • 84880365889 scopus 로고    scopus 로고
    • TomTom. Route Planner; 2012
    • TomTom. Route Planner; 2012. URL: http://www.routes.tomtom.com.
  • 3
    • 56549114060 scopus 로고    scopus 로고
    • A new model for path planning with interval data
    • X. Chen, J. Hu, and X. Hu A new model for path planning with interval data Computers and Operations Research 36 2009 1893 1899
    • (2009) Computers and Operations Research , vol.36 , pp. 1893-1899
    • Chen, X.1    Hu, J.2    Hu, X.3
  • 5
    • 0034179187 scopus 로고    scopus 로고
    • Robust path choice in networks with failures
    • M.C. Ferris, and A. Ruszczynski Robust path choice in networks with failures Networks 35 2000 200 218
    • (2000) Networks , vol.35 , pp. 200-218
    • Ferris, M.C.1    Ruszczynski, A.2
  • 7
    • 0035451785 scopus 로고    scopus 로고
    • An adaptive routing algorithm for in-vehicle route guidance systems with real-time information
    • DOI 10.1016/S0191-2615(00)00019-9, PII S0191261500000199
    • L. Fu An adaptive routing algorithm for in-vehicle route guidance systems with real-time information Transportation Research Part B: Methodological 35 8 2001 749 765 (Pubitemid 32770728)
    • (2001) Transportation Research Part B: Methodological , vol.35 , Issue.8 , pp. 749-765
    • Fu, L.1
  • 8
    • 0011991248 scopus 로고    scopus 로고
    • Stochastic shortest path problems with recourse
    • G.H. Polychronopoulos, and J.N. Tsitsiklis Stochastic shortest path problems with recourse Networks 27 2 1996 133 143 (Pubitemid 126326948)
    • (1996) Networks , vol.27 , Issue.2 , pp. 133-143
    • Polychronopoulos, G.H.1    Tsitsiklis, J.N.2
  • 9
    • 0022769799 scopus 로고
    • The fastest path through a network with random time-dependent travel times
    • R.W. Hall The fastest path through a network with random time-dependent travel times Transportation Science 20 3 1986 182 188
    • (1986) Transportation Science , vol.20 , Issue.3 , pp. 182-188
    • Hall, R.W.1
  • 10
    • 0032157717 scopus 로고    scopus 로고
    • Expected shortest paths in dynamic and stochastic traffic networks
    • PII S0191261598000162
    • L. Fu, and L.R. Rilett Expected shortest paths in dynamic and stochastic traffic networks Transportation Research Part B: Methodological 32 7 1998 499 516 (Pubitemid 128407016)
    • (1998) Transportation Research Part B: Methodological , vol.32 , Issue.7 , pp. 499-516
    • Fu, L.1    Rilett, L.R.2
  • 11
    • 0034187603 scopus 로고    scopus 로고
    • Least expected time paths in stochastic, time-varying transportation networks
    • E. Miller-Hooks, and H.S. Mahmassani Least expected time paths in stochastic, time-varying transportation networks Transportation Science 34 2 2000 198 215
    • (2000) Transportation Science , vol.34 , Issue.2 , pp. 198-215
    • Miller-Hooks, E.1    Mahmassani, H.S.2
  • 12
    • 0141541629 scopus 로고    scopus 로고
    • On the Online Shortest Path Problem with Limited Arc Cost Dependencies
    • DOI 10.1002/net.10049
    • S.T. Waller, and A.K. Ziliaskopoulos On the online shortest path problem with limited arc cost dependencies Networks 40 4 2002 216 227 (Pubitemid 37218333)
    • (2002) Networks , vol.40 , Issue.4 , pp. 216-227
    • Waller, S.T.1    Ziliaskopoulos, A.K.2
  • 13
    • 25144471578 scopus 로고    scopus 로고
    • Optimal routing policy problems in stochastic time-dependent networks
    • DOI 10.1016/j.trb.2005.02.001, PII S0191261505000391
    • S. Gao, and I. Chabini Optimal routing policy problems in stochastic time-dependent networks Transportation Research Part B: Methodological 40 2 2006 93 122 (Pubitemid 41350088)
    • (2006) Transportation Research Part B: Methodological , vol.40 , Issue.2 , pp. 93-122
    • Gao, S.1    Chabini, I.2
  • 14
    • 21644443677 scopus 로고    scopus 로고
    • State space reduction for nonstationary stochastic shortest path problems with real-time traffic information
    • DOI 10.1109/TITS.2005.853695
    • S. Kim, M.E. Lewis, and C.C.I. White State space reduction for nonstationary stochastic shortest path problems with real-time traffic information IEEE Transactions on Intelligent Transportation Systems 6 2005 273 284 (Pubitemid 41634331)
    • (2005) IEEE Transactions on Intelligent Transportation Systems , vol.6 , Issue.3 , pp. 273-284
    • Kim, S.1    Lewis, M.E.2    White, C.C.3
  • 15
    • 33749544788 scopus 로고    scopus 로고
    • The dynamic shortest path problem with anticipation
    • DOI 10.1016/j.ejor.2005.09.019, PII S0377221705007228
    • B. Thomas, and C.C.I. White The dynamic shortest path problem with anticipation European Journal of Operational Research 176 2 2007 836 854 (Pubitemid 44537625)
    • (2007) European Journal of Operational Research , vol.176 , Issue.2 , pp. 836-854
    • Thomas, B.W.1    White III, C.C.2
  • 17
    • 79958091470 scopus 로고    scopus 로고
    • Dynamic routing under recurrent and non-recurrent congestion using real-time its information
    • A.R. Güner, A. Murat, and R.B. Chinnam Dynamic routing under recurrent and non-recurrent congestion using real-time its information Computers and Operations Research 39 2 2012 358 373
    • (2012) Computers and Operations Research , vol.39 , Issue.2 , pp. 358-373
    • Güner, A.R.1    Murat, A.2    Chinnam, R.B.3
  • 18
    • 82055185566 scopus 로고    scopus 로고
    • Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks
    • H. Huang, and S. Gao Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks Transportation Research Part C: Emerging Technologies 21 1 2012 196 213
    • (2012) Transportation Research Part C: Emerging Technologies , vol.21 , Issue.1 , pp. 196-213
    • Huang, H.1    Gao, S.2
  • 21
    • 0141628999 scopus 로고
    • Statistical decision functions which minimize the maximum risk
    • A. Wald Statistical decision functions which minimize the maximum risk The Annals of Mathematics 46 2 1945 265 280
    • (1945) The Annals of Mathematics , vol.46 , Issue.2 , pp. 265-280
    • Wald, A.1
  • 23
    • 84922100465 scopus 로고    scopus 로고
    • Car drivers valuations of travel time variability, unexpected delays and queue driving
    • Eliasson J. Car drivers valuations of travel time variability, unexpected delays and queue driving. In: European transport conference; 2004.
    • (2004) European Transport Conference
    • Eliasson, J.1


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