Uniform crossover revisited: Maximum disruption in real-coded GAs

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Drake, S. (2003). Uniform crossover revisited: Maximum disruption in real-coded GAs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1576–1577. https://doi.org/10.1007/3-540-45110-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free