You are on page 1of 19

Ant Colony

Optimization
Group-25
K. Sushma Raghavi
Dev Karthik
Jaswanth Reddy
Varun

What??
Probabilistic technique
Meta-heuristic optimization
Searching for optimal path is based on the
behaviour of ants seeking a path between
their colony and source of food

Why ants??
Small, Hard working, Team work
They are the Survivors, 100 million years and
nearly 20,000 different species
Not so Intelligent

Behaviour

They can smell it using


their antennae
Scouts for searching of food

Leaves a scent behind for others to follow

Communicate???

Why in straight lines?

New terms
Swarm
Intellige
nce

Pheromone
Trail

ACO Algorithm
Each path is a possible solution
The amount of pheromone in the path is proportional
to the quality of solution.
The paths with higher amounts of pheromone are
more likely to be selected.
Ants converge and follow the shortest which is the
optimum solution or the near optimum solution for the
problem.

Specifications for ACO


Appropriate problem representation.
Method of constructing valid solution.
A function that measures quality of solution.
A rule for updating the pheromone trail.
A probabilistic transition rule.

Air Traffic conflict resolution

Air Traffic conflict resolution

Work to date
Problem name

Authors

Algorithm name

Year

Connection-oriented

Schoonderwood et al.

ABC

1996

network routing

White, Pagurek & Oppacher

ASGA

1998

Di Caro & Dorigo

AntNet-FS

1998

Bonabeau et al.

ABC-smart ants

1998

Connection-less

Di Caro & Dorigo

AntNet & AntNet-FA

1997

network routing

Subramanian, Druschel & Chen

Regular ants

1997

Heusse et al.

CAF

1998

van der Put & Rethkrantz

ABC-backward

1998

Sequential ordering

Gamberdella& Dorigo

HAS-SOP

1997

Graph coloring

Costa & Hertz

ANTCOL

1997

Shortest common supersequence

Michel & Middendorf

AS_SCS

1998

Frequency assignment

Maniezzo & Carbonaro

ANTS-FAP

1998

Generalized assignment

Ramalhinho Lourenco & Serra

MMAS-GAP

1998

Multiple knapsack

Leguizamon & Michalewicz

AS-MKP

1999

Optical networks routing

Navarro Varela & Sinclair

ACO-VWP

1999

Redundancy allocation

Liang & Smith

ACO-RAP

1999

Constraint satisfaction

Solnon

Ant-P-solver

2000

Travelling salesman problem (Branch


and bound)
A

Row minimization
A

Column minimisation.
Calculating penalties for all zeros
Matrix reduction.
A

A-->E-->B-->D-->C-->A
4+6+5+9+6
=30Km