The Traveling Salesperson Problem (TSP) is a widely known problem in OR and serves as a base for many routing applications. Consequently, numerous both heuristic and exact solution procedures exist to solve the TSP. The objective of this thesis is to implement and compare existing exact and heuristic solution procedures for the TSP and to conduct a sensitivity analysis regarding the problem instance parameters.

Basic implementation skills in an object-oriented programming language are required for working on this topic.

Interested in this topic? Please read about the application procedure on our website!