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

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...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2023-01, Vol.11 (1), p.129
Main Authors: Becerra-Rozas, Marcelo, Lemus-Romani, José, Cisternas-Caneo, Felipe, Crawford, Broderick, Soto, Ricardo, Astorga, Gino, Castro, Carlos, García, José
Format: Article
Language:English
Subjects:
Algorithms
binarization
Combinatorial analysis
combinatorial problems
continuous metaheuristics
discretization methods
Heuristic methods
Heuristic programming
Integer programming
Literature reviews
Mathematical research
Optimization
review
Sales territories
Search engines
Search strategies
Systematic review
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math11010129