🗺️ Visualize and control algorithms for the traveling salesman problem
The traveling salesman problem (TSP) asks the question, "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?".
Heuristic algorithms attempt to find a good approximation of the optimal path within a more reasonable amount of time.
Construction - Build a path
Improvement - Attempt to take an existing constructed path and improve on it
Exhaustive algorithms will always find the best possible solution by evaluating every possible path. These algorithms are typically significantly more expensive then the heuristic algorithms discussed above. The exhaustive algorithms implemented so far include:
These are the main tools used to build this site:
Pull requests are always welcome! Also, feel free to raise any ideas, suggestions, or bugs as an issue.