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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences 37(1) (August 1988)
Fox, D., Burgard, W., Kruppa, H., Thrun, S.: A probabilistic approach to collaborative multi-robot localization. Autonomous Robots 8(3), 325–344 (2000)
Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)
Koza, J.R., et al.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, Dordrecht (2003)
Kushchu, I.: An evaluation of evolutionary generalisation in genetic programming. Artificial Intelligence Review 18(1), 3–14 (2002)
Daida, J.M., et al.: What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines 2(2), 165–191 (2001)
Gustafson, S., Ekárt, A., Burke, E.K., Kendall, G.: Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Hardware 5(3), 271–290 (2004)
Daida, J.M., Li, H., Tang, R., Hilss, A.M.: What makes a problem GP-hard? validating a hypothesis of structural causes. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1665–1677. Springer, Heidelberg (2003)
Gathercole, C., Ross, P.: An adverse interaction between crossover and restricted tree depth in genetic programming. In: Koza, J.R., et al. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, July 28–31, 1996, pp. 291–296. MIT Press, Cambridge (1996)
Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Berlin (2002)
Punch, W.F., Zongker, D., Goodman, E.D.: The royal tree problem, a benchmark for single and multi-population genetic programming. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, ch. 15, pp. 299–316. The MIT Press, Cambridge (1996)
O’Reilly, U.-M.: The impact of external dependency in genetic programming primitives. In: Proceedings of the IEEE World Congress on Computational Intelligence, Anchorage, AL, USA, May 5-9, 1998, pp. 306–311. IEEE Press, Los Alamitos (1998)
O’Reilly, U.-M., Goldberg, D.E.: How fitness structure affects subsolution acquisition in genetic programming. In: Koza, J.R., et al. (eds.) Proceedings of the Third Annual Genetic Programming Conference, Madison, WI, USA, July 22-25, 1998, pp. 269–277. Morgan Kaufmann, San Francisco (1998)
Goldberg, D.E., O’Reilly, U.-M.: Where does the good stuff go, and why? how contextual semantics influence program structure in simple genetic programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 16–36. Springer, Heidelberg (1998)
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)
Juels, A., Wattenberg, M.: Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical Report Technical Report CSD-94-834. Computers Science Department, University of California at Berkeley, USA (1995)
de Jong, E.D., Pollack, J.B.: Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines 4(3), 211–233 (2003)
Ekárt, A., Gustafson, S.: A data structure for improved GP analysis via efficient computation and visualisation of population measures. In: Keijzer, M., O’Reilly, U.-M., Lucas, S., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 35–46. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustafson, S., Burke, E.K., 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. EuroGP 2005. Lecture Notes in Computer Science, vol 3447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31989-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-31989-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25436-2
Online ISBN: 978-3-540-31989-4
eBook Packages: Computer ScienceComputer Science (R0)