Genetic Algorithm

An Approach to Darwin’s Theor

DRIEMS

Presented by
Sushanta kumar Parida,
Haimabati Nand
Sahoo, DRIEMS, Cutta
 AN INTRODUCTION
Genetic algorithms are powerful
search techniques that are used
successfully to solve problems in
many different disciplines like in
business, engineering & science. The
major motivation behind this is as
below:
• The search of solutions is implicitly
parallel. So its time complicity is very less.
• Hard problems required large population
easy to compute.
• Time & memory requirements for genetic
programming (scalability).
 Charles Darwin
The genius behind genesis
The Man who gave the idea about GAs.
“ A Genetic Algorithm is a search
or optimization procedure based on
the mechanism of natural selection
and natural genetics
i.e. the theories of this man.”
What Are Genetic Algorithms?
They are optimisation techniques – They don’t use
domain specific knowledge in their search
procedure.

They generally involve evolving a population of

candidate solutions to a given problem.

Evolution is carried out using operations inspired

by natural genetic variation and natural selection.
 A Typical GA

“ A Genetic Algorithm is a search procedure that

optimizes some objective function (f) by
maintaining a population (p) of candidate
solution. Generally the candidate solution are
encoded as bit strings.”
 GA Terminology
Chromosome / Genome String of characters
Gene Characters used (eg binary)
Allele 1 or 0 (for binary)
Locus Position of gene in string
Phenotype / Organism Candidate solution
Generation Iteration
 GA Operators
There are 3 main operators for a serial GA:

Selection

Crossover

Mutation
 Selection Methods

Common selection methods used in GAs are

• Fitness Proportionate Selection
• Rank Selection
• Tournament Selection
 Crossover
• The means by which individuals are combined to form
offspring.
 Mutation
• The Mutation operator ensures
the gene pool does not become
too restricted.
• In GAs it is carried out by randomly
changing one or more of the alleles (bits) in
an individual’s chromosome.
• The probability of mutating a particular bit
is typically very small (~ 0.001).
 An Application

String Initial x value f(x)=x2

No. Population
1 01101 13 169
2 11000 24 576
3 01000 08 064
4 10011 19 361
 Continued….

Mating Pool after Mate New x value f(x)=x2

Reproduction Population
01101 2 01100 12 144
11000 1 11001 25 625
11000 4 11011 27 729
10011 3 10000 16 256
 Applications of GAs

 Optimisation tasks  Immune Systems

 Automatic Programming  Ecology
 Machine Learning  Population genetics
 Economics  Social Systems