General schema theory for genetic programming with subtree-swapping crossover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2038, Issue , 2001, Pages 143-159

  Poli, Riccardo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING;

CROSSOVER OPERATOR; CROSSOVER POINTS; EVOLUTION EQUATIONS; REFERENCE SYSTEMS; SCHEMA THEOREMS; SCHEMA THEORY; SIZE AND SHAPE; SUBTREE SWAPPING;

PROGRAMMING THEORY;

EID: 84937403614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45355-5_12     Document Type: Conference Paper

References (24)

1. L. Altenberg. Emergent phenomena in genetic programming. In A. V. Sebald and L. J. Fogel, editors, Evolutionary Programming-Proceedings of the Third Annual Conference, pages 233-241.World Scientific Publishing, 1994.
2. L. Altenberg. The Schema Theorem and Price’s Theorem. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 23-49, Estes Park, Colorado, USA. 1995.Morgan Kaufmann.
3. P. D’haeseleer. Context preserving crossover in genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 256-261, Orlando, Florida, USA, 27-29 June 1994. IEEE Press.
4. D. E. Goldberg. Genetic algorithms and Walsh functions: II. Deception and its analysis. Complex Systems, 3(2):153-171, Apr 1989.
5. J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, USA, 1975.
6. J. R. Koza. Genetic Programming:On the Programming of Computers byMeans of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
7. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. Genetic Programming And Evolvable Machines, 1(1/2):95-119, Apr 2000.
8. N. F. McPhee and R. Poli. A schema theory analysis of the evolution of size in genetic programming with linear representations. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr 2001. Springer-Verlag.
9. D. J. Montana. Strongly typed genetic programming. EvolutionaryComputation, 3(2):199-230, 1995.
10. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
11. U.-M. O’Reilly and F. Oppacher. The troubling aspects of a building block hypothesis for genetic programming. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 73-88, Estes Park, Colorado, USA, 31 July-2Aug. 1994 1995.Morgan Kaufmann.
12. R. Poli. Exact schema theorem and effective fitness for GP with one-point crossover. In D. Whitley, et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 469-476, Las Vegas, July 2000.Morgan Kaufmann.
13. R. Poli. General schema theory for genetic programming with subtree-swapping crossover. Technical Report CSRP-00-16, University of Birmingham, School of Computer Science, November 2000.
14. R. Poli. Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. In R. Poli, W. Banzhaf, and et al., editors, Genetic Programming, Proceedings of EuroGP 2000. Springer-Verlag, 15-16 Apr 2000.
15. R. Poli. Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genetic Programming and Evolvable Machines, 2(2), 2001. Forthcoming.
16. R. Poli and W. B. Langdon. Genetic programming with one-point crossover. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, pages 180-189. Springer-Verlag London, 1997.
17. R. Poli and W. B. Langdon. A new schema theory for genetic programming with one-point crossover and point mutation. In J. R. Koza, et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 278-285, Stanford University, CA, USA, 13-16 July 1997.Morgan Kaufmann.
18. R. Poli and W. B. Langdon. Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation, 6(3):231-252, 1998.
19. R. Poli, W. B. Langdon, and U.-M. O’Reilly. Analysis of schema variance and short term extinction likelihoods. In J. R. Koza, et al., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 284-292, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998.Morgan Kaufmann.
20. R. Poli and N. F. McPhee. Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr 2001. Springer-Verlag.
21. J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
22. C. R. Stephens and H. Waelbroeck. Effective degrees of freedom in genetic algorithms and the block hypothesis. In T. B¨ack, editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), pages 34-40, East Lansing, 1997. Morgan Kaufmann.
23. C. R. Stephens and H. Waelbroeck. Schemata evolution and building blocks. Evolutionary Computation, 7(2):109-124, 1999.
24. P. A. Whigham. A schema theorem for context-free grammars. In 1995 IEEE Conference on Evolutionary Computation, volume 1, pages 178-181, Perth, Australia, 29 Nov.-1 Dec 1995. IEEE Press.