Inducing Sequentiality Using Grammatical Genetic Codes

This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converge sequentially in time in contrast to uniform convergence observed for uniformly-scaled problems. This study uses three different grammatical genetic codes to induce sequentiality. Genotypic genes in the grammatical codes are interpreted as phenotypes according to the grammar, and the grammar induces sequential interactions among phenotypic genes. The experimental results show that the grammatical codes can indeed induce sequentiality, but the GAs using them need exponential population sizes for a reliable search.

[1]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[2]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[3]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[4]  Hiroaki Kitano,et al.  Designing Neural Networks Using Genetic Algorithms with Graph Generation System , 1990, Complex Syst..

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

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

[7]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

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

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

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

[11]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[12]  Soraya B. Rana,et al.  Representation Issues in Neighborhood Search and Evolutionary Algorithms , 1998 .

[13]  P. G. Anderson,et al.  Ordered Greed , 1999, IIA/SOCO.

[14]  Shigeyoshi Tsutsui,et al.  Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms , 2000, GECCO.

[15]  Franz Rothlauf,et al.  Towards a theory of representations for genetic and evolutionary algorithms - development of basic concepts and their application to binary and tree representations , 2001, Ausgezeichnete Informatikdissertationen.

[16]  P. Anderson.  Ordered greed II: graph coloring , 2001 .

[17]  Conor Ryan,et al.  A Re-examination Of The Cart Centering Problem Using The Chorus System , 2002, GECCO.

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

[19]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[20]  Michael O'Neill,et al.  Genetic Algorithms Using Grammatical Evolution , 2002, EuroGP.

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

[22]  M. O'Neill,et al.  Grammatical evolution , 2001, GECCO '09.

[23]  Conor Ryan,et al.  How Functional Dependency Adapts to Salience Hierarchy in the GAuGE System , 2003, EuroGP.

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