| Article ID: | iaor2006948 |
| Country: | Germany |
| Volume: | 11 |
| Issue: | 4 |
| Start Page Number: | 389 |
| End Page Number: | 407 |
| Publication Date: | Dec 2003 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Scheithauer G., Stoyan Yurij Y., Yaskov G. |
| Keywords: | packing |
The paper considers the optimization problem of packing various solid spheres into a parallelepiped with minimal height. Based on a corresponding mathematical model the peculiarities of the problem are investigated. Regarding these peculiarities a solution method is offered. The method includes three stages: searching for some approximations (extreme points) to local minima; improving the approximations by a neighborhood search; computing local minima using these approximations as starting points. Preliminary numerical results for examples with up to 60 spheres are also given.