An improved ant colony algorithm for TSP

Artificial ant colony algorithm is new in the evolution computing. The primary study shows that it is a better algorithm with robust based population, but it has some shortcomings such as its slow computing speed, and it is easy to fall in a local peak in a large scale problem. To overcome these deficiencies, threshold value for selection operator and mutation operator were introduced, a heuristics operator was designed as well as a two-way search method was adopted. The result of TSP example shows this improvement on algorithm is effective.