Solving deceptive problems using a genetic algorithm with reserve selection

Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global optimum. This paper presents an improved genetic algorithm with reserve selection to solve deceptive problems. The concept ldquopotentialrdquo of individuals is introduced as a new criterion for selecting individuals for reproduction, where some individuals with low fitness are also let survive only if they have high potentials. An operator called adaptation is further employed to release the potentials for approaching the global optimum. Case studies are done in two deceptive problems, demonstrating the effectiveness of the proposed algorithm.

[1]  L. Darrell Whitley,et al.  The Only Challenging Problems Are Deceptive: Global Search by Solving Order-1 Hyperplanes , 1991, ICGA.

[2]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

[3]  Abdollah Homaifar,et al.  Analysis and Design of a General GA Deceptive Problem , 1991, International Conference on Genetic Algorithms.

[4]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Marcus Hutter,et al.  Fitness uniform selection to preserve genetic diversity , 2001, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Gary B. Lamont,et al.  Multi-objective fast messy genetic algorithm solving deception problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[10]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[11]  Kotaro Hirasawa,et al.  GARS: an improved genetic algorithm with reserve selection for global optimization , 2007, GECCO '07.

[12]  Shengxiang Yang.  Adaptive group mutation for tackling deception in genetic search , 2004 .

[13]  Kotaro Hirasawa,et al.  Performance tuning of genetic algorithms with reserve selection , 2007, 2007 IEEE Congress on Evolutionary Computation.