Putting continuous metaheuristics to work in binary search spaces

155Citations
Citations of this article
66Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Crawford, B., Soto, R., Astorga, G., García, J., Castro, C., & Paredes, F. (2017). Putting continuous metaheuristics to work in binary search spaces. Complexity. Hindawi Limited. https://doi.org/10.1155/2017/8404231

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free