Behavior of finite population variable length genetic algorithms under random selection

Authors:
Hal Stringer;Annie S. Wu
Affiliations:
University of Central Florida, Orlando, FL;University of Central Florida, Orlando, FL
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 4
Cited 0

Recombination, selection, and the genetic construction of computer programs

Recombination, selection, and the genetic construction of computer programs
A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the Study of the Evolution of Size

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Schemata evolution and building blocks

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.