Operator-based distance for genetic programming: Subtree crossover distance

Lecture Notes in Computer Science

Volumn 3447, Issue , 2005, Pages 178-189

  Gustafson, Steven ^a   Vanneschi, Leonardo ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CORRELATION METHODS; MATHEMATICAL OPERATORS; TREES (MATHEMATICS);

FITNESS DISTANCE CORRELATION; GENETIC OPERATORS; GENETIC PROGRAMMING; TREE STRUCTURES;

GENETIC ALGORITHMS;

EID: 24644469160     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31989-4_16     Document Type: Conference Paper

References (12)

1. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
2. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 184-192, San Francisco, CA, 1995. Morgan Kaufmann.
3. P. Collard, M. Clergue, M. Tomassini, and L. Vanneschi, A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation, in press.
4. L. Vanneschi, M. Tomassini, P. Collard, and M. Clergue. Fitness distance correlation in structural mutation genetic programming. In C. Ryan et al., editors, Genetic Programming, Proceedings of the European Conference, volume 2610 of LNCS, pages 459-468, Essex, 14-16 April 2003. Springer-Verlag.
5. L. Vanneschi. Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, University of Lausanne, Switzerland, 2004.
6. S. Gustafson, A. Ekárt, E.K. Burke, and G. Kendall. Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Hardware, 5(3):271-290, 2004.
7. S. Gustafson. An Analysis of Diversity in Genetic Programming. PhD thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, England, February 2004.
8. E.K. Burke, S. Gustafson, and G. Kendall. Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation, 8(1):47-62, 2004.
9. N.F. McPhee and N.J. Hopper. Analysis of genetic diversity through population history. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1112-1120, FL, USA, 1999. Morgan Kaufmann.
10. M. Wineberg and F. Oppacher. Distance between populations. In E. Cantú-Paz et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2724 of LNCS, pages 1481-1492, Chicago, USA, 2003. Springer-Verlag.
11. R. Poli and N.F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part i. Evolutionary Computation, 11(1):53-66, 2003.
12. J.M. Daida, H. Li, R. Tang, and A.M. Hilss. What makes a problem GP-hard? validating a hypothesis of structural causes. In E. Cantú-Paz et al., editors, Proceedings of the Genetic and Evolutionary Computation, volume 2724 of LNCS, pages 1665-1677, Chicago, IL, USA, 12-16 July 2003. Springer-Verlag.