Ant Colony Based Algorithm for Constructing Broadcasting Tree with Constraint Satisfaction

In this paper, we proposed solution for the construction of degree, delay and bandwidth constrained Minimum Spanning Tree (MST) of the network with the help of Ant Colony Optimization approach. The degree, delay and bandwidth constrained broadcasting problem with minimum-cost appears to be NP-complete. Given the lack of an exact algorithm to obtain the optimal solutions for NP-complete problems within a polynomial time, many meta-heuristic methods such as tabu search, genetic algorithm and ant colony system were proposed to solve these problems. Ant colony optimization is a well-known meta-heuristic for network optimization problems.