Improved ant colony algorithm and its application in TSP

Ant algorithm is a meta-heuristic optimization algorithm.The study has showed that the algorithm has great ability of searching better solution,but at the same time there are some shortcomings.By using the properties of pheromone update of ant colony algorithm,a new method of updating pheromone is introduced,and used to solve the Traveling Salesman Problem(TSP).Simulation experiments show that the new algorithm has better performance.