Simplex crossover and linkage identification: single-stage evolution vs. multi-stage evolution

Previous studies have proposed simplex crossover for real-coded genetic algorithms (GAs). In this paper, we propose two types of linkage identification for simplex crossover: the linkage identification with single-stage evolution (LISS) and linkage identification with multi-stage evolution (LIMS); and a comparative study is performed. Results show that the LIMS has a more stable performance than LISS.

[1]  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.

[2]  K. Deb,et al.  Rapid, Accurate Optimization of Diicult Problems Using Fast Messy Genetic Algorithms Rapid, Accurate Optimization of Diicult Problems Using Fast Messy Genetic Algorithms , 1993 .

[3]  Masayuki Yamamura,et al.  Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms , 2000, PPSN.

[4]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[5]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[6]  Jean-Michel Renders,et al.  Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[8]  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.

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

[10]  Keith E. Mathias,et al.  Crossover Operator Biases: Exploiting the Population Distribution , 1997, ICGA.

[11]  M. Yamamura,et al.  A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[12]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

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

[14]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[15]  David E. Goldberg,et al.  Linkage Identification by Non-monotonicity Detection for Overlapping Functions , 1999, Evolutionary Computation.

[16]  Shigenobu Kobayashi,et al.  A robust real-coded genetic algorithm using Unimodal Normal Distribution Crossover augmented by Uniform Crossover: effects of self-adaptation of crossover probabilities , 1999 .

[17]  Fernando G. Lobo,et al.  Compressed introns in a linkage learning genetic algorithm , 1998 .