Fireworks explosion can solve the set covering problem

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorAstudillo, G.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T15:56:00Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T15:56:00Z
dc.date.issued2016
dc.description.abstractThe Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we will use a metaheuristic called Fireworks Algorithm (FWA) inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-33625-1_43es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-33625-1_43
dc.language.isoenges_ES
dc.publisherSpringer Verlages_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceAdvances in Intelligent Systems and Computinges_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleFireworks explosion can solve 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:
57. Fireworks explosion can solve the set covering problem.pdf
Tamaño:
159.04 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso