![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
This paper presents a two-stage methodology for the optimisation of layout and path planning that can be used in flame cutting of sheet metals. The main objective of this paper is to minimise the total travel distance of the flame gun that will not only reduce the cutting time but also the heat effect. The first stage is to use a heuristic to cluster a set of small rectangular items (called workpieces) into one or more large rectangular objects (called blocks) and then best fit these blocks into a given stock. By allowing clustered small items to be cut along common borderlines, the travel distance within blocks is minimised. The second stage is to use genetic algorithms (GAs) to determine an optimal path in consideration of multiple start points for each block. The proposed path planning method provides an advantage by minimising the travel distance between blocks. The combination of the two solutions leads to minimisation of the total travel distance. To demonstrate the effectiveness of the proposed method, a number of cases are studied with results showing a 20% average reduction in the total travel distance in comparison to conventional methods.