An analysis of constructive crossover and selection pressure in genetic programming

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1739-1748

  Xie, Huayang ^a   Zhang, Mengjie ^a   Andreae, Peter ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Crossover; Genetic programming; Selection pressure; Stochastic elements

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

CROSSOVER; SELECTION PRESSURE; STOCHASTIC ELEMENTS;

GENETIC PROGRAMMING;

EID: 34548076914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277297     Document Type: Conference Paper

References (15)

1. T. Blickle and L. Thiele. A mathematical analysis of tournament selection. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 9-16. Morgan Kaufmann, 1995.
2. C. B. D.J. Newman, S. Hettich and C Merz. UCI repository of machine learning databases, 1998.
3. A. E. Eiben and C A. Schippers. On evolutionary exploration and exploitation. Fundamenta Informaticae, 35(1-4):35-50, 1998.
4. S. M. Gustafson. An Analysis of Diversity in Genetic Programming. PhD thesis, University of Nottingham, 2004.
5. K. Harries and P. Smith. Exploring alternative operators and search strategies in genetic programming. In J. R. Koza, et al, editors, Genetic Programming 1991: Proceedings of the Second Annual Conference, pages 147-155, Stanford University, CA, USA, 1997. Morgan Kaufmann.
6. J. R. Koza. Genetic Programming -On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, 1992.
7. J. R. Koza. A response to the ML-95 paper entitled "Hill climbing beats genetic search on a boolean circuit synthesis of Koza's". Distributed 11 July 1995 at the 1995 International Machine Learning Conference in Tahoe City, California, USA, 11 July 1995.
8. K. J. Lang. Hill climbing beats genetic search on a boolean circuit synthesis of Koza's. In Proceedings of the Twelfth International Conference on Machine Learning, 1995. Morgan Kaufmann.
9. S. W. Mahfoud. Crowding and preselection revisited. In R. Männer and B. Manderick, editors, Parallel problem solving from nature 2, pages 27-36, Amsterdam, 1992. North-Holland.
10. H. Majeed and C. Ryan. A less destructive, context-aware crossover operator for GP. In P. Collet and et al, editors, Proceedings of EuroGP 2006, volume 3905 of LNCS, pages 36-48. Springer-Verlag, 2006.
11. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference, pages 310-317, Pittsburgh, PA, USA, 15-19 1995. Morgan Kaufmann.
12. P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In J. P. Rosea, editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 6-22, 1995.
13. S. J. Russell and P. Norvig. Artificial Intelligence - A modern approach. Pearson Education, New Jersey, US, 2nd edition, 2003.
14. W. A. Tackett. Recombination, selection, and the genetic construction of computer programs. PhD thesis, University of Southern California, Los Angeles, CA, USA, 1994.
15. M. D. Terrio and M. I. Heywood. On naive crossover biases with reproduction for simple solutions to classification problems. In K. Deb, et al, editors, GECCO-2004, Part II, volume 3103 of LNCS, pages 678-689, Seattle, WA, USA, 2004. Springer-Verlag.