Download:
|
by Kanta Vekaria, Chris Clack
In Proceedings of Fourth Online World Conference on Soft Computing in Industrial Applications
http://www.cs.ucl.ac.uk/staff/K.Vekaria/publications/wsc4Schemaprop.ps.gz
Add To MetaCart
Abstract:
Recombination operators with high positional bias are less disruptive against adjacent genes. Therefore, it is ideal for the encoding to position epistatic genes adjacent to each other and aid GA search through genetic linkage. To produce an encoding that facilitates genetic linkage is problematic. This study focuses on selective crossover, which is an adaptive recombination operator. We propose three alternative encodings for the Royal Road problem. We use these encodings to analyse the performance of selective crossover with respect to different encodings. This study shows that the performance of selective crossover is consistent and is not affected by alternative encodings of a problem, unlike two-point crossover. The encodings are also used to understand the behaviour of selective crossover in terms of schema propagation. Experimental results indicate that selective crossover provides a better balance between exploration and exploitation than conventional recombination operators. 1
Citations
|
1827
|
Adaptation in Natural and Artificial Systems. The
– Holland
- 1975
|
|
1082
|
Genetic algorithms in search, optimization and machine learning
– Goldberg
- 1989
|
|
815
|
An Introduction to Genetic Algorithms
– Mitchell
- 1996
|
|
244
|
Messy Genetic Algorithms: Motivation, Analysis and First Results
– Goldberg, Korb, et al.
- 1989
|
|
206
|
Reducing bias and inefficiency in the selection algorithm
– Baker
- 1987
|
|
146
|
The royal road for genetic algorithms : Fitness landscapes and ga performance
– Mitchell, Forrest, et al.
- 1993
|
|
80
|
Biases in the crossover landscape
– Eschelman, Caruana, et al.
- 1989
|
|
75
|
The gene expression messy genetic algorithm
– Kargupta
- 1996
|
|
60
|
Crossover or mutation
– Spears
- 1992
|
|
47
|
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
– Harik
- 1997
|
|
23
|
On crossover as an evolutionary viable strategy
– Schaffer, Eshelman
- 1991
|
|
19
|
The Role of Mutation and Recombination in the Evolutionary Algorithms
– Spears
- 1998
|
|
15
|
Relative Building-Block Fitness and the Building Block Hypothesis
– Forrest
- 1993
|
|
7
|
Selective crossover in genetic algorithms: an empirical study
– Vekaria
- 1998
|
|
5
|
Recombination parameters
– Spears
- 1997
|
|
4
|
Biases introduced by adaptive recombination operators
– Vekaria, Clack
- 1999
|
