GENETIC ALGORITHM

GENETIC ALGORITHM

by,
Mr. Sanjay Sawaitul
CONTENTS
 Introduction
 Genetic Lifecycle
 Genetic Operators
INTRODUCTION
 The genetic algorithm is a method for solving both
constrained and unconstrained optimization
problems that is based on natural selection, the
process that drives biological evolution.
 The genetic algorithm repeatedly modifies a
population of individual solutions.
 Genetic Algorithms (GAs) are adaptive heuristic
search algorithm based on the evolutionary ideas
of natural selection and genetics.
 GA represent an intelligent exploitation of a
random search used to solve optimization problems.
GENETIC
LIFECYCLE Parents
Selection Modification

Modified
Members

Initiate
Population Evaluated
Evaluation
Evaluate
Offspring
Deleted
Members

Discard
GENETIC
OPERATORS
 Selection

 Cross Over
 Mutation
SELECTION
OPERATOR
 Selection is the stage of a genetic
algorithm in which individual genomes are
chosen from a population for later breeding
(using the crossover operator).
CROSS OVER
 In genetic algorithms,
crossover is a genetic operator
used to vary the programming of
a chromosome or
chromosomes from one
generation to the next. It is
analogous to reproduction and
biological crossover, upon
which genetic algorithms are
based.
MUTATION
 Mutation is a genetic operator used to maintain
genetic diversity from one generation of a
population of genetic algorithm chromosomes to
the next.
 Mutation is analogous to biological mutation.
 Mutation alters one or more gene values in a
chromosome from its initial state.
 EXAMPLE
Fitness
Function
24
234098761 2340 98761 9876125437 9876125437
21
254378956 25437 8956 23408956 23408956
18
964325241 9643 25241 96433891 96433891
10
876543891 87654 3891 2524187654 2524187654
Initial Selection Cross Over Mutation
Population