 |
Travelling Salesman Problem
Solves a “travelling salesman problem” (TSP) by a
standard MILP procedure. (Under observation) |
|
|
| nod |
|
Number of nodes ("cities"),
|nod| ≤ 10
For a symmetrical problem, make nod < 0
• |
| cost |
'Cost' (or distance) matrix:
|
| For the symmetrical problem,
supply only: the first line with a dummy value [say,
cost(1,1) = ∞]; and the lower triangular matrix.
(For infinity, enter −1.) Resolution is via
NAG procedure H02BBF.
Solution to the example… |
|
References:
• TSP
(Georgia I. of Technology).
• TSPLIB (Univ. of Heidelberg). |
