Title :
Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem
Author :
Mulati, Mauro Henrique ; Constantino, A.A.
Author_Institution :
State Univ. of Maringa, Maringa, Brazil
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.
Keywords :
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; Context; Equations; Heuristic algorithms; Integrated circuits; Optimization; Search problems; Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation.;
Conference_Titel :
Computer Science Society (SCCC), 2011 30th International Conference of the Chilean
Conference_Location :
Curico
Print_ISBN :
978-1-4673-1364-3
DOI :
10.1109/SCCC.2011.34
