Massive Multimodality, Deception, and Genetic Algorithms

This paper considers the use of genetic algorithms GAs for the solution of problems that are both average sense misleading deceptive and massively multimodal An archetypical multimodal deceptive problem here called a bipolar deceptive problem is de ned and two generalized constructions of such problems are reviewed one using re ected trap functions and one using low order Walsh coe cients su cient conditions for bipolar deception are also reviewed The Walsh construction is then used to form a bit order six bipolar deceptive function by concatenating ve six bit bipolar functions This test function with over ve million local optima and global optima poses a di cult challenge to simple and niched GAs alike Nonetheless simulations show that a simple GA can reliably nd one of the global optima if appropriate signal to noise ratio population sizing is adopted Simulations also demonstrate that a niched GA can reliably and simultaneously nd all global solutions if the population is roughly sized for the expected niche distribution and if the function is appropriately scaled to emphasize global solutions at the expense of suboptimal ones These results immediately recommend the application of niched GAs using appropriate population sizing and scaling They also suggest a number of avenues for generalizing the notion of deception

[1]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

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

[3]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[4]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[5]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

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

[7]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[8]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[9]  GUNAR E. LIEPINS,et al.  Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..

[10]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale , 1990, Complex Syst..

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

[12]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[13]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[14]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[15]  Kalyanmoy Deb,et al.  Multimodal Deceptive Functions , 1993, Complex Syst..