摘要:
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.
展开