Ant Colony Optimization (ACO)
Real Ants
Basic Concept
ACO Definintion
Shortest Route
Ant foraging- Co-operative Search by Pheromone Trails
ACO-Algorithm
ACO
How to implement in a program
A simple Travel Salesman Problem example
Iteration 1
How to build next sub-solution?
Path and Pheromone Evaluation
Advantages/Disadvantages
Any Questions?

Basic Concept
Thus, when one ant finds a good (short) path from the colony to a food source, other ants are more likely to follow that path.
Such positive feedback eventually leaves all ants following a single path.
The idea of the ant colony algorithm is to mimic this behaviour with “simulated ants” walking around the search space representing the problem to be solved
ACO algorithm have been used to produce near-optimal solutions to the travelling salesman problem.
This is of interest in network routing and urban transportation systems.