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.