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 inward a release of specified locations in addition to returning to the starting location?"

The Shiny Salesman tool allows you lot to select a release of dissimilar locations to include inward the TSP. You tin locomote in addition to then solve the work using your ain faux annealing parameters. You tin locomote fifty-fifty sentry every 2nd the map runs through the release of iterations that you lot select. Shiny Salesman also practice a graph showing the development of the electrical flow tour distance thence you lot tin locomote encounter how many iterations it took to honor the optimal route.

If you lot desire to encounter the TSP applied to a real-world work in addition to then you lot mightiness similar Randy Olson's Optimal Road Trip of U.S.A. of America National Parks.