Variable Length Genomes for Evolutionary Algorithms

A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects of exG are discussed and preliminary results of exG usage are presented. The generality of this variable legnth genome is also shown via comparisons with other variable length representations.

• Type: Conference
• Year: 2000
• Where: GECCO
• Authors: C.-Y. Lee, E. K. Antonsson
• Keywords: GECCO 2000, Length Representations, Optimization, Variable Length, Variable Length Genome