A novel learning-based binarization scheme selector for swarm algorithms solving combinatorial problems

José Lemus-Romani, Marcelo Becerra-Rozas, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo, Emanuel Vega, Mauricio Castillo, Diego Tapia, Gino Astorga, Wenceslao Palma, Carlos Castro, José García

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

2 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Número de artículo2887
PublicaciónMathematics
Volumen9
N.º22
DOI
EstadoPublicada - 1 nov. 2021
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'A novel learning-based binarization scheme selector for swarm algorithms solving combinatorial problems'. En conjunto forman una huella única.

Citar esto