Skip to main content
Log in

On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank

  • Published:
Biological Cybernetics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Durbin R, Willshaw D (1987) An analogue approach to the travelling salesman problem using an elastic net method. Nature 326:689–691

    Google Scholar 

  • Hockney RW, Jesshope CR (1981) Parallel computers. Adam Hilger, Bristol

    Google Scholar 

  • Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152

    Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00363956

Keywords

Navigation