Scribd
Upload
50 views3 pages

Ant Colony Optimization Algorithm

The ant colony optimization algorithm (ACO) is a probabilistic technique for finding optimal paths through graphs, inspired by the behavior of ants searching for food. Initially, ants wander randomly, but lay pheromone trails that attract other ants. Shorter paths accumulate pheromone faster, making them more likely to be followed. Pheromone also evaporates over time, preventing convergence on local optima and allowing exploration of alternative paths. This process eventually guides all ants along the shortest path from the colony to food sources. The ACO works well for problems with dynamic or changing topologies like computer networks.

Uploaded by

Ibrahim Dewali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views3 pages

Ant Colony Optimization Algorithm

The ant colony optimization algorithm (ACO) is a probabilistic technique for finding optimal paths through graphs, inspired by the behavior of ants searching for food. Initially, ants wander randomly, but lay pheromone trails that attract other ants. Shorter paths accumulate pheromone faster, making them more likely to be followed. Pheromone also evaporates over time, preventing convergence on local optima and allowing exploration of alternative paths. This process eventually guides all ants along the shortest path from the colony to food sources. The ACO works well for problems with dynamic or changing topologies like computer networks.

Uploaded by

Ibrahim Dewali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Ant Colony Optimization Algorithm

The Ant colony optimization algorithm (ACO) is a probabilistic technique


for solving computational problems which can be reduced to finding good
paths through graphs (finding optimal paths that is based on the behavior of ants
searching for food).

At first, the ants wander randomly. When an ant finds a source of food, it walks
return back to their colony while laying down "markers" (pheromones trails) that
show the path has food. When other ants find such a path, they are likely not to
keep traveling at random, but instead follow the trail laid by earlier ants, returning
and reinforcing it if they eventually find food, as more ants find the path, it gets
stronger.

Because the ants drop pheromones every time they bring food A short path, by
comparison, gets marched over faster, and thus the pheromone density becomes
higher on shorter paths than longer ones. However, in longer paths the pheromone
trail starts to evaporate, thus reducing its attractive strength, because more time it
takes for an ant to travel down the path and back again, so the more time the
pheromones have to evaporate.

Pheromone evaporation has also the advantage of avoiding the convergence to a


locally optimal solution. If there were no evaporation at all, the paths chosen by the
first ants would tend to be excessively attractive to the following ones. In that case,
the exploration of the solution space would be constrained.

The overall result is that when one ant finds a good (short) path from the colony to
a food source, other ants are more likely to follow that path, and such positive
feedback eventually leaves all the ants following a single path.

Because the ant-colony works on a very dynamic system, the ant colony algorithm
works very well in graphs with changing topologies. Examples of such systems
include computer networks, and artificial intelligence simulations of workers.
1-When ants leave their nest to search for a food source, they
randomly rotate around an obstacle

2-initially the pheromone deposits will be the same for the right and left
directions

3-When the ants in the shorter direction find a food source, they carry the food
and start returning back, following their pheromone trails, and still depositing
more pheromone.
4-An ant will most likely choose the shortest path when returning back to the
nest with food as this path will have the most deposited pheromone

5-For the same reason, new ants that later starts out from the nest to
find food will also choose the shortest path.

6- Over time, this positive feedback (autocatalytic) process prompts all


ants to choose the shorter path

You might also like