메뉴 건너뛰기




Volumn 49, Issue 9-10, 2005, Pages 1549-1564

Shortest paths in stochastic networks with correlated link costs

Author keywords

Adaptive feedback control; Correlated link costs; Dynamic programming; Shortest path; Stochastic networks

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; MATHEMATICAL MODELS; NEURAL NETWORKS; NONLINEAR SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

EID: 23344442680     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2004.07.028     Document Type: Article
Times cited : (109)

References (16)
  • 1
    • 0020811529 scopus 로고
    • Optimal paths in graphs with stochastic or multidimensional weights
    • P. Loui Optimal paths in graphs with stochastic or multidimensional weights Communications of the ACM 26 1983 670 676
    • (1983) Communications of the ACM , vol.26 , pp. 670-676
    • Loui, P.1
  • 2
    • 0022010935 scopus 로고
    • Path preferences and optimal paths in probabilistic networks
    • A. Eiger, P. Mirchandani, and H. Soroush Path preferences and optimal paths in probabilistic networks Transportation Science 19 1 1985 75 84
    • (1985) Transportation Science , vol.19 , Issue.1 , pp. 75-84
    • Eiger, A.1    Mirchandani, P.2    Soroush, H.3
  • 3
    • 0030217072 scopus 로고    scopus 로고
    • A relaxation-based pruning technique for a class of stochastic shortest path problems
    • I. Murthy, and S. Sarkar 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
  • 4
    • 0032207880 scopus 로고    scopus 로고
    • Stochastic shortest path problems with piecewise linear concave utility functions
    • I. Murthy, and S. Sarkar Stochastic shortest path problems with piecewise linear concave utility functions Management Science 44 11 1998 125 136
    • (1998) Management Science , vol.44 , Issue.11 , pp. 125-136
    • Murthy, I.1    Sarkar, S.2
  • 5
    • 0002610737 scopus 로고
    • On a routing problem
    • R.E. Bellman On a routing problem Quart. Appl. Math 16 1958 87 90
    • (1958) Quart. Appl. Math , vol.16 , pp. 87-90
    • Bellman, R.E.1
  • 6
    • 34147120474 scopus 로고
    • A note on two problems on connexion with graphs
    • E.W. Dijkstra A note on two problems on connexion with graphs Numer. Math 1 1959 269 271
    • (1959) Numer. Math , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 7
    • 0000418612 scopus 로고
    • An appraisal of some shortest-path algorithm
    • S.E. Dreyfus An appraisal of some shortest-path algorithm Operations Research 17 1969 395 412
    • (1969) Operations Research , vol.17 , pp. 395-412
    • Dreyfus, S.E.1
  • 8
    • 0002607217 scopus 로고
    • Fastest paths in time-dependent networks for intelligent vehicle highway systems application
    • D.E. Kaufman Fastest paths in time-dependent networks for intelligent vehicle highway systems application IVHS Journal 1 1 1993 1 11
    • (1993) IVHS Journal , vol.1 , Issue.1 , pp. 1-11
    • Kaufman, D.E.1
  • 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
    • Part B L. Fu, and L.R. Rilett Expected shortest paths in dynamic and stochastic traffic networks Transportation Research 32 7 1998 499 516
    • (1998) Transportation Research , vol.32 , Issue.7 , pp. 499-516
    • Fu, L.1    Rilett, L.R.2
  • 11
    • 0035451785 scopus 로고    scopus 로고
    • An adaptive routing algorithm for in-vehicle route guidance systems with real-time information
    • Part B L. Fu An adaptive routing algorithm for in-vehicle route guidance systems with real-time information Transportation Research 35 2001 749 765
    • (2001) Transportation Research , vol.35 , pp. 749-765
    • Fu, L.1
  • 12
    • 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 2000 198 215
    • (2000) Transportation Science , vol.34 , pp. 198-215
    • Miller-Hooks, E.1    Mahmassani, H.S.2
  • 13
    • 0042021410 scopus 로고
    • On the inverse shortest path problem
    • Facultes University of Note-Dame De La Paix De Namur Berlin
    • D. Burton On the inverse shortest path problem Ph.D. Dissertation 1993 Facultes University of Note-Dame De La Paix De Namur Berlin
    • (1993) Ph.D. Dissertation
    • Burton, D.1
  • 14
    • 0141541629 scopus 로고    scopus 로고
    • On the online shortest path problem with limited arc cost dependencies
    • S.T. Waller, and A.K. Ziliaskopoulos On the online shortest path problem with limited arc cost dependencies Networks 40 4 2002 216 227
    • (2002) Networks , vol.40 , Issue.4 , pp. 216-227
    • Waller, S.T.1    Ziliaskopoulos, A.K.2
  • 15
    • 0028766968 scopus 로고
    • On the use of an inverse shortest paths problem for recovering linearly correlated cost
    • D. Burton On the use of an inverse shortest paths problem for recovering linearly correlated cost Mathematical Programming 63 1994 1 22
    • (1994) Mathematical Programming , vol.63 , pp. 1-22
    • Burton, D.1


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