El problema de cobertura de conjuntos solucionado por el algoritmo del Agujero Negro [The set covering problem solved by the Black Hole algorithm]

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorFigueroa, I.es_ES
dc.contributor.authorOlivares, R.es_ES
dc.contributor.authorOlguin, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:31:48Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:31:48Z
dc.date.issued2016
dc.description.abstractThe 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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1109/CISTI.2016.7521538es_ES
dc.identifier.urihttps://doi.org/10.1109/CISTI.2016.7521538
dc.language.isospaes_ES
dc.publisherIEEE Computer Societyes_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceIberian Conference on Information Systems and Technologies, CISTIes_ES
dc.subjectComputer Sciencees_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleEl problema de cobertura de conjuntos solucionado por el algoritmo del Agujero Negro [The set covering problem solved by the Black Hole algorithm]es_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
204. The set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado...].pdf
Tamaño:
340.57 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso