Results

Tabu Search Algorithms Results

Here are the results of executing a wide range of TS algorithms on Solomon's instances. For each instance and algorithm we give the average number of vehicles (main goal, in bold) and the average tour length.

Table 1: Results of tabu search algorithms on Solomon's benchmark instances. For each problem class, the average number of vehicles (bold) and the average tour length are shown.
Author R1 R2 C1 C2 RC1 RC2
Garcia et al. (1994)12.92
1317.7
3.09
1222.6
10.00
877.1
3.00
602.3
12.88
1473.5
3.75
1527.0
Rochat et al. (1995)12.25
1208.50
2.91
961.72
10.00
828.38
3.00
589.86
11.88
1377.39
3.38
1119.59
Potvin et al. (1996)12.50
1294.5
3.09
1154.4
10.00
850.2
3.00
594.6
12.63
1456.3
3.38
1404.8
Taillard et al. (1997)12.17
1209.35
2.82
980.27
10.00
828.38
3.00
589.86
11.50
1389.22
3.38
1117.44
Chiang et al. (1997)12.17
1204.19
2.73
986.32
10.00
828.38
3.00
591.42
11.88
1397.44
3.25
1229.54
De Backer et al. (1997)14.17
1214.86
5.27
930.18
10.00
829.77
3.25
604.84
14.25
1385.12
6.25
1099.96
Brandão (1999)12.58
1205
3.18
995
10.00
829
3.00
591
12.13
1371
3.50
1250
Schulze et al. (1999)12.25
1239.15
2.82
1066.68
10.00
828.94
3.00
589.93
11.75
1409.26
3.38
1286.05
Tan et al. (2000)13.83
1266.37
3.82
1080.24
10.00
870.87
3.25
634.85
13.63
1458.16
4.25
1293.38
Lau et al. (2000)14.00
1211.54
3.55
960.43
10.00
832.13
3.00
612.25
13.63
1385.05
4.25
1232.65
Cordeau et al. (2001)12.08
1210.14
2.73
969.57
10.00
828.38
3.00
589.86
11.50
1389.78
3.25
1134.52

← Back to Solomon instances results