Solving the Travelling Salesman Problem by the Program of Ant Colony Algorithm

Ant colony algorithm is a novel simulated ecosystem evolutionary algorithm, which is applied to solving complex combinatorial optimization problems. The basic principle and realization about ant colony algorithm are studied in this paper. The algorithm is realized under the Visual C++ compiler environment, and applied to solving the travelling salesman problem (TSP). The result is accordance with the best route solution. This algorithm has practical worth.