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.
References
Durbin R, Willshaw D (1987) An analogue approach to the travelling salesman problem using an elastic net method. Nature 326:689–691
Hockney RW, Jesshope CR (1981) Parallel computers. Adam Hilger, Bristol
Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilson, G.V., Pawley, G.S. On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank. Biol. Cybern. 58, 63–70 (1988). https://doi.org/10.1007/BF00363956
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00363956