Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017 (2017), Article ID 8404231, 19 pages
https://doi.org/10.1155/2017/8404231
Review Article

Putting Continuous Metaheuristics to Work in Binary Search Spaces

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad de Valparaíso, 2361864 Valparaíso, Chile
3Centro de Investigación y Desarrollo Telefónica, 7500961 Santiago, Chile
4Universidad Técnica Federico Santa María, 2390123 Valparaíso, Chile
5Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

Correspondence should be addressed to José García

Received 24 January 2017; Revised 30 March 2017; Accepted 9 April 2017; Published 11 May 2017

Academic Editor: Jia Hao

Copyright © 2017 Broderick Crawford et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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 algorithms must be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.