This Python script solves the Travelling Salesperson Problem (TSP) using a randomized hill climbing algorithm with random restarts. It calculates the shortest possible tour that visits all given destinations and returns to the starting point.
python optimization optimization-algorithms shortest-path-algorithm traveling-salesman-problem randomized-hill-climbing
-
Updated
Jul 12, 2024 - Python