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

Research output: Contribution to journalReview articlepeer-review

3 Scopus citations


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.

Original languageEnglish
Article number129
Issue number1
StatePublished - Jan 2023


  • binarization
  • combinatorial problems
  • continuous metaheuristics
  • discretization methods
  • review


Dive into the research topics of 'Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review'. Together they form a unique fingerprint.

Cite this