By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tachibana, Y. ; Coll. of Eng., Osaka Prefecture Univ., Japan ; Lee, G.H. ; Ichihashi, H. ; Miyoshi, T.

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

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:4 )

Date of Conference:

Nov/Dec 1995