  We investigate the possibility of encoding multiple solutions of a problem in
a single chromosome. The best solution encoded in an individual will represent
(will provide the fitness of) that individual. In order to obtain some benefits
the chromosome decoding process must have the same complexity as in the case of
a single solution in a chromosome. Three Genetic Programming techniques are
analyzed for this purpose: Multi Expression Programming, Linear Genetic
Programming, and Infix Form Genetic Programming. Numerical experiments show
that encoding multiple solutions in a chromosome greatly improves the search
process.
