TY - JOUR
T1 - Continuous Metaheuristics for Binary Optimization Problems
T2 - An Updated Systematic Literature Review
AU - Becerra-Rozas, Marcelo
AU - Lemus-Romani, José
AU - Cisternas-Caneo, Felipe
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - Astorga, Gino
AU - Castro, Carlos
AU - García, José
N1 - Publisher Copyright:
© 2022 by the authors.
PY - 2023/1
Y1 - 2023/1
N2 - 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.
AB - 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.
KW - binarization
KW - combinatorial problems
KW - continuous metaheuristics
KW - discretization methods
KW - review
UR - http://www.scopus.com/inward/record.url?scp=85146023142&partnerID=8YFLogxK
U2 - 10.3390/math11010129
DO - 10.3390/math11010129
M3 - Review article
AN - SCOPUS:85146023142
SN - 2227-7390
VL - 11
JO - Mathematics
JF - Mathematics
IS - 1
M1 - 129
ER -