Asymmetric Traveling Salesman Problem: Results obtained for TSPLIB instances


Results obtained using Gurobi for solving the asymmetric traveling salesman problem, using models described in Mathematical Optimization: Solving Problems using Python and Gurobi. CPU time limited to 3600 seconds. (Click on values for selecting data to display.)

Performance data
CPU time required
Number of solution failures
Solutions and bounds

Solutions failed

Legend for columns in the next tables
LabelDescription
inst Instance name
mtz Solutions failed using Miller-Tucker-Zemlin's potential formulation
mtz_strong Solutions failed by the stronger version of Miller-Tucker-Zemlin's formulation
scf Solutions failed by the single-commodity flow formulation
mcf Solutions failed by the multi-commodity flow formulation

chart
Number of failed solution attempts
InstanceSizemtzmtz_strongscfmcf
atex1 16 0 0 0 0
br17 17 0 0 0 0
atex3 32 0 0 0 0
ftv33 34 0 0 0 0
ftv35 36 0 0 0 0
ftv38 39 0 0 0 0
p43 43 1 1 0 1
ftv44 45 1 1 0 1
atex4,ftv47,ry48p 48 2 2 0 2
ft53 53 2 2 0 2
ftv55 56 2 2 0 2
ftv64 65 2 2 0 2
ft70 70 3 2 0 2
ftv70 71 3 2 0 2
atex5 72 4 3 1 3
ftv90 91 4 3 1 3
kro124p 100 4 3 1 4
ftv100,td100.1 101 4 3 1 6
ftv110 111 4 3 1 7
dc112 112 5 4 2 8
ftv120 121 5 4 2 9
dc126 126 6 5 3 10
ftv130 131 6 5 3 11
dc134 134 7 6 3 12
ftv140 141 7 6 3 13
ftv150 151 7 6 3 14
ftv160 161 7 6 3 15
ftv170 171 7 6 3 16
dc176 176 8 7 3 17
dc188 188 9 8 4 18
code198 198 9 8 4 19
code253 253 9 8 5 20
td316.10 317 9 8 5 21
rbg323 323 9 8 5 22
rbg358 358 9 8 5 23
rbg403 403 9 8 5 24
rbg443 443 9 8 5 25
dc563 563 10 9 6 26
atex8 600 11 10 7 27
big702 702 12 10 8 28
dc849 849 13 11 9 29
dc895 895 14 12 10 30
dc932 932 15 13 11 31
td1000.20 1001 15 13 12 32