A Hybrid Ant Colony Algorithm for Solving TSP
FENG Zuhong1,XU Zongben2(1The Second Northwest National Institute, Yinchuan 750021; 2Xi'an Jiaotong University, Xi'an 710049)
A hybrid ant colony algorithm for solving TSP (The traveling salesman problem) is presented. A TSP numerical test, named att532, which is taken from the library of TSPLIB in the United States, is discussed. The test result indicates that the efficiency and numerical performance of the original ant colony algorithm could be improved by the hybrid strategy.