Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

A Hybrid Ant Colony Algorithm for Solving TSP

FENG Zuhong1,XU Zongben2(1The Second Northwest National Institute, Yinchuan 750021; 2Xi'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.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved