DocumentCode
285357
Title
A theoretical analysis of the parameters in a Hopfield/Tank model for solving TSP
Author
Rong, Liu ; Liu Ze- Min
Author_Institution
Beijing Univ. of Posts & Telecommun., China
Volume
1
fYear
1992
fDate
10-13 May 1992
Firstpage
336
Abstract
Some parameter rules for the Hopfield-Tank model are given. It has been found that if the time step Δt is not enough, the model may converge to an invalid solution. Thus, this model requires a lot of time to find a good solution, especially for the large-scale TSP (traveling salesman problem) (N >30). If the transfer function is replaced by the linear-segment function, Δt can be comparatively large. Therefore some modification is necessary in order to use this model to solve the large-scale problem
Keywords
Hopfield neural nets; combinatorial mathematics; functions; optimisation; Hopfield-Tank model; large-scale problem; linear-segment function; parameter rules; traveling salesman problem; Eigenvalues and eigenfunctions; Hypercubes;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
Conference_Location
San Diego, CA
Print_ISBN
0-7803-0593-0
Type
conf
DOI
10.1109/ISCAS.1992.229945
Filename
229945
Link To Document