Skip to main content
Log in

Packing ellipses in an optimized rectangular container

  • Published:
Wireless Networks Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Kallrath, J., & Rebennack, S. (2014). Cutting ellipses from area-minimizing rectangles. Journal of Global Optimization, 59(2–3), 405–437.

    Article  MathSciNet  Google Scholar 

  2. Miller, P. (2012). Globally optimal packing of nonconvex two-dimensional shapes by approximation with ellipses. Senior thesis, Princeton University, Princeton, NJ.

  3. Stoyan, Yu., Pankratov, A., & Romanova, T. (2017). Placement problems for irregular objects: Mathematical modeling, optimization and applications. In S. Butenko, et al. (Eds.), Optimization methods and applications (pp. 521–558). New York: Springer.

    Chapter  Google Scholar 

  4. Stoyan, Y., Pankratov, A., & Romanova, T. (2016). Cutting and packing problems for irregular objects with continuous rotations: Mathematical modelling and non-linear optimization. Journal of the Operational Research Society, 67(5), 786–800.

    Article  Google Scholar 

  5. Litvinchev, I., Infante, L., & Ozuna, L. (2015). Packing circular like objects in a rectangular container. Journal of Computer and Systems Sciences International, 54(2), 259–267.

    Article  MathSciNet  Google Scholar 

  6. Litvinchev, I., Infante, L., & Ozuna, L. (2015). Approximate packing: Integer programming models, valid inequalities and nesting. In G. Fasano & J. Pintér (Eds.), Optimized packings and their applications. Springer optimization and its applications (Vol. 105, pp. 117–135). New York: Springer.

    Google Scholar 

  7. Stoyan, Yu., Pankratov, A., & Romanova, T. (2016). Quasi-phi-functions and optimal packing of ellipses. Journal of Global Optimization, 65(2), 283–307.

    Article  MathSciNet  Google Scholar 

  8. Birgin, E. G., Lobato, R. D., & Martinez, J. M. (2016). Packing ellipsoids by nonlinear optimization. Journal of Global Optimization, 65(4), 709–743.

    Article  MathSciNet  Google Scholar 

  9. Birgin, E. G., Lobato, R. D., & Martinez, J. M. (2017). A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, 68(3), 467–499.

    Article  MathSciNet  Google Scholar 

  10. Stoyan, Yu., & Romanova, T. (2012). Mathematical models of placement optimization: Two- and three-dimensional problems and applications. In G. Fasano & J. Pinter (Eds.), Modeling and optimization in space engineering. Springer optimization and its applications (Vol. 73, pp. 363–388). New York: Springer.

    Chapter  Google Scholar 

  11. Stoyan, Yu., Romanova, T., Pankratov, A., & Chugay, A. (2015). Optimized object packings using quasi-phi-functions. In G. Fasano & J. Pinter (Eds.), Optimized packings with applications (Vol. 105, pp. 265–293). New York: Springer.

    Chapter  Google Scholar 

  12. Wachter, A., & Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1), 25–57.

    Article  MathSciNet  Google Scholar 

  13. Stoyan, Yu., & Pankratov, A. (1999). Regular packing of congruent polygons on the rectangular sheet. European Journal of Operational Research, 113, 653–675.

    Article  Google Scholar 

  14. Martinez-Rios, F., Marmolejo-Saucedo, J. A., Murillo-Suarez, A. (2019). A new heuristic algorithm to solve circle packing problem inspired by nanoscale electromagnetic fields and gravitational effects. In Proceedings of the 4th IEEE international conference on nanotechnology for instrumentation and measurement (NANOFIM 2018), 7–8 November, 2018, Mexico City, Mexico.

  15. Torres-Escobar, R., Marmolejo-Saucedo, J. A., & Litvinchev, I. (2018). Linear models for non-congruent circle packing in a rectangular container. International Journal of Applied Engineering Research, 13(3), 1784–1790.

    Google Scholar 

  16. Torres-Escobar R., Marmolejo-Saucedo J.A., Litvinchev I., Vasant P. (2019). Monkey algorithm for packing circles with binary variables. In: Vasant P., Zelinka I., Weber GW. (eds) ICO 2018: Intelligent computing and optimization. Advances in intelligent systems and computing (Vol. 866, pp. 547-559). Springer, Cham.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. Romanova.

Appendices

Appendix 1: Definitions of a phi-function and quasi phi-function

Let there be two objects \(A \subset R^{2}\) and \(B \subset R^{2}\). The position of object \(A\) is defined by a vector of placement parameters \(u_{A} = (v_{A} ,\theta_{A} )\), where \(v_{A} = (x_{A} ,y_{A} )\) is a translation vector and \(\theta_{A}\) is a rotation angle. The object A, rotated by angle \(\theta_{A}\) and translated by vector \(v_{A}\) will be denoted by \(A(u_{A} )\).

Phi-functions allow us to distinguish the following three cases: \(A(u_{A} )\) and \(B(u_{B} )\) are intersecting so that \(A(u_{A} )\) and \(B(u_{B} )\) have common interior points (Fig. 5a); \(A(u_{A} )\) and \(B(u_{B} )\) are in contact, i.e. \(A(u_{A} )\) and \(B(u_{B} )\) have only common frontier points (Fig. 5b); \(A(u_{A} )\) and \(B(u_{B} )\) do not intersect, i.e. \(A(u_{A} )\) and \(B(u_{B} )\) do not have common points (Fig. 5c).

Fig. 5
figure 5

Relations between two objects: a interior overlapping, b touching, c non-overlapping

Definition 1.1

