%0 Report %1 poli:1997:schemaTR %A Poli, Riccardo %A Langdon, W. B. %C The University of Birmingham, B15 2TT, UK %D 1997 %K POP-11 algorithms, genetic programming, %N CSRP-97-3 %T A New Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation %U ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-03.ps.gz %X In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is quite close to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this concept of schema has been used to derive an improved schema theorem for GP which describes the propagation of schemata from one generation to the next. In the paper we discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.

@techreport{poli:1997:schemaTR, abstract = {In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is quite close to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this concept of schema has been used to derive an improved schema theorem for GP which describes the propagation of schemata from one generation to the next. In the paper we discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {The University of Birmingham, B15 2TT, UK}, author = {Poli, Riccardo and Langdon, W. B.}, biburl = {https://www.bibsonomy.org/bibtex/27a53beb7e94af41fa65be1982145e7d1/brazovayeye}, institution = {School of Computer Science}, interhash = {243ebec1f44f946ca5a653030f3e4d2e}, intrahash = {7a53beb7e94af41fa65be1982145e7d1}, keywords = {POP-11 algorithms, genetic programming,}, month = {January}, note = {Presented at GP-97}, notes = {Originally 9 pages (see \cite{poli:1998:schema}, \cite{poli:1997:schema}), Revisised August 1997}, number = {CSRP-97-3}, size = {25 pages}, timestamp = {2008-06-19T17:49:38.000+0200}, title = {A New Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation}, type = {Technical Report}, url = {ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-03.ps.gz}, year = 1997 }