Publication Date
4-2022
School
College of Arts and Sciences
Major
Mathematics
Keywords
Traveling Salesman Problem, Metaheuristics, Genetic Algorithm, Ant Colony Optimization
Disciplines
Industrial Engineering | Mathematics | Operational Research | Systems Engineering
Recommended Citation
Helmick, Mason, "The Traveling Salesman Problem: An Analysis and Comparison of Metaheuristics and Algorithms" (2022). Senior Honors Theses. 1195.
https://digitalcommons.liberty.edu/honors/1195
Abstract
One of the most investigated topics in operations research is the Traveling Salesman Problem (TSP) and the algorithms that can be used to solve it. Despite its relatively simple formulation, its computational difficulty keeps it and potential solution methods at the forefront of current research. This paper defines and analyzes numerous proposed solutions to the TSP in order to facilitate understanding of the problem. Additionally, the efficiencies of different heuristics are studied and compared to the aforementioned algorithms’ accuracy, as a quick algorithm is often formulated at the expense of an exact solution.
Included in
Industrial Engineering Commons, Mathematics Commons, Operational Research Commons, Systems Engineering Commons
