A binary coded firefly algorithm that solves the set covering problem

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorOlivares-Suárez, M.es_ES
dc.contributor.authorPalma, W.es_ES
dc.contributor.authorParedes, F.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.contributor.authorNorero, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:31:36Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:31:36Z
dc.date.issued2014
dc.description.abstractThis work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is being applied to solve many optimization problems. We test the proposed binary coded firefly algorithm solving the non-unicost set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary coded firefly algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5144443es_PE
dc.language.isoenges_ES
dc.publisherEditura Academiei Romanees_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceRomanian Journal of Information Science and Technologyes_ES
dc.subjectComputer Sciencees_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleA binary coded firefly algorithm that solves the set covering problemes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
122. A binary coded firefly algorithm that solves the set covering problem.pdf
Tamaño:
199.41 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Artículo