Quad Search and Hybrid Genetic Algorithms

A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sphere functions, where ¥ bits are used to encode the function domain. Exploiting these ideas, we have constructed an algorithm we call Quad Search. Quad Search converges to a local optimum on unimodal 1-D functions in not more than ¢¥¢ function evaluations. For unimodal 1-D and separable multi-dimensional functions, the result is the global optimum. We empirically assess the performance of steepest ascent local search, next ascent local search, and Quad Search. These algorithms are also compared with Evolutionary Strategies. Because of its rapid convergence time, we also use Quad Search to construct a hybrid genetic algorithm. The resulting algorithm is more effective than hybrid genetic algorithms using steepest ascent local search or the RBC next ascent local search algorithm. 1 Background and Motivat...

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: L. Darrell Whitley, Deon Garrett, Jean-Paul Watson
• Keywords: Ascent Local Search, GECCO 2003, Quad Search, Unimodal 1-D Functions