| New! |
Travelling salesman problem

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).
Yakov Polyakov is another 'spreadsheet king' and an ExcelCalcs
User. He is very worthy of our praise and has helped me out of a few
tight spots in my time with his many superb structural engineering spreadsheets - you'll find a link to his site here.
|