Using Schema Theory To Explore Interactions Of Multiple Operators

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

  author =       "Nicholas Freitag {McPhee} and Riccardo Poli",
  title =        "Using Schema Theory To Explore Interactions Of
                 Multiple Operators",
  booktitle =    "GECCO 2002: Proceedings of the Genetic and
                 Evolutionary Computation Conference",
  editor =       "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and 
                 R. Roy and D. Davis and R. Poli and K. Balakrishnan and 
                 V. Honavar and G. Rudolph and J. Wegener and 
                 L. Bull and M. A. Potter and A. C. Schultz and J. F. Miller and 
                 E. Burke and N. Jonoska",
  year =         "2002",
  pages =        "853--860",
  address =      "New York",
  publisher_address = "San Francisco, CA 94104, USA",
  month =        "9-13 " # jul,
  publisher =    "Morgan Kaufmann Publishers",
  keywords =     "genetic algorithms, genetic programming, operator
                 bias, operator interaction, operator proportion, schema
                 theory, variable length linear structures",
  ISBN =         "1-55860-878-8",
  URL =          "",
  URL =          "",
  URL =          "",
  abstract =     "In the last two years the schema theory for Genetic
                 Programming (GP) has been applied to the problem of
                 understanding the length biases of a variety of
                 crossover and mutation operators on variable length
                 linear structures. In these initial papers, operators
                 were studied in isolation. In practice, however, they
                 are typically used in various combinations, and in this
                 paper we present the first schema theory analysis of
                 the complex interactions of multiple operators. In
                 particular, we apply the schema theory to the use of
                 standard subtree crossover, full mutation, and grow
                 mutation (in varying proportions) to variable length
                 linear structures in the one-then-zeros problem. We
                 then show how the results can be used to guide choices
                 about the relative proportion of these operators in
                 order to achieve certain structural goals during a
  notes =        "GECCO-2002. A joint meeting of the eleventh
                 International Conference on Genetic Algorithms
                 (ICGA-2002) and the seventh Annual Genetic Programming
                 Conference (GP-2002)",

Genetic Programming entries for Nicholas Freitag McPhee Riccardo Poli