A Real-Coded Genetic Algorithm using Distance Dependent Alternation Model for Complex Function Optimization

The multi-parental Unimodal Normal Distribution Crossover (UNDX-m) that was proposed by Ono et al. and extended by Kita et al for real-coded Genetic Algorithms (GA). shows an excellent performance in optimization problems of highly epistatic fitness functions in continuous search spaces. The UNDX-m is a crossover operator that preserves the statistics such as the mean vector and the covariance matrix of the population well. While the crossover operator preserves the statistics of the population, an alternation model used with the crossover is needed to evolve the population through the alternations of the individuals in the population to progress a search. We proposed a distance dependent alternation (DDA) model, which is based on alternations of the elite child with the nearest parent in the family, to progress a search maintaining a diversity of a population. In this paper we show a real-coded GA using the UNDX-m combined with DDA model robustly solves 30-dimensional Fletcher-Powell function which is highly multi-modal and has similarity to real-world problems, and has never been solved by every other Evolutionary Algorithms.

[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]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[4]  Heinz Mühlenbein,et al.  The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA) , 1993, Evolutionary Computation.

[5]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[6]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[7]  Günter Rudolph,et al.  Contemporary Evolution Strategies , 1995, ECAL.

[8]  Heinz Mühlenbein,et al.  Fuzzy Recombination for the Breeder Genetic Algorithm , 1995, ICGA.

[9]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[10]  Hiroaki Satoh,et al.  Minimal generation gap model for GAs considering both exploration and exploitation , 1996 .

[11]  Ralf Salomon,et al.  The Influence of Different Coding Schemes on the Computational Complexity of Genetic Algorithms in Function Optimization , 1996, PPSN.

[12]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[13]  Thomas Bäck,et al.  Empirical Investigation of Multiparent Recombination Operators in Evolution Strategies , 1997, Evolutionary Computation.

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

[15]  S. Kobayashi,et al.  Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[16]  Shigenobu Kobayashi,et al.  A distance alternation model on real-coded genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[17]  O. Takahashi,et al.  Protein Folding by a Hierarchical Genetic Algorithm , 1999 .

[18]  Shigenobu Kobayashi,et al.  A Real-Coded Genetic Algorithm for Function Optimization Using the Unimodal Normal Distribution Crossover , 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).