Abstract | ||
---|---|---|
The paper studies packing ellipses in a rectangular container of minimum area. The problem has various applications in production, logistics, industrial design. New phi-functions are proposed to state containment constraints and quasi-phi-functions are used for analytical description of non-overlapping constraints. A mathematical model for the packing problem is stated as a nonlinear programming problem. Two algorithms to find feasible starting points for identical and non-identical ellipses are proposed. The optimization procedure is used as a compaction algorithm to search for local optimal solutions. Computational results are provided to show the efficiency of the proposed approach. |
Year | DOI | Venue |
---|---|---|
2020 | 10.1007/s11276-018-1890-1 | Wireless Networks |
Keywords | DocType | Volume |
Ellipses, Packing, Continuous rotations, Phi-function technique, Mathematical modelling, Nonlinear optimization | Journal | 26 |
Issue | ISSN | Citations |
7 | 1572-8196 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. Pankratov | 1 | 0 | 0.34 |
T. Romanova | 2 | 65 | 7.04 |
Igor S. Litvinchev | 3 | 33 | 10.71 |