A Simple Real-Coded Extended Compact Genetic Algorithm

This paper presents a simple real-coded estimation of distribution algorithm (EDA) design using x-ary extended compact genetic algorithm (XECGA) and discretization methods. Specifically, the real-valued decision variables are mapped to discrete symbols of user-specified cardinality using discretization methods. The XECGA is then used to build the probabilistic model and to sample a new population based on the probabilistic model. The effect of alphabet cardinality and the selection pressure on the scalability of the real-coded ECGA (rECGA) method is investigated. The results show that the population size required by rECGA-to successfully solve a class of additively- separable problems-scales sub-quadratically with problem size and the number of function evaluations scales sub-cubically with problem size. The proposed rECGA is simple, making it amenable for further empirical and theoretical analysis. Moreover, the probabilistic models built in the proposed real- coded ECGA are readily interpretable and can be easily visualized. The proposed algorithm and the results presented in this paper are first step towards conducting a systematic analysis of real-coded EDAs and towards developing a design theory for development of scalable and robust real-coded EDAs.

[1]  D. Goldberg,et al.  Probabilistic Model Building and Competent Genetic Programming , 2003 .

[2]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[3]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .

[4]  David E. Goldberg,et al.  Combining The Strengths Of Bayesian Optimization Algorithm And Adaptive Evolution Strategies , 2002, GECCO.

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

[6]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[7]  Petr Posík.  Estimation of Distribution Algorithms , 2006 .

[8]  David E. Goldberg,et al.  The Race, the Hurdle, and the Sweet Spot , 1998 .

[9]  David E. Goldberg,et al.  Simplex crossover and linkage identification: single-stage evolution vs. multi-stage evolution , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[10]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

[11]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..

[12]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[13]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[14]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

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

[16]  David E. Goldberg,et al.  Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods , 2004, GECCO.

[17]  Chao-Hong Chen,et al.  Adaptive discretization for probabilistic model building genetic algorithms , 2006, GECCO '06.

[18]  Fernando G. Lobo,et al.  Extended Compact Genetic Algorithm in C , 1999 .

[19]  Erick Cantú-Paz,et al.  Supervised and unsupervised discretization methods for evolutionary algorithms , 2001 .

[20]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[21]  David E. Goldberg,et al.  Getting the best of both worlds: Discrete and continuous genetic and evolutionary algorithms in concert , 2003, Inf. Sci..