Scribd
Upload
19 views19 pages

GA Alg

Uploaded by

Anu Priya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views19 pages

GA Alg

Uploaded by

Anu Priya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

GA Strategies

Different GA Strategies
1) Simple Genetic Algorithm (SGA)
2) Steady State Genetic Algorithm (SSGA)
3) Messy Genetic Algorithm (MGA)
Simple GA
Important parameters involved in Simple
GA
• SGA Parameters
• Initial population size : N
• Size of mating pool
• Convergence threshold
• Mutation
• Inversion
• Crossover
Salient features in SGA
Simple GA features:
• Have overlapping generation (Only fraction of
individuals are replaced).
• Computationally expensive.
• Good when initial population size is large.
• In general, gives better results. Selection is biased
toward more highly fit individuals; Hence, the
average fitness (of overall population) is expected
to increase in success in succession.
• The best individual may appear in any iteration
Steady State Genetic Algorithm (SSGA)
Salient features in Steady-state GA
SSGA Features:
• Generation gap is small.
• Only two offspring are produced in one
generation.
• It is applicable when
 Population size is small
 Chromosomes are of longer length
 Evaluation operation is less computationally
expensive (compare to duplicate checking)
Salient features in Steady-state GA
Limitations in SSGA:
• There is a chance of stuck at local optima, if
crossover/mutation/inversion is not strong
enough to diversify the population).
• Premature convergence may result.
• It is susceptible to stagnation. Inferiors are
neglected or removed and keeps making more
trials for very long period of time without any
gain (i.e. long period of localized search).
GA Operators
• Following are the GA operators in Genetic
Algorithms.
1) Encoding
2) Convergence test
3) Mating pool
4) Fitness Evaluation
5) Crossover
6) Mutation
7) Inversion
Different Encoding Schemes
• Different GA’s
 Simple Genetic Algorithm (SGA)
 Steady State Genetic Algorithm (SSGA)
 Messy Genetic Algorithm (MGA)
• Encoding Schemes
 Binary encoding
 Real value encoding
 Order encoding
 Tree encoding
Different Encoding Schemes
• Often, GAs are specified according to the encoding
scheme it follows.
For example:
• Encoding Scheme
• Binary encoding – >Binary Coded GA or simply Binary GA
• Real value encoding – > Real Coded GA or simply Real GA
• Order encoding – > Order GA (also called as Permuted
GA)
• Tree encoding
Encoding Schemes in GA
• Genetic Algorithm uses metaphor consisting
of two distinct elements :
1) Individual
2) Population
An individual is a single solution while a
population is a set of individuals at an instant of
searching process.
Individual Representation :Phenotype and
Genotype

• An individual is defined by a chromosome. A


chromosome stores genetic information
(called phenotype) for an individual.
• Here, a chromosome is expressed in terms of
factors defining a problem
Individual Representation :Phenotype and
Genotype
Note :
• A gene is the GA’s representation of a single
factor (i.e. a design parameter), which has a
domain of values (continuous, discontinuous,
discrete etc.) symbol, numbering, etc.
• In GA, there is a mapping from genotype to
phenotype. This eventually decides the
performance (namely speed and accuracy) of the
problem solving.
Encoding techniques
There are many ways of encoding:
1) Binary encoding: Representing a gene in terms
of bits (0s and 1s).
2) Real value encoding: Representing a gene in
terms of values or symbols or string.
3) Permutation (or Order) encoding:
Representing a sequence of elements.
4) Tree encoding: Representing in the form of a
tree of objects.
Binary Encoding
• In this encoding scheme, a gene or
chromosome is represented by a string (fixed
or variable length) of binary bits (0’s and 1’s)
Pros and cons of Binary encoding scheme
• Limitations:
1) Needs an effort to convert into binary from
2) Accuracy depends on the binary representation
• Advantages:
1) Since operations with binary representation is
faster, it provide a faster implementations of all
GA operators and hence the execution of Gas
2) Any optimization problem has it binary‐coded
GA implementation
Real value encoding
The real‐coded GA is most suitable for
optimization in a continuous search space.
• Uses the direct representations of the design
parameters.
• Thus, avoids any intermediate encoding and
decoding steps.

You might also like