A survey of problem difficulty in genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3673 LNAI, Issue , 2005, Pages 66-77

  Vanneschi, Leonardo ^a   Tomassini, Marco ^b   Collard, Philippe ^c   Clergue, Manuel ^c  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF LAUSANNE   (Switzerland)

^c UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CORRELATION METHODS; MATHEMATICAL PROGRAMMING;

GENETIC PROGRAMMING; HAND-TAILORED PROBLEMS;

PROBLEM SOLVING;

EID: 33646128244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558590_7     Document Type: Conference Paper

References (16)

1. L. Altenberg. The evolution of evolvability in genetic programming. In K. Kinnear, editor, Advances in Genetic Programming, pages 47-74, Cambridge, MA, 1994. The MIT Press.
2. M. Clergue, P. Collard, M. Tomassini, and L. Vanneschi. Fitness distance correlation and problem difficulty for genetic programming. In et al. W. B. Langdon, editor, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO'02, pages 724-732, New York City, USA, 2002. Morgan Kaufmann, San Francisco, CA. Best Conference Paper Award Nomination.
3. J. M. Daida, R. Bertram, S. Stanhope, J. Khoo, S. Chaudhary, and O. Chaudhary. What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines, 2:165-191, 2001.
4. A. Ekárt and S. Z. Németh. Maintaining the diversity of genetic programs. In J. A. Foster, E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi, editors, Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002, volume 2278 of LNCS, pages 162-171, Kinsale, Ireland, 3-5 April 2002. Springer-Verlag.
5. T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, 1995.
6. J. R. Koza. Genetic Programming. The MIT Press, Cambridge, Massachusetts, 1992.
7. W. B. Langdon and R. Poli. An analysis of the max problem in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference on Genetic Programming, pages 222-230, San Francisco, CA, 1997. Morgan Kaufmann.
8. N. Madras. Lectures on Monte Carlo Methods. American Mathematical Society, Providence, Rhode Island, 2002.
9. B. Punch, D. Zongker, and E. Goodman. The royal tree problem, a benchmark for single and multiple population genetic programming. In P. Angeline and K. Kinnear, editors, Advances in Genetic Programming 2, pages 299-316, Cambridge, MA, 1996. The MIT Press.
10. R.J. Quick, V.J. Rayward-Smith, and G.D. Smith. Fitness distance correlation and ridge functions. In Fifth Conference on Parallel Problems Solving from Nature (PPSN'98), pages 77-86. Springer-Verlag, Heidelberg, 1998.
11. M. Tomassini, L. Vanneschi, P. Collard, and M. Clergue. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation, 2004. (to appear).
12. L. Vanneschi. Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, Faculty of Science, University of Lausanne, Switzerland, 2004. Downlodable version at: http://www.disco.unimib.it/vanneschi.Honored with the Excellence Award by the Science Faculty of the University of Lausanne.
13. L. Vanneschi, M. Tomassini, M. Clergue, and P. Collard. Difficulty of unimodal and multimodal landscapes in genetic programming. In Cantú-Paz, E., et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '03, LNCS, pages 1788-1799, Chicago, Illinois, USA, 2003. Springer-Verlag. Best Conference Paper Award Nomination.
14. L. Vanneschi, M. Tomassini, P. Collard, and M. Clergue. Fitness distance correlation in genetic programming: a constructive counterexample. In Congress on Evolutionary Computation (CEC'03), pages 289-296, Canberra, Australia, 2003. IEEE Press, Piscataway, NJ.
15. L. Vanneschi, M. Tomassini, P. Collard, and M. Clergue. Fitness distance correlation in structural mutation genetic programming. In Ryan, C., et al., editor, Genetic Programming, 6th European Conference, EuroGP2003, Lecture Notes in Computer Science, pages 455-464. Springer-Verlag, Heidelberg, 2003.
16. S. Vérel, P. Collard, and M. Clergue. Where are bottleneck in nk-fitness landscapes? In CEC 2003: IEEE International Congress on Evolutionary Computation. Canberra, Australia, pages 273-280. IEEE Press, Piscataway, NJ, 2003.