Crossover-based tree distance in genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 12, Issue 4, 2008, Pages 506-524

  Gustafson, Steven ^a   Vanneschi, Leonardo ^b  

^a GE GLOBAL RESEARCH   (United States)

^b UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

Distance measures; Diversity; Genetic programming (GP); Operators

Indexed keywords

COMPUTER PROGRAMMING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; GENETIC PROGRAMMING; LEARNING ALGORITHMS; STANDARDS; TREES (MATHEMATICS);

DISTANCE MEASURES; DISTANCE METRICS; DIVERSITY; FITNESS SHARING; FITNESS-DISTANCE CORRELATION; GENETIC PROGRAMMING (GP); OPERATORS; POPULATION EVOLUTION; SEARCH ALGORITHMS; SEARCH PROCESSES; SEARCH SPACES; SYNTAX TREES; VARIATION OPERATORS;

MATHEMATICAL TRANSFORMATIONS;

EID: 49049098323     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.915993     Document Type: Article

References (28)

1. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
2. T. Jones, "Evolutionary algorithms, fitness landscapes and search," Ph.D. dissertation, Univ. New Mexico, Albuquerque, NM, 1995.
3. M. Tomassini, L. Vanneschi, P. Collard, and M. Clergue, "A study of fitness distance correlation as a difficulty measure in genetic programming," Evol. Comput., vol. 13, no. 2, pp. 213-239, 2005.
4. L. Vanneschi, M. Tomassini, P. Collard, and M. Clergue, "Fitness distance correlation in structural mutation genetic programming," in Proc. Eur. Conf. Genetic Programming, C. Ryan et al., Ed., April 14-16, 2003, vol. 2610, Lecture Notes in Computer Science, pp. 459-468.
5. L. Vanneschi, "Theory and Practice for Efficient Genetic Programming," Ph.D. dissertation, Univ. Lausanne, 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, vol. 5, no. 3, pp. 271-290, 2004.
7. S. Gustafson, "An Analysis of Diversity in Genetic Programming," Ph.D. dissertation, School of Comput. Sci. Inf. Technol., Univ. Nottingham, Nottingham, U.K., Feb. 2004.
8. E. K. Burke, S. Gustafson, and G. Kendall, "Diversity in genetic programming: An analysis of measures and correlation with fitness," IEEE Trans. Evol. Comput., vol. 8, no. 1, pp. 47-62, Feb. 2004.
9. N. F. McPhee and N. J. Hopper, "Analysis of genetic diversity through population history," in Proc. Genetic and Evol. Comput. Conf., W. Banzhaf et al., Ed., pp. 1112-1120.
10. L. Altenberg, "Fitness distance correlation analysis: An instructive counterexample," in Proc. 7th Int. Conf. Genetic Algorithms, T. Back, Ed., 1997, pp. 57-64.
11. T. Jones and S. Forrest, "Fitness distance correlation as a measure of problem difficulty for genetic algorithms," in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 184-192.
12. R. J. Quick, V. J. Rayward-Smith, and G. D. Smith, "Fitness distance correlation and ridge functions," in Proc. 5th Conf. Parallel Problems Solving From Nature (PPSN'98), 1998, pp. 77-86.
13. U.-M. O'Reilly and D. E. Goldberg, "How fitness structure affects subsolution acquisition in genetic programming," in Proc. 3rd Annu. Genetic Programming Conf., J. R. Koza et al., Ed., Madison, WI, Jul. 22-25, 1998, pp. 269-277.
14. U.-M. O'Reilly and F. Oppacher, "Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing," in Parallel Problem Solving From Nature, Y. Davidor et al., Ed. Berlin, Germany: Springer-Verlag, Oct. 9-14, 1994, vol. 866, Lecture Notes in Computer Science, pp. 397-406.
15. A. Ekárt and S. Z. Németh, "Maintaining the diversity of genetic programs," in Proc. 5th Eur. Conf., Genetic Programming, EuroGP'2002 J. A. Foster et al., Ed., 2002, vol. 2278, Lecture Notes in Computer Science, pp. 162-171.
16. M. Brameier and W. Banzhaf, "Explicit control of diversity and effective variation distance in linear genetic programming," in Proc. 5th Eur. Conf. Genetic Programming, A. G. B. Tettamanzi et al., Ed., Apr. 2002, vol. 2278, Lecture Notes in Computer Science, pp. 162-171.
17. A. Moraglio, "Geometric unification of evolutionary algorithms," in Proc. Eur. Graduate Student Workshop Evol. Comput., M. Giacobini and J. van Hemert, Eds., Apr. 10, 2006, pp. 45-58.
18. A. Moraglio and R. Poli, "Topological crossover for the permutation representation," in Proc. 2005 Workshops on Genetic and Evol. Comput. GECCO'05, 2005, pp. 332-338.
19. S. Gustafson and L. Vanneschi, "Operator-based distance for genetic programming: Subtree crossover distance," in Proc. 8th Eur. Conf. Genetic Programming, EuroGP'2005, M. Keijzer et al., Ed., 2005, vol. 3447, Lecture Notes in Computer Science, pp. 178-189.
20. L. Vanneschi, S. Gustafson, and G. Mauri, "Using subtree crossover distance to investigate genetic programming dynamics," in Proc. 9th Eur. Conf. Genetic Programming, EuroGP'2006, P. Collet et al., Ed., 2006, vol. 3905, Lecture Notes in Computer Science, pp. 238-249.
21. M. Wineberg and F. Oppacher, "Distance between populations," in Proc. Genetic and Evol. Comput. Conf., E. Cantú-Paz et al., Ed., 2003, vol. 2724, Lecture Notes in Computer Science, pp. 1481-1492.
22. R. Poli and N. F. McPhee, "General schema theory for genetic programming with subtree-swapping crossover: Part I," Evol. Comput. vol. 11, no. 1, pp. 53-66, 2003.
23. J. M. Daida, H. Li, R. Tang, and A. M. Hilss, "What makes a problem GP-hard? Validating a hypothesis of structural causes," in Proc. Genetic and Evol. Comput., E. Cantú-Paz et al., Ed., vol. 2724, Lecture Notes in Computer Science, pp. 1665-1677.
24. K. Deb and D. E. Goldberg, Analyzing Deception in Trap Functions. San Mateo, CA: Morgan Kaufmann, 1993, pp. 93-108.
25. J. M. Daida, H. Li, R. Tang, and A. M. Hilss, ":WHat makes a problem GP-hard? Validating a hypothesis of structural causes," in Proc. Genetic and Evol. Comput. - GECCO'2003, E. Cantú-Paz et al., Ed., Jul. 12-16, 2003, vol. 2724, Lecture Notes in Computer Science, pp. 1729-1739.
26. N. X. Hoai, R. I. BobMcKay, and D. L. Essam, "Representation and structural difficulty in genetic programming," IEEE Trans. Evol. Comput., vol. 10, no. 2, pp. 157-166, Apr. 2006.
27. B. Punch, D. Zongker, and E. Goodman, ":THe royal tree problem, a benchmark for single and multiple population genetic programming," in Advances in Genetic Programming 2, P. Angeline and K. Kinnear, Eds. Cambridge, MA: MIT Press, 1996, pp. 299-316.
28. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.