Professional Documents
Culture Documents
GENETIC ALGORITHMS
SUBMITTED BY : MANISH M. PATIL
SUBMITTED TO : PROF.A.R.KOLHE
BASICS OF GA
The most common type of genetic algorithm works like this:
A population is created with a group of individuals created
randomly.
The individuals in the population are then evaluated.
The evaluation function is provided by the programmer and
gives the individuals a score based on how well they
perform at the given task.
Two individuals are then selected based on their fitness,
the higher the fitness, the higher the chance of being
selected.
These individuals then "reproduce" to create one or more
offspring, after which the offspring are mutated randomly.
This continues until a suitable solution has been found or a
certain number of generations have passed, depending
on the needs of the programmer.
COMPONENTS OF A GA
A problem to solve, and ...
Encoding technique
(gene, chromosome)
Initialization procedure
(creation)
Evaluation function
(environment)
Selection of parents
(reproduction)
Genetic operators (mutation, recombination)
Parameter settings
(practice and art)
children
modified
children
parents
population
deleted
members
discard
modification
evaluated children
evaluation
POPULATION
population
Chromosomes could be:
Bit strings
Real numbers
Permutations of element
Lists of rules
Program elements
... any data structure ...
REPRODUCTION
reproduction
children
parents
population
Parents are selected at random with selection chances biased in
relation to chromosome evaluations.
CHROMOSOME MODIFICATION
children
modification
modified children
A SIMPLE EXAMPLE
The Traveling Salesman Problem:
Find a tour of a given set of cities so that
each city is visited only once
the total distance traveled is minimized
REPRESENTATION
Representation is an ordered list of city
numbers known as an order-based GA.
1) London
2) Venice
CityList1
CityList2
3) Dunedin
4) Singapore
5) Beijing
7) Tokyo
6) Phoenix 8) Victoria
(3 5 7 2 1 6 4 8)
(2 5 7 6 8 1 3 4)
CROSSOVER
Crossover combines inversion and
recombination:
*
*
Parent1
(3 5 7 2 1 6 4 8)
Parent2
(2 5 7 6 8 1 3 4)
Child
(5 8 7 2 1 6 3 4)
MUTATION
Mutation involves reordering of the list:
Before:
*
*
(5 8 7 2 1 6 3 4)
After:
(5 8 6 2 1 7 3 4)
10
20
30
40
50
x
60
70
80
90
100
100
80
60
40
20
10
20
30
40
50
x
60
70
80
90
100
100
80
y 60
40
20
10
20
30
40
50
x
60
70
80
90
100
100
80
y 60
40
20
10
20
30
40
50
x
60
70
80
90
100
100
80
y 60
40
20
10
20
30
40
50
x
60
70
80
90
100
OVERVIEW OF PERFORMANCE
TSP30 - Overview of Performance
1800
1600
1400
1200
e
c 1000
n
a
t
s
800
i
D
600
400
200
0
1
11
13
15
17
19
Generations (1000)
21
23
25
27
29
31
Best
Worst
Average
representation
population size, mutation rate, ...
selection, deletion policies
crossover, mutation operators
Termination Criteria
Performance, scalability
Solution is only as good as the evaluation
function (often hardest part)
WHEN TO USE A GA
Alternate solutions are too slow or overly
complicated
Need an exploratory tool to examine new
approaches
Problem is similar to one that has already
been successfully solved by using a GA
Want to hybridize with an existing solution
Benefits of the GA technology meet key
problem requirements
Application Types
Control
Design
Scheduling
Robotics
trajectory planning
Machine Learning
Signal Processing
Game Playing
Combinatorial
Optimization