Genetic Programming Bloat without Semantics

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

  author =       "W. B. Langdon and W. Banzhaf",
  title =        "Genetic Programming Bloat without Semantics",
  booktitle =    "Parallel Problem Solving from Nature - PPSN VI 6th
                 International Conference",
  year =         "2000",
  editor =       "Marc Schoenauer and Kalyanmoy Deb and 
                 G{\"u}nter Rudolph and Xin Yao and Evelyne Lutton and 
                 Juan Julian Merelo and Hans-Paul Schwefel",
  volume =       "1917",
  series =       "LNCS",
  pages =        "201--210",
  address =      "Paris, France",
  month =        "16-20 " # sep,
  publisher =    "Springer Verlag",
  keywords =     "genetic algorithms, genetic programming, evolution of
                 shape, subquadratic length growth, linear depth growth,
                 binary tree search spaces",
  URL =          "",
  URL =          "",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.1007/3-540-45356-3_20",
  abstract =     "To investigate the fundamental causes of bloat, six
                 artificial random binary tree search spaces are
                 presented. Fitness is given by program syntax (the
                 genetic programming genotype). GP populations are
                 evolved on both random problems and problems with
                 ``building blocks''. These are compared to problems
                 with explicit ineffective code (introns, junk code,
                 inviable code). Our results suggest the entropy random
                 walk explanation of bloat remains viable. The hard
                 building block problem might be used in further
                 studies, e.g. of standard subtree crossover.",
  notes =        "C++ code at


Genetic Programming entries for William B Langdon Wolfgang Banzhaf