A critical analysis of parameter adaptation in ant colony optimization

Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have been proposed. In the literature, these methods have been shown to improve the quality of the results achieved in some particular contexts. In particular, they proved to be successful when applied to novel ant colony optimization algorithms for tackling problems that are not a classical testbed for optimization algorithms. In this paper, we show that the adaptation methods proposed so far do not improve, and often even worsen the performance when applied to high performing ant colony optimization algorithms for some classical combinatorial optimization problems. Keywords Ant colony optimization · Parameter adaptation · Traveling salesman problem · Quadratic assignment problem

• Type: Journal
• Year: 2012
• Where: SWARM
• Authors: Paola Pellegrini, Thomas Stützle, Mauro Birattari
• Keywords: Ant Colony Optimization, Combinatorial Optimization Problems, Optimization, Quadratic Assignment Problem, SWARM 2012