By Topic

Hopfield-style neural networks and the TSP

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
$31 $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)
Wolfe, W.J. ; Campus Box 109, Colorado Univ., Denver, CO, USA ; Parry, M.H. ; MacMillan, J.M.

We describe the results of our travelling salesman problem (TSP) neural model, using a linearization of the Hopfield model and an orthogonal projection onto the feasible subspace, including the definition of a region of parameter space that ensures exclusive convergence to tours. Our TSP results are relatively good for up to 30 cities, achieving a large number of optimal tours, but scaling remains a problem. For a particular 100 city problem the results are not very good, giving tours that are 80-90% longer than the optimal tour. We compare the performance of the network to the sequential nearest city algorithm, and provide several ideas for improving the performance of the network, including a divide and conquer approach. The relationship of TSP networks to lateral inhibition networks is also described

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994