{"repo":"jhackshaw/tspvis","free":true,"listed":false,"github":"https://github.com/jhackshaw/tspvis","clone":"git clone https://github.com/jhackshaw/tspvis.git","description":"🗺️ Visualize and control algorithms for the traveling salesman problem","language":"JavaScript","stars":463,"topics":["visualization","heuristics","tsp","react","algorithms","javascript","data-visualization","travelling-salesman-problem"],"license":"MIT","category":"analytics","readme_excerpt":"[!WARNING] Seeking maintainers : If you're qualified and interested in taking over this project, I'd love to hear from you! The analytics suggest it is still helpful to a number of users, but I don't currently have the time to give it the attention it deserves. There's a lot of potential here and I'm looking to transition this to someone interested in making it better. Please shoot me a message if you're interested. 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?\". This project - Live at tspvis.com - The goal of this site is to be an educational resource to help visualize, learn, and develop different algorithms for the traveling salesman problem in a way that's easily accessible - As you apply different algorithms, the current best path is saved and used as input to whatever you run next. The order in which you apply different algorithms to the problem is sometimes referred to the meta-heuristic strategy. - For example, apply nearest neighbor, then 2-opt inversion, then branch and bound Heuristic algorithms Heuristic algorithms attempt to find a good approximation of the optimal path within a more reasonable amount of time. Construction - Build a path - Nearest Neighbor - Arbitrary Insertion - Furthest Insertion - Nearest Insertion - Convex Hull Insertion\\ - Simulated Annealing\\ Imp","default_branch":null,"files":null,"tree":[],"storefront":"/r/jhackshaw","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/jhackshaw/tspvis/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}