Travelling Salesman Problem
Solves a “travelling salesman problem” (TSP) by a standard MILP procedure. (Under observation)
2024.Nov.25 05:53:15
nod
Number of
nodes
("cities"), |
nod
| ≤ 10
For a
symmetrical
problem, make
nod
< 0 •
cost
'Cost' (or distance) matrix:
-1 72 202 138 222 172 219 134 78 80 147 248 189 47 186 123 (Coim Leir Lisb Ptlg Sant Setú — a comment)
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
Tech
nology).
•
TSPLIB
(Univ. of Heidelberg).
http://web.ist.utl.pt/~mcasquilho/compute/or/F-tsp.php
Created:
2002-06-27 —
Last modified:
2007-10-13
