Laser cutting path optimization with minimum heat accumulation

Numerical modeling offers considerable promise to reduce costs associated with trial-and-error process in the manufacturing industry. In laser cutting of fiber-reinforced composites, the developed thermal stress in the cut region has considerable inﬂuence on the application of the machined composite and the end product quality. Nevertheless, measurement of the thermal stress is quite challenging in practice. Here, an uncoupled thermo-mechanical finite element model is developed to accurately predict formation of heat-affected zone, kerf width, thermal field, and thermal residual stress of an anisotropic carbon/Kevlar fiber reinforced composite during multi-pass laser cutting process. A novel approach of element deletion incorporating temperature-dependent Hashin failure criteria and VUMAT subroutine is proposed. The study is carried out using Abaqus interlinked with Fortran compiler to define laser Gaussian beam (DFLUX subroutine) and material removal (VUMAT subroutine) for determining the temperature gradient and cut characteristics, respectively. The numerical results agree well with the experimental scanning electron micrographs of heat-affected zone and kerf width. In addition, residual temperature after subsequent pass results in greater temperature distribution and heat accumulation. It has also been established that the strength of composite gradually decays with the increase of temperature due to stiffness (elastic moduli) degradation in the area of the cutting zone, accelerating damage initiation in both fibers and matrix.

Download Full-text

Solving the Laser Cutting Path Problem Using Population-Based Simulated Annealing with Adaptive Large Neighborhood Search

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.833.29 ◽

2020 ◽

Vol 833 ◽

pp. 29-34 ◽

Cited By ~ 1

Author(s):

Makbul Hajad ◽

Viboon Tangwarodomnukun ◽

Chaiya Dumkum ◽

Chorkaew Jaturanonda

Keyword(s):

Simulated Annealing ◽

Laser Cutting ◽

Computing Time ◽

Population Based ◽

Neighborhood Search ◽

Large Neighborhood Search ◽

Adaptive Large Neighborhood Search ◽

Large Neighborhood ◽

Generalized Traveling Salesman Problem ◽

Cutting Path

This paper presents an alternative algorithm for solving the laser cutting path problem which was modeled as Generalized Traveling Salesman Problem (GTSP). The objective is to minimize the traveling distance of laser cutting of all profiles in a given layout, where a laser beam makes a single visit and then does the complete cut of individual profile in an optimum sequence. This study proposed a hybrid method combining population-based simulated annealing (SA) with an adaptive large neighborhood search (ALNS) algorithm to solve the cutting path problem. Recombination procedures were executed alternately using swap, reversion, insertion and removal-insertion through a fitness proportionate selection mechanism. In order to reduce the computing time and maintain the solution quality, the 35% proportion of population were executed in each iteration using the cultural algorithm selection method. The results revealed that the algorithm can solve several ranges of problem size with an acceptable percentage of error compared to the best known solution.

Download Full-text

Optimization Algorithm of Laser Cutting Path for Multi-contour Sheet Metal Parts

2019 3rd International Conference on Electronic Information Technology and Computer Engineering (EITCE) ◽

10.1109/eitce47263.2019.9094805 ◽

2019 ◽

Author(s):

Peng-de Zhao ◽

Dong Yan ◽

Ling Yan

Keyword(s):

Sheet Metal ◽

Optimization Algorithm ◽

Laser Cutting ◽

Metal Parts ◽

Sheet Metal Parts ◽

Cutting Path

Download Full-text

An Optimized Algorithm for Discretization of Cutter Location Points on the Laser Cutting Path of Three-Dimensional Surface

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.190-191.19 ◽

2012 ◽

Vol 190-191 ◽

pp. 19-22

Author(s):

Jun Hu ◽

Fan Deng ◽

Xian Chen Qiu

Keyword(s):

Laser Cutting ◽

Three Dimensional ◽

Automatic Programming ◽

Step Size ◽

Starting Point ◽

Discretization Step ◽

Reference Sphere ◽

Programming Software ◽

Cutting Path ◽

Dimensional Surface

This paper proposed an optimized algorithm for discretization of cutter location points on the laser cutting path of three-dimensional surface. The initial discretization step size was calculated due to the curvature of the curve on the starting point and accuracy requirements. A reference sphere was established by taking the initial discretization step size as the radius. The initial cutter location point was located on the intersection of the reference sphere and the processing path. The radius of reference sphere was dynamically adjusted by dichotomy according to string height difference in order to get the optimal cutter location on the path to be processed. This algorithm has a high computational efficiency. And an automatic programming software used for three-dimensional laser cutting was developed based on this algorithm.

Download Full-text