The Nature of Crossover Operator in Genetic Algorithms

Authors:
Lihan Tian
Affiliations:
-
Venue:
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Year:
2000

Citing 13
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
An introduction to genetic algorithms

An introduction to genetic algorithms
The design and analysis of a computational model of cooperative coevolution

The design and analysis of a computational model of cooperative coevolution
Practical Handbook of Genetic Algorithms

Practical Handbook of Genetic Algorithms
Parallel Genetic Algorithms: Theory and Applications

Parallel Genetic Algorithms: Theory and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Engineering and Computer Science

Genetic Algorithms in Engineering and Computer Science
Genetic Algorithms for Control and Signal Processing

Genetic Algorithms for Control and Signal Processing
Genetic Algorithms and Fuzzy Logic Systems: Soft Computing Perspectives

Genetic Algorithms and Fuzzy Logic Systems: Soft Computing Perspectives
The role of mutation and recombination in evolutionary algorithms

The role of mutation and recombination in evolutionary algorithms
Evolutionary computation: comments on the history and current state

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Crossover is a main searching operator of genetic algorithms (GAs), which has distinguished GAs from many other algorithms. Through analyzing and imitating the implementation of crossover operator, this paper points out that crossover is intrinsically a heuristic mutation with reference. Its reference objective is just the other individual which is mated with the one which will be crossovered. On the basis of this conclusion this paper then explains and discusses the results obtained by other GA researchers through experiments.