Solving Travelling salesman problem for deliveries

Lucas Zuza Araujo

Bachelor's thesis

Abstract:

This work addresses Traveling Salesman Problem in a real business case and formulates a delivery plan which minimizes delivery costs. A selected company which deals with deliveries daily, provided data regarding current route plans for five working days and further relevant information which allowed deeper analysis and comparisons. Literature review on Operations Research, Traveling Salesman Problem and other connected topics was done. Furthermore, the approximation method Nearest Neighbour Algorithm and the optimization method Branch and Bound were used for solving Traveling Salesman Problem for the given problem with the help of the TSPKOSA solver. The results obtained showed that the current route used by the selected company are not the best when it comes to costs minimization. Additionally, Branch and Bound method achieved better results compared to the other method utilized. Based on results achieved it is safe to conclude that the route planning for the selected company may be improved to reduce delivery costs and its impact on the company’s profit. A suggestion for achieving such improvement is to adopt Traveling Salesman Problem methods such as Branch and Bound in the route planning activities of the company.

Keywords

Traveling salesman problem, Operations research, Deliveries, Optimization approach, Approximation methods

Jazyk práce: English

Datum vytvoření / odevzdání či podání práce: 2. 12. 2023

Obhajoba závěrečné práce

• Obhajoba proběhla 7. 2. 2024
• Vedúci: doc. Ing. Igor Krejčí, Ph.D.
• Oponent: Tereza Sedlářová Nehézová, Ing.

Czech University of Life Sciences Prague

Faculty of Economics and Management

Bachelor programme:
Informatics