Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos]
MetadataShow full item record
The set covering problem belongs to the combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at minimal cost. The solution to this problem is presented using, for first time, the binary cat swarm optimization algorithm. This metaheuristic is based on the cat's behavior, where cats have curiosity by objects in motion and have a great hunting ability. Cats have two modes of behavior: seeking mode and tracing mode. The algorithm is tested on 65 instances, which are compared in a result table including a column with the relative percentage deviation. © 2015 AISTI.
Showing items related by title, author, creator and subject.
The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020) Crawford B.; Soto R.; Leiva F.A.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos] (2020) Crawford B.; Soto R.; Suárez M.O.; Paredes F.; Johnson F. (IEEE Computer Society, 2014)
Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] (2020) Crawford B.; Soto R.; Olea C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)