Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm
Figure 3
An illustration of the ants’ behavior in one iteration. The thickness of the edges denotes the pheromone density. (a) The distribution of pheromones from the last iteration. (b) When the three ants are moving, the pheromones on the passed edges are changed by the local pheromone update, resulting in the reduction of pheromones. (c) The global pheromone update reinforces the pheromones on the edges of the best-so-far solution.
