JUCS - Journal of Universal Computer Science 26(2): 293-316, doi: 10.3897/jucs.2020.016
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem
expand article infoMurilo Falleiros Lemos Schmitt, Mauro Henrique Mulati§, Ademir Aparecido Constantino|, Fábio Hernandes§, Tony Alexander Hild§
‡ Federal University of Paraná, Curitiba, Brazil§ Midwestern State University of Parana, Guarapuava, Brazil| Universidade Estadual de Maringá, Maringá, Brazil
Open Access
This paper proposes an algorithm for the set covering problem based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Set, which uses a lineoriented approach and a novelty pheromone manipulation based on the connections between components of the construction graph, while also applying a local search. The algorithm is compared with other ACO-based approaches. The results obtained show the effectiveness of the algorithm and the impact of the pheromone manipulation.
ant colony optimization, ant-set, set covering problem, pheromone manipulation, line-orientation