一种混沌蚁群优化的多约束QoS算法

摘要

Based on the properties of randomicity, regularity and ergedicity 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.%利用混沌算法随机性、规律性和遍历性,将混沌搜索融合到蚁群算法中,用于求解最短QoS路由问题,避免蚁群算法易陷入局部寻优的缺点,提高了混合算法的搜索范围,并且加快了蚁群群体的进化速度,仿真实验表明,该算法提高了算法的搜索精度,并具有较快的收敛速度.