By Topic

On parameter settings of Hopfield networks applied to traveling salesman problems

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
$33 $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

3 Author(s)
K. C. Tan ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore ; Huajin Tang ; S. S. Ge

Parameter setting is a critical step in the Hopfield networks solution of the traveling salesman problem (TSP), which is often prone to extraneous solutions. This paper presents some stability criteria that ensure the convergence of valid solutions and suppression of infeasible solutions. Our theory is based on an enhanced parametric formulation that maps TSP onto a continuous-time Hopfield network (CHN), which is more advantageous than the Hopfield-Tank (H-T) formulation. A set of analytical conditions for optimal parameter settings of the CHN is then derived, and the resulting performance is validated by simulations.

Published in:

IEEE Transactions on Circuits and Systems I: Regular Papers  (Volume:52 ,  Issue: 5 )