Home▸Algorithms & AI▸Travelling Salesman Problem Solver: 2-opt, Simulated Annealing, Genetic Algorithm and Exact Dynamic Programming

🚚 Travelling Salesman Problem Solver: 2-opt, Simulated Annealing, Genetic Algorithm and Exact Dynamic Programming

Interactive travelling salesman problem: nearest neighbour, 2-opt, simulated annealing and a genetic algorithm with a 1-tree lower bound, an exact Held-Karp answer for small instances and drag-and-drop cities.

Algorithms & AI2DModerate60 FPS📱 Mobile-adapted⇄ 3D version
Travelling Salesman Problem Solver: 2-opt, Simulated Annealing, Genetic Algorithm and Exact Dynamic Programming ↗ Open standalone
⚙ Under the hood

Interactive travelling salesman problem: nearest neighbour, 2-opt, simulated annealing and a genetic algorithm with a 1-tree lower bound, an exact Held-Karp answer for small instances and drag-and-drop cities.

travelling salesmanTSP2-optsimulated annealinggenetic algorithmHeld-Karpcombinatorial optimization

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)