On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
暂无分享,去创建一个
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.
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.
[3] J. J. Hopfield,et al. “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.