Mostrar el registro sencillo del ítem

An binary black hole algorithm to solve set covering problem

dc.contributor.authorRubio Á.G.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorJaramillo A.
dc.contributor.authorVillablanca S.M.
dc.contributor.authorSalas J.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:27:31Z
dc.date.available2020-09-02T22:27:31Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42007-3_74
dc.identifier.citation9799, , 873-883
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6103
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. After tray this algorithm, we implemented some improvements in certain operators, as well as added others also inspired by black holes physical behavior, to optimize the search and exploration to improving the results. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceAli M.Fujita H.Sasaki J.Kurematsu M.Selamat A.
dc.subjectBinary black hole
dc.subjectCombinatorial optimization problem
dc.subjectMethaheuristics
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectGravitation
dc.subjectIntelligent systems
dc.subjectKnowledge based systems
dc.subjectOptimization
dc.subjectStars
dc.subjectBinary algorithms
dc.subjectBlack holes
dc.subjectCombinatorial optimization problems
dc.subjectMethaheuristics
dc.subjectMultiple applications
dc.subjectMultiple instances
dc.subjectPhysical behaviors
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleAn binary black hole algorithm to solve set covering problem
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem