On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
Parameter setting of the Hopfield network applied to TSP
Neural Networks
“Optimal” Hopfield network for combinatorial optimization with linear cost function
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
This paper analyzes the behavior of Hopfield networks as a method of solving the travelling salesman problem (TSP) with an enhanced formulation of energy function, which is more available than the Hopfield-Tank (H-T) one. The analysis is based on the geometry of the subspace set up by the degenerate eigenvalues of the connection matrix. A set of criterion for parameter settings is derived. The new parameters performed well in the simulations.