| Article ID: | iaor20041847 |
| Country: | China |
| Volume: | 25 |
| Issue: | 5 |
| Start Page Number: | 1 |
| End Page Number: | 4 |
| Publication Date: | Oct 2002 |
| Journal: | Journal of Jingzhou Teachers College |
| Authors: | Yan Zizong, Wang Zhangxiong |
A new method to deal with travelling salesman problems is obtained. We choose various better paths by setting up obstacles to penalise the function's value and get some branches and a better path, which decreases the calculated bound. Meanwhile, better results for the CHN144 problem and justification for the method being effective are obtained. (CHN144 is a standard TSP test problem).