A Comparison Between ACO Algorithms for the Set Covering Problem

Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence of different ways of defining the heuristic information on the performance of the ACO algorithms. Finally, we show that the best performing ACO algorithms we implemented, when combined with a fine-tuned local search procedure, reach excellent performance on a set of well known benchmark instances.

• Type: Conference
• Year: 2004
• Where: ANTSW
• Authors: Lucas Lessing, Irina Dumitrescu, Thomas Stützle
• Keywords: ACO Algorithms, Ant Colony Optimization, ANTSW 2004, Artificial Intelligence, Set Covering Problem