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

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.

Original languageEnglish
Article number2887
JournalMathematics
Volume9
Issue number22
DOIs
StatePublished - 1 Nov 2021
Externally publishedYes

Keywords

  • Binarization scheme
  • Combinatorial problems
  • Discretization methods
  • Machine learning
  • Metaheuristics
  • Q-learning
  • SARSA

Fingerprint

Dive into the research topics of 'A novel learning-based binarization scheme selector for swarm algorithms solving combinatorial problems'. Together they form a unique fingerprint.

Cite this