A P-Based Hybrid Evolutionary Algorithm for Vehicle Routing Problem with Time Windows
Table 4
Comparison with the results of PHEA-cs,-symp.
Problems
BS
MBS
WS
STD
ET
PHEA-cs,-symp
r107
1119.14
1126.37
1130.03
7.16
2207
r109
1268.87
1280.36
1322.81
23.78
3105
c108
840.56
893.1
929.7
32.5
8562
c109
1064.63
1094.26
1131.01
28.98
7340
rc101
1733.43
1746.11
1777.61
18.25
4985
rc105
1647.46
1656.5
1674.92
11.21
6279
R201
1434.71
1440.53
1457.71
10.81
6597
R210
1203.25
1225.01
1296.43
39.99
4871
C201
591.56
657.78
686.27
40.52
14673
C202
643.23
659.67
668.22
10.45
10739
RC201
1589.95
1603.71
1612.88
12.56
8214
RC208
1049.6
1063.17
1088.99
14.11
8380
PHEA
r107
1091.75
1101.51
1110.8
7.96
3972
r109
1183.04
1202.46
1218.88
14.42
9728
c108
840.56
862.29
894.88
29.75
18370
c109
828.94
865.16
896.98
37.27
15832
rc101
1650.29
1654.72
1669
8.03
9856
rc105
1602.34
1617.85
1629.44
11.6
11725
R201
1255.76
1284.05
1328.42
38.76
12434
R210
939.37
956.25
967.5
15.5
16287
C201
591.56
591.56
591.56
0
26739
C202
591.56
591.56
591.56
0
28473
RC201
1392.38
1402.23
1427.08
15.25
16298
RC208
848.10
867.04
942.78
12.76
18472
The number of runs is 10. BS, MBS, WS, STD, and ET represent the best solution, worst solution, standard deviation, and elapsed time (in seconds), respectively.
