Leonardo Vanneschi
ABSTRACT
The NK landscapes are a well known benchmark for genetic algorithms (GAs) in which it is possible to tune the ruggedness of the fitness landscape by simply modifying the value of a parameter K. They have successfully been used in many theoretical studies, allowing researchers to discover interesting properties of the GAs dynamics in presence of rugged landscapes. A similar benchmark does not exist for genetic programming (GP) yet. Nevertheless, during the EuroGP conference debates of the last few years, the necessity of defining new benchmark problems for GP has repeatedly been expressed by a large part of the attendees. This paper is intended to fill this gap, by introducing an extension of the NK landscapes to tree based GP, that we call K landscapes. In this benchmark, epistasis are expressed as growing mutual interactions between the substructures of a tree as the parameter K increases. The fact that the problem becomes more and more difficult as the value of K increases is experimentally demonstrated. Interestingly, we also show that GP "bloats" more and more as K increases.
- L. Altenberg. B2.7.2 NK fitness landscapes. In T. Baeck, et al., editors, Handbook of evolutionary computation. New York: Oxford University Press, 1997.Google Scholar
- A. Asuncion and D. Newman. UCI machine learning repository, 2007.Google Scholar
- 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. Google ScholarDigital Library
- K. Deb and D. E. Goldberg. Analyzing deception in trap functions. In D. Whitley, editor, Foundations of Genetic Algorithms, 2, pages 93--108. Morgan Kaufmann, 1993.Google Scholar
- D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989. Google ScholarDigital Library
- S. Gustafson, E. Burke, and N. Krasnogor. The tree-string problem: An artificial domain for structure and content search. In M. Keijzer, et al., editors, EuroGP 2005, pages 215--226. Springer, 2005. Google ScholarDigital Library
- J. H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, Michigan, 1975.Google Scholar
- S. Kauffman and S. Levin. Towards a general theory of adaptive walks on rugged landscapes. J. Theoret. Biol., 128(1):11--45, 1987.Google ScholarCross Ref
- S. A. Kauffman. The Origins of Order. Oxford University Press, New York, 1993.Google Scholar
- J. Kingman. Mathematics of genetic diversity. Number 34 in CBMS-NSF regional conference series in applied mathematics. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 2. druck edition, 1980.Google Scholar
- J. R. Koza. Genetic Programming. The MIT Press, Cambridge, Massachusetts, 1992. Google ScholarDigital Library
- M. Mitchell, S. Forrest, and J. Holland. The royal road for genetic algorithms: fitness landscapes and ga performance. In F. J. Varela and P. Bourgine, editors, Toward a Practice of Autonomous Systems, Proc. of the First European Conf. on Artif. Life, pages 245--254. The MIT Press, 1992.Google Scholar
- M. O'Neill, L. Vanneschi, S. Gustafson, and W. Banzhaf. Open issues in genetic programming. Genetic Programming and Evolvable Machines, 11(3--4):339--363, 2010. Google ScholarDigital Library
- A. Orfila, J. M. Estevez-Tapiador, and A. Ribagorda. Evolving high-speed, easy-to-understand network intrusion detection rules with genetic programming. In M. Giacobini, et al., editors, App. of Evolutionary Computing, EvoWorkshops2009, LNCS. Springer Verlag, 2009. Google ScholarDigital Library
- R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- D. Song, M. I. Heywood, and A. N. Zincir-Heywood. A linear genetic programming approach to intrusion detection. In E. Cantú-Paz, et al., editors, Genetic and Evolutionary Computation -- GECCO-2003, volume 2724 of LNCS, pages 2325--2336, Chicago, 12--16 July 2003. Springer-Verlag. Google ScholarDigital Library
- W. A. Tackett. Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems, USA, 1994. Google ScholarDigital Library
- M. Tomassini, L. Vanneschi, P. Collard, and M. Clergue. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation, 13(2):213--239, Summer 2005. Google ScholarDigital Library
- 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.Google Scholar
- S. Wright. The roles of mutation, inbreeding, crossbreeding and selection in evolution. In D. F. Jones, editor, Proceedings og the Sixth International Congress on Genetics, volume 1, pages 356--366, 1932.Google Scholar
Index Terms
- The K landscapes: a tunably difficult benchmark for genetic programming
Recommendations
Fitness landscapes and problem hardness in genetic programming
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationThe performance of searching agents, or metaheuristics, like evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algorithms (simulated annealing, tabu search, etc.) depend on some properties of the search space ...
A tunable model for multi-objective, epistatic, rugged, and neutral fitness landscapes
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computationThe fitness landscape of a problem is the relation between the solution candidates and their reproduction probability. In order to understand optimization problems, it is essential to also understand the features of fitness landscapes and their ...
Analysis of epistasis correlation on NK landscapes with nearest-neighbor interactions
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationEpistasis correlation is a measure that estimates the strength of interactions between problem variables. This paper presents an empirical study of epistasis correlation on a large number of random problem instances of NK landscapes with nearest ...
Comments