Accessibility navigation


Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes

Hutt, B. and Warwick, K. (2005) Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes. Lecture Notes in Artificial Intelligence, 3630. pp. 926-935. ISSN 3540288481

Full text not archived in this repository.

Abstract/Summary

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 non-random crossover points based on the common parental sequence similarity. The SVLC Algorithm recurrently "glues" or synapses homogenous genetic sub-sequences 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 is shown to outperform current variable length crossover techniques. The SVLC algorithm is also shown to work in a more realistic robot neural network controller evolution application.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science > School of Systems Engineering
ID Code:15289
Additional Information:Proceedings Paper 8th European Conference on Artifical Life (Advances in Artifical Life) SEP 05-09, 2005 Canterbury, ENGLAND

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation