Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics
To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance measures can make this analysis more accurate and reliable than using distance measures which have no relationship with the genetic operators. This paper extends a recent definition of a distance measure based on subtree crossover for genetic programming. Empirical studies are presented that show the suitability of this measure to dynamically calculate the fitness distance correlation coefficient during the evolution, to construct a fitness sharing system for genetic programming and to measure genotypic diversity in the population. These experiments confirm the accuracy of the new measure and its consistency with the subtree crossover genetic operator.
KeywordsGlobal Optimum Genetic Programming Edit Distance Share System Structural Distance
Unable to display preview. Download preview PDF.
- 3.Gustafson, S.: An Analysis of Diversity in Genetic Programming. PhD thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, England (February 2004)Google Scholar
- 5.McPhee, N.F., Hopper, N.J.: Analysis of genetic diversity through population history. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, FL, USA, pp. 1112–1120. Morgan Kaufmann, San Francisco (1999)Google Scholar
- 8.Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184–192. Morgan Kaufmann, San Francisco (1995)Google Scholar
- 10.Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness distance correlation in structural mutation genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 459–468. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 11.Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, University of Lausanne, Switzerland (2004)Google Scholar
- 14.Punch, B., Zongker, D., Goodman, E.: The royal tree problem, a benchmark for single and multiple population genetic programming. In: Angeline, P., Kinnear, K. (eds.) Advances in Genetic Programming 2, pp. 299–316. The MIT Press, Cambridge (1996)Google Scholar