TY - JOUR
T1 - Putting continuous metaheuristics to work in binary search spaces
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - Astorga, Gino
AU - García, José
AU - Castro, Carlos
AU - Paredes, Fernando
N1 - Funding Information:
Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1171243, Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455, Jos? Garc?a is supported by INF-PUCV 2016, and Gino Astorga is supported by Postgraduate Grant, Pontificia Universidad Cat?lica de Valpara?so, 2015.
Publisher Copyright:
© 2017 Broderick Crawford et al.
PY - 2017
Y1 - 2017
N2 - In the real world, there are a number of optimization problems whose search space is restricted to take binary values; however, there are many continuous metaheuristics with good results in continuous search spaces. These algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.
AB - In the real world, there are a number of optimization problems whose search space is restricted to take binary values; however, there are many continuous metaheuristics with good results in continuous search spaces. These algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.
UR - http://www.scopus.com/inward/record.url?scp=85019679418&partnerID=8YFLogxK
U2 - 10.1155/2017/8404231
DO - 10.1155/2017/8404231
M3 - Review article
AN - SCOPUS:85019679418
VL - 2017
JO - Complexity
JF - Complexity
SN - 1076-2787
M1 - 8404231
ER -