IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v75y2019i2d10.1007_s10898-019-00777-y.html
   My bibliography  Save this article

Packing ellipses in an optimized convex polygon

Author

Listed:
  • A. Pankratov

    (Institute for Mechanical Engineering Problems of the National Academy of Sciences of Ukraine)

  • T. Romanova

    (Institute for Mechanical Engineering Problems of the National Academy of Sciences of Ukraine)

  • I. Litvinchev

    (Nuevo Leon State University (UANL))

Abstract

Packing ellipses with arbitrary orientation into a convex polygonal container which has a given shape is considered. The objective is to find a minimum scaling (homothetic) coefficient for the polygon still containing a given collection of ellipses. New phi-functions and quasi phi-functions to describe non-overlapping and containment constraints are introduced. The packing problem is then stated as a continuous nonlinear programming problem. A solution approach is proposed combining a new starting point algorithm and a new modification of the LOFRT procedure (J Glob Optim 65(2):283–307, 2016) to search for locally optimal solutions. Computational results are provided to demonstrate the efficiency of our approach. The computational results are presented for new problem instances, as well as for instances presented in the recent paper ( http://www.optimization-online.org/DB_FILE/2016/03/5348.pdf , 2016).

Suggested Citation

  • A. Pankratov & T. Romanova & I. Litvinchev, 2019. "Packing ellipses in an optimized convex polygon," Journal of Global Optimization, Springer, vol. 75(2), pages 495-522, October.
    • Handle: RePEc:spr:jglopt:v:75:y:2019:i:2:d:10.1007_s10898-019-00777-y
    DOI: 10.1007/s10898-019-00777-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00777-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00777-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Josef Kallrath & Steffen Rebennack, 2014. "Cutting ellipses from area-minimizing rectangles," Journal of Global Optimization, Springer, vol. 59(2), pages 405-437, July.
    2. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2017. "A nonlinear programming model with implicit variables for packing ellipsoids," Journal of Global Optimization, Springer, vol. 68(3), pages 467-499, July.
    3. Igor Litvinchev & Luis Infante & Lucero Ozuna, 2015. "Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Optimized Packings with Applications, edition 1, chapter 0, pages 187-205, Springer.
    4. Yuriy Stoyan & Alexander Pankratov & Tatiana Romanova, 2016. "Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(5), pages 786-800, May.
    5. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2016. "Packing ellipsoids by nonlinear optimization," Journal of Global Optimization, Springer, vol. 65(4), pages 709-743, August.
    6. Yuriy Stoyan & Tatiana Romanova & Alexander Pankratov & Andrey Chugay, 2015. "Optimized Object Packings Using Quasi-Phi-Functions," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Optimized Packings with Applications, edition 1, chapter 0, pages 265-293, Springer.
    7. Josef Kallrath, 2017. "Packing ellipsoids into volume-minimizing rectangular boxes," Journal of Global Optimization, Springer, vol. 67(1), pages 151-185, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2023. "Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    2. Romanova, Tatiana & Litvinchev, Igor & Pankratov, Alexander, 2020. "Packing ellipsoids in an optimized cylinder," European Journal of Operational Research, Elsevier, vol. 285(2), pages 429-443.
    3. Josef Kallrath & Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Luis Infante, 2023. "Packing convex polygons in minimum-perimeter convex hulls," Journal of Global Optimization, Springer, vol. 85(1), pages 39-59, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Romanova, Tatiana & Litvinchev, Igor & Pankratov, Alexander, 2020. "Packing ellipsoids in an optimized cylinder," European Journal of Operational Research, Elsevier, vol. 285(2), pages 429-443.
    2. Birgin, E.G. & Lobato, R.D., 2019. "A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids," European Journal of Operational Research, Elsevier, vol. 272(2), pages 447-464.
    3. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2020. "Packing ovals in optimized regular polygons," Journal of Global Optimization, Springer, vol. 77(1), pages 175-196, May.
    4. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    5. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2017. "A nonlinear programming model with implicit variables for packing ellipsoids," Journal of Global Optimization, Springer, vol. 68(3), pages 467-499, July.
    6. Tiago Montanher & Arnold Neumaier & Mihály Csaba Markót & Ferenc Domes & Hermann Schichl, 2019. "Rigorous packing of unit squares into a circle," Journal of Global Optimization, Springer, vol. 73(3), pages 547-565, March.
    7. Ryu, Joonghyun & Lee, Mokwon & Kim, Donguk & Kallrath, Josef & Sugihara, Kokichi & Kim, Deok-Soo, 2020. "VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    8. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    9. Juan Lu & Chengyi Ou & Chen Liao & Zhenkun Zhang & Kai Chen & Xiaoping Liao, 2021. "Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1043-1063, April.
    10. Germán Pantoja-Benavides & David Álvarez-Martínez & Francisco Parreño Torres, 2024. "The Normalized Direct Trigonometry Model for the Two-Dimensional Irregular Strip Packing Problem," Mathematics, MDPI, vol. 12(15), pages 1-25, August.
    11. Cafieri, Sonia & Conn, Andrew R. & Mongeau, Marcel, 2023. "Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 670-679.
    12. Josef Kallrath & Markus M. Frey, 2019. "Packing circles into perimeter-minimizing convex hulls," Journal of Global Optimization, Springer, vol. 73(4), pages 723-759, April.
    13. Luiz H. Cherri & Adriana C. Cherri & Edilaine M. Soler, 2018. "Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations," Journal of Global Optimization, Springer, vol. 72(1), pages 89-107, September.
    14. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2016. "Packing ellipsoids by nonlinear optimization," Journal of Global Optimization, Springer, vol. 65(4), pages 709-743, August.
    15. Longhui Meng & Liang Ding & Aqib Mashood Khan & Ray Tahir Mushtaq & Mohammed Alkahtani, 2024. "Optimizing Two-Dimensional Irregular Pattern Packing with Advanced Overlap Optimization Techniques," Mathematics, MDPI, vol. 12(17), pages 1-19, August.
    16. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    17. Aloïs Duguet & Christian Artigues & Laurent Houssin & Sandra Ulrich Ngueveu, 2022. "Properties, Extensions and Application of Piecewise Linearization for Euclidean Norm Optimization in $$\mathbb {R}^2$$ R 2," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 418-448, November.
    18. Josef Kallrath, 2017. "Packing ellipsoids into volume-minimizing rectangular boxes," Journal of Global Optimization, Springer, vol. 67(1), pages 151-185, January.
    19. Romanova, Tatiana & Stoyan, Yurij & Pankratov, Alexander & Litvinchev, Igor & Plankovskyy, Sergiy & Tsegelnyk, Yevgen & Shypul, Olga, 2021. "Sparsest balanced packing of irregular 3D objects in a cylindrical container," European Journal of Operational Research, Elsevier, vol. 291(1), pages 84-100.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:75:y:2019:i:2:d:10.1007_s10898-019-00777-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.