Coursework from University of Hertfordshire
The Travelling Salesman Problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the original city?
I completed a program in Python that is capable of:
- Randomly generating a map of locations
- Calculating the distance between those locations
- Generating a visiting order to find the shortest path
- Visualising the path.
The program implements two algorithms, the Nearest Neighbour Algorithm, and the Genetic Algorithm. The Nearest Neighbour algorithm is used to calculate an optimized travel route between all of the locations returning to the starting point. Whereas the Genetic Algorithm is used to solve small datasets (less than 100).
For more information about this project, please email me at mgrosmaninho@hotmail.com