Shiny Salesman is a tool for solving the Traveling Salesman Problem (TSP). The TSP asks: "What is the shortest possible route taking inwards a set out of specified locations together with returning to the starting location?"
The Shiny Salesman tool allows you lot to conduct a set out of dissimilar locations to include inwards the TSP. You tin together with therefore solve the work using your ain imitation annealing parameters. You tin fifty-fifty spotter every minute the map runs through the set out of iterations that you lot select. Shiny Salesman also utilisation a graph showing the development of the electrical current tour distance therefore you lot tin run into how many iterations it took to detect the optimal route.
If you lot desire to run into the TSP applied to a real-world work together with therefore you lot powerfulness similar Randy Olson's Optimal Road Trip of United States of America of America National Parks.
