Satisfactory Solution of Chinese Travelling Salesman Problem Based on Ant Colony Algorithm

Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem. This paper gives a brief introduction on the ant colony algorithm and modifies it to solve the Chinese travelling salesman problem. Result shows that the performance of ant colony algorithm is improved and the present best solution is found. It also points out that the ant colony algorithm still has to be modified in many ways.