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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Mulati, M. H., Constantino, A. A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	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-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1522-4902 2691-0632
DOI:	10.1109/SCCC.2011.34