38 search results - page 1 / 8 » Variable Length Genomes for Evolutionary Algorithms |
GECCO
2000
Springer
13 years 9 months ago
2000
Springer
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
— In various nuances of evolutionary algorithms it has been observed that variable sized genomes exhibit large degrees of redundancy and corresponding undue growth. This phenomen...
EPS
1998
Springer
13 years 9 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
AE
2003
Springer
13 years 10 months ago
2003
Springer
Although there are some real world applications where the use of variable length representation (VLR) in Evolutionary Algorithm is natural and suitable, an academic framework is la...
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...