Mostrar el registro sencillo del ítem

dc.contributor.authorRubio Á.G.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlguín E.
dc.contributor.authorMisra S.
dc.contributor.authorJaramillo A.
dc.contributor.authorVillablanca S.M.
dc.contributor.authorSalas J.
dc.date.accessioned2020-09-02T22:27:32Z
dc.date.available2020-09-02T22:27:32Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42085-1_16
dc.identifier.citation9786, , 207-219
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6105
dc.descriptionThere 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. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceApduhan B.O.Murgante B.Misra S.Taniar D.Torre C.M.Rocha A.M.A.C.Wang S.Gervasi O.Stankova E.
dc.subjectBinary black hole
dc.subjectCombinatorial optimization problem
dc.subjectMeta heuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectCost engineering
dc.subjectGravitation
dc.subjectStars
dc.subjectBlack holes
dc.subjectCombinatorial optimization problems
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleSolving the set covering problem with a binary black hole inspired algorithm
dc.typeConference Paper


Ficheros en el ítem

Thumbnail

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

Mostrar el registro sencillo del ítem