A continuous and everywhere defined function \(\varPhi^{AB} (u_{A} ,u_{B} )\) is called a phi-function for objects \(A(u_{A} )\) and \(B(u_{B} )\) if

$$\begin{aligned} & \Phi ^{{AB}} (u_{A} ,u_{B} ) < 0,\quad {\text{if}}\quad \text{int} A(u_{A} ) \cap \text{int} B(u_{B} ) \ne \emptyset ; \\ & \Phi ^{{AB}} (u_{A} ,u_{B} ) = 0,\quad {\text{if}}\quad \text{int} A(u_{A} ) \cap \text{int} B(u_{B} ) = \emptyset \quad {\text{and}}\quad frA(u_{A} ) \cap frB(u_{B} ) \ne \emptyset ; \\ & \Phi ^{{AB}} (u_{A} ,u_{B} ) > 0,\quad {\text{if}}\quad A(u_{A} ) \cap B(u_{B} ) = \emptyset . \\ \end{aligned}$$

Figure 5 illustrates three types of relations between two ellipses: (a) interior overlapping, \(\varPhi^{AB} (u_{A} ,u_{B} ) < 0;\) (b) touching, \(\varPhi^{AB} (u_{A} ,u_{B} ) = 0;\) c) non-overlapping \(\varPhi^{AB} (u_{A} ,u_{B} ) > 0.\)

The inequality \(\varPhi^{AB} (u_{A} ,u_{B} ) \ge 0\) provides the non-overlapping condition, i.e., \(\text{int}\,A(u_{A} ) \cap \text{int}\,B(u_{B} ) = \emptyset\), and inequality \(\varPhi^{{AB^{*} }} (u_{A} ,u_{B} ) \ge 0\) provides the containment condition \(A(u_{A} ) \subset\)\(B(u_{B} )\), i.e. \(\text{int}\,A(u_{A} ) \cap \text{int}\,B^{*} (u_{B} ) = \emptyset\), where \(B^{ * } = R^{2} \backslash \text{int}\,B.\) (Fig. 6)

Fig. 6
figure 6

Containment of A into B

We refer the reader for details to, e.g., Stoyan and Romanova [10].

Definition 1.2

A continuous and everywhere defined function \(\varPhi^{{{\prime }AB}} (u_{A} ,u_{B} ,u^{{\prime }} )\) is called a quasi-phi-function for two objects \(A(u_{A} )\) and \(B(u_{B} )\) if \(\mathop {\hbox{max} }\limits_{{u^{\prime}}} \varPhi^{{{\prime }AB}} (u_{A} ,u_{B} ,u^{{\prime }} )\) is a phi-function for the objects.

Here \(u^{\prime}\) is a vector of auxiliary continuous variables that belongs to Euclidean space.

Based on features of a quasi-phi-function the non-overlapping constraint can be described in the form:

if \(\varPhi^{{{\prime }AB}} (u_{A} ,u_{B} ,u^{{\prime }} ) \ge 0\) for some \(u^{\prime}\), then \(\text{int}\,A(u_{A} ) \cap \text{int}\,B(u_{B} ) = \emptyset\).

Example 1.1

A function defined by

$$\varPhi^{{{\prime }AB}} (u_{A} ,u_{B} ,u^{{\prime }} ) = \hbox{min} \{ \varPhi^{AP} (u_{A} ,u^{{\prime }} ),\varPhi^{{BP^{ * } }} (u_{B} ,u^{{\prime }} )\}$$

is a quasi-phi-function for a pair of convex objects \(A\) and \(B\), where \(\varPhi_{{}}^{AP} (u_{A} ,u^{\prime})\) is a phi-function for \(A(u_{A} )\) and a half-plane \(P(u^{\prime})\) and \(\varPhi_{{}}^{{BP^{ * } }} (u_{B} ,u_{P} )\) is a phi-function for \(B(u_{B} )\) and a half-plane \(P^{*} (u^{\prime}) = R^{2} \backslash \text{int}\,P(u^{\prime})\).

Figure 7 illustrates position of two convex objects and a separation line that provide \(\varPhi^{{{\prime }AB}} (u_{A} ,u_{B} ,u^{{\prime }} ) > 0\).

Fig. 7
figure 7

Illustration to a quasi-phi-function \(\varPhi^{{{\prime }AB}}\) for objects A and B

We refer the reader for details to, e.g., Stoyan et al. [7].

Appendix 2: Illustrations to the SPA_1 algorithm

See Figures 8, 9, 10 and 11.

Fig. 8
figure 8

Illustration to Steps 1, 2 of SPA_1

Fig. 9
figure 9

Illustration to Steps 4 of SPA_1

Fig. 10
figure 10

Illustration to Steps 5 of SPA_1

Fig. 11
figure 11

Feasible placement of ellipses

Appendix 3: Illustrations to the LOFRT procedure

Starting from point \(u^{0} = (l^{0} ,w^{0} ,u_{1}^{0} ,u_{2}^{0} , \ldots ,u_{n}^{0} ,\tau^{0} )\) the point \(u^{*} = (l^{*} ,w^{*} ,u_{1}^{*} ,u_{2}^{*} , \ldots ,u_{n}^{*} ,\tau^{*} )\) of local minimum is found (Fig. 12).

Fig. 12
figure 12

Arrangement of ellipses that corresponds to: the starting point u0 and point of local minimum u*

For details of the LOFRT procedure we refer the reader to Stoyan et al. [7].

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pankratov, A., Romanova, T. & Litvinchev, I. Packing ellipses in an optimized rectangular container. Wireless Netw 26, 4869–4879 (2020). https://doi.org/10.1007/s11276-018-1890-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-018-1890-1

Keywords