Description

Multi Expression Programming is a Genetic Programming variant that uses a linear
representation of individuals. A unique feature of Multi Expression Programming is
its ability of storing multiple solutions of a problem in a single chromosome. In this
paper, we propose and use several techniques for improving the search performed
by Multi Expression Programming. Some of the most important improvements are
Automatically Defined Functions and Sub-Symbolic node representation. Several
experiments with Multi Expression Programming are performed in this paper. Numerical
results show that Multi Expression Programming performs very well for the
considered test problems.