Skip to content

jedrazb/python-tsp-simulated-annealing

Repository files navigation

Visualisation of Simulated Annealing algorithm to solve the Travelling Salesman Problem in Python

Using simulated annealing metaheuristic to solve the travelling salesman problem, and animating the results.

A simple implementation which provides decent results.

Requires python3, matplotlib and numpy to work


An example of the resulting route on a TSP with 70 nodes on 200x200 grid.


An example of learning progress expressed as the distance of the path over the time