摘要
在分析了多种路由算法的基础上,设计了一种基于蚁群算法的多约束路由算法。该算法采用了非线性路径长度,通过蚂蚁的周游获得长度更短的多约束路径。仿真表明,该算法在最短路径获取和路由发现成功率方面都有高效的表现。
A multi constrained routing algorithm based on ant algorithm shorter multi-constrained path could be found with nonlinear path length and ants is presented in this paper. The travel. Simulations show that this new algorithm has higher efficiency in obtaining the shortest path and successfully finding the route .
出处
《通信技术》
2009年第8期211-213,共3页
Communications Technology
基金
广东省自然科学基金(编号:31393)
2006年粤港关键领域重点突破项目(编号:20060104-2)
