Uniform crossover revisited: maximum disruption in real-coded GAs

Authors:
Stephen Drake
Affiliations:
COGS, University of Sussex, Falmer, Brighton, UK
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 3
Cited 1

Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
A Comparison of Search Techniques on a Wing-Box Optimisation Problem

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A measure of landscapes

Evolutionary Computation

Tuning p systems for solving the broadcasting problem

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A detailed comparison is presented of five well-known crossover operators on a range of continuous optimization tasks to test longheld beliefs concerning disruption, with respect to real-coded GAs. It is suggested that, contrary to traditional assumptions, disruption is useful.