The Traveling Salesperson Problem (TSP) is a widely known problem in OR and serves as a base for many routing applications. Over the years, a vast number of problem variations have been developed. The objective of this thesis is to give a systematic overview of the problem variants, their applications, and to analyze their model formulations in comparison to the classical TSP.

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