Paper Info
Title
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.
Year
DOI
Venue
2011
10.1109/SCCC.2011.34
SCCC
Keywords
Field
DocType
ant colony optimisation,computational complexity,integer programming,linear programming,set theory,Ant-Line algorithm,NP-hard combinatorial optimization,ant colony optimization,exact algorithms,integer linear optimization problem,line-oriented ACO algorithm,set covering problem problem,superpolynomial time,Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation.
Ant colony optimization algorithms,Extremal optimization,Computer science,Artificial intelligence,Metaheuristic,Mathematical optimization,Parallel metaheuristic,Meta-optimization,Algorithm,Combinatorial optimization,Local search (optimization),Machine learning,Tabu search
Conference
ISSN
Citations 
PageRank 
1522-4902
0
0.34
References 
Authors
18
2
Name
Order
Citations
PageRank
Mauro Henrique Mulati192.65
Ademir Aparecido Constantino2155.76