메뉴 건너뛰기




Volumn 1, Issue , 2010, Pages 497-500

An effective hybrid ant colony algorithm for solving the traveling salesman problem

Author keywords

Ant colony optimization (ACO); Minimum spanning tree (MST); Traveling salesman problem (TSP)

Indexed keywords

ACO ALGORITHMS; ANT COLONIES; ANT COLONY ALGORITHMS; ANT-COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTING SPEED; HIGHER EFFICIENCY; HYBRID ALGORITHMS; MINIMUM SPANNING TREES; OPTIMAL PATHS; OPTIMIZATION STRATEGY; SEARCH RANGE; TRAVELING SALESMAN;

EID: 77955813478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICTA.2010.731     Document Type: Conference Paper
Times cited : (8)

References (8)
  • 1
    • 0030082551 scopus 로고    scopus 로고
    • The ant system: Optimization by a colony of cooperating agents
    • Marco Dorigo, Vittorio Maniezzo, and Alberto Colomi, "The Ant System: Optimization by a colony of cooperating agents", IEEE Transactions on Systems, vol.26, no.1, pp.1-13, 1996.
    • (1996) IEEE Transactions on Systems , vol.26 , Issue.1 , pp. 1-13
    • Dorigo, M.1    Maniezzo, V.2    Colomi, A.3
  • 2
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • September
    • C. Blum, and A. Roli, "Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison", ACM Computing Surveys, Vol. 35, No.3, September 2003, pp.268-308.
    • (2003) ACM Computing Surveys , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 3
    • 33749534855 scopus 로고    scopus 로고
    • An ant colony algorithm aimed at dynamic continuous optimization
    • J. Dréo and P. Siarry, "An ant colony algorithm aimed at dynamic continuous optimization", Applied Mathematics and Computation, vol. 181, pp. 457-467, 2006.
    • (2006) Applied Mathematics and Computation , vol.181 , pp. 457-467
    • Dréo, J.1    Siarry, P.2
  • 4
    • 34848884200 scopus 로고    scopus 로고
    • Ant colony optimization for continuous domains
    • K. Socha and M. Dorigo, "Ant colony optimization for continuous domains", European Journal of Operational Research, vol. 185, pp. 1155-1173, 2008.
    • (2008) European Journal of Operational Research , vol.185 , pp. 1155-1173
    • Socha, K.1    Dorigo, M.2
  • 6
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J.B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem", Proceedings of the American Mathematical Society 1956, pp.48-50.
    • (1956) Proceedings of the American Mathematical Society , pp. 48-50
    • Kruskal, J.B.1
  • 7
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R.C. Prim, "Shortest connection networks and some generalizations", Bell Systems Technology Journal 1957, pp.389-401.
    • (1957) Bell Systems Technology Journal , pp. 389-401
    • Prim, R.C.1


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