Multiple Offspring Sampling In Large Scale Global Optimization

Continuous optimization is one of the most active research lines in evolutionary and metaheuristic algorithms. Through CEC 2005 to CEC 2011 competitions, many different algorithms have been proposed to solve continuous problems. The advances on this type of problems are of capital importance as many real-world problems from very different domains (biology, engineering, data mining, etc.) can be formulated as the optimization of a continuous function. In this paper we analyze the behavior of a hybrid algorithm combining two heuristics that have been successfully applied to solving continuous optimization problems in the past. We show that the combination of both algorithms obtains competitive results on the proposed benchmark by automatically selecting the most appropriate heuristic for each function and search phase.