CGP - Constrained Genetic Programming

CGP uses GP [Koza] to evolve programs (or trees in general). It extends GP by allowing syntactic and sematical constraints on function calls (the constraints can be weighted rather than strict), plus function overloading. In future releases, evolution of representation (i.e., constraints), ADFs, and recursive functions are planned.
Partly supported by UMRB and NASA NAG 9-847.

Developed by: Cezary Z. Janikow and Scott DeWeese.

CGP is roughly described in:


CGP 3.0 etc. Under Construction


Last Modified: 9/18/97 by Cezary Z. Janikow