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

1 January 1988

journal article
Published by Springer Nature in Biological Cybernetics

Vol. 58 (1) , 63-70
https://doi.org/10.1007/bf00363956

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

This publication has 3 references indexed in Scilit:

An analogue approach to the travelling salesman problem using an elastic net method
Nature, 1987
“Neural” computation of decisions in optimization problems
Biological Cybernetics, 1985
Optimization by Simulated Annealing
Science, 1983