Created by W.Langdon from gp-bibliography.bib Revision:1.8010
Of the many forms of evolutionary computation, one recently developed discipline is that of grammatical evolution (GE). This approach can evolve executable functions in any computer language that can be represented in BNF form. The ability to synthesise arbitrary functions from a formal grammar is an attractive alternative to the expression tree generation of the more common genetic programming (GP) approach. However, the GE approach may not be ideal for the optimisation of any real-valued parameters of the functions generated. This work combines the use of grammatical evolution for function synthesis with the use of evolutionary programming (EP) to optimise the parameters (constants) required by the synthesised functions. These two evolutionary processes combine to explore a rich and complex search space of functional forms and floating point values. A prototype system is implemented and applied to the problem of function approximation.",
Genetic Programming entries for Dale E Courte