蚂蚁优化算法在解决CVRP中的应用

针对基本蚁群算法收敛性差,易于停滞的缺陷,通过引入信息素窗口限制信息素的最大最小值,只对迭代最好解进行信息素更新,判断汇聚情况进行信息素重新初始化,在每次迭代中加入局部搜索优化,在选择概率中加入与问题相关的参数等措施对蚁群进行优化,提高蚁群算法的收敛性,避免了算法的停滞现象。

Application of Ant Swarm Optimization Algorithm to the Solution to CVRP

According to the disadvantage of basic ant swarm optimization algorithm such weak convergence and easy stagnation,through importing pheromone windows to restrict the maximum value and minimum value of the pheromone,information renewal is conducted only on the optimal iterative solution,pheromone is reinitialized by judging the situation of the convergence,the solution optimization is added by local search procedure at the end of every iteration,and the ant swarm is optimized by thr measures such as adding the parameters related to the problems in probability selection and so on,in order to improve the convergence of the ant swarm optimization algorithm and to avoid algorithm stagnation.