The set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro]
MetadataShow full item record
The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole phenomenon in space. To improve the performance of metaheuristics are used repairing operator, which those solutions that violate the constraints, preprocessing accelerate the resolution of the problem, and transfer function and discretization function to adapts the solutions to a binary domains. We report interesting and competitive experimental results on a set of 45 instances preprocessed the Set Covering Problem. © 2016 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)
Conference PaperSoto R.; Crawford B.; Figueroa I.; Niklander S.; Olguín E. (Springer Verlag, 2016)
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)