Mostrar el registro sencillo del ítem
Solving the set covering problem with a binary black hole inspired algorithm
dc.contributor.author | Rubio Á.G. | |
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Olguín E. | |
dc.contributor.author | Misra S. | |
dc.contributor.author | Jaramillo A. | |
dc.contributor.author | Villablanca S.M. | |
dc.contributor.author | Salas J. | |
dc.date.accessioned | 2020-09-02T22:27:32Z | |
dc.date.available | 2020-09-02T22:27:32Z | |
dc.date.issued | 2016 | |
dc.identifier | 10.1007/978-3-319-42085-1_16 | |
dc.identifier.citation | 9786, , 207-219 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/6105 | |
dc.description | There 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.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Apduhan B.O.Murgante B.Misra S.Taniar D.Torre C.M.Rocha A.M.A.C.Wang S.Gervasi O.Stankova E. | |
dc.subject | Binary black hole | |
dc.subject | Combinatorial optimization problem | |
dc.subject | Meta heuristics | |
dc.subject | Set Covering Problem | |
dc.subject | Algorithms | |
dc.subject | Bins | |
dc.subject | Combinatorial optimization | |
dc.subject | Cost engineering | |
dc.subject | Gravitation | |
dc.subject | Stars | |
dc.subject | Black holes | |
dc.subject | Combinatorial optimization problems | |
dc.subject | Meta heuristics | |
dc.subject | Set covering problem | |
dc.subject | Optimization | |
dc.title | Solving the set covering problem with a binary black hole inspired algorithm | |
dc.type | Conference Paper |