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

An improvement heuristic framework for the laser cutting tool path problem

Author

Listed:
  • Reginald Dewil
  • Pieter Vansteenwegen
  • Dirk Cattrysse
  • Manuel Laguna
  • Thomas Vossen

Abstract

This paper deals with generating cutting paths for laser cutting machines by representing a tool path in a novel way. Using the new representation, the tool path problem can be viewed as finding a partitioning of contours which minimises the sum of the costs of a rooted directed minimum spanning tree to connect the partitions and the costs of a generalised travelling salesman problem (GTSP) solutions within each partition. Using Edmond–Liu’s algorithm to solve the arborescence problem, an improved Lin–Kernighan heuristic to solve the GTSP and a heuristic-repartitioning approach, tool paths can be generated that are 4.2% faster than those generated by an existing tool path construction heuristic.

Suggested Citation

  • Reginald Dewil & Pieter Vansteenwegen & Dirk Cattrysse & Manuel Laguna & Thomas Vossen, 2015. "An improvement heuristic framework for the laser cutting tool path problem," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1761-1776, March.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:6:p:1761-1776
    DOI: 10.1080/00207543.2014.959268
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.959268
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.959268?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tatiana Makarovskikh & Anatoly Panyukov, 2022. "Special Type Routing Problems in Plane Graphs," Mathematics, MDPI, vol. 10(5), pages 1-22, March.

    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:53:y:2015:i:6:p:1761-1776. 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.