TSP in spreadsheets—A fast and flexible tool |
| |
Authors: | Rasmus Rasmussen |
| |
Affiliation: | Molde University College, Specialized University in Logistics, Norway |
| |
Abstract: | The traveling salesman problem (TSP) is well-known and many specially developed solution procedures have been constructed to solve particular variants of it. This paper considers several different variants of TSP. However, developing tailored solution procedures for each is impractical. These problems are non-deterministic polynomial-time hard (NP hard). Solving them using standard linear programming/mixed integer programming (LP/MIP) solvers has therefore only been regarded to be feasible for very small problems. A careful consideration of the problem formulation may facilitate efficient software utilization, and for real-world problems this can have a considerable impact. Problems that were previously regarded as large and unwieldy are now easily solvable using spreadsheets, thanks to the recent advancement in general optimization software. |
| |
Keywords: | Traveling salesmen Assignment Network Spreadsheets |
本文献已被 ScienceDirect 等数据库收录! |
|