Title
Recent harmony search algorithms for 0–1 optimization problems
Date Issued
01 January 2015
Access level
open access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.
Start page
567
End page
572
Volume
528
Language
English
OCDE Knowledge area
Otras ingenierías y tecnologías
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-84951839143
ISBN
9783319213798
Source
Communications in Computer and Information Science
ISSN of the container
18650929
Conference
17th International Conference on Human Computer Interaction, HCI 2015
Sponsor(s)
Broderick Crawford is supported by Grant CONICYT / FONDECYT / REGULAR / 1140897. Ricardo Soto is supported by Grant CONICYT / FONDECYT / INICIACION / 11130459.
Sources of information:
Directorio de Producción Científica
Scopus