Thursday, April 19, 2018

Solving the Traveling Salesman Problem


Shiny Salesman is a tool for solving the Traveling Salesman Problem (TSP). The TSP asks: "What is the shortest possible route taking in a number of specified locations and returning to the starting location?"

The Shiny Salesman tool allows you to choose a number of different locations to include in the TSP. You can then solve the problem using your own simulated annealing parameters. You can even watch as the map runs through the number of iterations that you select. Shiny Salesman also create a graph showing the evolution of the current tour distance so you can see how many iterations it took to find the optimal route.

If you want to see the TSP applied to a real-world problem then you might like Randy Olson's Optimal Road Trip of U.S. National Parks.
Post a Comment