The Branch-and-Bound procedure for the classical Traveling Salesman Problem: Building a Demonstrator as an Open Educational Resource

Bachelor thesis

The Traveling Salesman Problem (TSP) as well as the Branch-and-Bound procedure (B&B) are both classics in Operations Research, tackled in many courses at different universities. The goal of this thesis is to develop a demonstrator which applies B&B to the TSP, using some simple bounds and branching schemes. The algorithm, hereby, needs to be visualized in a suitable manner, such that it can be used for educational purposes. The goal is to provide the demonstrator as an Open Educational Resource, ultimately, such that the outcome of the thesis can be used freely in any Operations Research course.

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