Algoritmo de Optimización basado en biogeografía para resolver el Set Covering Problem [Biogeography-based Optimization Algorithm for the Set Covering Problem]

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorRiquelme, L.es_ES
dc.contributor.authorOlguin, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:31:47Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:31:47Z
dc.date.issued2016
dc.description.abstractBiogeography-Based Optimization Algorithm (BBOA) is a new kind of global optimization algorithm inspired by biogeography, which mimics the migration behavior of animals in nature to solve optimization and engineering problems. In this paper, we proposed BBOA for solving the Set Covering Problem (SCP). The SCP is a classic combinatorial problem from NP-hard list problems, consisting in find a set of solutions that cover a range of needs at the lowest possible cost with certain constraints. Moreover, we proposed a new feature for improve performance of BBOA, improving stagnation in local optimum. Finally, the experiments with BBOA to solve these problems, show very good results. © 2016 AISTI.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1109/CISTI.2016.7521402es_ES
dc.identifier.urihttps://doi.org/10.1109/CISTI.2016.7521402
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.titleAlgoritmo de Optimización basado en biogeografía para resolver el Set Covering Problem [Biogeography-based Optimization Algorithm for the Set Covering Problem]es_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Colecciones
Ponencia de congreso