一种基于去除点交叉和点交换的局部优化蚁群算法

An Ant Colony Algorithm with Local Optimization Based on Removal Point-intersection and Point Exchange

蚁群算法里,收敛速度和收敛精度是一对矛盾体,首先引入局部优化算法,即去除点交叉和点交换算法,然后重新调整单位信息素和重新更新全局策略,从而达到提高计算资源的利用率和降低重复计算的效果,减少局部优化的计算量,最终加快收敛速度的同时可以提高解的精度.实列数据表明此算法在解决收敛速度和收敛精度矛盾体在平衡性上的有效性.

The contradiction between convergence accuracy and convergence speed in ant colony algorithm will be solved by reducing the proportion of repeated computing resources and improving the utilization of computing resources,a local optimization operator which called point exchange is introduced to readjust the unit pheromone and global update strategy.By constraining the parameters of local optimization operators,the calculation amount of local optimization is reduced and the convergence speed is accelerated.We can conclude from the experimental data that the proposed algorithm can obtain higher accuracy with fewer iterations,and achieve a good balance between convergence speed and convergence accuracy.