@inproceedings{f72ae629a1b04181bbfddfbb362d0fc0,
title = "Un Algoritmo Binario Inspirado En Hoyos Negros Para Resolver El Problema De La Cobertura",
abstract = "The Set Covering Problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions.",
keywords = "Binary Black Hole, Combinatorial Optimization Problem, Methaheuristics, Set Covering Problem",
author = "Alvaro Gomez and Broderick Crawford and Ricardo Soto and Adrian Jaramillo and Sebastian Mansilla and Juan Salas and Eduardo Olguin",
note = "Publisher Copyright: {\textcopyright} 2016 AISTI.; 11th Iberian Conference on Information Systems and Technologies, CISTI 2016 ; Conference date: 15-06-2016 Through 18-06-2016",
year = "2016",
month = jul,
day = "25",
doi = "10.1109/CISTI.2016.7521431",
language = "Spanish",
series = "Iberian Conference on Information Systems and Technologies, CISTI",
publisher = "IEEE Computer Society",
editor = "Alvaro Rocha and Reis, {Luis Paulo} and Cota, {Manuel Perez} and Ramiro Goncalves and Suarez, {Octavio Santana}",
booktitle = "Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016",
}