Research Article
Solving Packing Problems by a Distributed Global Optimization Algorithm
Table 3
Computational results for all boxes are cubic.
| | Problem number | Number of cubes | Side | (x, y, z) | CPU time (h:min:s) | Objective value |
| | 4 | 3 | | (8, 5, 5) | 00:00:08 | 200 Global optimum | | 3 | | | 1 | | | 1 | |
| | 5 | 4 | | (8, 6, 5) | 00:01:26 | 240 Global optimum | | 2 | | | 3 | | | 1 | |
| | 6 | 4 | | (8, 8, 5) | 00:10:12 | 320 Global optimum | | 3 | | | 4 | |
| | 7 | 4 | | (12, 7, 5) | 01:37:44 | 420 Global optimum | | 3 | | | 3 | | | 1 | | | 1 | |
|
|
