Genetic Algorithms

Population of
individuals or alternative
(feasible) solutions

Next generation
Evaluate individuals
of
on their fitness
individuals

a l
i
t io n
n
e re uct
i ffSelect
od individuals
Arbitrarily change pr
D ebased on fitness
some characteristic n R
t io for subsequent mating
r ia
V a
etic
n Select individuals Heredity
Ge Mating pool of
& exchange charac- “fitter”
teristics to create individuals
new individuals
 Genetic Algorithms
What is an individual?

z
x,y,z 24,2,11 1001,0000,1101
y
x

i i
h h
g g (a,b)(b,c)(c,d)…(h,i) a,b,c,d,…i
d e d
f e f
a b c a b c
 Genetic Algorithms
Steps:

Generation of initial population

Evaluation

Selection (Reproduction operation)

Exchange characteristics to develop new

individuals (Crossover operation)

Arbitrarily modify characteristics in new

individuals (Mutation operation)
 Genetic Algorithms
Reproduction / Selection Operator

The purpose is to bias the mating pool (those who

can pass on their traits to the next generation)
with fitter individuals

Assign p as the prob. of choosing Choose n individuals randomly

an individual for the mating pool
p is proportional to the fitness
Choose an individual with prob. p
and place it in the mating pool
Continue till the mating pool size
is the same as the initial population’s
Pick the one with highest fitness
Place n copies of this individual in
the mating pool
Choose n different individuals and
repeat the process till all in the
original population have been chosen
 Genetic Algorithms
Crossover operator

1001101 1001111

1100101
1100111
 Genetic Algorithms
Mutation

1001101 1000101
 Function Optimization using GA

Results from a small example:

Minimize f ( x1 , x 2 ) ( x12  x 2  11) 2  ( x1  x 22  7) 2
0  x1 , x 2 6

Initial Population Generation 10

Generation 40 Generation 20
Function Optimization using GA

Generation 50 Generation 30
 Genetic Algorithms
Issues

Representation

Generation of initial population

Evaluation

Reproduction operation

Crossover and Mutation operations and

feasibility issues
 Genetic Algorithms
Benefits to engineers as an optimization tool

Problem formulation is easier

Allows external procedure based declarations

Can work naturally in a discrete environment

 Some Applications
Decision making / decision support systems

Engineering component / equipment design

Engineering process optimization

Portfolio optimization

Route optimization; optimal layout; optimal packing

Schedule optimization

Protein structure analysis

Single Vehicle Routing Problem
Single Vehicle Routing Problem: Description

Nodes can be visited in any Travelling Salesman

order and at any time Problem (TSP)

Some nodes cannot be Pickup & Delivery

visited before others; no Problem (PDP)
restrictions on visit time

Some nodes cannot be Dial-a-ride Problem

visited before others;
restrictions on visit time
Single Vehicle Routing Problem: Description
J J
I I
A A
H H
B K B K

C G C G

D F D F

E E
A-B-C-H-G-D-E-F-I-J-K-A
A-B-C-D-E-F-H-G-I-J-K-A
A-B-C-D-E-F-H-G-K-J-I-A
A-B-C-D-E-F-G-K-J-H-I-A
A general formulation for all types of
SVRP: A mutation-only GA approach
Single Vehicle Routing Problem: Formulation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 202
Distance between nodes = Geospherical distance
Optimal (reported in liter.)

Near-optimal (obtained
here)
Single Vehicle Routing Problem (PDP): Result
Total nodes = 70
Distance between nodes: Euclidean distance
Optimum
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Initial generation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Intermediate generation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Intermediate generation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Intermediate generation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Intermediate generation
Single Vehicle Routing Problem (TSP): Result
Total nodes = 51,
Final generation