Synapsing Variable-Length Crossover: Meaningful Crossover for Variable-Length Genomes

The synapsing variable-length crossover (SVLC) algorithm provides a biologically inspired method for performing meaningful crossover between variable-length genomes. In addition to providing a rationale for variable-length crossover, it also provides a genotypic similarity metric for variable-length genomes, enabling standard niche formation techniques to be used with variable-length genomes. Unlike other variable-length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses nonrandom crossover points based on the common parental sequence similarity. The SVLC algorithm recurrently "glues" or synapses homogenous genetic subsequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable-length test problem, the SVLC algorithm compares favorably with current variable-length crossover techniques. The variable-length approach is further advocated by demonstrating how a variable-length genetic algorithm (GA) can obtain a high fitness solution in fewer iterations than a traditional fixed-length GA in a two-dimensional vector approximation task

[1]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[2]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[3]  Inman Harvey Open the Box , 2007 .

[4]  Benjamin David Hutt Evolving artificial neural network controllers for robots using species-based methods , 2002 .

[5]  A. I.,et al.  Neural Field Continuum Limits and the Structure–Function Partitioning of Cognitive–Emotional Brain Networks , 2023, Biology.

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

[7]  R. Gregory The evolution of the genome , 2005 .

[8]  Kevin Warwick,et al.  Emergent Behaviour in Autonomous Robots , 2004 .

[9]  R. Dawkins The Blind Watchmaker , 1986 .

[10]  Brad Fullmer and Risto Miikkulainen Using Marker-Based Genetic Encoding Of Neural Networks To Evolve Finite-State Behaviour , 1991 .

[11]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Makoto Fujiyoshi Evolutionary Robotics from Intelligent Robots to Artificial Life , 1998 .

[14]  Dave Cliff,et al.  Challenges in evolving controllers for physical robots , 1996, Robotics Auton. Syst..

[15]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[16]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

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

[18]  C.-Y. Lee,et al.  Variable Length Genomes for Evolutionary Algorithms , 2000, GECCO.

[19]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[20]  Larry Bull,et al.  Coevolutionary Species Adaptation Genetic Algorithms: A Continuing SAGA on Coupled Fitness Landscapes , 2005, ECAL.

[21]  Inman Harvey Artificial Evolution: A Continuing SAGA , 2001, EvoRobots.

[22]  J. Root,et al.  Open the box , 1986 .

[23]  Xiaoou Tang,et al.  Evolutionary Search for Faces from Line Drawings , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Annie S. Wu,et al.  Putting More Genetics into Genetic Algorithms , 1998, Evolutionary Computation.

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