Crossover or Mutation?

Crossover or Mutation? (1992)

by William M. Spears , E-mail Pears , Aic. Nrl. Navy Mil

Venue:	Foundations of Genetic Algorithms 2
Citations:	63 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Crossover or Mutation?	user correction - Legacy Corrections
AUTHOR NAME	William M. Spears	SVM HeaderParse 0.1
AUTHOR AFFIL	Navy Center for Applied Research in Artificial Intelligence; Code $$10; Naval Research Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Washington, D.C. 20375-$320	SVM HeaderParse 0.1
AUTHOR NAME	E-mail Pears	SVM HeaderParse 0.1
AUTHOR NAME	Aic. Nrl. Navy Mil	SVM HeaderParse 0.1
ABSTRACT	Genetic algorithms rely on two genetic operators - crossover and mutation. Although there exists a large body of conventional wisdom concerning the roles of crossover and mutation, these roles have not been captured in a theoretical fashion. For example, it has never been theoretically shown that mutation is in some sense "less powerful" than crossover or vice versa. This paper provides some answers to these questions by theoretically demonstrating that there are some important characteristics of each operator that are not captured by the other.	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
VENUE	Foundations of Genetic Algorithms 2	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	221--237	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	25 found	ParsCit 1.0