The Mixing Rate of Different Crossover Operators
Prügel-Bennett, A (2001) The Mixing Rate of Different Crossover Operators. Foundations of Genetic Algorithms 6 Morgan Kaufmann, 261-274.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_postscript.png) |
Postscript
Download (188Kb) |
Description/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.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: San Francisco |
| ISSNs: | 1081-6593 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control |
| Item ID: | 254125 |
| Date Deposited: | 22 Mar 2002 |
| Last Modified: | 02 Mar 2012 12:39 |
| Contributors: | Prügel-Bennett, A (Author) Martin, W. N. (Editor) Spears, W. (Editor) |
| Date: | 2001 |
| Additional Information: | Address: San Francisco |
| Status: | Published |
| Publisher: | Morgan Kaufmann |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/254125 |
Actions (login required)
 |
View Item |
