IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v36y2025i3d10.1007_s10845-024-02329-y.html
   My bibliography  Save this article

Fidelity-adaptive evolutionary optimization algorithm for 2D irregular cutting and packing problem

Author

Listed:
  • Yizhe Yang

    (Chinese Academy of Sciences
    University of Chinese Academy of Sciences)

  • Bingshan Liu

    (Chinese Academy of Sciences)

  • Xin Li

    (Chinese Academy of Sciences)

  • Qingfeng Jia

    (Chinese Academy of Sciences)

  • Wenyan Duan

    (Chinese Academy of Sciences)

  • Gong Wang

    (Chinese Academy of Sciences)

Abstract

The cutting and packing problems (CPP) widely appear in various industrial fields, such as additive manufacturing (AM) and the fashion industry. The evolutionary optimization (EO) algorithms inspired by biological evolution are popular to solve such combinatorial optimization problems these years. Most of the research focused on the improvement of nesting strategies (NS) and EO algorithms, while the relationship between NSs and evolutionary optimization stages is the neglected crucial point. In this paper, a fidelity-adaptive evolution optimization (FAEO) method is proposed to speed up the optimization process by using different nesting strategies at the appropriate optimization stages. In FAEO methods, two switching methods are designed to convert NSs. The neighbourhood-elite evaluation (NEE) and staged-archive (S-A) methods are developed to accelerate individual internal assessment. The experimental results and relevant analysis of the cases from ESICUP by the combination of genetic algorithm (GA) and skyline-derived NSs prove the effectiveness, rapidity, and industrial value of the FAEO algorithm compared with the benchmark algorithms.

Suggested Citation

  • Yizhe Yang & Bingshan Liu & Xin Li & Qingfeng Jia & Wenyan Duan & Gong Wang, 2025. "Fidelity-adaptive evolutionary optimization algorithm for 2D irregular cutting and packing problem," Journal of Intelligent Manufacturing, Springer, vol. 36(3), pages 1781-1799, March.
    • Handle: RePEc:spr:joinma:v:36:y:2025:i:3:d:10.1007_s10845-024-02329-y
    DOI: 10.1007/s10845-024-02329-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-024-02329-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/s10845-024-02329-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. H. Terashima-Marín & P. Ross & C. Farías-Zárate & E. López-Camacho & M. Valenzuela-Rendón, 2010. "Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems," Annals of Operations Research, Springer, vol. 179(1), pages 369-392, September.
    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. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    4. J. Bennell & G. Scheithauer & Y. Stoyan & T. Romanova, 2010. "Tools of mathematical modeling of arbitrary object packing problems," Annals of Operations Research, Springer, vol. 179(1), pages 343-368, September.
    5. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    6. 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.
    7. Andrea Lodi & Silvano Martello & Daniele Vigo, 2004. "TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems," Annals of Operations Research, Springer, vol. 131(1), pages 203-213, October.
    8. Donald Jones, 2014. "A fully general, exact algorithm for nesting irregular shapes," Journal of Global Optimization, Springer, vol. 59(2), pages 367-404, July.
    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.
    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. 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.
    2. 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.
    3. 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.
    4. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    5. Miguel Santoro & Felipe Lemos, 2015. "Irregular packing: MILP model based on a polygonal enclosure," Annals of Operations Research, Springer, vol. 235(1), pages 693-707, December.
    6. Yizhe Yang & Bingshan Liu & Haochen Li & Xin Li & Gong Wang & Shan Li, 2023. "A nesting optimization method based on digital contour similarity matching for additive manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 34(6), pages 2825-2847, August.
    7. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    14. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
    15. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:joinma:v:36:y:2025:i:3:d:10.1007_s10845-024-02329-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.