Contents

 Introduction to Genetic Algorithm

 Darwin’s Theory of Natural Selection: Biological Perspective
 Optimization
 Vocabulary of GA
 Genetic Operators
 Fitness Function
 Survival of the fittest: GA Perspective
 Search Space
 Natural Genetics
 Applications Areas of GA
Genetic Algorithm
 A genetic algorithm (or GA) is a search technique used in
computing to find optimal solutions to optimization and
search problems.
 GA is inspired by Charles Darwin’s theory of natural
evolution “survival of the fittest”.
 GA is based on the principle of Natural Genetics and Natural
selection.
Darwin’s Theory of Natural Selection:
Biological Perspective

• It states that only the organism best

adapted to their environment tend to
survive and transmit their genetic
properties to succeeding generations.

• Organism that are less adapted to their

environment tend to get eliminated.
Vocabulary of GA
 Cell: Cell is a basic unit of function in lifetime.
 Chromosomes: A chromosome is one such solution to the
given problem. It is the blueprint of an individual.
 Gene: A gene is one element position of a chromosome.
 Population: It is a subset of all the possible (encoded)
solutions to the given problem. 
 Individual: Any possible solution to the problem.
 Allele: It is the value a gene takes for a particular
chromosome.
Genetic Operators and Parameters
 Selection: Parent Selection is the process of selecting parents which mate

and recombine to create off-springs for the next generation based on a fitness
value.

 Crossover: The crossover operator is analogous to reproduction and

biological crossover. In this more than one parent is selected and one or more

off-springs are produced using the genetic material of the parents.

 Mutation: It may be defined as a small random change in the chromosome, to

get a new solution.

Fitness Function

Fitness function takes a solution to the problem as

input and produces as output how fit and how good
the solution is w.r.t the problem in consideration.
Optimization
 Optimization is the process of making something better.
 Optimization refers to finding the values of inputs in such a way that we get the
“best” output values.
 The definition of “best” varies from problem to problem.
Search Space
 Search Space is the set of all possible solutions
 Out of all these solution there lies a set of points
that provides the optimal solution
 The aim of optimization is to find that set of points
in the search space.
Natural Genetics
 Selection of Parents
 Find solutions by undergoing Crossover and Mutations
 Production of New Offsprings (Childrens)
 Repeat the Process for different generations
Survival of the fittest: GA Perspective

 Consider only those solutions which are Fit enough

 Discard all non-fit solutions

 Each individual must assigned a fitness value(fitness function).

 High fitness value Individuals given higher chance to mate to

produce more “fitter” individuals.

Applications of GA
Thus Genetic Algorithms implement the
optimization strategies by simulating
evolution of species through natural
selection.
Thank You