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

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...

Full description

Saved in:
Bibliographic Details
Published in2011 30th International Conference of the Chilean Computer Science Society pp. 265 - 274
Main Authors Mulati, M. H., Constantino, A. A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2011
Subjects
Ant colony optimization
Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation
Context
Equations
Heuristic algorithms
Integrated circuits
Optimization
Search problems
Online AccessGet full text
ISBN9781467313643
1467313645
ISSN1522-4902
DOI10.1109/SCCC.2011.34

Cover

More Information
Summary: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.
ISBN:9781467313643
1467313645
ISSN:1522-4902
DOI:10.1109/SCCC.2011.34