Binary harmony search algorithm for solving set-covering problem
Autor
Salas J.
Crawford B.
Soto R.
Rubio Á.G.
Jaramillo A.
Mansilla Villablanca S.
Olguín E.
Resumen
This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
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) -
Conference Paper
Solving the set covering problem with the soccer league competition algorithm (2020)
Jaramillo A.; Crawford B.; Soto R.; Villablanca S.M.; Rubio Á.G.; Salas J.; Olguín E. (Springer Verlag, 2016) -
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)