DMCA
Adapting Crossover in Evolutionary Algorithms (1995)
Cached
Download Links
- [www.aic.nrl.navy.mil]
- [www.cs.uwyo.edu]
- [www.swarmotics.com]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the Fourth Annual Conference on Evolutionary Programming |
| Citations: | 79 - 0 self |
BibTeX
@INPROCEEDINGS{Spears95adaptingcrossover,
author = {William M. Spears},
title = {Adapting Crossover in Evolutionary Algorithms},
booktitle = {Proceedings of the Fourth Annual Conference on Evolutionary Programming},
year = {1995},
pages = {367--384},
publisher = {MIT Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
One of the issues in evolutionary algorithms (EAs) is the relative importance of two search operators: mutation and crossover. Genetic algorithms (GAs) and genetic programming (GP) stress the role of crossover, while evolutionary programming (EP) and evolution strategies (ESs) stress the role of mutation. The existence of many different forms of crossover further complicates the issue. Despite theoretical analysis, it appears difficult to decide a priori which form of crossover to use, or even if crossover should be used at all. One possible solution to this difficulty is to have the EA be self-adaptive, i.e., to have the EA dynamically modify which forms of crossover to use and how often to use them, as it solves a problem. This paper describes an adaptive mechanism for controlling the use of crossover in an EA and explores the behavior of this mechanism in a number of different situations. An improvement to the adaptive mechanism is then presented. Surprisingly this improvement can a...
