Travelling Salesman — Download
This spreadsheet solves the famous travelling salesman problem of finding the shortest cyclical itinerary for a travelling salesman who must visit each of N cities in turn. In addition a penalty may be assigned for each river crossing. The algorithm is based on the method of simulated annealing published in the Numerical Recipes in C, 2nd edition (1992). For more information on this method visit the NRC website at: www.nrbook.com.
TravellingSalesman.xlsb will download to your default folder.