메뉴 건너뛰기




Volumn 144, Issue 1, 2003, Pages 27-38

Genetic Algorithms for rerouting shortest paths in dynamic and stochastic networks

Author keywords

Dynamic and stochastic networks; Genetic algorithms; Routing; Shortest path

Indexed keywords

COMPUTER NETWORKS; GENETIC ALGORITHMS; OBJECT ORIENTED PROGRAMMING; PROBLEM SOLVING; ROUTERS;

EID: 0037209435     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00354-X     Document Type: Article
Times cited : (69)

References (19)
  • 1
    • 34147120474 scopus 로고
    • A note on two papers in connection with graphs
    • Dijkstra E.W. A note on two papers in connection with graphs. Numeriske Mathematics. 1: 1959; 269-271.
    • (1959) Numeriske Mathematics , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 2
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein D. Finding the k shortest paths. SIAM Journal on Computing. 28 (2): 1998; 653-674.
    • (1998) SIAM Journal on Computing , vol.28 , Issue.2 , pp. 653-674
    • Eppstein, D.1
  • 3
  • 4
    • 0039918015 scopus 로고    scopus 로고
    • Time-varying shortest path problems with constraints
    • Cai X., Kloks T., Wong C.K. Time-varying shortest path problems with constraints. Networks. 29 (3): 1997; 141-149.
    • (1997) Networks , vol.29 , Issue.3 , pp. 141-149
    • Cai, X.1    Kloks, T.2    Wong, C.K.3
  • 5
    • 0000418612 scopus 로고
    • An appraisal of some shortest path algorithms
    • Dreyfus E.S. An appraisal of some shortest path algorithms. Operations Research. 17: 1969; 395-412.
    • (1969) Operations Research , vol.17 , pp. 395-412
    • Dreyfus, E.S.1
  • 6
    • 0014534283 scopus 로고
    • Shortest paths in probabilistic graphs
    • Frank H. Shortest paths in probabilistic graphs. Operations Research. 17: 1968; 583-599.
    • (1968) Operations Research , vol.17 , pp. 583-599
    • Frank, H.1
  • 8
    • 0030196020 scopus 로고    scopus 로고
    • Distributed shortest-path protocols for time-dependent networks
    • Orda A., Rom R. Distributed shortest-path protocols for time-dependent networks. Distributed Computing. 10 (1): 1996; 49-62.
    • (1996) Distributed Computing , vol.10 , Issue.1 , pp. 49-62
    • Orda, A.1    Rom, R.2
  • 9
    • 0025464812 scopus 로고
    • Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
    • Orda A., Rom R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of ACM. 37 (3): 1990; 607-625.
    • (1990) Journal of ACM , vol.37 , Issue.3 , pp. 607-625
    • Orda, A.1    Rom, R.2
  • 11
    • 0001008059 scopus 로고
    • Shortest distance reliability of probabilistic networks computer
    • Mirchandani P.B. Shortest distance reliability of probabilistic networks computer. Operations Research. 3: 1976; 347-356.
    • (1976) Operations Research , vol.3 , pp. 347-356
    • Mirchandani, P.B.1
  • 15
    • 34250090619 scopus 로고    scopus 로고
    • Learning with Genetic Algorithms: An overview
    • Kluwer Academic, Hingham, MA
    • DeJong K. Learning with Genetic Algorithms: An Overview. Machine Learning. vol. 3: 1998; 121-138 Kluwer Academic, Hingham, MA.
    • (1998) Machine Learning , vol.3 , pp. 121-138
    • DeJong, K.1
  • 16
    • 38249002081 scopus 로고
    • A finite-time algorithm for shortest path problems with time-varying costs
    • Philpott A.B., Mees A.I. A finite-time algorithm for shortest path problems with time-varying costs. Applied Mathematics Letters. 6 (2): 1993; 91-94.
    • (1993) Applied Mathematics Letters , vol.6 , Issue.2 , pp. 91-94
    • Philpott, A.B.1    Mees, A.I.2


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