Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem

  • Authors:
  • Amilkar Puris;Rafael Bello;Yailen Martínez;Ann Nowe

  • Affiliations:
  • Department of Computer Science, Central University of Las Villas, Cuba;Department of Computer Science, Central University of Las Villas, Cuba;Department of Computer Science, Central University of Las Villas, Cuba;CoMo Lab, Department of Computer Science, Vrije Universiteit Brussel, Belgium

  • Venue:
  • IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a multilevel approach of Ant Colony Optimization to solve the Traveling Salesman Problem is introduced. The basic idea is to split the heuristic search performed by ants into two stages; in this case we use both the Ant System and Ant Colony System algorithms. Also, the effect of using local search was analyzed. We have studied the performance of this new algorithm for several Traveling Salesman Problem instances. Experimental results obtained conclude that the Two-Stage approach significantly improves the Ant System and Ant Colony System in terms of the computation time needed.