Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms

For real-coded genetic algorithms, there have been proposed many crossover operators so far. While they have been evaluated by some benchmark problems, theoretically clear guidelines or design principles for them have not been established yet. This paper, first, discusses the importance of the distribution and statistics of the offspring yielded by a crossover operator for its evaluation. Then, from this viewpoint, the unimodal normal distribution crossover (UNDX) developed by Ono et al. (1997) is analyzed. The results of analysis provide us with a clear understanding of the characteristics of the UNDX. It is also shown that the values of the adjustable parameters of the UNDX tuned empirically is desirable in the sense that the offspring population inherits the statistics such as the mean value and the covariance matrix from the parent population.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[3]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[4]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[5]  Zbigniew Michalewicz,et al.  An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms , 1991, ICGA.

[6]  J. D. Schaffer,et al.  Real-Coded Genetic Algorithms and Interval-Schemata , 1992, FOGA.

[7]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[8]  L. J. Eshelman,et al.  chapter Real-Coded Genetic Algorithms and Interval-Schemata , 1993 .

[9]  Francesco Palmieri,et al.  Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutation , 1994, IEEE Trans. Neural Networks.

[10]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[12]  Ralf Salomon,et al.  Performance Degradation of Genetic Algorithms under Coordinate Rotation , 1996, Evolutionary Programming.

[13]  H. Beyer.  An alternative explanation for the manner in which genetic algorithms operate. , 1997, Bio Systems.

[14]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[15]  T. Nomura,et al.  An analysis on linear crossover for real number chromosomes in an infinite population size , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[16]  Tatsuya Nomura.  An Analysis on Crossovers for Real Number Chromosomes in an Infinite Population Size , 1997, IJCAI.

[17]  Yong Gao,et al.  Comments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [and reply] , 1998, IEEE Trans. Neural Networks.

[18]  Shigenobu Kobayashi,et al.  Theoretical Analysis of the Unimodal Normal Distiibution Crossover for Real-coded Genetic Algorithms , 1999 .

[19]  S. Kobayashi,et al.  Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).