Research Article
Solving Packing Problems by a Distributed Global Optimization Algorithm
Table 1
Computational results.
| Problem number | Box number | | | | | | | (x, y, z) | Objective value |
| 1 | 1 | 25 | 8 | 6 | 0 | 0 | 0 | (28, 26, 6) | 4368 | 2 | 20 | 10 | 5 | 8 | 0 | 0 | 3 | 16 | 7 | 3 | 8 | 10 | 2 | 4 | 15 | 12 | 6 | 16 | 11 | 0 |
| 2 | 1 | 25 | 8 | 6 | 10 | 20 | 0 | (35, 28, 6) | 5880 | 2 | 20 | 10 | 5 | 25 | 0 | 0 | 3 | 16 | 7 | 3 | 0 | 0 | 3 | 4 | 15 | 12 | 6 | 10 | 8 | 0 | 5 | 22 | 8 | 3 | 5 | 0 | 0 | 6 | 20 | 10 | 4 | 0 | 8 | 0 |
| 3 | 1 | 25 | 8 | 6 | 0 | 10 | 0 | (31, 16, 12) | 5952 | 2 | 20 | 10 | 5 | 0 | 0 | 0 | 3 | 16 | 7 | 3 | 9 | 0 | 9 | 4 | 15 | 12 | 6 | 25 | 0 | 0 | 5 | 22 | 8 | 3 | 3 | 7 | 9 | 6 | 20 | 10 | 4 | 0 | 0 | 5 | 7 | 10 | 8 | 4 | 31 | 0 | 0 |
|
|