GA consistently deceptive functions are not challenging problems

Das and Whitley have shown that functions which are easy in theory for genetic algorithms (GA) can be easily optimized with a global search method (Das and Whitley, 1991). In this paper, we show that this global search method can be simply adapted in order to solve also GA-hard functions and more generally consistently deceptive functions. The resulting algorithm, called GSC1, generates a set of binary strings and outputs the string that wins the first order schemas competitions as well as its binary complement. According to the theory of deceptiveness in GAs, this method solves GA-easy and GA-hard problems efficiently, as shown effectively in the reported experiments. This method is however only well suited for these functions, and does not deal with partially deceptive functions. It is then shown how it could be combined with a GA