Examinando por Autor "Mansilla Villablanca, S."

Mostrando 1 - 1 de 1
  • Miniatura
    ÍtemAcceso Abierto
    Binary harmony search algorithm for solving set-covering problem
    (Springer Verlag, 2016) Salas, J.; Crawford, B.; Soto, R.; Rubio Á.G.; Jaramillo, A.; Mansilla Villablanca, S.; Olguín, E.
    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.