Two Fast Tree-Creation Algorithms for Genetic Programming

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

@Article{luke:2000:2ftcaGP,
  author =       "Sean Luke",
  title =        "Two Fast Tree-Creation Algorithms for Genetic
                 Programming",
  journal =      "IEEE Transactions on Evolutionary Computation",
  year =         "2000",
  volume =       "4",
  number =       "3",
  pages =        "274--283",
  month =        sep,
  keywords =     "genetic algorithms, genetic programming, Population
                 Initialization, Tree Creation, Subtree Mutation, Tree
                 Growth, Introns, Bloat",
  size =         "9 pages",
  URL =          "http://ieeexplore.ieee.org/iel5/4235/18897/00873237.pdf",
  URL =          "http://www.cs.gmu.edu/~sean/papers/treecreation.pdf",
  URL =          "http://www.cs.gmu.edu/~sean/papers/treecreation.ps.gz",
  URL =          "http://citeseer.ist.psu.edu/409667.html",
  abstract =     "Genetic programming is an evolutionary optimization
                 method that produces functional programs to solve a
                 given task. These programs commonly take the form of
                 trees representing LISP s-expressions, and a typical
                 evolutionary run produces a great many of these trees.
                 For this reason, a good tree generation algorithm is
                 very important to genetic programming. This paper
                 presents two new tree-generation algorithms for genetic
                 programming and for strongly-typed genetic programming,
                 a common variant. These algorithms are fast, allow the
                 user to request specific tree sizes, and guarantee
                 probabilities of certain nodes appearing in trees. The
                 paper analyzes these two algorithms and compares them
                 with traditional and recently proposed approaches.",
}

Genetic Programming entries for Sean Luke

Citations