www.gp-field-guide.org.uk
Contents Top Previous Next

Chapter 2: Representation, Initialisation and Operators in Tree-based GP

This chapter introduces the basic tools and terminology used in genetic programming. In particular, it looks at how trial solutions are represented in most GP systems (Section  2.1 ), how one might construct the initial random population (Section  2.2 ), and how selection (Section  2.3 ) as well as crossover and mutation (Section  2.4 ) are used to construct new programs.


PIC

Figure 2.1: GP syntax tree representing max(x+x,x+3*y).



www.gp-field-guide.org.uk
Contents Top Previous Next