An Effective Algorithm for Tool-Path Airtime Optimization during Leather Cutting

Int J Adv Manuf Technol

2016

This paper presents a review of the literature on generating cutting paths for laser cutting machines. Firstly, the cutting path problem is defined including all relevant technical side constraints which exist plentifully in laser cutting. Secondly, a former classification method is updated to include all types of cutting path problems. Thirdly, a comprehensive review of solution methods and related applications is presented. Throughout the literature review, trends in research in cutting path generation and interesting areas for future research are identified.

Section: Gtspmentioning

confidence: 99%

A review of cutting path algorithms for laser cutters

Int J Adv Manuf Technol

2016

“…This approach is taken by Castelino, D'Souza, and Wright (2003), Kim, Gotoh, and Toyosada (2004), Wang and Xie (2005), Rao et al (2006), Xie, Gan, and Wang (2009), Yang et al (2010), and Jing and Zhige (2013). In the CCP, the laser head can initiate cutting at any location and like in the GTSP approach, once a contour is initiated, it needs to be cut completely before moving on to another contour.…”

Section: Introductionmentioning

confidence: 99%

Construction heuristics for generating tool paths for laser cutters

International Journal of Production Research

2014

This paper deals with generating paths for cutting irregular parts nested on thin or thick metal sheets. The objective is to minimise the total time required to cut all parts from the metal sheet explicitly taking the cost of piercing and pre-cutting into account. The problem is modelled as a generalised travelling salesperson problem with special precedence constraints. A set of construction heuristics is presented that incorporates the constraints originating from inner-outer contours, common cuts, piercing points and pre-cuts. Computational tests on a set of real-life cutting problems show that our solution approach is able to generate tool paths that for thick plates spend on average 33.4% less time than those generated by a commercial package for air movements, pre-cuts and sharp angle macros with cutting and piercing times being equal.

“…The GTSP version is considered by Reissner (1989, 1991), Han and Na (1999a,b), Xie et al (2001), Castelino, D'Souza, and Wright (2003), Kim, Gotoh, and Toyosada (2004), Wang and Xie (2005), Vaupotic et al (2006), Xie et al (2009), Yang et al (2010), and Jing and Zhige (2013).…”

Section: Introductionmentioning

confidence: 99%

An improvement heuristic framework for the laser cutting tool path problem

International Journal of Production Research

et al. 2014

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.