Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]
MetadataShow full item record
The set cover problem, belongs to the branch of 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 a minimal cost. In this work, the problem is solved by binary Firefly algorithm, based on the flashing behavior of fireflies, using binary representation. A firefly produces a change in brightness based position between the fireflies. The new position is determined by the change in the value of the old position of the firefly, but the number of the new position is a real number, we can solve this problem with the function tanh binarization compared with a random number generated uniformly distributed between 0 and 1. The proposed algorithm has been tested on 65 benchmark instances. The results show that it is capable of producing solutions competitivas. virtualización; ultrasecuenciación genetics. © 2014 AISTI.
Showing items related by title, author, creator and subject.
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020) Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
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 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)