Solving the set covering problem with binary cat swarm optimization
Autor
Crawford B.
Soto R.
BerrÍos N.
Johnson F.
Paredes F.
Resumen
The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero–one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a binary version of Cat Swarm Optimization generated by observing cat behavior. Cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve the Set Covering Problem, for this the proposed algorithm has been tested on 65 benchmarks instances. © Springer International Publishing Switzerland 2015.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
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
Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos] (2020)
Crawford B.; Soto R.; Berrios N.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem (2020)
Crawford B.; Soto R.; Olivares-Suárez M.; Paredes F. (Springer Verlag, 2014)