Is increased diversity in genetic programming beneficial? An analysis of lineage selection

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1398-1405

  Burke, Edmund K ^a   Gustafson, Steven ^a   Kendall, Graham ^a   Krasnogor, Natalio ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

ARTIFICIAL ANT; GENETIC DIVERSITY; GENETIC MATERIALS; LINEAGE SELECTION; PROBLEM DOMAIN; REGRESSION PROBLEM; SYMBOLIC REGRESSION;

GENETIC PROGRAMMING;

EID: 84871486396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299834     Document Type: Conference Paper

References (29)

1. M. Brameier and W. Banzhaf. Explicit control of diversity and effective variation distance in linear genetic programming. In Genetic Programming, Proceedings of the 5th European Conference, volume 2278 of LNCS, pages 162-171, Kinsale, Ireland, April 2002. Springer-Verlag.
2. E. Burke, S. Gustafson and G. Kendall. A survey and analysis of diversity measures in genetic programming. In W. B. Langdon et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 716-723, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
3. E. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. Advanced population diversity measures in genetic programming. in J.J Merelo Guervos et al., editors, Seventh International Conference on Parallel Problem Solving from Nature, volume 2439 of LNCS, pages 341-350, Granada, Spain, September 2002. Springer.
4. J.M. Daida, R.R. Bertram, S.A. Stanhope, J.C. Khoo, S.A. Chaudhary, O.A. Chaudhri, and J.A. Polito. What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines, 2(2): 165-191, June 2001.
5. E.D. de Jong, R.A. Watson, and J.B. Pollack. Reducing bloat and promoting diversity using multi-objective methods. In L. Speeior et al.. editors. Proceedings of I he Generic and Evolutionary Computation Conference, pages 11-18. San Francisco, CA, 7-1 1 July 2001. Morgan Kaufmann.
6. A. Ekert and S. Nemeth. Maintaining the diversity ol genetic programs, in J. Foster et al.. editors. Proceedings of the 5th European Genetic Programming Conference, volume 2278 of LNCS, pages 162-171, Kinsale, Ireland, 3-5 April 2002. Springer-Verlag.
7. L.J. Eshelman and J.D. Schaffer. Crossover's niche. In S. Forrest, editor. Proceedings of the Fifth international Conference on Genetic Algorithms, pages 9-14, San Mateo, CA, 1993. Morgan Kaufman.
8. C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In J.R. Koza et al., editors. Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
9. M. Hutter. Fitness uniform selection to preserve genetic diversity. In D.B. Fogel et al., editors, Proceedings of the 2002 Congress on Evolutionary Compulation CEC2002, pages 783-788. IEEE Press, 2002.
10. C. Igel and K. Chellapilla. Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. In W. Banzhaf et a!., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1061-1068, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
11. M. Keijzer. Efficiently representing populations in genetic programming. In P.J. Angeline and K F" Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 13, pages 259- 278. MIT Press, Cambridge, MA, USA, 1996.
12. W.B. Langdon. Data Structures and Genetic Programming: Genetic Programming + Data Structures = Automatic Programming, volume 1 of Genetic Programming. Kluwer, Boston, 24 April 1998.
13. W.B. Langdon. The evolution of size in variable length repre-sentations. In 1998 IEEE International Conference on Evolutional Compulation, pages 633-638, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
14. W.B. Langdon. Size fair and homologous tree genetic pro-gramming crossovers. Genetic Programming and Evolvable Machines, 1(1/2):95-1 19. April 2000.
15. W.B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
16. S. Luke. ECJ: A java-based evolutionary computation and genetic programming system, 2002. http://www.cs.umd.edu/projects/plus/ecj/.
17. S. Luke. Modification point depth and genome growth in genetic programming. Evolutionary Compulation, 11(1 ):67- 106, 2003.
18. S. Luke and L. Panait. Fighting bloat with nonparametric parsimony pressure. In J.-J. Merelo Guervos et al., editors. Parallel Problem Solving from Nature - PPSN VII, number 2439 in Lecture Notes in Computer Science, LNCS, page 411 ff., Granada, Spain, 7-11 September 2002. Springer-Verlag.
19. R.I. McKay. Fitness sharing in genetic programming. In D. Whitley el al., editors. Proceedings of the Genetic and Evolutionary Computation Conference, pages 435-442, Las Vegas. Nevada. USA. 10-12 July 2000. Morgan Kaufmann.
20. 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 Compulation Conference, pages 1112-1120, Florida, USA. 1999. Morgan Kaufmann.
21. P. Monsieurs and E. Flerackers. Reducing population size while maintaining diversity. In C. Ryan et al.. editors. Genetic Programming, Proceedings of EuroGP'2003, volume 2610 of LNCS, pages 145-156, Essex, 14-16 April 2003. Springer-Verlag.
22. U.-M. O'Reilly. Using a distance metric on genetic programs to understand genetic operators. In IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, volume 5. pages 4092-4097, Florida, USA, 1997.
23. U.-M. O'Reilly and F. Oppacher. Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In Y. Davidor et al., editors, Parallel Problem Solving from Nature - PPSN HI, number 866 in Lecture Notes in Computer Science, pages 397-406, Jerusalem, 9-14 October 1994. Springer-Verlag.
24. U.-M. O'Reilly and F. Oppacher. Hybridized crossover- based search techniques for program discovery. In Proceedings of the World Conference on Evolutionary Computation. volume 2, pages 573-578, Perth, Australia, 29 November - I December 1995. IEEE Press.
25. R. Poli. A simple but theoretically-motivated method to control bloat in genetic programming. In C. Ryan et al.. editors, European Conference on Genetic Programming, volume 2610 of LNCS, pages 200-210, Essex. 14-16 April 2003. Springer-Verlag.
26. R. Poli and W.B. Langdon. On the search properties of different crossover operators in genetic programming. In J.R. Koza et al., editors. Proceedings of the Third Annual Genetic Programming Conference, pages 293-301. Wisconsin. USA. 25 July 1998. Morgan Kaufmann.
27. J.P. Rosea. Entropy-driven adaptive representation, in J.P. Rosea, editor. Proceedings of the Workshop on Genetic Programming: From Theory to Real- World Applications, pages 32, Tahoe City. California. USA, 9 July 1995.
28. J.P. Rosea and D.H. Ballard. Rooted-tree schemata in genetic programming. In L. Spector et al.. editors. Advances in Genetic Programming 3. chapter 11, pages 243-271. MIT Press, Cambridge. MA. USA, June 1999.
29. C. Ryan. Pygmies and civil servants. In K.E. Kinnear, Jr., editor. Advances in Genetic Programming, chapter 11, pages 243-263. MIT Press. 1994.