A simple steepest descent method for minimizing Hopfield energy to obtain optimal solution of the TSP with reasonable certainty

摘要

An effective algorithm for the Hopfield neural network model is proposed through its application to the traveling salesman problem. By the estimation of local minimum inside a hypercube of solution space, a threshold value for deciding integer valued solution can be properly chosen. An optimum solution of the TSP is obtained with reasonable certainty.