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

Discrete cutting path problems: a general solution framework and industrial applications

Author

Listed:
  • Daniil Khachai
  • Olga Battaïa
  • Alexander Petunin
  • Michael Khachay

Abstract

The optimal tool routing for cutting machines, also known as cutting path optimisation is an important problem in production research. This problem is relevant in various manufacturing environments such as aeronautic, automotive, garment and semiconductor industries. In this paper, we introduce a general solution framework for the discrete Cutting Path Problem which includes: (i) the universal approach to reduce numerous settings of this problem to the appropriate auxiliary instances of the well-known Precedence Constrained Generalized Traveling Salesman Problem; (ii) the proposition of efficient solution methods for finding (sub-) optimal solutions. We carry out extensive computational experiments in order to evaluate performance of the proposed framework and the obtained results demonstrate its efficiency for real-life industrial instances.

Suggested Citation

  • Daniil Khachai & Olga Battaïa & Alexander Petunin & Michael Khachay, 2025. "Discrete cutting path problems: a general solution framework and industrial applications," International Journal of Production Research, Taylor & Francis Journals, vol. 63(3), pages 949-969, February.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:3:p:949-969
    DOI: 10.1080/00207543.2024.2365360
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2365360
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2365360?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:63:y:2025:i:3:p:949-969. 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.