Solving geometric TSP with ants

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… (More)
DOI: 10.1145/1068009.1068051

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Bui2005SolvingGT, title={Solving geometric TSP with ants}, author={Thang Nguyen Bui and Mufit Colpan}, booktitle={GECCO}, year={2005} }