Convergence analysis of multiple constrained routing-based ant colony optimization algorithm and its application
多约束条件蚁群优化算法的收敛性分析及其应用

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.