In genetic algorithm why crossover is primary and mutation is secondary
Answers
Explanation:
Crossover and mutation are two basic operators of GA. Performance of GA very depends on them. Type and implementation of operators depends on encoding and also on a problem.
There are many ways how to do crossover and mutation. In this chapter are only some examples and suggestions how to do it for several encoding.
Binary Encoding
Crossover
Single point crossover - one crossover point is selected, binary string from beginning of chromosome to the crossover point is copied from one parent, the rest is copied from the second parent

11001011+11011111 = 11001111
Two point crossover - two crossover point are selected, binary string from beginning of chromosome to the first crossover point is copied from one parent, the part from the first to the second crossover point is copied from the second parent and the rest is copied from the first parent

11001011 + 11011111 = 11011111
Uniform crossover - bits are randomly copied from the first or from the second parent

Answer:
The crossover of two parent strings produces offspring by swapping parts or genes of the chromosomes.
Each solution is encoded as a string called a chromosome.