|
The Newest Development of Evolutionary Computation |
|
|
|
|
||
|
What's New Subscribe to the GEP mailing list What is Gene Expression Programming?
Gene Expression Programming (GEP) is an evolutionary algorithm that
automatically creates computer programs. These computer programs can
take many forms: they can be conventional mathematical models, neural
networks, decision trees, sophisticated nonlinear models, logistic
nonlinear regressors, nonlinear classifiers, complex polynomial
structures, logic circuits and expressions, and so on. But irrespective
of their complexity, all GEP programs are encoded in very simple linear
structures
–
the chromosomes. These chromosomes are special because, no matter what,
they always encode a valid computer program. So we can mutate them and
then select the best ones to reproduce and then create more programs and
so on, endlessly. This is, of course, one of the prerequisites for
having a system evolving efficiently, searching for better and better
solutions as it tries to solve a particular problem.
If
you want to know how simple linear chromosomes can be used to
automatically generate complex computer programs, see the 2001
Complex Systems paper
Gene Expression Programming: A New Adaptive Algorithm for Solving
Problems, which is freely available online. Or you can read a
shorter
online tutorial for a quick introduction to Gene Expression
Programming. Other
online tutorials are also available for faster and more informal
expositions.
To see and understand how GEP works, you can download
GeneXproTools 4.3 and play with
it. GeneXproTools is a commercial product, but the
Demo is fully
functional for a wide set of well-known real-world problems:
*** |
|
Last update: 31/January/2012
|
© Candida Ferreira All rights reserved. |