Presentation	1994/5/19 Theoretical considerations on the formalization of traveling selesman problem with relative distances by Hopfield neural network Satoshi Matsuda,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In solving combinatorial problems by Hopfield neural networks, the formalizations of problems are not made so carefully.Though many formalizations of,for example,TSP have been proposed,their theoretical comparisons are not made yet.On the other hand,taking traveling salesman problem as an example,in solving the combinatorial optimization problem by Hopfield neural network,the asymptotical stability and unstability conditions of solutions and nonsolutions were shown by the author^(5),(6)>.In this paper, using these results on the stabilities of solutions,theoretical considerations on the formalization of TSP with relative distances^ (3),(4)>are made.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Hopfield neural network / Traveling salesman problem / Theoretical comparison
Paper #	NC94-3
Date of Issue

Conference Information
Committee	NC
Conference Date	1994/5/19(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Neurocomputing (NC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Theoretical considerations on the formalization of traveling selesman problem with relative distances by Hopfield neural network
Sub Title (in English)
Keyword(1)	Hopfield neural network
Keyword(2)	Traveling salesman problem
Keyword(3)	Theoretical comparison
1st Author's Name	Satoshi Matsuda
1st Author's Affiliation	Computer and Communication Research Center,Tokyo Electric Power Co.()
Date	1994/5/19
Paper #	NC94-3
Volume (vol)	vol.94
Number (no)	40
Page	pp.pp.-
#Pages	8
Date of Issue