Mostrar el registro sencillo del ítem

The set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro]

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorFigueroa I.
dc.contributor.authorOlivares R.
dc.contributor.authorOlguin E.
dc.date.accessioned2020-09-02T22:28:40Z
dc.date.available2020-09-02T22:28:40Z
dc.date.issued2016
dc.identifier10.1109/CISTI.2016.7521538
dc.identifier.citation2016-July, , -
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6296
dc.descriptionThe Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole phenomenon in space. To improve the performance of metaheuristics are used repairing operator, which those solutions that violate the constraints, preprocessing accelerate the resolution of the problem, and transfer function and discretization function to adapts the solutions to a binary domains. We report interesting and competitive experimental results on a set of 45 instances preprocessed the Set Covering Problem. © 2016 AISTI.
dc.language.isoes
dc.publisherIEEE Computer Society
dc.sourceRocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subjectBlack hole algorithm
dc.subjectoptimization problem
dc.subjectset covering problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectGravitation
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectStars
dc.subjectBlack holes
dc.subjectClassical problems
dc.subjectDiscretizations
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectOptimization problems
dc.subjectRepairing operators
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleThe set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro]
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem