Location of Repository

Crossover operators to control size growth in linear GP and variable length GAs

By Dominique Chu

Abstract

In various nuances of evolutionary algorithms it has been observed that variable sized genomes exhibit large degrees of redundancy and corresponding undue growth. This phenomenon is commonly referred to as bloat. The present contribution investigates the role of crossover operators as the cause for length changes in variable length genetic algorithms and linear GP. Three crossover operators are defined; each is tested with three different fitness functions. The aim of this article is to indicate suitable designs of crossover operators that allow efficient exploration of designs of solutions of a wide variety of sizes, while at the same time avoiding bloat

Topics: QA76
Publisher: IEEE
Year: 2008
OAI identifier: oai:kar.kent.ac.uk:24036

Suggested articles

Preview

Citations

  1. (2002). Allele diffusion in linear genetic programming and variable-length genetic algorithms with subtree crossover. doi
  2. (2005). Coevolutionary species adaptation genetic algorithms: A continuing saga on coupled ļ¬tness landscapes. doi
  3. (1997). Dynamics of Complex Systems. doi
  4. (1998). Effects of code growth and parsimony pressure on populations in genetic programming. doi
  5. (2004). Exact schema theory and markov chain models for genetic programming and variable-length genetic algorithms with homologous crossover. doi
  6. Fighting bloat with nonparametric parsimony pressure. In doi
  7. (1997). Fitness causes bloat. In doi
  8. (1989). Genetic Algorithms in Search, Optimization doi
  9. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. doi
  10. (1990). Learning sequential decision rules using simulation models and competition. doi
  11. (2002). Lexicographic parsimony pressure. doi
  12. (2003). Minimal Model for Genome Evolution and Growth. Physical Review Letters, doi
  13. (2003). Neutral variations cause bloat in linear GP. doi
  14. (2004). Preliminary studies on the in silico evolution of biochemical networks. doi
  15. Resource-limited genetic programming: Replacing tree depth limits. doi
  16. (2005). Resource-limited genetic programming: the dynamic approach. doi
  17. (2002). Some considerations on the reason for bloat.
  18. (1992). Species adaptation genetic algorithms: a basis for a continuing SAGA. doi
  19. (2001). The effects of crossover and mutation operators on variable length linear structures. In
  20. (1999). The evolution of size and shape.
  21. (2002). The proportional genetic algorithm: Gene expression in a genetic algorithm,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.