Advertisement

Biological Cybernetics

, Volume 58, Issue 1, pp 63–70 | Cite as

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

  • G. V. Wilson
  • G. S. Pawley
Article

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.

Keywords

Silicon System Size Travelling Salesman Problem Problem Algorithm Travelling Salesman 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Durbin R, Willshaw D (1987) An analogue approach to the travelling salesman problem using an elastic net method. Nature 326:689–691Google Scholar
  2. Hockney RW, Jesshope CR (1981) Parallel computers. Adam Hilger, BristolGoogle Scholar
  3. Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152Google Scholar
  4. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • G. V. Wilson
    • 1
  • G. S. Pawley
    • 1
  1. 1.Department of PhysicsUniversity of EdinburghEdinburghUnited Kingdom

Personalised recommendations