Research Article

Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking

Table 5

Optimal objective values of the demonstrative case.

Case ivrpcovrpcizsizs objIs it optimal?Computation time/s

1 335035814.9Y0.4
2 337666826.4Y0.5
3 4458471025.9Y0.4
4 437253932.9Y0.5
5 4458611040.3Y0.4
6 4453481137.4Y0.5
7 4463611151.2Y0.5
8 446566960.2Y0.4
9 445751922.8Y0.7
10 345541924.6Y0.6
11 3461441030.4Y0.4
12 445364939.8Y0.4
13 4457621145.7Y0.5
14 3458491043Y0.6
15 446558954.5Y0.6
16 338050934.4Y0.5
17 336753935.2Y0.7
18 335236729.2Y0.5
19 4475471044.3Y0.5
20 436447844.3Y0.4
21 4461691060.7Y0.4
22 4464481135.9Y0.5
23 445751936.6Y0.4
24 436950744.7Y0.4
25 4460421042.8Y0.5
26 336977766.8Y0.4
27 336244939Y0.4
28 4469451146.8Y0.4
29 347473860.5Y0.5
30 4467561157Y0.4
31 4469411048.5Y0.4
32 4370501054Y0.4
33 447244957.3Y0.4
34 337173858.6Y0.4
35 346173858.1Y0.4
36 4480571170.8Y0.5