基于改进的蚁群算法的组播路由问题的研究

目前，蚁群算法在路由协议上已有广泛应用。通过研究蚁群算法的特性和目前在路由协议上的应用，发现其在加快运行时间、局部最优解等问题上还有改进的空间。为此文中提出一种蚁群优化算法，使蚁群算法更好地应用在路由协议上。针对蚁群算法容易出现局部最优解的问题，文中提出一种链表随机选择法，该方法能有效地减小蚁群算法出现局部最优解的几率。同时为了减少蚁群算法在选择路径上的时间，提高运行速率，文中还提出了一种雅克比迭代收敛准则，此方法很好地减短了算法时间。

Research of Problem of Multicast Routing Based on Optimized Ant Colony Algorithm

Currently, the ant colony algorithm has been widely used in routing protocols. By researching the ant colony algorithmic characteristic and application of routing ,it finds that there is the room of improvement in speeding up the running time, reducing the rate of causing local optimization problems and so on. In order to make better application of ant colony algorithm in routing protocol,it proposes a kind of ant colony optimized algorithm to improve its performance. Becau~se ant colony algorithm is easy to cause local optimization problems,it proposes a random selection method using chain table. This method can effectively reduce the possibility of local optimization problems in ant algorithm. Meanwhile, in order to reduce the time of choosing a path and increase the running rate,it puts forward new convergence criteria according to Jacobi iterative thoughts. It is very good to cut down the cost of time.