Putting Continuous Metaheuristics to Work in Binary Search Spaces

Broderick Crawford, Ricardo Soto, Gino Astorga, José García, Carlos Castro, Fernando Paredes · Complexity · 2017

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.

Read the paper · More papers on PaperTik