A bi-objetive Cat Swarm Optimization algorithm for set covering problem
Autor
Crawford B.
Soto R.
Caballero H.
Olguín E.
Resumen
In this paper, we study a classical problem in combinatorics and computer science, Set Covering Problem. It is one of Karp’s 21 NP-complete problems, using a new and original metaheuristic, Cat Swarm Optimization. This algorithm imitates the domestic cat through two states: seeking and tracing mode. The OR-Library of Beasley instances were used for the benchmark with additional fitness function, thus the problem was transformed from Mono-objective to Bi-objective. The Cat Swarm Optimization finds a set solution non-dominated based on Pareto concepts, and an external file for storing them. The results are promising for further continue in future work optimizing this problem. © Springer International Publishing Switzerland 2016.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Solving biobjective set covering problem using binary cat swarm optimization algorithm (2020)
Crawford B.; Soto R.; Caballero H.; Olguín E.; Misra S. (Springer Verlag, 2016) -
Conference Paper
Cat swarm optimization with different binarization methods for solving set covering problems (2020)
Crawford B.; Soto R.; Berrios N.; Olguín E. (Springer Verlag, 2016) -
Conference Paper
An artificial fish swarm optimization algorithm to solve set covering problem (2020)
Crawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)