메뉴 건너뛰기




Volumn 2463, Issue , 2002, Pages 88-99

Ant systems for a dynamic TSP: Ants caught in a traffic jam

Author keywords

[No Author keywords available]

Indexed keywords

TRAFFIC CONGESTION; TRAVEL TIME;

EID: 84974719335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45724-0_8     Document Type: Conference Paper
Times cited : (118)

References (10)
  • 3
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 5
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • Marco Dorigo and Gianni Di Caro. Ant algorithms for discrete optimization. Artificial life, 5(2):137-172, 1999.
    • (1999) Artificial Life , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2
  • 9
    • 4344682508 scopus 로고    scopus 로고
    • An ant colony optimization approach to dynamic TSP
    • Lee Spector et al., editor, San Francisco, California, USA, 7-11 July, Morgan Kaufmann
    • Michael Guntsch, Martin Middendorf, and Hartmut Schmeck. An ant colony optimization approach to dynamic TSP. In Lee Spector et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 860-867, San Francisco, California, USA, 7-11 July. 2001. Morgan Kaufmann.
    • (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) , pp. 860-867
    • Guntsch, M.1    Middendorf, M.2    Schmeck, H.3


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