Neural Network Algorithm for Solving Large Scale Travelling Salesman Problems

This study improves the neural network algorithm that was presented by J.J.Hopfield for solving TSP(travelling salesman problem) and gets an effective algorithm whose time complexity is O(n(2)), so we can solve quickly TSP more than 500 cities in microcomputer. The paper considers the algorithm based on the replacement function of the V Value. The improved algorithm can greatly reduces the time and space complexities of Hopfield method. The TSP examples show that the proposed algorithm could efficiently find a satisfactory solution and has a fast convergence speed.