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 regression models, logistic regression models, 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 simple linear chromosomes are a breakthrough because, no matter what, they always encode valid computer programs. So we can mutate them and then select the best ones to reproduce and then create better 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
for all kinds of problems.
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 5.0 and play with it for free for 15 days using your own data. GeneXproTools is a commercial product, but the
Demo is fully
functional for a wide set of well-known real-world problems:
*** |
Last update: 23/July/2013
|
© Candida Ferreira All rights reserved. |