Parameters rules of the Hopfield/Tank model on solving TSP
Liu Rong, Zemin Liu · 2003
The Hopfield/Tank model has been used to solve large-scale optimization problems, such as the traveling salesman problem (TSP). The model is very sensitive to the parameters (A,B,C,D, and Ne). Following the subspace analysis of the connection matrix in which D=0, the influence of parameter D is investigated with some theorems to be proved. The dynamics of the model are analyzed. Based on these analyses, the parameter rules are established. Some simulation results of 10 city, 30 city and 50 city TSPs are also included. It is shown that if the parameters are selected based on these rules, not only the valid but also the sub-optimal solutions can be found by the Hopfield/Tank model.>