Beruflich Dokumente
Kultur Dokumente
Artificial Intelligence
Techniques in Engineering
Charles Darwin
Origin of the Species
Survival of the Fittest
1859
History of Genetic Algorithm
Elitism
Crossover/recombination
Mutation
One Point Crossover
N-Point Crossover
Uniform Crossover
Mutation
Changing one/more
bit(s) at randomly
selected position(s)
of a parent.
Small probability
(usually 2-3 % of
popsize)
Flow Chart of Genetic
Algorithm
Particle Swarm
Optimisation
Particle Swarm Optimisation
Particle Swarm Optimization (PSO), inspired by
social behavior of bird flocking or fish schooling, is a
population based stochastic optimization technique
developed by Eberhart and Kennedy in 1995
Position Update
A swarm consists of number of particles “or possible
solutions” that fly through the feasible solution space to
explore optimal solutions. Each particle updates its position
based on its own best exploration; best swarm overall
experience, and its previous velocity vector according to the
following model:
pbest j s kj gbest j s kj (1)
v kj 1 Wv kj C1 rand1 () C2 rand2 ()
t t
s kj 1 s kj v kj 1 t (2)
W Wmax
W (k ) min (k 1) Wmax
itermax 1
Concept of multi-agent search by
PSO in a multi-dimensional space
Ant Colony
Optimisation
Ant Colony Optimization
where τi,j is the amount of the pheromone on the edge i-j, α is the
parameter to control the influence of τi,j, ηi,j is the desirability of
ant to move from node i to node j based on a priori knowledge,
typically 1/di,j, (where dij is the distance between node i and
node j) and β is the parameter to control the influence of ηi,j.
Pheromone Update