Laser cutting path optimization using simulated annealing with an adaptive large neighborhood search

A simulated annealing algorithm combined with an adaptive large neighborhood search (ALNS) has been proposed in this paper to minimize the laser cutting path in a two-dimensional cutting process. The proposed algorithm was capable of finding a near-optimum cutting path from a given layout of cut pro...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2019-07, Vol.103 (1-4), p.781-792
Main Authors: Hajad, Makbul, Tangwarodomnukun, Viboon, Jaturanonda, Chorkaew, Dumkum, Chaiya
Format: Article
Language:English
Subjects:
Adaptive algorithms
Algorithms
CAE) and Design
Computer simulation
Computer-Aided Engineering (CAD
Computing time
Engineering
Image processing
Industrial and Production Engineering
Laser beam cutting
Lasers
Layouts
Mechanical Engineering
Media Management
Optimization
Original Article
Piercing
Pixels
Simulated annealing
Simulation
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A simulated annealing algorithm combined with an adaptive large neighborhood search (ALNS) has been proposed in this paper to minimize the laser cutting path in a two-dimensional cutting process. The proposed algorithm was capable of finding a near-optimum cutting path from a given layout of cut profiles. In this study, the layout was taken from an image, in which image processing algorithms were employed to extract cut profiles from the input image and to assign coordinates to the contours’ pixels. The optimization algorithm was based on generalized traveling salesman problem (GTSP), where all pixels of the input image were considered as the potential piercing locations. A laser beam made a single visit and then did a complete cut of each profile consecutively. The simulation results revealed that the proposed algorithm can successfully solve several datasets from GTSP-Lib database with a good solution quality. A compromise between the path distance and computing time was achievable by considering only 30% of the total pixels of the input image examined in this study. In addition, the cutting path generated by the proposed method was shorter than that recommended by the commercial CAM software and other previous works in terms of path distance with the same profile sample.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-019-03569-6