GA (Genetic Algorithm) Operators

May 27 • General • 10998 Views • 1 Comment on GA (Genetic Algorithm) Operators


GA (Genetic Algorithm) is good at taking larger, potentially huge search space and navigating them looking for optimal solution which we might not find in lifetime. GA is better than other traditional algorithm in that they are more robust. They do not break easily even if the inputs are changed slightly or in the presence of reasonable noise.

GA is used to resolve complicated optimization problems, such as , organizing the time table, scheduling job shop, playing games. The concept of GA is directly derived from natural evolution and heredity i.e. inheritance, where child inherits the characters (stored in the chromosomes) from the parent.

Operators in GA:
1.Crossover (Recombination):-

Crossover is the process of taking two parent solutions and producing from them a child. After the selection (reproduction) process, the population is enriched with better individuals. Crossover operator is applied to the mating pool with the hope that it creates a better offspring.

The various crossover techniques are-

i).Single-Point Crossover-Here the two mating chromosomes are cut once at corresponding points and the sections after the cuts exchanged.


ii). Two-Point Crossover-Here two crossover points are chosen and the contents between these points are exchanged between two mated parents.


2. Inversion:-

Inversion operator inverts the bits between two random sites.

 01  0011  1

Then, 0111001


3. Deletion:-

i).Deletion and duplication-Here any two or three bits in random are selected and their previous bits are duplicated.

before duplication: 00   1001  0

deletion: 00  10_  _   0

duplication: 00  1010  0

ii). Deletion and regeneration-Here bits between the cross site are deleted and regenerated randomly.

10  0110 1

10 _ _ _ _   1
10  1101  1

4. Mutation:-

After crossover, the strings are subjected to mutation. Mutation prevents the algorithm to be trapped in a local minimum. It plays the role of recovering the genetic materials as well as for randomly distributing genetic information. It helps escape from local minima’s trap and maintain diversity in the population. Mutation of a bit involves flipping a bit, changing 0 to 1and vice-versa.


Tell us Your Queries, Suggestions and Feedback

Your email address will not be published. Required fields are marked *

One Response to GA (Genetic Algorithm) Operators

  1. Rachita Mishra says:

    In the computer science field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic (also sometimes called a metaheuristic) is routinely used to generate useful solutions to optimization and search problems.It’s operation are given in this article.

« »