The Tree-String problem: An artificial domain for structure and content search

Citation

Gustafson S, Burke E & Krasnogor N (2005) The Tree-String problem: An artificial domain for structure and content search. In: Keijzer M, Tettamanzi A, Collet P, van Hemert J & Tomassini M (eds.) Genetic Programming: 8th European Conference, EuroGP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings. Lecture Notes in Computer Science, 3447. 8th European Conference, EuroGP 2005, Genetic Programming, Lausanne, Switzerland, 30.03.2005-01.04.2005. Berlin Heidelberg: Springer, pp. 215-226. http://link.springer.com/chapter/10.1007%2F978-3-540-31989-4_19; https://doi.org/10.1007/978-3-540-31989-4_19

Abstract
This paper introduces the Tree-String problem for genetic programming and related search and optimisation methods. To improve the understanding of optimisation and search methods, we aim to capture the complex dynamic created by the interdependencies of solution structure and content. Thus, we created an artificial domain that is amenable for analysis, yet representative of a wide-range of real-world applications. The Tree-String problem provides several benefits, including: the direct control of both structure and content objectives, the production of a rich and representative search space, the ability to create tunably difficult and random instances and the flexibility for specialisation.