Thumbnail Image
Publication

Using Matrices And Hungarian Method To Solve The Traveling Salesman Problem

Couto, Briana
; 
Couto, Briana
Citations
Altmetric:
Abstract
In this paper, we introduce the Traveling Salesman Problem (TSP) and solve for the most efficient route of the problem using the steps of the Hungarian method. Specifically, this paper discusses the properties of a TSP matrix, provides the steps for the Hungarian method, and presents examples that apply these concepts to a Traveling Salesman Problem. We do not consider any constraints on the order in which the localities are visited, nor do we take into account possible traffic at differing times. We use examples to show how the Hungarian method is used and why it is an efficient way to solve the Traveling Salesman Problem.
Title
Using Matrices And Hungarian Method To Solve The Traveling Salesman Problem
Date
2018-01-01
Subject
mathematics
algorithm
Material type
Collections
Honors Theses
Mathematics Honors Theses
Show all metadata
Files
Thumbnail Image
Couto__20Briana.pdf
Adobe PDF, 172.95 KB
URI
http://hdl.handle.net/20.500.13013/644
Abstract
In this paper, we introduce the Traveling Salesman Problem (TSP) and solve for the most efficient route of the problem using the steps of the Hungarian method. Specifically, this paper discusses the properties of a TSP matrix, provides the steps for the Hungarian method, and presents examples that apply these concepts to a Traveling Salesman Problem. We do not consider any constraints on the order in which the localities are visited, nor do we take into account possible traffic at differing times. We use examples to show how the Hungarian method is used and why it is an efficient way to solve the Traveling Salesman Problem.
Duration
Location
Advisor
Crowe, Kathi
Sponsor
Course
Department
Mathematics
Degree
Bachelor of Science (BS)
Source
Publisher
Research Projects
Organizational Units
Journal Issue
Embedded videos