On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The application of the method of Hopfield and Tank to the Travelling Salesman Problem has been re-examined in an effort to find a procedure for scaling to system sizes of real interest, but no satisfactory refinement was found and the reasons for algorithm failure have been identified.
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.