Presentation 1996/7/24
Existence of Neural Representation of TSP Most Sharply Distinguishing its Optimal Solution and its Approximate Realization
Satoshi Matsuda,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Taking traveling salesman problem as an example of combinatorial optimization problems, the existance of its mapping on Hopfield network is shown where a corner of state hypercube of the network is asymptotically stable if and only if it is an optimal solution. That is, one can always get optimal solution whenever the network converges to a corner. But this mapping can not be obtained without knowing optimal solution. So, its approximate realization is proposed, which is shwon, by simulations, to get good solutions very frequently.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hopfield network / traveling salesman problem / optimal neural representation
Paper # NC96-36
Date of Issue

Conference Information
Committee NC
Conference Date 1996/7/24(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) Existence of Neural Representation of TSP Most Sharply Distinguishing its Optimal Solution and its Approximate Realization
Sub Title (in English)
Keyword(1) Hopfield network
Keyword(2) traveling salesman problem
Keyword(3) optimal neural representation
1st Author's Name Satoshi Matsuda
1st Author's Affiliation Computer and Communication Research Center, Tokyo Electric Power Company()
Date 1996/7/24
Paper # NC96-36
Volume (vol) vol.96
Number (no) 178
Page pp.pp.-
#Pages 8
Date of Issue