Solving the set covering problem with a binary black hole inspired algorithm
Autor
Rubio Á.G.
Crawford B.
Soto R.
Olguín E.
Misra S.
Jaramillo A.
Villablanca S.M.
Salas J.
Resumen
There are multiple problems in several industries that can be solved with combinatorial optimization. In this sense, the Set Covering Problem is one of the most representative of them, being used in various branches of engineering and science, allowing find a set of solutions that meet the needs identified in the restrictions that have the lowest possible cost. This paper presents an algorithm inspired by binary black holes (BBH) to resolve known instances of SPC from the OR-Library. Also, it reproduces the behavior of black holes, using various operators to bring good solutions. © 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 set covering problem (2020)
Rubio Á.G.; Crawford B.; Soto R.; Jaramillo A.; Villablanca S.M.; Salas J.; Olguín E. (Springer Verlag, 2016) -
Conference Paper
Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization (2020)
Crawford B.; Soto R.; Olguín E.; Misra S.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016) -
Conference Paper
An approach to solve the Set Covering Problem with the Soccer League Competition algorithm (2020)
Jaramillo A.; Crawford B.; Soto R.; Misra S.; Olguín E.; Rubio Á.G.; Salas J.; Villablanca S.M. (Springer Verlag, 2016)