Travelling salesman problem
 
This Download is for Registered Users Only.
Please login or Register (free plans available).

Description:

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.

Forum Link

Discuss this document in the Forum (subscribe to this topic to be notified of changes).

 

Submitted On:

08 Sep 2008

Submitted By:

yakpol

File Date:

08 Sep 2008

File Version:

1.0

File Size:

122.50 Kb

File Type:

xls

Downloads:

204

Rating:

Total Votes:1

Comments:

maccrinj 2008-09-17 16:17:50 Very easy to use and very instructive