一种仿Dijkstra的蚂蚁算法  

An ant colony system algorithm rooted in Dijkstra strategy

作　　者：韦绥线[1] 黄胜华[1] 

机构地区：[1]中国科学技术大学通信与电子系统实验室,安徽合肥230027

出　　处：《计算机应用》2005年第12期2908-2910,共3页journal of Computer Applications

摘　　要：为了快捷可靠地寻找到满足多媒体QoS保证的路由,结合Dijkstra算法和蚂蚁算法,从源节点开始,在所有满足QoS要求的邻接链路上泛滥寻路蚂蚁,所有中间节点依据一个设定的QoS路由优劣综合评价函数,在到达的所有寻路蚂蚁中选择其最优者复制并继续泛滥,直到最后到达目的节点为止。这样,通过约束条件下的穷举搜索,最后一定可以找到源节点和目的节点间的满足QoS要求的路由。实验证明,该算法具有思路直观、运算量小、强收敛、能自适应网络变动优点。To find out QoS routing quickly and reliably, an new ant colony system algorithm rooted in Dijkstra strategy was suggested out. The source code flooded searching ants to all its adjoining and QoS-satisfied nodes . Every adjoining node selected out the best-performance one due to an early-setted judgmental function from all the arrived ants, then copied and flooded it again. The ants went on flooding until it got to the aim node at last. After searching all the possible routs between the source node and the aim node, this algorithm must be able to find out the QoS routing fitted for request. As proved in example followed, this algorithm has virtue of briefness, efficiency and strong convergence.

关 键 词：最短路径 服务质量保证 蚂蚁算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]