| Article ID: | iaor2005758 |
| Country: | China |
| Volume: | 12 |
| Issue: | 2 |
| Start Page Number: | 63 |
| End Page Number: | 67 |
| Publication Date: | Apr 2003 |
| Journal: | Operations Research and Management Science |
| Authors: | Wen Zhenwei |
In this paper, an iterative algorithm for non-symmetrical traveling salesman problem is given. Its computational complexity is O(MN4), where N is the number of towns the salesman needs to visit and M is the maximum distance between two towns. Illustrative examples for the algorithm are given.