Mostrar el registro sencillo del ítem

An binary black hole algorithm to solve the set covering problem [Un Algoritmo Binario Inspirado En Hoyos Negros Para Resolver El Problema De La Cobertura]

dc.contributor.authorGomez A.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorJaramillo A.
dc.contributor.authorMansilla S.
dc.contributor.authorSalas J.
dc.contributor.authorOlguin E.
dc.date.accessioned2020-09-02T22:19:18Z
dc.date.available2020-09-02T22:19:18Z
dc.date.issued2016
dc.identifier10.1109/CISTI.2016.7521431
dc.identifier.citation2016-July, , -
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4696
dc.descriptionThe 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. © 2016 AISTI.
dc.language.isoes
dc.publisherIEEE Computer Society
dc.sourceRocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subjectBinary Black Hole
dc.subjectCombinatorial Optimization Problem
dc.subjectMethaheuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectGravitation
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectStars
dc.subjectBinary algorithms
dc.subjectBlack holes
dc.subjectCelestial bodies
dc.subjectCombinatorial optimization problems
dc.subjectMethaheuristics
dc.subjectMultiple applications
dc.subjectMultiple instances
dc.subjectSet covering problem
dc.subjectBins
dc.titleAn binary black hole algorithm to solve the set covering problem [Un Algoritmo Binario Inspirado En Hoyos Negros Para Resolver El Problema De La Cobertura]
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84982129186.pdf
Tamaño:
2.484Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem