Sciweavers

Share
ANTSW
2006
Springer

Parallel Ant Colony Optimization for the Traveling Salesman Problem

8 years 9 months ago
Parallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a high-performing ant colony optimization (ACO) algorithm for the traveling salesman problem using message passing libraries. In particular, we examine synchronous and asynchronous communications on different interconnection topologies. We find that the simplest way of parallelizing the ACO algorithms, based on parallel independent runs, is surprisingly effective; we give some reasons as to why this is the case.
Max Manfrin, Mauro Birattari, Thomas Stützle,
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ANTSW
Authors Max Manfrin, Mauro Birattari, Thomas Stützle, Marco Dorigo
Comments (0)
books