Ga Irtt

1
Presented by : Presented by :
DR SISHAJ P SIMON, DR SISHAJ P SIMON,
Department of Electrical and Electronics Engineering Department of Electrical and Electronics Engineering
National Institute of Technology National Institute of Technology
Trichy Trichy 620 015, Tamil Nadu (India) 620 015, Tamil Nadu (India)
GENETIC ALGORITHM AND ITS HYBRID SYSTEMS GENETIC ALGORITHM AND ITS HYBRID SYSTEMS
As natural selection works solely by and for the good of each
being, all corporeal and mental endowments will tend to progress
toward perfection.
- Charles Darwin, Origin of Species
2
ORGANIZATION ORGANIZATION
2
GENETIC ALGORITHM AND PROGRAMMING GENETIC ALGORITHM AND PROGRAMMING
CASE STUDIES CASE STUDIES--EXAMPLES EXAMPLES--APPLICATIONS APPLICATIONS
GENETIC OPERATORS GENETIC OPERATORS
HOW GENETIC ALGORITHM WORKS? HOW GENETIC ALGORITHM WORKS?
SELECTION SELECTION
INTRODUCTION INTRODUCTION
GENETIC REPRESENTATION GENETIC REPRESENTATION
GA PROGRAMMING (MATLAB) GA PROGRAMMING (MATLAB)
3
Genetic algorithms (GAs) are a technique to solve problems which need optimization
GAs are a subclass of Evolutionary Computing
GAs are based on Darwins theory of evolution
History of GAs
Evolutionary computing evolved in the 1960s.
GAs were created by John Holland in the mid-70s.
Every animal cell is a complex of many small factories working together
The center of this all is the cell nucleus
The nucleus contains the genetic information
Biological Back Ground Biological Back Ground
GENETIC ALGORITHMS GENETIC ALGORITHMS
3 4
GA GA--BIOLOGICAL BACK GROUND BIOLOGICAL BACK GROUND
4
2
S.P.Simon EED NITT 5
The genetic algorithm (GA) is defined by randomized search and
optimization technique guided by the principle of natural genetic
systems.
WHAT IS GA? WHAT IS GA?
1. A genetic representation for potential solutions
to the problem.
2. A way to create an initial population of
potential solutions,
3. An evaluation function that plays the role of
the environment, rating solutions in terms of
their fitness.
4. Genetic operators that alter the composition of
children.
5. Values for various parameters that the genetic
algorithm uses (population size,
probabilities of applying genetic operators,
etc.).
Step by Step Procedures of Genetic Algorithms
A. Many real life problems cannot be solved in polynomial amount of time
using deterministic algorithm
B. Sometimes near optimal solutions that can be generated quickly are more
desirable than optimal solutions which require huge amount of time
C. Problems can be modeled as an optimization one.
D. GA work with a coding of the parameter set, not the parameters
themselves. Therefore GA can easily handle the integer or discrete
variables.
E. GA search from a population of points, not a single point. Therefore GA
can provide a globally optimal solution.
F. GA use only objective function information, not derivatives or other
auxiliary knowledge. Therefore GA can deal with the non-smooth, non-
continuous and non-differentiable functions which are actually existed in a
practical optimization problem.
G. GA use probabilistic transition rules, not deterministic rules
HOW IS GA DIFFERENT FROM OTHER SEARCH ALGORITHMS? HOW IS GA DIFFERENT FROM OTHER SEARCH ALGORITHMS?
GENETIC REPRESENTATION (ENCODING) GENETIC REPRESENTATION (ENCODING)
Chromosomal representation of a problem
Binary string representation
Real number coding
Integer coding
Representing genes in arrays, trees, lists and other objects
Note: Ensure suitable representation of solutions with meaningful and
problem-specific genetic operators
1. Binary representation - binary coding and gray coding
2. Octal representation
3. Hexadecimal representation
4. Floating point representation
5. Tree representation (Minimum spanning tree (MST) formulation method )
6. Permutation representation
7. Random keys representation
8. Job Shop Scheduling (JSP)
Operation-based representation
Job-based representation
Preference-list-based representation
Job-pair-relation-based representation
Priority-rule-based representation
Disjunctive-graph-based representation
Completion time-based representation
Machine-based representation and Random keys representation.
Etc.
GENETIC REPRESENTATIONS GENETIC REPRESENTATIONS
3
GENETIC REPRESENTATIONS GENETIC REPRESENTATIONS--Examples Examples
) (
) 1 2 (
string of value decoded
X X
X X
i n
l
i
u
i l
i i

+ =
Binary coding
.
If p is the precision required for a continuous variable then the string length Sl should be equal to
(

p
X X
l u
2
log
Each variable has both the upper and lower limit which can be put in the form as
An n-bit string can be represented from 0 to 2
n
-1, which constitutes 2
n
integers
u
i i
l
i X X X
D
i
= 1010 = 2
3
x 1 + 2
2
x 0 + 2
1
x 1 + 2
0
x 0 = 10
n = 4, 20 & 5 = =
l
i
u
i
X X
12 10
) 1 2 (
) 5 20 (
2
4
=
+ =
i
X
Permutation representation (Path Representation or Order representation)
GENETIC REPRESENTATIONS GENETIC REPRESENTATIONS- -Examples Examples
For example, a tour of 8-city Travelling Salesman Problem(TSP)
3-5-8-1-4-2-6-7 can be represented as [3 5 8 1 4 2 6 7]
Random keys representation
Solution is encoded with random numbers from (0, 1) - 8 city TSP
[0.45 0.68 0.91 0.11 0.62 0.34 0.74 0.89] can be represented as 3-5-8-1-4-2-6-7
(machine scheduling- resource allocation- vehicle routing-quadratic assignment
problem)
SELECTION SELECTION
GENETIC SELECTION GENETIC SELECTION
a) Sampling space Regular-Enlarged
b) Sampling mechanism- Stochastic sampling - Deterministic sampling - Mixed sampling
c) Selection probability.
SAMPLING SPACE
A new population is created for the next generation with the help of
selection procedure based on either all parents and offspring or part of
them.
Two important factors: Size and the Ingredient of parent or offspring
New population
Selection
Population
Crossover
Mutation
Replacement
Regular sampling space
Generational replacement-Holland
Crowding strategy-De Jong (one parent chromosome is selected to die after the offspring is
produced -bit-bybit similarity count mechanism to measure resemblance)
4
Enlarged sampling space
Enlarged sampling space offers both the parents and offspring equal chance
to compete for survival in the next generation.
New population
Parents
Crossover
Mutation
Off spring
Selection phase determines the actual number of copies that each
chromosome will receive based on its survival probability(selection
probability)
(1) chromosomes expected values is determined (2) the expected values is
converted to the number of offspring
Eg. Hollands proportionate selection or roulette wheel selection (maintains
diversity of population)
Prevents
- duplicating of chromosome
- dominating of super chromosomes
- premature convergence to local minimum
SAMPLING MECHANISM
Deterministic Sampling
Selection of best pop size chromosomes from the sampling space is the
significant feature of this approach.
Truncation selection : A threshold T is defined such that the T% of
chromosomes are selected and each one receives nearly 100/T copies
Elistic selection : Ensures that the best chromosome is passed onto the next
generation, if not selected by any means of selection methods
Steady State selection : Modified version of generational replacement
approach where we find, not the entire set of parents is replaced by their off
springs but replacing n worst old chromosomes with n number of off springs
Mixed Sampling
Mixing of the features of the random and deterministic selection procedure
is the approach found in this sampling mechanism.
Eg. Tournament selection: runs a "tournament" among a few individuals
chosen at random from the population and selects the winner (the one with
the best fitness) for crossover easily adjusted by changing the tournament
size. If the tournament size is larger, weak individuals have a smaller chance
to be selected
5
SELECTION PROBABILITY
Proportional selection methods selection Selection of chromosome is proportional to the
fitness of the chromosomes
Limitation: during early generations; the selection process is dominated by few super
chromosomes and in the later generations when the population is largely converged, the
competition among the chromosomes has reduced and a random search behavior is
emerged
Scaling mechanism maps the raw objective function values to some positive
real values, and the survival probability for each chromosome determined
according these values.
Fitness scaling is used to maintain a reasonable differential between relative
fitness ratings of chromosomes and to prevent a domination of some super
chromosomes in order to meet the requirement to limit competition early on,
but to stimulate it later.
)) ( ( ) (
'
rawfitness f g ess scaledfitn f
k k
=
linear scaling, sigma truncation, power
law scaling, logarithmic scaling etc.
Main Operator Types Main Operator Types
Crossover (recombination)- Exchanging genetic material
between the individuals of the chromosomal population
Mutation A genetic operator used to maintain genetic
diversity from one generation of a population of chromosomes
to the next
Analogous to biological reproduction
REPRODUCTION
GA GA--CROSSOVER CROSSOVER
Conventional binary crossover
Single Point Crossover
Parent 2 Child 1 Child 2 Parent 1
1
0
0
0
0
1
1
1
1
1
X =
1
0
0
0
1
0
1
1
1
1
1
0
1
Before mating After mating
1
0
1
1
1
Double Point Crossover
Before mating
After mating
1
0
0
1
1
1
1
1
1
1
1
X
=
1
0
1
1
1
1
1
1
Parent 2 Child 1 Child 2
0
0
0
0
1
1
0
0
0
Parent 1
6
Multiple Point Crossover
1X
1
1
1
1
1
1
0
0 1
1
1
0
0
0
0
1
0
0
0
0
1
1 1
0
Parent 1 Parent 2
1
1
1
0
1
0
0
0
1
0
0
0
1
1
0
0
1
1 1
0
1
1
1
0
Child 1
Child 2
Even cross-site multi - point cross over
=
Parent 2 Child 1 Child 2
1
0
0
1
1
1
1
1
1
1
1
X
0
0
0
1
0
1
1
0
0
1
1
0
1
0
1
1
1
Parent 1
Odd cross- site multi -point cross over
Uniform Crossover
Parent 1 Parent 1 Child 1
x
0
0
1
1
1
0
0
1
0
0
1
1
0
1
1
1
1
0
0
0
1
1
1
=
1
1
0
1
0
0
1
0
1
Exchange
Child 1
Exchange
Uniform crossover is
achieved as a result of
exchanging bits from two
individual parental
chromosomes by
maintaining a probability
of 0.5 to produce off
springs
Masking based Uniform Crossover
1
1
0
1
0
0
0
1
1
1
0
0
0
0
1
1
x
Cross over mask
1
1
0
0
0
0
1
1
1
1
0
1
0
0
0
1
=
Parent 1 Parent 2 Child 1 Child 2
1
0
1
1
0
0
0
1
Matrix Crossover
1 0
1
1 0
1
0
1
1
0
0
1
1 0
0
1
1
0
Parent 1
Parent 2
X
0
1
1
0
1
0 0
1
1 0
0
1
1
0
Child 1
Child 2
1
1
0
1
Cross sites of row and column
are chosen randomly
Select any region between
in each layer, either
vertically or horizontally and
then exchange the
information in the region
between the mated
populations.
7
Permutation Based Crossover
Sub string
Mapping relationship
93
254
16
X
7
8
9
3
5
6
4
2
1
7
4
6
9
2
1
5
8
3
Sub string
Sub string
=
9
7
8
3
9
2
1
5
4
6
7
2
1
3
5
6
4
8
Sub string
Child 2
Partial-mapped Crossover
Order Crossover
X X
X
9
6
8
7
3
1
2
5
4
9
6
8
7
3
1
4
2
5
9
8
6
4
1
2
7
3
5
Parent 1 Child 1 Parent 2 Child 2
9
6
8
7
3
1
2
5
4
Parent 1
9
8
6
4
1
2
3
7
5
Sub string Sub string Sub string Sub string
Substring 1-3-7-8 of the
parent 1 is copied to the
child 1
Delete the nodes form
parent 2 which are already
present in child 1
Starting from bottom to
top of the parent 2 string,
9-6-4-2-5 nodes are left
out and have to be filled in
the empty segments of
child 1 from bottom to top
of the sting
Position based Crossover
X
Random
selected
positions
X
Child 1 Parent 2 Child 2 Parent 1
6
X
9
6
8
7
3
1
2
5
4
9
6
8
4
2
1
3
5
7
9
8
6
7
1
2
3
4
5
Parent 1
9
8
7
3
1
2
5
4
9
8
6
4
1
2
3
7
5
Random
selected
positions
Set of random selected
positions 5-1-8-6 from parent
1 is copied to the child 1
Delete the nodes form parent
2 which are already present
in child 1
Starting from bottom to top
of the parent 2 string, 9-4-2-
3-7 nodes are left out and
have to be filled in the empty
segments of child 1 from
bottom to top of the string
Order Based Crossover
Random
selected
positions
Child 1 Parent 2 Parent 1
6
X
9
6
8
7
3
1
2
5
4
9
6
8
4
1
2
3
7
5
9
6
8
7
1
3
2
5
4
Parent 1
9
8
7
3
1
2
5
4
9
8
6
4
1
2
3
7
5
Random
selected
positions
X X
Set of random selected
positions from one parent is
considered (5-1-8-6 from
parent 1)
Delete the selected nodes of
parent 1 from parent 2
The remaining nodes 9-4-2-3-7
of parent 2 is transferred to its
child 1 string maintaining the
same locations of the parent 2.
Selected nodes of the parent 5-
1-8-6 are filled from bottom to
top in the empty segments of
the child 1 string.
8
Cycle Crossover
Cycle548675 Cycle457684
Remaining nodes 3-2-1-9
(FromParent 2)
Remaining nodes 2-1-3-9
(FromParent 1)
4
5
2
1
3
8
7
6
9
X
X
Parent 1 Child 1 Parent 2 Child 2 Parent 1 Parent2
4
5
2
1
3
8
7
6
9
5
7
3
2
1
4
6
8
9
5
7
3
2
1
4
6
8
9
4
5
3
2
1
8
7
6
9
5
7
2
1
3
4
6
8
9
Selected nodes (4-5-8-6) in
the parent 1, involved in the
cycle, are transferred to its
child 1 string maintaining the
same locations of the parent
itself.
Delete the selected nodes of
parent 1 form parent 2.
The remaining nodes 3-2-1-9
of parent 2 are imposed to
its child 1 string maintaining
the same locations.
Sub Tour Exchange Crossover
Sub tour
X
7
8
9
3
5
6
4
2
1
3
4
6
5
2
1
9
8
7
Sub tour
Sub tour
=
7
7
8
9
3
4
6
5
2
1
3
5
6
4
2
1
9
8
Sub tour
Child 2
Sub string from each of the
crossing parents is selected.
Sub strings contain only the
common nodes, which is
exchanged between parents
producing child strings
Arithmetic crossover
Achieved by the principle of convex set theory
Weighted average of the two vectors X1 & X2 are calculated as X1 + X2,
where the multipliers are restricted as + = 1, such that >0 and >0
X'1= X1 + X2
X'2= X2 + X1
Crossover Operation
= =0.5 (Average cross over)
=1.5 and = -0.5 (Affine cross over)
When one of the multiplier is given a
random real number in the interval [-n,1+n]
(extended intermediate crossover)
Linear Crossover
+ 2, where > 0 and >0.
Directional Crossover
X = R * (X2 - X1) + X2
R is a random number between 0 and 1
Maintain that the parent X2 is not worse
than X1; i.e., f(X2 ) f(X1) for
maximisation problems and f(X2)
f(X1)for minimisation problems
GA GA--MUTATION MUTATION
a)Uniform mutation
X
t
=[X
1,
X
2
X
m
] - Chromosome
A random number is selected such that k [1,m]
X
t+1
=[X
1,
X
k
X
m
] Off- Spring
X
k
- A random value generated according to
uniform probability distribution from the range ] , [
U
k
L
k
X X
b) Boundary mutation
X
k
L
k
X
U
k
X or
Replacement takes place with equal probability
9
GA GA--MUTATION MUTATION
c) Non-Uniform mutation
X
t
=[X
1,
X
2
X
m
] - Chromosome
A random number is selected such that k [1,m]
X
t+1
=[X
1,
X
k
X
m
] Off- Spring
. 1
, 0
) , (
) , (
'
is digit random a if
is digit random a if
X X t X
X X t X
X
L
k k k
k
U
k k
k

+
=
IMPLEMENTATION OF GA IMPLEMENTATION OF GA--MUTATION WITH PROGRAM LOGICS MUTATION WITH PROGRAM LOGICS
Y=3 X=11
X=4
Y=12
1 0 1 1 0
0
1
1
C
0 1 0 0 1
1
0
0
C
m
1)Ones complement operator

