A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems
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.
Más información
Título según WOS: | A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems |
Título según SCOPUS: | A novel learning-based binarization scheme selector for swarm algorithms solving combinatorial problems |
Título de la Revista: | Mathematics |
Volumen: | 9 |
Fecha de publicación: | 2021 |
DOI: |
10.3390/MATH9222887 |
Notas: | ISI, SCOPUS |