Binary harmony search algorithm for solving set-covering problem
Fecha
2016
Título de la revista
ISSN de la revista
Título del volumen
Editor
Springer Verlag
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.
Descripción
Palabras clave
Computer Science, Mathematics