Ant Colony Optimization

SWARM INTELLIGENCE
AND ANT COLONY

OPTIMIZATION
Submitted to:
1Mr. Lucknesh kumar
Submitted by:
Shubham
Singh
1309710107
Presented By: Shubham Singh
SWARM INTELLIGENCE DEFINITION

Any attempt to design algorithms or distributed
problem-solving devices inspired by the collective
behavior of social insect colonies and other
animal societies [Bonabeau, Dorigo, Theraulaz:
Swarm Intelligence]
Solves optimization problems
SWARMING EXAMPLES
Bird Flocking.
Colonies of ants.
PROPERTIES OF SWARM INTELLIGENCE

The typical swarm intelligence system has the
following properties:
It is composed of many individuals.
The individuals are relatively homogeneous .
The interactions among the individuals are based on
simple behavioural rules that exploit only local
information that the individuals exchange directly or
via the environment.
The overall behaviour of the system results from the
interactions of individuals with each other and with
their environment, that is, the group behaviour self
organizes.
SWARMING IS POWERFUL
Swarms can achieve things that an individual

cannot
RULES FOR MODELLING

SWARM INTELLIGENCE
Rule 1: Avoid Collision with neighboring sources.

Rule 2: Match the velocity of neighboring sources.
Rule 3: Stay near neighboring sources.
ANT COLONY OPTIMIZATION
Inspiration from swarm intelligence has led to

some highly successful optimization algorithms.
One of those algorithms is ..
Ant Colony algorithm a way to solve optimization
problems based on the behaviour of ants searching for
food.
Ant colony optimization is a technique for optimization that
was introduced in the early 1990s.
The inspiring source of ant colony optimization is the
foraging behaviour of real ant colonies.
ANT COLONY OPTIMIZATION BIOLOGICAL INSPIRATION
10
Ants find shortest path to food source from nest.

Ants deposit pheromone along travelled path
which is used by other ants to follow the trail.
Has adaptability, robustness and redundancy.
FORAGING BEHAVIOR OF ANTS
2 ants start with equal probability of going on either

path.
11
The ant on shorter path has a shorter to-and-fro time

from its nest to the food.
12
The density of pheromone on the shorter path is

higher because of 2 passes by the ant (as compared to
1 by the other).
13
The next ant takes the shorter route.
14
Over many iterations, more ants begin using the path

with higher pheromone, thereby further reinforcing it.
15
After some time, the shorter path is almost exclusively

used.
16
ANT COLONY OPTIMIZATION

ALGORITHMS: BASIC IDEAS
Ants are agents that:
Move along between nodes in a graph.

They choose where to go based on pheromone strength (and maybe other
things)
An ants path represents a specific candidate solution.
When an ant has finished a solution, pheromone is laid on its path,
according to quality of solution.
This pheromone trail affects behaviour of other ants by `stigmergy
17
TRAVELLING SALESMAN PROBLEM

(TSP)
Given a list of cities and the distances between
each pair of cities, what is the shortest possible
route that visits each city exactly once and
returns to the origin city?
18
ACO FOR THE

TRAVELLING
SALESMAN PROBLEM
19
E.G. A 4-CITY TSP

Initially, random levels of pheromone are scattered on the edges
A
Pheromone
Ant
C
AB: 10, AC: 10, AD: 30,
BC: 40,
20
CD: 20
E.G. A 4-CITY TSP

An ant is placed at a random node
A
Pheromone
Ant
C
AB: 10, AC: 10, AD: 30,
BC: 40,
21
CD: 20
E.G. A 4-CITY TSP

The ant decides where to go from that node,
based on probabilities
A
calculated from:
- pheromone strengths,
Suppose this one chooses BC
Pheromone
Ant
C
AB: 10, AC: 10, AD: 30,
BC: 40,
22
CD: 20
E.G. A 4-CITY TSP

The ant is now at C, and has a tour memory = {B, C} so he cannot
visit B or C again.
A
B
Again, he decides next hop
(from those allowed) based
on pheromone strength
and distance;
suppose he chooses
CD
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
D
BC: 40,
23
CD: 20
E.G. A 4-CITY TSP

The ant is now at D, and has a `tour memory = {B, C, D}
There is only one place he can go now:
A
B
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
D
BC: 40,
24
CD: 20
E.G. A 4-CITY TSP

So, he has nearly finished his tour, having gone over the links:
BC, CD, and DA.
A
B
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
BC: 40,
25
CD: 20
E.G. A 4-CITY TSP
So, he has nearly finished his tour, having gone over the links:
BC, CD, and DA. AB is added to complete the round trip.
A
B
Now, pheromone on the tour

is increased, in line with the
fitness of that tour.
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
BC: 40,
26
CD: 20
E.G. A 4-CITY TSP

A
Next, pheromone everywhere

is decreased a little, to model
decay of trail strength over
time
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
D
BC: 40,
27
CD: 20
E.G. A 4-CITY TSP

We start again, with another ant in a random position.
A
Where will he go?

Next , the actual algorithm
and variants.
Pheromone
Ant
C
AB: 10, AC: 10, AD, 30,
BC: 40,
28
CD: 20
OTHER APPLICATION OF ACO
Quadratic Assignment Problem

Network Model Problem
Feature Selection
Scheduling Problem
Vehicle Routing Problem
29
SOME INHERENT ADVANTAGES

Positive
Feedback accounts for rapid discovery

of good solutions
No supervision is required , interaction among
agents is used for optimization.
The collective local interaction of a population
of agents leads to global optimization.
30
DISADVANTAGES
Performed poorly for TSP problems larger than 75
cities.
No centralized processor to guide the system towards
good solutions.
A complex neural network is required to make random
decisions.
31
CONCLUSION
ACO is a thriving and maturing research area

it has its own conferences. It gets very good
results on some difficult problems.
32
REFERENCES
https://www.ics.uci.edu/~welling/teaching/271fall09/antcolonyopt.
pdf
rain.ifmo.ru/~chivdan/presentations
www.macs.hw.ac.uk/~dwcorne/Teaching
Dorigo M, Optimization, learning and natural algorithms. PhD
thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy,
1992 [in Italian]
Wikipedia
https://www.ics.uci.edu/~welling/teaching/271fall09
code.ulb.ac.be/dbfiles/
Ant Colony Optimization for Feature Selection in Software
Product Lines by WANG Ying-lin1,2, PANG Jin-wei2
mitpress.mit.edu/books/ant-colony-optimization
33
THANK YOU
34

Ant Colony Optimization

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Ant Colony Optimization

Diunggah oleh

Hak Cipta:

Format Tersedia

SWARM INTELLIGENCE

AND ANT COLONY

Presented By: Shubham Singh

SWARM INTELLIGENCE DEFINITION

Presented By: Shubham Singh

Presented By: Shubham Singh

PROPERTIES OF SWARM INTELLIGENCE

Presented By: Shubham Singh

Presented By: Shubham Singh

Swarms can achieve things that an individual

RULES FOR MODELLING

Rule 1: Avoid Collision with neighboring sources.

Rule 2: Match the velocity of neighboring sources.

Presented By: Shubham Singh

Rule 3: Stay near neighboring sources.

Presented By: Shubham Singh