2) Logical bitwise operator
Logical bitwise operator
14 10
1 0 1 0 1
1
1
0
Px
7
11
0 1 1 1 1
0
1
1
Py
2
10
0 0 1 0 1
0
1
0
Cxy
a)Bit-wise AND operator
b) Bit-wise XOR operator
14 10
1 1 0
1
1
1
0
Px
7
11
0 1 1 1 1
0
1
1
Py
13
5
1 1 0 1
0
1
0
1
Cxy
c) Bit-wise OR operator
1 0
14 10
14
1 0 1 0 1
1
1
0
Px
7
10
0 1 1 1
1
0
1
0
Py
15
1 1 1 1 1
1 Cxy
Shift operators
14 10
1 0 1 0 1
1
1 0
Px
11 9
1 0 1 1 1
0
0
0
Px<< 2 Cx
Shift left operator
Shift right operator
14 10
1 0 1 0 1
1
1
0
Px
2
11
0 0 1 0 1
0
1
1
Px>> 2 Cx
Masking Operator
14
10
1 0 1 0
1
1
1 0
Px
2 2
0 0 1 0 0
0
1
0
Cx
Mask table
AND Operator
0 1 1 1 0 0 1 1
10
Mutation for Permutation Representation
Inversion Mutation
2 5 4 9 6
8
1
3
Px
7
2 5 8 6
9
4
1
3
Cx
7
Randomly selected substring
Inverted substring
Insertion Mutation
2 5 4 9 6
8
1
3
Px
7
2 6 5 4 9
8
1
3
Cx
7
Randomly selected position
Randomly inserted position
Displacement
2 5 4 9 6
8
1
3
Px
7
2 6 4 9
5
8 1
3
Cx
7
Randomly selected substring
Randomly inserted position
Reciprocal Exchange
2 5 4 9 6
8
1
3
Px
7
Randomly selected two positions
Swaping the relative nodes
2 4 9
5 8
1
3
Cx
7
6
Randomly selected three positions
1 2 3 4 5
6
7
8
Px
9
1 2 3 4 5
8
7
6
Nx
9
1 2 8 4 5
3
7
6
Nx
9
1 2 8 4 5
6
7
3
Nx
9
1 2 6 4 5
8
7
3
Nx
9
1 2 6 4 5
3
7
8
Nx
9
The neighbors form with the nodes
Heuristic Mutation
NATURAL INHERITANCE OPERATORS
Dominance
A
b
C
D
e
a
B
C
d
e
A
B
C
D
e
Genotype having one pair of
Chromosome (Homologous
Chromosomes)
Phenotypic
expression
Dominant gene is expressed when it is heterozygous (mixed,
AaA) or homozygous (pure, CCC) and the recessive allele is
expressed only when it is homozygous (eee).
11
Inversion
1 0 1 1 0
0
1
0
C
1
1 0 0 0
1
1
1
0
Ci
1
Inversion
Random selected sites
Deletion
1 0 1 1 0
0
1
0
C
1
1 0 1 1 -
-
1
0
Cd
1
Deletion
Intrachromosomal duplication
1 0 1 0 0
0
1
0
C
1
Deletion
1 0 1 0
-
-
1
0
Cd
1
1 0 1 0 1
0
1
0
Cd
1
Duplication
Regeneration
1 0 1 0 0
0
1
0
C
1
Deletion
1 0
0
Cd
1
1 0 0 0 1
0
0
0
Cdp
1
Regeneration
- - -
-
-
Segregation
Child 1
1 0 1 1 0
0
1
0
C
1
1 0 1 0
0
0
1
1
Cs
1
Parent 1
Parent 2
Child 2
Other inheritance operators:
Translocation, Niche and speciation, Migration, Sharing, Mating
44
0 START : Create random population of n chromosomes
1 FITNESS : Evaluate fitness f(x) of each chromosome in
the population
2 NEW POPULATION
0 SELECTION : Based on f(x)
1 RECOMBINATION : Cross-over chromosomes
2 MUTATION : Mutate chromosomes
3 ACCEPTATION : Reject or accept new one
3 REPLACE : Replace old with new population: the new
generation
4 TEST : Test problem criterium
5 LOOP : Continue step 1 4 until criterium is satisfied
HOW GA WORKS? HOW GA WORKS?
44
12
CASE STUDY EXAMPLES-APPLICATION
Traveling salesman problem
Permutation representation of
city nodes in each parent
chromosome
Minimize
Cost=
Production of the initial
chromosomal population
Evaluation of cost
Selection of chromosome for
mating
Permutation crossover and
mutation
Change old population with
new population
Test convergence of cost
Stop
=
+ +
+
N
n
n n n n
y y x x
0
2
1
2
1
) ( ) (
No of cities: N(13)
Possible combinations :13! / 2 = 3.1135x10
9
N
ipop
= 800 (Initial population)
N
pop
= 400
(Constant maintained population at each generation),
Ngood= 200 (Best selected population)
=0.04 (Mutation rate)
Neuro-Genetic (GA based BPN)
HYBRID GA
Optimization of weights of BPNN using Genetic algorithm
Inputs
Outputs
1
2
3
1
2
1
Input neurons Hidden neurons Output neuron
W11
W12
W21
W22
W32
W31
V11
V21
Consider a 3-2-1 (l-m-n) BPNN architecture neural network. Therefore the
number of weights to be determined is (l + n) m, which is (3+1) 2 = 8.
Here the number of digits of each gene is 5. Therefore the total
length of the string is 8 X 5=40.
GA-BPNN
HYBRID NN MODELS
Representation of chromosomes generated randomly for BPNN weights
13
GA-BPNN
HYBRID NN MODELS
<
+ +

+ +
+
+
+
+
+
+
+
5 0
10
.... 10 10
9 5 ,
10
..... 10 10
1 2
) 1 (
3
3
2
2
1 2
) 1 (
3
3
2
2
kd d
d k
d
kd
d
kd
kd d
d k
d
kd
d
kd
k
x if
x x x
x if
x x x
w
L d
x x x x ,....., ,....., ,
2 1
d k kd kd
x x x
) 1 ( 2 1
,..., ,
+ + +
Let represents a chromosome and
represent the k
th
gene (k 0) in the chromosome.
The actual weight is given by
GA-BPNN
HYBRID NN MODELS
GA-BPNN
HYBRID NN MODELS

Ga Irtt

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Ga Irtt

Transféré par

Droits d'auteur :

Formats disponibles

1

1)Ones complement operator

Vous aimerez peut-être aussi