A New Ant Colony Optimization Algorithm for TSP

The traditional ant colony algorithm is based on the positive feedback mechanism. In essence, this guidance is conducive to the convergence of the algorithm but is not conducive to the diversity of the search. In order to shorten the length of the path of the optimization, this paper proposes an improved ant colony algorithm to improve search diversity. The algorithm, the positive feedback, the inverse feedback simultaneously makes the entire ant colony search time is greatly reduced, and will greatly increase the diversity of the ant colony search space and search results. Simulation results of the TSP problem show that, the new algorithm for solving complex combinatorial optimization problem has a significant effect.