Document Type
Paper
Publication Date
Fall 2023
Abstract
What is the shortest route to walk to every residence hall on campus, beginning and ending with the same hall? This question can be considered by applying the Traveling Salesman Problem, an easy to understand yet hard to solve problem in the realm of discrete combinatorial optimization. The Traveling Salesman Problem is useful as an introduction to optimization problems, and it also has immensely practical applications. This paper will serve as an introduction to the computational difficulty of the Traveling Salesman Problem and will also explore various approximation algorithms. We will subsequently apply our new understanding of the theory to our problem at Taylor University.
Recommended Citation
Pawley, Jonathan Jinoo, "The Traveling Salesman Problem at Taylor University" (2023). Mathematics Student Projects. 6.
https://pillars.taylor.edu/mathstudentscholarship/6
Notes
Course: MAT 392, Mathematics Seminar (Dr. Jeremy Case)