Abstract
Biological Crossover occurs during the early stages of meiosis. During this process the chromosomes undergoing crossover are synapsed together at a number of homogenous sequence sections, it is within such synapsed sections that crossover occurs. The SVLC (Synapsing Variable Length Crossover) Algorithm recurrently synapses homogenous genetic sequences together in order of length. The genomes are considered to be flexible with crossover only being permitted within the synapsed sections. Consequently, common sequences are automatically preserved with only the genetic differences being exchanged, independent of the length of such differences. 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 utilised. In a simple variable length test problem the SVLC algorithm outperforms current variable length crossover techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D., K. Deb, B. Korb (1989). Messy genetic algorithms: motivation, analysis, and first results. In Complex Systems 3: 493–530.
Fullmer, B., Miikkulainen, R. (1991). Using Marker-Based Genetic Encoding of Neural Networks to evolve Finite-State Behaviour. In Varela, F., Bourgine, P. (eds.), Proceedings of the First European Conference on Artificial Life. MIT Press.
Koza, J. (1990). A paradigm for genetically breeding computer programs to solve problems. Technical Report STAN-CS-90-1314, Department of Computer Science, Stanford University.
Lee, C., Antonsson, E.. (2000). Variable Length Genomes for Evolutionary Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kauffman, p. 806.
Harvey, I. (1992). “The SAGA cross: the mechanics of crossover for variable-length genetic algorithms”. In Männer, R, Manderick, B. (eds.), Parallel Problem Solving from Nature 2: 269–278.
Burke, D., De Jong, K., Grefenstette, J., Ramsey, C., Wu, A. (1998). Putting More Genetics into Genetic Algorithms. In Whitley, D. (ed.), Evolutionary Computation 6(4): 387–410.
Kimball, J. (1994). Biology. McGraw Hill Education.
Harvey, I. (1992). Species adaptation genetic algorithms: a basis for a continuing SAGA. In Varela, F., Bourgine, P. (eds.), Proceedings of the First European Conference on Artificial Life, MIT Press, pp. 346–354
Harvey, I. (2001). Artificial Evolution: A Continuing SAGA. In Gomi, T. (ed.), Evolutionary Robotics: From Intelligent Robots to Artificial Life, Proc. of 8th Intl. Symposium on Evolutionary Robotics. Springer-Verlag Lecture Notes in Computer Science LNCS 2217 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Wien
About this paper
Cite this paper
Hutt, B., Warwick, K. (2003). Synapsing Variable Length Crossover: Biologically Inspired Crossover for Variable Length Genomes. In: Pearson, D.W., Steele, N.C., Albrecht, R.F. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0646-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-7091-0646-4_36
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-00743-3
Online ISBN: 978-3-7091-0646-4
eBook Packages: Springer Book Archive