Skip to Main Content
The default that the factor of pheromone remnant is constant can make the algorithm fall into the local optimal solution easily, a new factor of pheromone remnant is proposed which is varying with the iterative time. But this can not overcome the local one completely, the bit exchanging mode with the shifting windows is proposed by the analysis in the solution set. Above all an improved ant colony algorithm is got, then it applies in the TSP, the simulation shows that this algorithm can improve the ability of searching global optimization and overcome premature convergence. Comparison with the basic ant colony algorithm shows that the algorithm is effective.
Date of Conference: 7-9 July 2010