Binary harmony search algorithm for solving set-covering problem

Juan Salas, Broderick Crawford, Ricardo Soto, Álvaro Gómez Rubio, Adrián Jaramillo, Sebastián Mansilla Villablanca, Eduardo Olguín

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

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.

Idioma originalInglés
Título de la publicación alojadaTrends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings
EditoresMoonis Ali, Hamido Fujita, Jun Sasaki, Masaki Kurematsu, Ali Selamat
EditorialSpringer Verlag
Páginas917-930
Número de páginas14
ISBN (versión impresa)9783319420066
DOI
EstadoPublicada - 2016
Publicado de forma externa
Evento29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016 - Morioka, Japón
Duración: 2 ago 20164 ago 2016

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen9799
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016
País/TerritorioJapón
CiudadMorioka
Período2/08/164/08/16

Huella

Profundice en los temas de investigación de 'Binary harmony search algorithm for solving set-covering problem'. En conjunto forman una huella única.

Citar esto