Evolving Computer Programs without Subtree Crossover

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

@Article{Chellapilla:1998:eptm,
  author =       "Kumar Chellapilla",
  title =        "Evolving Computer Programs without Subtree Crossover",
  journal =      "IEEE Transactions on Evolutionary Computation",
  year =         "1997",
  volume =       "1",
  number =       "3",
  pages =        "209--216",
  month =        sep,
  keywords =     "genetic algorithms, genetic programming, symbolic
                 expressions, Evolutionary Programming, variation
                 operators",
  ISSN =         "1089-778X",
  doi =          "doi:10.1109/4235.661552",
  abstract =     "An evolutionary programming procedure is used for
                 optimising computer programs in the form of symbolic
                 expressions. Six tree mutation operators are proposed.
                 Recombination operators such as crossover are not
                 included. The viability and efficiency of the method is
                 extensively investigated on a set of well-studied
                 problems. The evidence indicates that the technique is
                 not only viable but is indeed capable of evolving good
                 computer programs. The results compare well with other
                 evolutionary methods that rely on crossover to solve
                 the same problems",
  notes =        "negative results on building block hypothesis, C++
                 code available, Compares use of EP using 6 types of
                 tree mutation with GP on: 6-mux, 3, 4, 5, 6 parity,
                 symbolic regression, two box, two spirals, Santa Fe
                 trail artificial ant, cart centering, 4 variation on
                 broom balancing. In general EP wins in terms of Effort
                 to find the solution. Gives algorithm used to create
                 initial random trees",
}

Genetic Programming entries for Kumar Chellapilla