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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.