A grid tile TSP solver
Solves a given travelling salesman problem (start city, cities, end city) from the user by a grid tile using simulated annealing and the manhattan distance as its heuristic.
- Clone the repository and
cdinto it:
git clone https://github.com/quandelaa/travelling_salesman.git
cd travelling_salesman/- Run the program:
python src/runner.py- Grid Window
- Grid Manager Window
This project is licensed under the MIT License - see the LICENSE.md file for details
- CS50 AI for introducing me to TSP (https://cs50.harvard.edu/ai/notes/3/)
- Simulated Annealing Afternoon though contains some errors hehe (https://algorithmafternoon.com/books/simulated_annealing/)
- My love for programming
- Made by quandela
February or March 2026