An improvement heuristic framework for the laser cutting tool path problem

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.

Integrated task sequencing and path planning for robotic remote laser welding

“…The proposed algorithms are designed mostly for planar workpieces: task sequencing is performed by solving a TSP over the fixed welding stitch positions, and a robot path is computed in a 2D plane above the workpiece. A similar model is applied and heuristics are proposed for path planning in laser cutting in Dewil, Vansteenwegen, and Cattrysse (2014), Dewil et al (2015), with sophisticated ordering constraints among the contours to cut.…”

A review of cutting path algorithms for laser cutters

“…The papers that consider common cuts and collisions are either complete CAM system descriptions [76][77][78][79][80], or consider an EDM application where the cutter never stops cutting [66,68], or our own work which focuses on considering simultaneously as many problem aspects as possible [6,[71][72][73][74][75]. Similarly, the papers that consider piercings and bridges are CAM system descriptions [76][77][78][79][80], our own previous work [6,73,75], and one more paper [64]. Thermal effects are only considered by three papers [50][51][52] in addition to our own previous work [74,75].…”

“…It was found that this approach is not able to generate results in computation times that are short enough to be usable on the shop floor. In [6] and [73], a set of specialized construction and improvement heuristics are presented exploiting problem specific information such as that piercing costs dominate all other costs and that choosing a piercing point fixes the relative order and cutting direction of a contour. A comparison is made with a state-of-the-art GTSP solver that can proxy as the best attainable result that commercial CAM packages can attain when limiting themselves when not allowing preemptions.…”

A genetic algorithm used for solving one optimization problem

“…The discrete model of the problem is analogous in setting to the Generalized Traveling Salesman Problem (GTSP) with limitations in the form of precursor conditions determined by the technological features of cutting [2].…”