Professional Documents
Culture Documents
Colony
Optimization.
1
Background.
Proposed by Marco Dorigo et al. in 1990s
2
The Ants.
Can explore vast areas without global view of
the ground.
3
How can they manage such
great tasks ?
By leaving pheromones behind them.
4
Double Bridge Experiment
The more ants follow a trail, the more attractive that trail becomes for being followed.
NEST FOOD
5
Route Selection.
Ants are forced to decide whether they should go left or
right, and the choice that is made is a random decision.
6
Traveling Salesman
Problem.
◦ A salesman has to visit ‘n’
towns cyclically.
◦ In one tour he visits each
towns just once and finishes
up where he started.
In what order should he
visit them to minimise the
distance travelled?
◦ How many orderings? ( n=21)
20!= 20x19x18x17……3x2x1
=2,432,902,008,176,640,000
7
Problem Definition.
OBJECTIVE:
Given a set of ‘n’ cities, the
Traveling
Salesman Problem requires a
salesman to find the shortest route
between the given cities and return
to the starting city, while keeping in
mind that each city can be visited
only once.
8
Flowchart of ACO
START ACO
9
TSP Applications.
Lots of practical applications
10
Questions
11