메뉴 건너뛰기




Volumn , Issue , 2008, Pages

A Team ant colony optimization algorithm for the multiple travelling salesmen problem with MinMax objective

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION ALGORITHMS; ANT COLONY SYSTEMS; MINMAX OBJECTIVES; MULTI-ROBOT PATH PLANNING; MULTIPLE TRAVELLING SALESMEN PROBLEMS; NETWORK-BASED APPROACHES; SIMULATION RESULTS; SOLUTION QUALITIES; TRAVELLING SALESMAN PROBLEMS;

EID: 77955174705     PISSN: 10258973     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (18)
  • 1
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • April
    • Marco Dorigo and Luca Maria Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, April 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Maria Gambardella, L.2
  • 3
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • June
    • Gilbert Laporte. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(2):231-247, June 1992.
    • (1992) European Journal of Operational Research , vol.59 , Issue.2 , pp. 231-247
    • Laporte, G.1
  • 7
    • 0032790197 scopus 로고    scopus 로고
    • Competition-based neural network for the multiple travelling salesmen problem with minmax objective
    • Samerkae Somhom, Abdolhamid Modares, and Takao Enkawa. Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Computers & OR, 26(4):395-407, 1999.
    • (1999) Computers & OR , vol.26 , Issue.4 , pp. 395-407
    • Somhom, S.1    Modares, A.2    Enkawa, T.3
  • 11
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for the vehicle routing problem
    • Bernd Bullnheimer, Richard Hartl, and Christine Strauss. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89:319-328, 1999.
    • (1999) Annals of Operations Research , vol.89 , pp. 319-328
    • Bullnheimer, B.1    Hartl, R.2    Strauss, C.3
  • 12
    • 0033312934 scopus 로고    scopus 로고
    • The ant system applied to the quadratic assignment problem
    • Vittorio Maniezzo and Alberto Colorni. The ant system applied to the quadratic assignment problem. Knowledge and Data Engineering, 11(5):769-778, 1999.
    • (1999) Knowledge and Data Engineering , vol.11 , Issue.5 , pp. 769-778
    • Maniezzo, V.1    Colorni, A.2
  • 15
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2


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