On parameter settings of Hopfield networks applied to traveling salesman problems

Please use this identifier to cite or link to this item: https://doi.org/10.1109/TCSI.2005.846666

Title:	On parameter settings of Hopfield networks applied to traveling salesman problems
Authors:	Tan, K.C. Tang, H. Ge, S.S.
Keywords:	Hopfield neural networks Parameter setting Stability Traveling salesman problem (TSP)
Issue Date:	May-2005
Citation:	Tan, K.C., Tang, H., Ge, S.S. (2005-05). On parameter settings of Hopfield networks applied to traveling salesman problems. IEEE Transactions on Circuits and Systems I: Regular Papers 52 (5) : 994-1002. ScholarBank@NUS Repository. https://doi.org/10.1109/TCSI.2005.846666
Abstract:	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. © 2005 IEEE.
Source Title:	IEEE Transactions on Circuits and Systems I: Regular Papers
URI:	http://scholarbank.nus.edu.sg/handle/10635/56876
ISSN:	10577122
DOI:	10.1109/TCSI.2005.846666
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check