The traveling salesperson problem (TSP) is a classical OR problem. A person, starting from a node, needs to visit a set of nodes before returning to the initial position. Hereby, the distance covered needs to be minimized. As the problem is known for years, many mixed integer linear programming formulations have been published over time. The purpose of the thesis is to conduct a systematic literature review, identify different modeling approaches, and explain the differences, pros, and cons of the single models.

Interested in this topic? Please use the application form on our website!