메뉴 건너뛰기




Volumn 26, Issue 3, 2003, Pages 323-331

K expected shortest path in stochastic and time-dependent network

Author keywords

Bus network; Communication network; Expected path; Shortest path problem; Stochastic; Time dependent network

Indexed keywords

DATA STRUCTURES; OPTIMIZATION; PROBABILITY DENSITY FUNCTION;

EID: 0037491253     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (5)

References (9)
  • 1
    • 0011991248 scopus 로고    scopus 로고
    • Stochastic shortest path problems with recourse
    • Polychronopoulos G H. Stochastic shortest path problems with recourse. Networks, 1996, 27 (2): 133-143.
    • (1996) Networks , vol.27 , Issue.2 , pp. 133-143
    • Polychronopoulos, G.H.1
  • 2
    • 0041109437 scopus 로고    scopus 로고
    • State space partitioning methods for stochastic shortest path problems
    • Alexopoulos C. State space partitioning methods for stochastic shortest path problems. Networks, 1997, 30 (1): 9-21
    • (1997) Networks , vol.30 , Issue.1 , pp. 9-21
    • Alexopoulos, C.1
  • 3
    • 84973872778 scopus 로고
    • Shortest paths in stochastic networks with ARC lengths having discrete distributions
    • Corea G A, Kulkarni V G. Shortest paths in stochastic networks with ARC lengths having discrete distributions. Network, 1993, 23(3): 175-183
    • (1993) Network , vol.23 , Issue.3 , pp. 175-183
    • Corea, G.A.1    Kulkarni, V.G.2
  • 4
    • 0022769799 scopus 로고
    • The fastest path through a network with random time-dependent travel limes
    • Hall R W. The fastest path through a network with random time-dependent travel limes. Transportation Science, 1986, 20 (3): 182-188
    • (1986) Transportation Science , vol.20 , Issue.3 , pp. 182-188
    • Hall, R.W.1
  • 6
    • 0032358743 scopus 로고
    • Least possible time paths in stochastic, time-varying Networks
    • Miller-Hooks E D, Mahmassani H S. Least possible time paths in stochastic, time-varying Networks. Computer and Operations Research, 1998, 25 (12), 1107-1125
    • (1988) Computer and Operations Research , vol.25 , Issue.12 , pp. 1107-1125
    • Miller-Hooks, E.D.1    Mahmassani, H.S.2
  • 7
    • 0036462915 scopus 로고    scopus 로고
    • Shortest path algorithm in time-dependent networks
    • Chinese source
    • Tan Guo-Zhen, Gao Wen. Shortest path algorithm in time-dependent networks. Chinese Journal of Computers, 2002, 25 (2): 165-172 (in Chinese)
    • (2002) Chinese Journal of Computers , vol.25 , Issue.2 , pp. 165-172
    • Tan, G.-Z.1    Gao, W.2


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