Ant colony optimization for multicast routing

Ant colony optimization (ACO) is a new optimization algorithm, and has the limitation of stagnation. In this paper, the performance of ACO is improved and the improved ACO is combined with heuristic algorithm to solve the multicast routing problem. Simulation shows that the results of this algorithm for multicast routing are better than the heuristic algorithms; this algorithm is also well suited for parallel implementation and execution.