A genetic operator is an operator

Operator (programming)

Programming languages typically support a set of operators: operations which differ from the language's functions in calling syntax and/or argument passing mode. Common examples that differ by syntax are mathematical arithmetic operations, e.g...

 used in genetic algorithms to maintain genetic diversity

Genetic diversity

Genetic diversity, the level of biodiversity, refers to the total number of genetic characteristics in the genetic makeup of a species. It is distinguished from genetic variability, which describes the tendency of genetic characteristics to vary....

, known as Mutation (genetic algorithm)

Mutation (genetic algorithm)

In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next...

 and to combine existing solutions into others, Crossover (genetic algorithm)

Crossover (genetic algorithm)

In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based...

. The main difference between them is that the mutation operators operate on one chromosome, that is, they are unary, while the crossover operators are binary operators.

Genetic variation is a necessity for the process of evolution

Evolution

Evolution is any change across successive generations in the heritable characteristics of biological populations. Evolutionary processes give rise to diversity at every level of biological organisation, including species, individual organisms and molecules such as DNA and proteins.Life on Earth...

. Genetic operators used in genetic algorithms are analogous to those in the natural world: survival of the fittest

Survival of the fittest

"Survival of the fittest" is a phrase originating in evolutionary theory, as an alternative description of Natural selection. The phrase is today commonly used in contexts that are incompatible with the original meaning as intended by its first two proponents: British polymath philosopher Herbert...

, or selection

Selection (genetic algorithm)

Selection is the stage of a genetic algorithm in which individual genomes are chosen from a population for later breeding .A generic selection procedure may be implemented as follows:...

; reproduction (crossover

Crossover (genetic algorithm)

In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based...

, also called recombination); and mutation

Mutation (genetic algorithm)

In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next...

.

Types of Operators

1. Mutation (genetic algorithm)

Mutation (genetic algorithm)

In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next...

2. Crossover (genetic algorithm)

Crossover (genetic algorithm)

In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based...