This thesis focuses on the implementation and evaluation of metaheuristic algorithms to solve large instances of the Travelling Salesperson Problem (TSP). The objective is to identify or combine heuristics that achieve high-quality solutions within reasonable computation times, using benchmarks like TSPLIB or custom-generated test cases.

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!