Behavior of finite population variable length genetic algorithms under random selection

In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromosome length appears to occur in finite population GAs when 1) selection is absent from the GA (random) or 2) when selection focuses on some other property not influenced by the length of individuals within a population. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search – heuristic methods General Terms Algorithms, Performance, Experimentation. Keywords Genetic Algorithm, Variable Length, Random Selection.

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Hal Stringer, Annie S. Wu
• Keywords: GECCO 2005, Genetic Algorithm, Shorter Average Size, Variable-length Genetic Algorithm