Presented By:
Nitesh Trivedi,
M.Tech 1st Year,
CSE(Analytics)
GENETIC ALGORITHM //INTRODUCTION
Genetic Algorithm (GA) is a search-based optimization
technique based on the principles of Genetics and
Natural Selection.
Genetic Algorithms (GAs) are search based algorithms
based on the concepts of natural selection and genetics.
GAs are a subset of a much larger branch of computation
known as Evolutionary Computation.
GAs were developed by John Holland and his students and
colleagues at the University of Michigan.
GA follows principle of Darwinian Theory of “Survival of
the Fittest”.
BASIC TERMINOLOGY
Population- It is a subset of all the possible (encoded) solutions
to the given problem.
Chromosomes- A chromosome is one such solution to the given
problem.
Gene- A gene is one element position of a chromosome.
Allele- It is the value a gene takes for a particular chromosome.
Genotype- Genotype is the population in the computation space.
Phenotype- Phenotype is the population in the actual real world
solution space.
Decoding and Encoding- Decoding is a process of
transforming a solution from the genotype to the phenotype space
and Encoding is vice-versa.
Fitness Function- A fitness function takes the solution as input
and produces the suitability of the solution as the output.
Genetic Operators- These alter the genetic composition of the
offspring. These include crossover, mutation, selection, etc.
METHODOLOGY
Initial
Population
Fitness
Next
Selection
Generation
Mutation Crossover
PARENT SELECTION
Parent Selection is the process of selecting parents which mate and
recombine to create off-springs for the next generation.
Methods for parent selection-
1) Fitness Proportionate Selection
a) Roulette Wheel Selection
b) Stochastic Universal Sampling (SUS)
2) Tournament Selection
3) Rank Selection
4) Random Selection
Fitness Proportionate Selection- Fitness Proportionate Selection
is one of the most popular ways of parent selection. In this every
individual can become a parent with a probability which is
proportional to its fitness.
ROULETTE WHEEL SELECTION
Picture Courtesy- Tutorials Point
(https://www.tutorialspoint.com/genetic_algorithms/genetic_algorithms_parent_selection.
htm)
STOCHASTIC UNIVERSAL SAMPLING (SUS)
Picture Courtesy- Tutorials Point
(https://www.tutorialspoint.com/genetic_algorithms/genetic_algorithms_pare
nt_selection.htm)
TOURNAMENT SELECTION
Picture Courtesy- Tutorials Point
(https://www.tutorialspoint.com/genetic_algorithms/genetic_algorithms_parent_selection.
htm)
RANK SELECTION
The previous selection will have problems when the finesses differs very
much. For example, if the best chromosome fitness is 90% of all the roulette
wheel then the other chromosomes will have very few chances to be selected.
Picture Courtesy- http://www.obitko.com/tutorials/genetic-algorithms/selection.php
CROSSOVER
In this more than one parent is selected and one or more off-springs are
produced using the genetic material of the parents.
CROSSOVER OPERATORS-
1) One Point Crossover-
2) Multi Point Crossover-
MUTATION
In simple terms, mutation may be defined as a small random tweak in the
chromosome, to get a new solution. It is used to maintain and introduce
diversity in the genetic population and is usually applied with a low
probability – pm.
Mutation Operators-
1) Bit Flip Mutation
2) Scramble Mutation
3) Inversion Mutation
4) Swap Mutation
TERMINATION CONDITION
The termination condition of a Genetic Algorithm is important in
determining when a GA run will end.
Usually, we keep one of the following termination conditions −
1) When there has been no improvement in the population for X iterations.
2) When we reach an absolute number of generations.
3) When the objective function value has reached a certain pre-defined value.
ADVANTAGES
It is frequently used to find optimal or near-optimal solutions to
difficult problems which otherwise would take a lifetime to solve.
It is frequently used to solve optimization problems, in research, and
in machine learning.
Is faster and more efficient as compared to the traditional methods.
Optimizes both continuous and discrete functions and also multi-
objective problems.
Useful when the search space is very large and there are a large
number of parameters involved.
Provides a list of “good” solutions and not just a single solution.
LIMITATIONS
GAs are not suited for all problems, especially problems which are
simple and for which derivative information is available.
Fitness value is calculated repeatedly which might be
computationally expensive for some problems.
Being stochastic, there are no guarantees on the optimality or the
quality of the solution
If not implemented properly, the GA may not converge to the optimal
solution.
REFERENCES
https://www.tutorialspoint.com/genetic_algorithms/genetic_algorithm
s_introduction.htm
P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining,
Pearson Addison Wessley, 2005.
J. Han, M. Kamber, Data Mining Concepts and Techniques, San
Francisco:Morgan Kaufmapp, 2006.
http://www.obitko.com/tutorials/genetic-algorithms/selection.php
