메뉴 건너뛰기




Volumn 11, Issue 5, 2003, Pages 331-354

Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty

Author keywords

Advanced traveler information system; Dynamic and stochastic network; Route guidance system; Shortest path problem; Travel time estimation and forecasting; Travel time uncertainty

Indexed keywords

COSTS; MATHEMATICAL MODELS; RANDOM PROCESSES; TIME MEASUREMENT;

EID: 0141613930     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0968-090X(03)00029-9     Document Type: Article
Times cited : (63)

References (22)
  • 2
    • 33747425039 scopus 로고    scopus 로고
    • A statistical comparison of travel time estimates obtained from intelligent transportation systems and instrumented test vehicles
    • Washington, DC, January 2002
    • Eisele, W., Rilett, L.R., 2002. A statistical comparison of travel time estimates obtained from intelligent transportation systems and instrumented test vehicles. Presented at the 81st Annual Meeting of Transportation Research Board, Washington, DC, January 2002
    • (2002) 81st Annual Meeting of Transportation Research Board
    • Eisele, W.1    Rilett, L.R.2
  • 3
    • 0032157717 scopus 로고    scopus 로고
    • Expected shortest paths in dynamic and stochastic traffic networks
    • Fu L. Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks Transportation Research B 32 7 1998 499-516
    • (1998) Transportation Research B , vol.32 , Issue.7 , pp. 499-516
    • Fu, L.1    Rilett, L.R.2
  • 4
    • 0022769799 scopus 로고
    • The fastest path through a network with random time-dependent travel time
    • Hall R. The fastest path through a network with random time-dependent travel time Transportation Science 20 3 1986 182-188
    • (1986) Transportation Science , vol.20 , Issue.3 , pp. 182-188
    • Hall, R.1
  • 5
    • 0141836482 scopus 로고    scopus 로고
    • Comparative assessment of AVI tag matching algorithms for estimating vehicle travel times
    • Washington, DC, January 2001
    • Hellinga, B., 2001. Comparative assessment of AVI tag matching algorithms for estimating vehicle travel times. Presented at the 80th Annual Meeting of the Transportation Research Board, Washington, DC, January 2001
    • (2001) 80th Annual Meeting of the Transportation Research Board
    • Hellinga, B.1
  • 6
    • 0020811529 scopus 로고
    • Optimal paths in graphs with stochastic or multidimensional weights
    • Loui P. Optimal paths in graphs with stochastic or multidimensional weights Communications of ACM 26 1983 670-676
    • (1983) Communications of ACM , vol.26 , pp. 670-676
    • Loui, P.1
  • 7
    • 0032358743 scopus 로고    scopus 로고
    • Least possible time paths in stochastic, time-varying transportation networks
    • Miller-Hooks E.D. Mahmassani H.S. Least possible time paths in stochastic, time-varying transportation networks Computer and Operations Research 25 12 1998 1107-1125
    • (1998) Computer and Operations Research , vol.25 , Issue.12 , pp. 1107-1125
    • Miller-Hooks, E.D.1    Mahmassani, H.S.2
  • 8
    • 0034187603 scopus 로고    scopus 로고
    • Least expected time paths in stochastic, time-varying transportation networks
    • Miller-Hooks E.D. Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks Transportation Science 34 2000 198-215
    • (2000) Transportation Science , vol.34 , pp. 198-215
    • Miller-Hooks, E.D.1    Mahmassani, H.S.2
  • 9
    • 0001008059 scopus 로고
    • Shortest distance and reliability of probabilistic networks
    • Mirchandani P.B. Shortest distance and reliability of probabilistic networks Computer - Operations Research 3 1976 347-355
    • (1976) Computer - Operations Research , vol.3 , pp. 347-355
    • Mirchandani, P.B.1
  • 10
    • 0030217072 scopus 로고    scopus 로고
    • A relaxation-based pruning technique for a class of stochastic shortest path problems
    • Murthy I. Sarkar S. A relaxation-based pruning technique for a class of stochastic shortest path problems Transportation Science 30 3 1996 220-236
    • (1996) Transportation Science , vol.30 , Issue.3 , pp. 220-236
    • Murthy, I.1    Sarkar, S.2
  • 12
    • 0032155636 scopus 로고    scopus 로고
    • Forecasting multiple-period freeway link travel time using modular neural networks
    • Park D. Rilett L.R. Forecasting multiple-period freeway link travel time using modular neural networks Transportation Research Record 1617 1998 163-170
    • (1998) Transportation Research Record , vol.1617 , pp. 163-170
    • Park, D.1    Rilett, L.R.2
  • 13
    • 0032623401 scopus 로고    scopus 로고
    • Forecasting freeway link travel times with a multilayer feedforward neural network
    • Park D. Rilett L.R. Forecasting freeway link travel times with a multilayer feedforward neural network Computer-Aided Civil and Infrastructure Engineering 14 1999 357-367
    • (1999) Computer-Aided Civil and Infrastructure Engineering , vol.14 , pp. 357-367
    • Park, D.1    Rilett, L.R.2
  • 14
    • 0032779078 scopus 로고    scopus 로고
    • Spectral basis neural networks for real-time travel time forecasting
    • Park D. Rilett L.R. Han G. Spectral basis neural networks for real-time travel time forecasting ASCE Journal of Transportation Engineering 125 6 1999 515-523
    • (1999) ASCE Journal of Transportation Engineering , vol.125 , Issue.6 , pp. 515-523
    • Park, D.1    Rilett, L.R.2    Han, G.3
  • 15
    • 0141725157 scopus 로고    scopus 로고
    • Estimating travel time summary statistics of larger intervals from smaller intervals without storing individual data
    • Washington, DC, January 2002
    • Park, D., Rilett, L.R., Pattanamekar, P., 2002. Estimating travel time summary statistics of larger intervals from smaller intervals without storing individual data. Presented at the 81st Annual Meeting of Transportation Research Board, Washington, DC, January 2002
    • (2002) 81st Annual Meeting of Transportation Research Board
    • Park, D.1    Rilett, L.R.2    Pattanamekar, P.3
  • 16
    • 0013330844 scopus 로고    scopus 로고
    • Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting
    • Park, D., Rilett, L.R., Gagewski, B., Spiegelman, C.H., in press. Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting. Transportation Research A
    • Transportation Research A
    • Park, D.1    Rilett, L.R.2    Gagewski, B.3    Spiegelman, C.H.4
  • 17
    • 0035504387 scopus 로고    scopus 로고
    • Incorporating uncertainty and multiple objectives in real-time routing selection
    • Rilett L.R. Park D. Incorporating uncertainty and multiple objectives in real-time routing selection ASCE Journal of Transportation Engineering 127 6 2001 531-539
    • (2001) ASCE Journal of Transportation Engineering , vol.127 , Issue.6 , pp. 531-539
    • Rilett, L.R.1    Park, D.2
  • 19
    • 0030287291 scopus 로고    scopus 로고
    • Determination of number of probe vehicles required for reliable travel time measurement in urban network
    • Srinivasan K.K. Jovanis P.P. Determination of number of probe vehicles required for reliable travel time measurement in urban network Transportation Research Record 1537 1996 15-22
    • (1996) Transportation Research Record , vol.1537 , pp. 15-22
    • Srinivasan, K.K.1    Jovanis, P.P.2


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