optimal-odyssey

optimalodyssey.vercel.app

YouTube demo

• Animate the solution to the traveling salesperson problem with Held-Karp, which uses bitmask dynamic programming to find an exact solution.
• Compare this to a quick approximation found by the nearest neighbor heuristic.
• Allow users to manually solve the problem themselves.
• Change the animation speed with a dial.
• Randomly sample cities from around the world.
• Or add your own cities.
• Visualize the world and paths on a 2d map or 3d globe with Cesium.