The Mixing Rate of Different Crossover Operators

Adam Prügel-Bennetf apb@ecs.soton.ac.uk    Image, Speech and Intelligent Systems Research Group Department of Electronics and Computer Science University of Southampton Highfield, Southampton SO17 1BJ, United Kingdom

Abstract

In order to understand the mixing effect of crossover a simple shuffling problem is considered. The time taken for the strings in a population to become mixed is calculated for different crossover procedures. Uniform crossover is found to mix the population fastest, while single-point crossover causes very slow mixing. Two-point crossover extrapolates between these two limiting cases.

1 INTRODUCTION

One of the benefits of using an evolutionary algorithm is that it opens up the ...

Get Foundations of Genetic Algorithms 2001 (FOGA 6) now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.