Title: Ant Colony Search
1Ant Colony Search
21. Ethologists observed that ants can construct
the shortest path form their colony to the
feeding source and back through using the
pheromone trails. 2. An ant leaves some
quantities of pheromone on the ground and mark
the path by a trial of the substance. The next
ant sense the pheromone laid on different paths
and choose one with a probability proportional
to the amount of pheromone. 3.The ant traverses
the chosen path and leaves its own pheromone
Characteristic
Graph representation
Problem
3How to design ant colony search step 1
Initialization (a) graph
representation of the problem (b)
initial ant distributions step 2 Node
transition rule The ants move from
node to node based on a node transition rule.
step 3 Pheromone updating rule
(feasible solution) The intensity of
pheromone tails of an edge is updated at the end
of each cycle by the average
quality of the solutions that traverse along
their edge. step 4 Stopping
criterion
4step 3 Pheromone updating rule (feasible
solution) The intensity of
pheromone tails of an edge is updated at the end
of each cycle by the average
quality of the solutions that traverse along
their edge. step 4
Stopping criterion
5Polygonal Approximation
6Step 1 (a) Graph Representation
For each point on the curve should be represented
as node of the graph. Any closed circuit which
originates and ends at the same represented a
feasible solution to the original problem.
E closed circuit
7(b) Initial ant distribution
8(No Transcript)
9Step 2 Node transition rule
10Step 3 Pheromone updating rule
11(No Transcript)
12(No Transcript)
13(No Transcript)
14(No Transcript)