Title
Putting continuous metaheuristics to work in binary search spaces
Date Issued
01 January 2017
Access level
open access
Resource Type
journal article
Author(s)
Crawford B.
SOTO DE GIORGIS, RICARDO
Astorga G.
García J.
Castro C.
Paredes F.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Hindawi Limited
Abstract
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.
Volume
2017
Language
English
OCDE Knowledge area
Ciencias de la computación
DOI
10.1155/2017/8404231
Scopus EID
2-s2.0-85019679418
Source
Complexity
ISSN of the container
10762787
Source funding
Pontificia Universidad Católica de Valparaíso
Sponsor(s)
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.
Sources of information: Directorio de Producción Científica Scopus