Solving geometric TSP with ants

Thang Nguyen Bui, Mufit Colpan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the inclusion of a preprocessing stage and the use of a modified version of an ant-based approach with local optimization in multi stages. Experimental results show that this algorithm outperforms ACS [1] and is comparable to MMAS [4] for Euclidean TSP instances. Of the 40 instances of Euclidean TSP from TSPLIB [5] that were tested, this algorithm found the optimal solution for 37 instances. For the remaining instances, this algorithm returned solutions that were within 0.3% of the optimum.

Original languageEnglish (US)
Title of host publicationGECCO 2005 - Genetic and Evolutionary Computation Conference
EditorsH.G. Beyer, U.M. O'Reilly, D. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, al et al
Pages271-272
Number of pages2
DOIs
StatePublished - Dec 1 2005
EventGECCO 2005 - Genetic and Evolutionary Computation Conference - Washington, D.C., United States
Duration: Jun 25 2005Jun 29 2005

Publication series

NameGECCO 2005 - Genetic and Evolutionary Computation Conference

Other

OtherGECCO 2005 - Genetic and Evolutionary Computation Conference
CountryUnited States
CityWashington, D.C.
Period6/25/056/29/05

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Solving geometric TSP with ants'. Together they form a unique fingerprint.

  • Cite this

    Bui, T. N., & Colpan, M. (2005). Solving geometric TSP with ants. In H. G. Beyer, U. M. O'Reilly, D. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, & A. et al (Eds.), GECCO 2005 - Genetic and Evolutionary Computation Conference (pp. 271-272). (GECCO 2005 - Genetic and Evolutionary Computation Conference). https://doi.org/10.1145/1068009.1068051