Degree Type


Degree Name

Bachelor of Science (BS)

Date Information




First Advisor

Kathi Crowe


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.

Included in

Mathematics Commons