Application of Ant Colony Algorithm Based on Monopoly and Competition Idea in QoS Routing

Ant colony algorithm is easy to fall in local best and its convergent speed is slow in solving multiple QoS constrained unicast routing problems. Therefore, an ant colony algorithm based on monopoly and competition is proposed in this paper to solve the problems. In the choice of nodes, improves pheromone competition, avoids monopoly of pheromone prematurely, stimulates ants to attempt the paths which have less pheromone and improves the global search ability of ants. Stagnation behavior is judged by the monopoly extent of the pheromone on the excellent path. Moreover, the catastrophic is embedded in the global pheromone update operation. According to simulations, its global search is strong and it can range out of local best and it is fast convergence to the global optimum. The improved algorithm is feasible and effective.