Title
Solving the set covering problem with a binary black hole inspired algorithm
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Rubio Á.G.
Crawford B.
Olguín E.
Misra S.
Jaramillo A.
Villablanca S.M.
Salas J.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
There are multiple problems in several industries that can be solved with combinatorial optimization. In this sense, the Set Covering Problem is one of the most representative of them, being used in various branches of engineering and science, allowing find a set of solutions that meet the needs identified in the restrictions that have the lowest possible cost. This paper presents an algorithm inspired by binary black holes (BBH) to resolve known instances of SPC from the OR-Library. Also, it reproduces the behavior of black holes, using various operators to bring good solutions.
Start page
207
End page
219
Volume
9786
Language
English
OCDE Knowledge area
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-84978796141
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
978-331942084-4
Conference
16th International Conference on Computational Science and Its Applications, ICCSA 2016
Sponsor(s)
Broderick Crawford is supported by Grant CONICYT / FONDECYT / REGULAR / 1140897. Ricardo Soto is supported by Grant CONICYT / FONDECYT / REGULAR / 1160455. Sebastiásn Mansilla, Álvaro Gómez and Juan Salas are supported by Postgraduate Grant Pontificia Universidad Católica de Valparaiso 2015 (INF-PUCV 2015).
Sources of information:
Directorio de Producción Científica
Scopus