Variable length genetic algorithms with multiple chromosomes on a variant of the Onemax problem

Authors:
Rachel Cavill;Stephen L Smith;Andy M Tyrrell
Affiliations:
University of York, York, UK;University of York, York, UK;University of York, York, UK
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 3
Cited 0

Genetic Algorithms Using Grammatical Evolution

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Grammatical Evolution: Evolving Programs for an Arbitrary Language

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Multi-chromosomal genetic programming

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The dynamics of variable length representations in evolutionary computation have been shown to be complex and different from those seen in standard fixed length genetic algorithms. This paper explores a simple variable length genetic algorithm with multiple chromosomes and its underlying dynamics when used for the onemax problem. The changes in length of the chromosomes are especially observed and explanations for these fluctuations are sought.