A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

Simple item page
dc.contributor.authorGarcia, Jose
dc.contributor.authorLemus-Romani, Jose
dc.contributor.authorAltimiras, Francisco
dc.contributor.authorCrawford, Broderick
dc.contributor.authorSoto, Ricardo
dc.contributor.authorBecerra-Rozas, Marcelo
dc.contributor.authorMoraga, Paola
dc.contributor.authorPaz Becerra, Alex
dc.contributor.authorPena Fritz, Alvaro
dc.contributor.authorRubio, Jose-Miguel
dc.contributor.authorAstorga, Gino
dc.date.accessioned2025-01-20T22:05:44Z
dc.date.available2025-01-20T22:05:44Z
dc.date.issued2021
dc.description.abstractOptimization techniques, specially metaheuristics, are constantly refined in order to decrease execution times, increase the quality of solutions, and address larger target cases. Hybridizing techniques are one of these strategies that are particularly noteworthy due to the breadth of applications. In this article, a hybrid algorithm is proposed that integrates the k-means algorithm to generate a binary version of the cuckoo search technique, and this is strengthened by a local search operator. The binary cuckoo search algorithm is applied to the NP-hard Set-Union Knapsack Problem. This problem has recently attracted great attention from the operational research community due to the breadth of its applications and the difficulty it presents in solving medium and large instances. Numerical experiments were conducted to gain insight into the contribution of the final results of the k-means technique and the local search operator. Furthermore, a comparison to state-of-the-art algorithms is made. The results demonstrate that the hybrid algorithm consistently produces superior results in the majority of the analyzed medium instances, and its performance is competitive, but degrades in large instances.</p>
dc.fuente.origenWOS
dc.identifier.doi10.3390/math9202611
dc.identifier.eissn2227-7390
dc.identifier.urihttps://doi.org/10.3390/math9202611
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/94164
dc.identifier.wosidWOS:000714464200001
dc.issue.numero20
dc.language.isoen
dc.revistaMathematics
dc.rightsacceso restringido
dc.subjectcombinatorial optimization
dc.subjectmachine learning
dc.subjectmetaheuristics
dc.subjectset-union knapsack
dc.titleA Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem
dc.typeartículo
dc.volumen9
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas