An artificial bee colony algorithm for the set covering problem
Autor
Cuesta R.
Crawford B.
Soto R.
Paredes F.
Resumen
In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem. © Springer International Publishing Switzerland 2014.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem (2020)
Crawford B.; Soto R.; Cuesta R.; Paredes F. (Springer Verlag, 2014) -
Conference Paper
A timetabling applied case solved with ant colony optimization (2020)
Crawford B.; Soto R.; Johnson F.; Paredes F. (Springer Verlag, 2015) -
Article
A 2-level approach for the set covering problem: Parameter tuning of artificial bee colony algorithm by using genetic algorithm (2020)
Crawford B.; Soto R.; Palma W.; Johnson F.; Paredes F.; Olguín E. (Springer Verlag, 2014)