多约束条件蚁群优化算法的收敛性分析及其应用  

Convergence analysis of multiple constrained routing-based ant colony optimization algorithm and its application

作　　者：金劲[1,2] 洪毅[1] 赵付青[1] 余冬梅[1] 

机构地区：[1]兰州理工大学电气工程与信息工程学院,甘肃兰州730030 [2]甘肃移动通信有限公司,甘肃兰州730000

出　　处：《控制理论与应用》2010年第10期1353-1361,共9页Control Theory & Applications

摘　　要：为有效解决无线移动自组网中多约束服务质量(QoS)路由问题,提出结合QoS条件下的改进型蚁群算法.该算法对QoS约束条件进行简化,只考虑影响网络因子的主要指标,提高了算法的工程实用性,并在理论上证明该算法的收敛性.对传统蚁群算法的信息素进行改善,通过对该算法局部和全局收敛性的研究,提出了普遍意义下的收敛条件,为这一类约束条件下的蚁群算法进一步研究奠定了良好的基础.To deal with the routing problem of the multiple-constrain quality-of-service（QoS） in wireless ad hoc net- works, we propose an improved ant-colony-optimization（ACO） algorithm in combination of QoS requirements. In this algorithm, QoS requirements are simplified, only the major effects from network factors are considered, thus facilitating the algorithm applications. The convergence of the algorithm is proved theoretically. The information pheromone of the conventional ACO is improved to make the algorithm converge both locally and globally under a general convergence condition we developed. This work may provide a foundation for further theoretical studies on the multiple-constrain QoS of ACO.

关 键 词：移动自组织网 QoS 蚁群优化算法 路由选择算法 收敛性分析 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]