This project applies Simulated Annealing to solve the Traveling Salesman Problem using Peru's departments as nodes. Through iterative refinement, it finds the shortest route visiting each department once. Visual feedback enhances understanding and debugging, resulting in an optimal solution displayed with total distance.
data-visualization simulated-annealing geospatial-analysis traveling-salesman-problem simulated-annealing-algorithm simulated-annealing-edge-detection traveling-salesman-problem-solver
-
Updated
Jun 24, 2024 - Python