Title
Binary harmony search algorithm for solving set-covering problem
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Salas J.
Crawford B.
Rubio Á.G.
Jaramillo A.
Mansilla Villablanca S.
Olguín E.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
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.
Start page
917
End page
930
Volume
9799
Language
English
OCDE Knowledge area
Matemáticas
Informática y Ciencias de la Información
Subjects
Scopus EID
2-s2.0-84978834488
ISBN
9783319420066
ISSN of the container
03029743
ISBN of the container
978-331942006-6
DOI of the container
10.1007/978-3-319-42007-3_78
Conference
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Sources of information:
Directorio de Producción Científica
Scopus