IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v85y2023i1d10.1007_s10898-022-01194-4.html
   My bibliography  Save this article

Packing convex polygons in minimum-perimeter convex hulls

Author

Listed:
  • Josef Kallrath

    (University of Florida)

  • Tatiana Romanova

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

  • Alexander Pankratov

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

  • Igor Litvinchev

    (Graduate Program in Systems Engineering, Nuevo Leon State University (UANL))

  • Luis Infante

    (Graduate Program in Systems Engineering, Nuevo Leon State University (UANL))

Abstract

The problem of packing a given set of freely translated and rotated convex polygons in a minimum-perimeter convex polygon (in particular the minimum-perimeter convex hull) is introduced. A mathematical model of the problem using the phi-function technique is provided. Problem instances with up to 6 convex polygons are solved by the global NLP solver BARON to get a minimum-perimeter convex hull. Numerical experiments for larger instances are reported using the local NLP solver IPOPT.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jglopt:v:85:y:2023:i:1:d:10.1007_s10898-022-01194-4
    DOI: 10.1007/s10898-022-01194-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01194-4
    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-022-01194-4?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. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    2. 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.
    3. 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.
    4. 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.
    5. Yuriy Stoyan & Alexandr Pankratov & Tatiana Romanova & Giorgio Fasano & János D. Pintér & Yurij E. Stoian & Andrey Chugay, 2019. "Optimized Packings in Space Engineering Applications: Part I," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Modeling and Optimization in Space Engineering, pages 395-437, Springer.
    6. Luiz J.P. Araújo & Ender Özcan & Jason A.D. Atkin & Martin Baumers, 2019. "Analysis of irregular three-dimensional packing problems in additive manufacturing: a new taxonomy and dataset," International Journal of Production Research, Taylor & Francis Journals, vol. 57(18), pages 5920-5934, September.
    7. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    8. 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.
    9. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    10. Yuriy Stoyan & Alexandr Pankratov & Tatiana Romanova, 2017. "Placement Problems for Irregular Objects: Mathematical Modeling, Optimization and Applications," Springer Optimization and Its Applications, in: Sergiy Butenko & Panos M. Pardalos & Volodymyr Shylo (ed.), Optimization Methods and Applications, pages 521-559, Springer.
    11. 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.
    12. Romanova, T. & Bennell, J. & Stoyan, Y. & Pankratov, A., 2018. "Packing of concave polyhedra with continuous rotations using nonlinear optimisation," European Journal of Operational Research, Elsevier, vol. 268(1), pages 37-53.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Alexander Pankratov & Tatiana Romanova & Igor Litvinchev, 2020. "Packing Oblique 3D Objects," Mathematics, MDPI, vol. 8(7), pages 1-17, July.
    6. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2023. "Model Development and Solver Demonstrations Using Randomized Test Problems," SN Operations Research Forum, Springer, vol. 4(1), pages 1-15, March.
    7. Kimms, Alf & Király, Hédi, 2023. "An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1202-1218.
    8. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    9. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    10. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    11. Yainier Labrada-Nueva & Martin H. Cruz-Rosales & Juan Manuel Rendón-Mancha & Rafael Rivera-López & Marta Lilia Eraña-Díaz & Marco Antonio Cruz-Chávez, 2021. "Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses," Mathematics, MDPI, vol. 9(9), pages 1-22, May.
    12. Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.
    13. Igor Litvinchev & Andreas Fischer & Tetyana Romanova & Petro Stetsyuk, 2024. "A New Class of Irregular Packing Problems Reducible to Sphere Packing in Arbitrary Norms," Mathematics, MDPI, vol. 12(7), pages 1-17, March.
    14. Hagspihl, Thomas & Kolisch, Rainer & Fontaine, Pirmin & Schiffels, Sebastian, 2024. "Apron layout planning–Optimal positioning of aircraft stands," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    15. Sato, André Kubagawa & Martins, Thiago Castro & Gomes, Antonio Miguel & Tsuzuki, Marcos Sales Guerra, 2019. "Raster penetration map applied to the irregular packing problem," European Journal of Operational Research, Elsevier, vol. 279(2), pages 657-671.
    16. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    17. Martinez-Sykora, A. & Alvarez-Valdes, R. & Bennell, J.A. & Ruiz, R. & Tamarit, J.M., 2017. "Matheuristics for the irregular bin packing problem with free rotations," European Journal of Operational Research, Elsevier, vol. 258(2), pages 440-455.
    18. Toledo, Franklina M.B. & Carravilla, Maria Antónia & Ribeiro, Cristina & Oliveira, José F. & Gomes, A. Miguel, 2013. "The Dotted-Board Model: A new MIP model for nesting irregular shapes," International Journal of Production Economics, Elsevier, vol. 145(2), pages 478-487.
    19. Cherri, Luiz Henrique & Carravilla, Maria Antónia & Ribeiro, Cristina & Toledo, Franklina Maria Bragion, 2019. "Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap," Operations Research Perspectives, Elsevier, vol. 6(C).
    20. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.

    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:85:y:2023:i:1:d:10.1007_s10898-022-01194-4. 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.