Solving TSP based on an Improved Ant Colony Optimization Algorithm

Abstract

Traveling Salesman Problem (TSP) is a typical Problem in combinatorial optimization field in modern times. Most of the problems in reality can be transformed into TSP problems for solving. Such as postal problems, communication network design, etc. Ant colony algorithm, as a heuristic algorithm, has been successfully applied to solving TSP problems. Based on the improved ant colony algorithm, this paper solves the travel agent problem, evaluates the population according to the membership degree, and updates the pheromone in turn, so as to achieve a good balance in solving speed and quality.