求解TSP问题的一种改进蚁群算法

SP is a classical NP-hard combinatorial optimization. Some drawbacks such as long time searching and fall into local optimal solution are shown with ant colony algorithm is used for solving this problem. As a result, this paper presents an optimized algorithm for solving TSP. The proposed algorithm combines the ant colony algorithm and genetic algorithm, which uses GA to generate the distribution of pheromone.In addition,in the Ant colony algorithm,we use the crossover and mutation strategies to improve the quality of TSP solution. The simulation result shows that the improved algorithm optimizes the TSP in time and performance.