Shiny Salesman is a tool for solving the Traveling Salesman Problem (TSP). The TSP asks: "What is the shortest possible route taking inward a discover of specified locations in addition to returning to the starting location?"
The Shiny Salesman tool allows you lot to direct a discover of dissimilar locations to include inward the TSP. You tin in addition to therefore solve the occupation using your ain imitation annealing parameters. You tin fifty-fifty sentinel every mo the map runs through the discover of iterations that you lot select. Shiny Salesman also practise a graph showing the development of the electrical current tour distance therefore you lot tin come across how many iterations it took to notice the optimal route.
If you lot desire to come across the TSP applied to a real-world occupation in addition to therefore you lot mightiness similar Randy Olson's Optimal Road Trip of USA National Parks.
Buat lebih berguna, kongsi:
