Tours marked with * are claimed to be optimal.
| Problem | Solution | Time | Algorithm |
| south-12.ttp | south-12.ttr | 1:21:15 (Optimal) | Branch and Bound |
| south-25.ttp | south-25.ttr | 7:11:40 | Greedy + 3-Opt |
| south-36.ttp | south-36.ttr | 9:21:15 | Greedy + 3-Opt |
| south-49.ttp | south-49.ttr | 16:21:15 | Greedy + 3-Opt |
| south-66.ttp | south-66.ttr | 16:21:15 | Greedy + 3-Opt |
| south-75.ttp | south-75.ttr | 17:06:00 | Greedy + 3-Opt |
| Problem | Solution | Time | Algorithm |
| usa-10.ttp | usa-10.ttr | 10:17:43 (Optimal) | Branch and Bound |
| usa-12.ttp | usa-12.ttr | 10:16:57 (Optimal) | Branch and Bound |
| usa-15.ttp | usa-15.ttr | 13:18:51 | Greedy + 3-Opt |
| usa-20.ttp | usa-20.ttr | 14:02:51 | Greedy + 3-Opt |
| Problem | Solution | Time | Algorithm |
| usa-25.ttp | usa-25.ttr | 16:06:58 | Greedy + 3-Opt |
| usa-30.ttp | usa-30.ttr | 17:13:06 | Greedy + 3-Opt |
| usa-35.ttp | usa-35.ttr | 20:13:58 | Greedy + 3-Opt |
| usa-40.ttp | usa-40.ttr | 22:21:37 | Greedy + 3-Opt |
| usa-45.ttp | usa-45.ttr | 24:15:08 | Greedy + 3-Opt |
| usa-50.ttp | usa-50.ttr | 24:01:55 | Greedy + 3-Opt |
| usa-60.ttp | usa-60.ttr | 27:22:32 | Greedy |
| usa-80.ttp | usa-80.ttr | 34:22:40 | Greedy + 3-Opt |
| usa-100.ttp | usa-100.ttr | 41:03:55 | Greedy + 3-Opt |
| usa-128.ttp | usa-128.ttr | 49:14:26 | Greedy + 3-Opt |
| Problem | Solution | Time | Algorithm |
| uk-25.ttp | uk-25.ttr | 8:06:49 | Greedy + 3-Opt |
| uk-50.ttp | uk-50.ttr | 12:04:38 | Greedy + 3-Opt |
| uk-100.ttp | uk-100.ttr | 24:08:57 | Greedy + 3-Opt |
| uk-150.ttp | uk-150.ttr | 32:03:35 | Greedy + 3-Opt |
| uk-200.ttp | uk-200.ttr | 38:02:45 | Greedy + 3-Opt |
| uk-284.ttp | uk-284.ttr | 53:14:41 | Greedy + 3-Opt |
| Problem | Solution | Time | Algorithm |
| mesh-3.ttp | mesh-3.ttr | 8:23:21 (Optimal) | Branch and Bound |
| mesh-4.ttp | mesh-4.ttr | 12:03:27 | Greedy + 3-Opt |
| mesh-5.ttp | mesh-5.ttr | 11:14:12 | Greedy + 3-Opt |
| mesh-6.ttp | mesh-6.ttr | 14:06:20 | Greedy + 3-Opt |
| mesh-7.ttp | mesh-7.ttr | 18:00:24 | Greedy + 3-Opt |
| mesh-8.ttp | mesh-8.ttr | 21:05:27 | Greedy + 3-Opt |
| mesh-9.ttp | mesh-9.ttr | 23:16:23 | Greedy + 3-Opt |
| mesh-10.ttp | mesh-10.ttr | 29:21:38 | Greedy + 3-Opt |
| Problem | Solution | Time | Algorithm |
| tri-3.ttp | tri-3.ttr | 6:07:03 (Optimal) | Branch and Bound |
| tri-4.ttp | tri-4.ttr | 7:05:34 (Optimal) | Branch and Bound |
| tri-5.ttp | tri-5.ttr | 8:19:19 (Optimal) | Branch and Bound |
| tri-6.ttp | tri-6.ttr | 9:23:41 | Greedy + 3-Opt |
| tri-7.ttp | tri-7.ttr | 10:16:50 | Greedy + 3-Opt |
| tri-8.ttp | tri-8.ttr | 14:06:50 | Greedy + 3-Opt |
| tri-9.ttp | tri-9.ttr | 15:10:15 | Greedy + 3-Opt |
| tri-10.ttp | tri-10.ttr | 20:09:03 | Greedy + 3-Opt |
| tri-11.ttp | tri-11.ttr | 24:06:26 | Greedy + 3-Opt |
| tri-12.ttp | tri-12.ttr | 23:17:26 | Greedy + 3-Opt |