Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem

Abstract

This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.

DOI: 10.1109/SCCC.2011.34

8 Figures and Tables

Cite this paper

@article{Mulati2011AntLineAL, title={Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem}, author={Mauro Henrique Mulati and Ademir Aparecido Constantino}, journal={2011 30th International Conference of the Chilean Computer Science Society}, year={2011}, pages={265-274} }