Name
Abstract | ||
|---|---|---|
In optimized packing problems a set of objects have to be allocated completely inside a number of containers (containment condition) without overlapping, while optimizing a certain objective. In some applications, a distance between the objects (and/or the objects and the container) has to be at least a certain given threshold. Analytical representations for non-overlapping, containment and distant conditions are proposed for the objects and containers defined by systems of inequalities. The placement constraints are transformed to optimization problems, corresponding optimality conditions are stated using Lagrangian multipliers technique and then are used as constraints to the overall optimized packing problem. The objects can be freely rotated and translated. For the objects presented by convex polytopes, rotations and translations are reduced to defining positions of the vertices subject to shapes preservation. Numerical results are provided to illustrate the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11036-020-01556-w | MOBILE NETWORKS & APPLICATIONS |
Keywords | DocType | Volume |
Optimized packing, Non-overlapping, containment and distant conditions, Optimality conditions, Lagrangian multipliers | Journal | 25 |
Issue | ISSN | Citations |
6 | 1383-469X | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor S. Litvinchev | 1 | 33 | 10.71 |
| T. Romanova | 2 | 65 | 7.04 |
| Rogelio Corrales-Diaz | 3 | 0 | 0.34 |
| Aned Esquerra-Arguelles | 4 | 0 | 0.34 |
| Alberto Martinez-Noa | 5 | 0 | 0.34 |