Traveling Salesman Problem
Find the shortest tour visiting all cities — NP-hard meets heuristics
Nearest Neighbor
2-Opt Improve
Brute Force (≤10)
15 Cities
30 Cities
50 Cities
Clear
Click to place cities, then choose a solving method. Nearest Neighbor is fast but suboptimal. 2-Opt improves iteratively.