Multiple constrained QoS algorithm based on chaos and ant colony optimization
一种混沌蚁群优化的多约束QoS算法*

Based on the properties of randomicity, regularity and ergodicity of chaos, chaos searching was combined with the ant algorithms, which was proposed to solve searching the shortest path of QoS routing problem. The mixed algorithms avoided the disadvantage to be trapped into local seeking solution and advanced the scope of the searching area and evolution speed of ant colony. The experimental results show that the mixed algorithm can effectively improve the seeking accuracy of the algorithms and accelerate the speed of convergence.