A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems
dc.contributor.author | Lemus-Romani, Jose | |
dc.contributor.author | Becerra-Rozas, Marcelo | |
dc.contributor.author | Crawford, Broderick | |
dc.contributor.author | Soto, Ricardo | |
dc.contributor.author | Cisternas-Caneo, Felipe | |
dc.contributor.author | Vega, Emanuel | |
dc.contributor.author | Castillo, Mauricio | |
dc.contributor.author | Tapia, Diego | |
dc.contributor.author | Astorga, Gino | |
dc.contributor.author | Palma, Wenceslao | |
dc.contributor.author | Castro, Carlos | |
dc.contributor.author | Garcia, Jose | |
dc.date.accessioned | 2025-01-20T22:02:15Z | |
dc.date.available | 2025-01-20T22:02:15Z | |
dc.date.issued | 2021 | |
dc.description.abstract | Currently, industry is undergoing an exponential increase in binary-based combinatorial problems. In this regard, metaheuristics have been a common trend in the field in order to design approaches to successfully solve them. Thus, a well-known strategy includes the employment of continuous swarm-based algorithms transformed to perform in binary environments. In this work, we propose a hybrid approach that contains discrete smartly adapted population-based strategies to efficiently tackle binary-based problems. The proposed approach employs a reinforcement learning technique, known as SARSA (State-Action-Reward-State-Action), in order to utilize knowledge based on the run time. In order to test the viability and competitiveness of our proposal, we compare discrete state-of-the-art algorithms smartly assisted by SARSA. Finally, we illustrate interesting results where the proposed hybrid outperforms other approaches, thus, providing a novel option to tackle these types of problems in industry. | |
dc.fuente.origen | WOS | |
dc.identifier.doi | 10.3390/math9222887 | |
dc.identifier.eissn | 2227-7390 | |
dc.identifier.uri | https://doi.org/10.3390/math9222887 | |
dc.identifier.uri | https://repositorio.uc.cl/handle/11534/93956 | |
dc.identifier.wosid | WOS:000815316600001 | |
dc.issue.numero | 22 | |
dc.language.iso | en | |
dc.revista | Mathematics | |
dc.rights | acceso restringido | |
dc.subject | combinatorial problems | |
dc.subject | metaheuristics | |
dc.subject | binarization scheme | |
dc.subject | SARSA | |
dc.subject | Q-learning | |
dc.subject | machine learning | |
dc.subject | discretization methods | |
dc.title | A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems | |
dc.type | artículo | |
dc.volumen | 9 | |
sipa.index | WOS | |
sipa.trazabilidad | WOS;2025-01-12 |