Description
Convex Hull is a visualizer for the traveling salesman problem, the puzzle of finding the shortest route that visits every city and returns to the start. The site is an educational resource for seeing, learning and developing algorithms for the problem in the browser. You apply algorithms one after another, and the current best path is saved and used as the input for the next one, which is known as a meta-heuristic strategy. The heuristic algorithms include construction methods such as shortest path, arbitrary insertion, furthest insertion and nearest insertion, plus improvement methods such as 2-opt inversion. Some are marked with an asterisk on the page, including convex hull insertion, simulated annealing and reciprocal exchange. The exhaustive algorithms always find the best path by checking every possibility, and the site includes random paths, depth first search and branch and bound. The page explains why brute force becomes impractical: with 10 points there are 181,400 paths to evaluate, and with 20 points the number is about 60 quadrillion. The site is built with Gatsby, React, web workers, Material UI and deck.gl, and it uses OpenFreeMap and OpenStreetMap for maps. Pull requests and issues are welcome on the project's GitHub repository.…
Highlights
- Visualize TSP algorithms step by step
- Heuristic construction and improvement methods
- Exhaustive methods such as brute force
- Apply algorithms in sequence
- Built as an educational resource
Ratings & Reviews
No ratings yet
Be the first to rate Convex Hull.
People also visit
Convex Hull FAQ
What is Convex Hull?
A visualizer for the traveling salesman problem that shows how different algorithms find routes.
What is the traveling salesman problem?
Finding the shortest route that visits every city in a list and returns to the origin city.
What algorithms are included?
Heuristics such as shortest path, arbitrary insertion, nearest insertion and 2-opt inversion, and exhaustive methods such as random paths, depth first search and branch and bound.
Why does brute force not scale?
The number of paths grows factorially. With 10 points there are 181,400 paths, and with 20 points about 60 quadrillion.
Can I contribute?
Yes. Pull requests are welcome, and ideas or bugs can be raised as issues on GitHub at jhackshaw/tspvis.
Is there a cost?
The text scanned does not mention pricing.
What are the best Convex Hull alternatives?
Popular alternatives to Convex Hull include Graphisual, Topological visualizations and RouteXL. See all Convex Hull alternatives




