Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics

Vista sencilla de ítem
dc.contributor.authorCisternas-Caneo, Felipe
dc.contributor.authorCrawford, Broderick
dc.contributor.authorSoto, Ricardo
dc.contributor.authorGiachetti, Giovanni
dc.contributor.authorPaz, Álex
dc.contributor.authorPeña Fritz, Alvaro
dc.date.accessioned2024-05-03T18:52:32Z
dc.date.available2024-05-03T18:52:32Z
dc.date.issued2024-01-02
dc.descriptionIndexación: Scopus.
dc.description.abstractChaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better results. In the present work, chaotic maps are used to modify the behavior of the binarization rules that allow continuous metaheuristics to solve binary combinatorial optimization problems. In particular, seven different chaotic maps, three different binarization rules, and three continuous metaheuristics are used, which are the Sine Cosine Algorithm, Grey Wolf Optimizer, and Whale Optimization Algorithm. A classic combinatorial optimization problem is solved: the 0-1 Knapsack Problem. Experimental results indicate that chaotic maps have an impact on the binarization rule, leading to better results. Specifically, experiments incorporating the standard binarization rule and the complement binarization rule performed better than experiments incorporating the elitist binarization rule. The experiment with the best results was STD_TENT, which uses the standard binarization rule and the tent chaotic map.
dc.description.urihttps://www-scopus-com.recursosbiblioteca.unab.cl/record/display.uri?eid=2-s2.0-85183139676&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=c8b1d76f86a80f83efc5c45aeb6793a8&sot=aff&sdt=cl&cluster=scofreetoread%2c%22all%22%2ct&sl=61&s=AF-ID%28%22Universidad+Andr%c3%a9s+Bello%22+60002636%29+AND+SUBJAREA%28MATH%29&relpos=11&citeCnt=0&searchTerm=
dc.identifier.citationMathematics Open Access Volume 12, Issue 2 January 2024 Article number 262
dc.identifier.doi10.3390/math12020262
dc.identifier.issn22277390
dc.identifier.urihttps://repositorio.unab.cl/handle/ria/56532
dc.language.isoen
dc.publisherMDPI
dc.rights.licenseCC BY 4.0 DEED Attribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectbinarization schemes
dc.subjectchaotic maps
dc.subjectGrey Wolf Optimizer
dc.subjectknapsack problem
dc.subjectSine Cosine Algorithm
dc.subjectWhale Optimization Algorithm
dc.titleChaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
dc.typeArtículo
Archivos
Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
Cisternas-Caneo-F-Chaotic-Binarization-Schemes-for-Solving-Combinatorial-Optimization-Problems-Using-Continuous-Metaheuristics.pdf
Tamaño:
726.53 KB
Formato:
Adobe Portable Document Format
Descripción:
TEXTO COMPLETO EN INGLÉS
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar
Colecciones
FIng - Artículos de Revista