Genetic Programming and Redundancy

Created by W.Langdon from gp-bibliography.bib Revision:1.4192

  author =       "Tobias Blickle and Lothar Thiele",
  title =        "Genetic Programming and Redundancy",
  booktitle =    "Genetic Algorithms within the Framework of
                 Evolutionary Computation (Workshop at KI-94,
  editor =       "J. Hopf",
  publisher =    "Max-Planck-Institut f{\"u}r Informatik
  address =      "

                 Im Stadtwald, Building 44, D-66123 Saarbr{\"u}cken,

  pages =        "33--38",
  year =         "1994",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "",
  size =         "6 pages",
  notes =        "From GP list Wed, 22 Mar 95 we did some work on the
                 convergence problem and the redundancy in the trees in
                 GP. It turned out that {"}bloating{"} is a property of
                 GP that arises from the fact that more redundant trees
                 have a higher probability to survive crossover. As a
                 result, the redundant part of the trees grow bigger and
                 bigger because the increased proportion of redundant
                 {"}cut-sites{"} in the tree again lead to a higher
                 probability to survive crossover.

                 Gives a formula for tournament size related to
                 proportion of crossover in a generational GP. Ie
                 recommending T=10 for pc=0.9. This does not apply to
                 steady state GA.


Genetic Programming entries for Tobias Blickle Lothar Thiele