title: On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank.
abstract: The application of the method of Hopfield and Tank to the Travelling Salesman Problem (1985) has been re-examined in an effort to find a procedure for scaling to system sizes of real interest. As this failed, methods were tried to improve the algorithm, recognizing the importance of a "silicon implementation". No satisfactory refinement was found, and the reasons for algorithm failure have been identified.
authors.affiliation: Department of Physics, University of Edinburgh, United Kingdom.
authors.forename: G V
authors.initials: GV
authors.lastname: Wilson
authors.forename: G S
authors.initials: GS
authors.lastname: Pawley
mesh_terms: D000465:Algorithms; D006801:Humans; D008959:Models, Neurological; D011340:Problem Solving