Introducing Subchromosome Representations to the Linkage Learning Genetic Algorithm

This paper introduces subchromosome representations to the linkage learning genetic algorithm (LLGA). The subchromosome representation is utilized for effectively lowering the number of building blocks in order to escape from the performance limit implied by the convergence time model for the linkage learning genetic algorithm. A preliminary implementation to realize subchromosome representations is developed and tested. The experimental results indicate that the proposed representation can improve the performance of the linkage learning genetic algorithm on uniformly scaled problems, and the initial implementation provides a potential way for the linkage learning genetic algorithm to incorporate prior linkage information when such knowledge exists.

[1]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[2]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[3]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[4]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[5]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

[6]  Jim Smith,et al.  Recombination strategy adaptation via evolution of gene linkage , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[7]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

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

[9]  James R. Levenick,et al.  Metabits: Generic Endogenous Crossover Control , 1995, International Conference on Genetic Algorithms.

[10]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[11]  David E. Goldberg,et al.  Convergence time for the linkage learning genetic algorithm , 2004, IEEE Congress on Evolutionary Computation.

[12]  David E. Goldberg,et al.  Tightness Time for the Linkage Learning Genetic Algorithm , 2003, GECCO.

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

[14]  David E. Goldberg,et al.  Introducing Start Expression Genes to the Linkage Learning Genetic Algorithm , 2002, PPSN.

[15]  E. Cantu-Paz,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1997, Evolutionary Computation.

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

[17]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

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

[19]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .