| Article ID: | iaor20043765 |
| Country: | China |
| Volume: | 23 |
| Issue: | 7 |
| Start Page Number: | 100 |
| End Page Number: | 105 |
| Publication Date: | Jul 2003 |
| Journal: | Systems Engineering Theory & Practice |
| Authors: | Chen Jian, Jin Haihe, Zheng Guoqi, Tang Zheng |
This paper proposes an algorithm for solving the multi-city traveling salesman problem based on Hopfield networks. The algorithm is applied to a 100-city traveling salesman problem, and its effectiveness is confirmed by simulation. The algorithm is free from limitation of the city number; and speedup can be implemented by parallel operation.