An binary black hole algorithm to solve set covering problem
Autor
Rubio Á.G.
Crawford B.
Soto R.
Jaramillo A.
Villablanca S.M.
Salas J.
Olguín E.
Resumen
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. After tray this algorithm, we implemented some improvements in certain operators, as well as added others also inspired by black holes physical behavior, to optimize the search and exploration to improving the results. © Springer International Publishing Switzerland 2016.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
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] (2020)
Gomez A.; Crawford B.; Soto R.; Jaramillo A.; Mansilla S.; Salas J.; Olguin E. (IEEE Computer Society, 2016) -
Conference Paper
Solving the set covering problem with a binary black hole inspired algorithm (2020)
Rubio Á.G.; Crawford B.; Soto R.; Olguín E.; Misra S.; Jaramillo A.; Villablanca S.M.; Salas J. (Springer Verlag, 2016) -
Conference Paper
An artificial fish swarm optimization algorithm to solve set covering problem (2020)
Crawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)