| Article ID: | iaor20043364 |
| Country: | China |
| Volume: | 21 |
| Issue: | 1 |
| Start Page Number: | 17 |
| End Page Number: | 21 |
| Publication Date: | Jan 2003 |
| Journal: | Systems Engineering |
| Authors: | Zhao Xuefeng |
| Keywords: | ant system |
The Traveling Salesman Problem (TSP) is an NP-hard combinatorial optimization problem. In this paper an improved ant colony algorithm is presented for the extended TSP model. Numerical instance indicates satisfactory results.