Un Algoritmo Binario Inspirado En Hoyos Negros Para Resolver El Problema De La Cobertura

Translated title of the contribution: An binary black hole algorithm to solve the set covering problem

Alvaro Gomez, Broderick Crawford, Ricardo Soto, Adrian Jaramillo, Sebastian Mansilla, Juan Salas, Eduardo Olguin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Translated title of the contributionAn binary black hole algorithm to solve the set covering problem
Original languageSpanish
Title of host publicationProceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016
EditorsAlvaro Rocha, Luis Paulo Reis, Manuel Perez Cota, Ramiro Goncalves, Octavio Santana Suarez
PublisherIEEE Computer Society
ISBN (Electronic)9789899843462
DOIs
StatePublished - 25 Jul 2016
Externally publishedYes
Event11th Iberian Conference on Information Systems and Technologies, CISTI 2016 - Gran Canaria, Spain
Duration: 15 Jun 201618 Jun 2016

Publication series

NameIberian Conference on Information Systems and Technologies, CISTI
Volume2016-July
ISSN (Print)2166-0727
ISSN (Electronic)2166-0735

Conference

Conference11th Iberian Conference on Information Systems and Technologies, CISTI 2016
Country/TerritorySpain
CityGran Canaria
Period15/06/1618/06/16

Fingerprint

Dive into the research topics of 'An binary black hole algorithm to solve the set covering problem'. Together they form a unique fingerprint.

Cite this