DocumentCode
296134
Title
A simple steepest descent method for minimizing Hopfield energy to obtain optimal solution of the TSP with reasonable certainty
Author
Tachibana, Y. ; Lee, G.H. ; Ichihashi, H. ; Miyoshi, T.
Author_Institution
Coll. of Eng., Osaka Prefecture Univ., Japan
Volume
4
fYear
1995
fDate
Nov/Dec 1995
Firstpage
1871
Abstract
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
Keywords
Hopfield neural nets; combinatorial mathematics; minimisation; travelling salesman problems; Hopfield energy; Hopfield neural network model; hypercube; local minimum; steepest descent method; threshold value; traveling salesman problem; Chaos; Educational institutions; Hopfield neural networks; Hypercubes; Neural networks; Neurons; Power engineering and energy; Space exploration; Stability; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1995. Proceedings., IEEE International Conference on
Conference_Location
Perth, WA
Print_ISBN
0-7803-2768-3
Type
conf
DOI
10.1109/ICNN.1995.488907
Filename
488907
Link To Document