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

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

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

英文关键词  Ad Hoc networks  QoS  ant colony optimization algorithm  routing selection algorithm  convergence analysis

中文摘要

      为有效解决无线移动自组网中多约束服务质量(QoS)路由问题, 提出结合QoS条件下的改进型蚁群算法. 该算法对QoS约束条件进行简化, 只考虑影响网络因子的主要指标, 提高了算法的工程实用性, 并在理论上证明该算法的收敛性. 对传统蚁群算法的信息素进行改善, 通过对该算法局部和全局收敛性的研究, 提出了普遍意义下的收敛条件, 为这一类约束条件下的蚁群算法进一步研究奠定了良好的基础.

英文摘要

      To deal with the routing problem of the multiple-constrain quality-of-service(QoS) in wireless ad hoc networks, 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.