By Topic

A hierarchical approach for solving large-scale traveling salesman problem

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
$33 $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)
D. C. Park ; Intelligent Comput. Res. Lab., Florida Int. Univ., Miami, FL, USA ; A. L. Figueras ; C. Chen

A hierarchical approach which combines an unsupervised learning algorithm and a recursive Hopfield neural network is proposed for solving the large-scale traveling salesman problem (TSP). For a TSP with given number of cities, an unsupervised learning algorithm was first used to find the clusters for decomposing the given problem and then a recursive version of the Hopfield network was applied to the centroids of the clusters. The proposed recursive Hopfield network was also applied to cities in each cluster in order to find an optimal path. A final tour was obtained by connecting together the resultant paths of each cluster

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