An binary black hole algorithm to solve the set covering problem [Un Algoritmo Binario Inspirado En Hoyos Negros Para Resolver El Problema De La Cobertura]
MetadataShow full item record
The Set Covering Problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. © 2016 AISTI.
Showing items related by title, author, creator and subject.
The set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro] (2020) Soto R.; Crawford B.; Figueroa I.; Olivares R.; Olguin E. (IEEE Computer Society, 2016)
Conference PaperRubio Á.G.; Crawford B.; Soto R.; Jaramillo A.; Villablanca S.M.; Salas J.; 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)