| Article ID: | iaor20041844 |
| Country: | China |
| Volume: | 19 |
| Issue: | 4 |
| Start Page Number: | 35 |
| End Page Number: | 39 |
| Publication Date: | Oct 2002 |
| Journal: | Chinese Journal of Engineering Mathematics |
| Authors: | Feng Zuhong, Xu Zongben |
| Keywords: | ant system |
A hybrid ant colony algorithm for solving TSP (the travelling salesman problem) is presented. A TSP numerical test, named ant532, 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.