A black hole algorithm for solving the set covering problem
MetadataShow full item record
The set covering problem is a classical optimization benchmark with many industrial applications such as production planning, assembly line balancing, and crew scheduling among several others. In this work, we solve such a problem by employing a recent nature-inspired metaheuristic based on the black hole phenomena. The core of such a metaheuristic is enhanced with the incorporation of transfer functions and discretization methods to handle the binary nature of the problem. We illustrate encouraging experimental results, where the proposed approach is capable to reach various global optimums for a well-known instance set from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.
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 PaperSoto R.; Crawford B.; Fernandez N.; Reyes V.; Niklander S.; Araya I. (Springer Verlag, 2017)
Conference PaperCrawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)