Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review

Marcelo Becerra-Rozas, José Lemus-Romani, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, Gino Astorga, Carlos Castro, José García

Producción científica: Contribución a una revistaArtículo de revisiónrevisión exhaustiva

7 Citas (Scopus)

Resumen

For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation of a previous review and seeks to draw a comprehensive picture of the various ways to binarize this type of metaheuristics; the study uses a standard systematic review consisting of the analysis of 512 publications from 2017 to January 2022 (5 years). The work will provide a theoretical foundation for novice researchers tackling combinatorial optimization using metaheuristic algorithms and for expert researchers analyzing the binarization mechanism’s impact on the metaheuristic algorithms’ performance. Structuring this information allows for improving the results of metaheuristics and broadening the spectrum of binary problems to be solved. We can conclude from this study that there is no single general technique capable of efficient binarization; instead, there are multiple forms with different performances.

Idioma originalInglés
Número de artículo129
PublicaciónMathematics
Volumen11
N.º1
DOI
EstadoPublicada - ene. 2023

Huella

Profundice en los temas de investigación de 'Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review'. En conjunto forman una huella única.

Citar esto