Travelling Salesman Download Page

Home

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 me assigned for each river crossing. An 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 NRC website at:www.nrbook.com

Travelling salesman itinerary
Play Now