IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i23p8299-8325.html
   My bibliography  Save this article

Combinatorial Benders' decomposition for the constrained two-dimensional non-guillotine cutting problem with defects

Author

Listed:
  • Shaowen Yao
  • Hao Zhang
  • Qiang Liu
  • Jiewu Leng
  • Lijun Wei

Abstract

This paper studies the constrained two-dimensional non-guillotine cutting problem with defects, in which a set of items of a specific size is cut from a large rectangular sheet with defective areas, with the number of each type of cut item cannot exceed a specified quantity. The objective is to maximise the total value of the cut items. We propose a decomposition approach to address the problem. The process involves decomposing the original problem into a master problem and a subproblem. The master problem is formulated as a one-dimensional contiguous bin packing problem, while the subproblem is an x-Check problem to identify a two-dimensional packing that does not lead to any overlap. The x-Check problem is effectively addressed by using an integer linear programming model. When the x-Check problem proves infeasible, cuts are added to the master problem, and the iteration is repeated until the x-Check finds a feasible solution. Furthermore, we introduce several novel techniques, including valid inequalities, preprocessing techniques, and lifting the cut methods to improve the performance of the algorithm. Extensive computational results show that our method can quickly find the optimal solution for the 5450 instances in the literature.

Suggested Citation

  • Shaowen Yao & Hao Zhang & Qiang Liu & Jiewu Leng & Lijun Wei, 2024. "Combinatorial Benders' decomposition for the constrained two-dimensional non-guillotine cutting problem with defects," International Journal of Production Research, Taylor & Francis Journals, vol. 62(23), pages 8299-8325, December.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:23:p:8299-8325
    DOI: 10.1080/00207543.2024.2338194
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2338194
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2338194?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:62:y:2024:i:23:p:8299-8325. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.