Travelling Salesman

A grid tile TSP solver

Description

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.

Installation

1. Clone the repository and cd into it:

git clone https://github.com/quandelaa/travelling_salesman.git
cd travelling_salesman/

2. Run the program:

python src/runner.py

Screenshots

• Grid Window

• Grid Manager Window

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Credits

• 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