Ant Colony Optimization Algorithm
Ant Colony Optimization Algorithm
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.
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.