Next: 3 Representation of Solutions
Up: 3 Genetic Programming
Previous: 1 Foundations
  Contents
Genetic programming adopts a similar search strategy as a genetic algorithm,
but uses
a program representation and special operators. It is this
representation that makes genetic programming unique. The basic
algorithm is as follows:
- Initialise a population of solutions
- Assign a fitness to each population member
- While the Stopping criterion is not met
- Produce new individuals using operators and the existing population
- Place new individuals into the population
- Assign a fitness to each population member, and test for the Stopping criterion
- Return the best fitness found
The rest of this section describes the components of this algorithm in
more detail, beginning with the representation.
S Gustafson
2004-05-20