Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10225897 | European Journal of Operational Research | 2019 | 36 Pages |
Abstract
The problem of packing ellipsoids in the three-dimensional space is considered in the present work. The proposed approach combines heuristic techniques with the resolution of recently introduced nonlinear programming models in order to construct solutions with a large number of ellipsoids. The introduced approach is able to pack identical and non-identical ellipsoids within a variety of containers. Moreover, it allows the inclusion of additional positioning constraints. This fact makes the proposed approach suitable for constructing large-scale solutions with specific positioning constraints in which density may not be the main issue. Numerical experiments illustrate that the introduced approach delivers good quality solutions with a computational cost that scales linearly with the number of ellipsoids; and solutions with more than a million ellipsoids are exhibited.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
E.G. Birgin, R.D. Lobato,