An binary black hole algorithm to solve set covering problem

Vista sencilla de ítem
dc.contributor.authorRubio Á.G.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorJaramillo, A.es_ES
dc.contributor.authorVillablanca S.M.es_ES
dc.contributor.authorSalas, J.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T19:51:08Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:08Z
dc.date.issued2016
dc.description.abstractThe 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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-42007-3_74es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-42007-3_74
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleAn binary black hole algorithm to solve set covering problemes_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
25. An binary black hole algorithm to solve set covering problem.pdf
Tamaño:
1.05 MB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso