You are here

graphical approach to the traveling salesman problem

Download pdf | Full Screen View

Date Issued:
1989
Summary:
This report details an approach to solving the Traveling Salesman Problem (TSP) using learning automata and a unique geometric approach. Two-dimensional Euclidean TSPs are considered and the type of learning automata used are commonly called neural networks. A standard neural net algorithm called back propagation proved to be fairly good at learning the sample figures, but a newer substitute for back propagation, called counter propagation, performed extremely well. An important goal of this research was to derive increased theoretical understanding of the TSP. This goal has been satisfied, especially with regard to instabilities in path length and the order of points traversed along the minimal path route. In addition, some applications to larger point problems are considered, and it is shown that configurations with isolated clusters of relatively closely spaced points relative to the convex hull apexes and the fixed points map quite well into the geometric figures presented here.
Title: A graphical approach to the traveling salesman problem.
0 views
0 downloads
Name(s): Garrett, Randy L.
Florida Atlantic University, Degree grantor
Hoffman, Frederick, Thesis advisor
College of Engineering and Computer Science
Department of Computer and Electrical Engineering and Computer Science
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 1989
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 285 p.
Language(s): English
Summary: This report details an approach to solving the Traveling Salesman Problem (TSP) using learning automata and a unique geometric approach. Two-dimensional Euclidean TSPs are considered and the type of learning automata used are commonly called neural networks. A standard neural net algorithm called back propagation proved to be fairly good at learning the sample figures, but a newer substitute for back propagation, called counter propagation, performed extremely well. An important goal of this research was to derive increased theoretical understanding of the TSP. This goal has been satisfied, especially with regard to instabilities in path length and the order of points traversed along the minimal path route. In addition, some applications to larger point problems are considered, and it is shown that configurations with isolated clusters of relatively closely spaced points relative to the convex hull apexes and the fixed points map quite well into the geometric figures presented here.
Identifier: 11939 (digitool), FADT11939 (IID), fau:8858 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (Ph.D.)--Florida Atlantic University, 1989.
Subject(s): Traveling-salesman problem
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/11939
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.