By Topic

Neural network approach to traveling salesman problem based on hierarchical city adjacency

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

4 Author(s)
Hiroshi Ninomiya, ; Dept. of Comput. Sci., Shizuoka Univ., Hamamatsu, Japan ; Sato, K. ; Nakayama, T. ; Asai, H.

A neural network approach based on city adjacency has been proposed in order to solve the traveling salesman problems. This method, in which a novel energy function is used for TSPs, produces frequently several traveling closed subtours. To cope with this problem, the authors propose a method to make a traveling tour without any closed subtours, where hierarchical city adjacency is considered. It is easy to apply this technique recursively. Therefore, this approach is applicable to larger scale problems

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:5 )

Date of Conference:

Nov/Dec 1995