Skip to main content

Table 2. Numerical results on the balanced assignment problem

From: Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective

Instance Time to optimal (s) Optimal objective Lower bound standard Upper bound standard Gap standard (%)
0010 0 105 105 105 0.0
0015 0 271 271 271 0.0
0020 0 285 221 286 22.7
0025 0 364 214 375 42.9
0030 0 433 161 443 63.6
0040 0 458 56 457 87.7
0050 0 629 117 805 85.4
0060 0 821 50 1.083 95.3
0070 0 857 90 1.210 92.5
0080 0 806 225 850 73.5
0090 0 973 58 1.203 95.1
0100 0 993 8 1.399 100.0
0150 0 1.664 0 2.868 100.0
0200 0 2.029 1 3.936 100.0
0250 0 2.796 0 5.056 100.0
0300 0 3.693 141 6.721 97.5
0400 1 4.698 0 7.099 100.0
0500 1 5.737 0 8.922 100.0
0600 0 6.543 4 9.789 99.9
0700 1 8.095 0 13.028 100.0
0800 1 9.226 0 14.899 100.0
0900 2 9.265 0 15.412 100.0
1000 2 11.201 0 21.157 100.0
1500 16 16.337 0 31.883 100.0
2000 18 20.755 0 47.645 100.0
2500 39 1.326 0 31.943 100.0
3000 38 0 0 18.872 100.0