TSP ALGORITHM ANALYZER

An interactive platform for visualizing and comparing Traveling Salesman Problem (TSP) algorithms. Evaluate route quality and runtime performance using Nearest Neighbor, 2-Opt Inversion, and Simulated Annealing.

Best Route
-- km
Runtime
0.00 s
Cities
29
Current Evaluation
-- km

Algorithm
Nearest Neighbor

Controls
Delay
100
Show Best Path
Show Evaluated Paths
Show Evaluated Steps
Add custom list of coordinates



Points
Number of random points
29
Possible Paths:
0 x 10

Dark Mode