Project description :

Project carried out as part of my studies at Polytech Lyon, with Maxime Antoine, Mathieu Ponton and Pablo Verchère. The aim of the project was to develop a python program to find the shortest path between 100 points on a map. The project is a version of the Travelling Salesman Problem. The program allows the user to choose one or more trucks to deliver to a predefined number of points. The programme was developed using the Turtle python library, and the algorithms used are the nearest neighbour algorithm for the initial solution, 2-opt, relocate and swap for the local search. All the algorithms were developed in-house. The program has a graphical interface that shows the best path in real time. All the data was saved in .xlsx files to enable us to analyse the results. For this project, we were ranked 1 out of 40 groups, with a score of 19/20.