TSP in Spreadsheets - a Short Guided Tour
The travelling salesman problem (TSP) is a well-known business problem, and variants like the maximum benefit TSP or the price collecting TSP may have numerous economic applications. We are looking at several different variants of TSP; all solved in spreadsheets, not using tailored solvers for TSP. As these problems are NP hard, solving those using standard LP/MIP solvers has been regarded feasible only for very small sized problems. However, a careful consideration of the spreadsheet layout may facilitate efficient software utilisation. For real world problems this can have considerable effects, and with the recent advancements in solver engines, problems previously regarded as big are now easily solvable in spreadsheets. This paper shows you how; and how the flexibility of spreadsheets makes it a convenient tool solving many variants of TSP, where tailored solvers simply would not fit.
Volume (Year): 10 (2011)
Issue (Month): 1 ()
|Contact details of provider:|| Postal: University of Bristol, BS8 1HH, United Kingdom|
Fax: +44(0)117 331 4396
Web page: http://www.economicsnetwork.ac.uk/iree
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:che:ireepp:v:10:y:2011:i:1:p:94-116. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Martin Poulter)
If references are entirely missing, you can add them using this form.