Introduction - If you have any usage issues, please Google them yourself
In all Ant Colony Optimization algorithms, each ant gets a start city. Beginning this city, the ant chooses the next city according to algorithm rules. After visiting all customer cities exactly once, the ant returns to the start city. The ants might travel concurrently or in sequence. Each ant deposits some amount of pheromone on his path. The amount of pheromone depends on the quality of the ant s path: a shorter path usually results in a greater amount of pheromone. The deposited pheromone suffer evaporation.
The algorithms use different rules for selection of the next city to move to, for evaporation, and for deposition of pheromone.