Introduction to the Special Issue: Variable-Length Representation and Noncoding Segments for Evolutionary Algorithms

The huge variation in the number and types of organisms that have evolved in nature is paralleled by an equally impressive diversity in the underlying genetic representation. Variation can be found, not only in the size of genomes, but also in the organization of information and the structure of the genomes. The result of this freedom of expression is that natural evolution is virtually unlimited in the types and complexity of the organisms that can be evolved. An entire new field has emerged in computer science to investigate the evolution of complexity and how it may be applied as problem-solving tools (Fogel, Owens, & Walsh, 1966; Holland, 1975; Koza, 1992; Rechenberg, 1973). Evolutionary computation systems traditionally employ a much more rigid representation of information than natural systems. Though these simpler, fixed representations may be easier to analyze, they also limit the scope and complexity of what may be evolved. We believe that it is time to seriously investigate the impact of more complex, variable representations on artificial evolutionary systems. The goal of this special issue is to examine the issues involved in extending the representational complexity of evolutionary algorithms (EA) and how this affects an EAs ability to evolve problem solutions. In particular, we focus on the ramifications of introducing variable-length representations and noncoding regions to EAs. A simple but significant difference between natural and computational evolutionary systems is the prevalence of variable-size representations in natural systems. In nature, genome sizes range from as little as lo5 base pairs (bp) for algae to as much as 10" bp for some plants and amphibians (Lewin, 1994). Even within phyla, the range of genome sizes varies from twofold in birds and mammals to more than tenfold for plants and amphibians. Variablesize representations lead naturally to the dynamic organization of information (genes) and to the appearance of noncoding or unexpressed segments in the genome. Noncoding DNA or DNA that does not directly contribute to the production of proteins is thought to make up upwards of 90% of some genomes (Bell, 1988; Nei, 1987). Thus, nature is able to vary both the amount and ratio of coding and noncoding regions in a genome, which, in turn, is thought to influence the shuffling or recombination of the coding regions (Gilbert, 1987). A brief review of the genetic process and a discussion of the different types of noncoding DNA is presented by Wu and Lindsay (1996b).

[1]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[2]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[3]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[4]  Justinian Rosca,et al.  Generality versus size in genetic programming , 1996 .

[5]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[6]  Terence Soule,et al.  Code growth in genetic programming , 1996 .

[7]  Annie S. Wu,et al.  Empirical Studies of the Genetic Algorithm with Noncoding Segments , 1995, Evolutionary Computation.

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

[9]  Annie S. Wu,et al.  A Comparison of the Fixed and Floating Building Block Representation in the Genetic Algorithm , 1996, Evolutionary Computation.

[10]  SAGAInman HarveyCSRP Species Adaptation Genetic Algorithms: A Basis for a Continuing SAGA , 1992 .

[11]  P. Nordin,et al.  Explicitly defined introns and destructive crossover in genetic programming , 1996 .

[12]  Riccardo Poli,et al.  Fitness Causes Bloat , 1998 .

[13]  Peter Nordin,et al.  Complexity Compression and Evolution , 1995, ICGA.

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  W. Gilbert,et al.  The exon theory of genes. , 1987, Cold Spring Harbor symposia on quantitative biology.

[16]  Annie S. Wu,et al.  A Survey of Intron Research in Genetics , 1996, PPSN.

[17]  John R. Koza,et al.  Genetic programming (videotape): the movie , 1992 .

[18]  Lothar Thiele,et al.  Genetic Programming and Redundancy , 1994 .

[19]  James R. Levenick Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[20]  Lawrence J. Fogel,et al.  Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming , 1999 .

[21]  M. Nei Molecular Evolutionary Genetics , 1987 .