A hierarchical approach for solving the large-scale traveling salesman problem
Master of Science (MS)
First Advisor's Name
Dong C. Park
First Advisor's Committee Title
Second Advisor's Name
Wunnava V. Subbarao
Third Advisor's Name
Fourth Advisor's Name
Traveling-salesman problem, Neural networks (Computer science)
Date of Defense
An algorithm for solving the large-scale Traveling Salesman Problem is presented. Research into past work in the area of Hopfield neural network use in solving the Traveling Salesman Problem has yielded design ideas that have been incorporated into this work. The algorithm consists of an unsupervised learning algorithm and a recursive Hopfield neural network. The unsupervised learning algorithm was used to decompose the problem into clusters. The recursive Hopfield neural network was applied to the centroids of the clusters, then to the cities in each cluster, in order to find an optimal path. An improvement in both computation speed and solution accuracy is shown by the proposed algorithm over the straight use of the Hopfield neural network.
Figueras, Anthony L., "A hierarchical approach for solving the large-scale traveling salesman problem" (1994). FIU Electronic Theses and Dissertations. 3321.
This document is currently not available here.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).