Proceedings of the
Genetic and Evolutionary Computation Conference (GECCO 2000)
(July 2000).
Abstract
A general variable length genome, called exG,
is developed here to address the problems of
fixed length representations in canonical evo-
lutionary algorithms. Convergence aspects of
exG are discussed and preliminary results of
exG usage are presented. The generality of
this variable length genome is also shown via
comparisons with other variable length rep-
resentations.