Open Access
Table 1
Computational results for problem size six suppliers, three co-ops, and c customers.
| Number of customers | Execution time (s) | Total distance in each cluster |
Traveled distance in the system | Number of problems |
||||
|---|---|---|---|---|---|---|---|---|
| Max | Min | Avg | SD | Two opened co-ops | Three opened co-ops | |||
| Optimal with the first objective function | ||||||||
| 3 | 1.15 | 648.07 | 26.47 | 321.91 | 325.64 | 965.73 | 25 | 5 |
| 4 | 3.75 | 722.40 | 24.93 | 340.51 | 365.13 | 1021.53 | 20 | 10 |
| 5 | 5.97 | 803.13 | 25.90 | 358.74 | 409.27 | 1076.23 | 22 | 8 |
| 6 | 21.83 | 850.23 | 10.67 | 389.94 | 439.75 | 1169.83 | 26 | 4 |
| MDSR heuristic | ||||||||
| 3 | 0.01 | 565.26 | 180.93 | 377.90 | 200.91 | 1133.70 | 5 | 20 |
| 4 | 0.03 | 591.47 | 166.83 | 403.39 | 223.40 | 1210.17 | 9 | 21 |
| 5 | 0.05 | 645.90 | 196.13 | 429.52 | 233.72 | 1288.57 | 6 | 24 |
| 6 | 0.04 | 666.77 | 202.03 | 462.60 | 249.73 | 1387.80 | 9 | 21 |
| Optimal with the second objective function | ||||||||
| 3 | 26.80 | 511.67 | 361.93 | 441.92 | 77.59 | 1325.77 | 0 | 30 |
| 4 | 222.31 | 526.47 | 520.27 | 523.36 | 3.23 | 1570.07 | 0 | 30 |
| 5 | 2139.87 | 563.70 | 560.70 | 562.16 | 1.59 | 1686.47 | 0 | 30 |
| 6 | 30 419.41 | 598.57 | 597.50 | 598.02 | 0.59 | 1794.07 | 0 | 30 |
| MDSRB heuristic | ||||||||
| 3 | 0.01 | 502.00 | 372.82 | 437.93 | 68.25 | 1313.79 | 0 | 30 |
| 4 | 0.03 | 562.50 | 384.47 | 466.99 | 94.02 | 1400.97 | 0 | 30 |
| 5 | 0.03 | 583.93 | 419.20 | 505.44 | 87.35 | 1516.33 | 0 | 30 |
| 6 | 0.02 | 599.30 | 467.43 | 535.61 | 70.32 | 1606.83 | 0 | 30 |