Uma metaheurística adaptada ao problema de determinação do caminho de corte de um leiaute com tempo mínimo

Abstract

A myriad of industrial applications needs to extract smaller objects from inputs with preset sizes. This work presents a variation of the determination problem of the cutting path, evidenced in a phase subsequent to the definition of a layout. The main objective is to establish a cutting order for the edges of all the polygons that are the computational representations of the items. In order to find optimal solutions for this problem, we present the Golden Ball algorithm approach. Comparing the results obtained with the presented results of the genetic algorithm and the genetic algorithm with biased keys. To validate our solutions, we use a laser cutting machine to compare the times required with the original software, genetic algorithms, and genetic algorithm with biased keys. With the output produced by the algorithm applied to a chosen test set. Getting similar results on small instances is an improvement in more significant instances but with a longer execution time than the algorithms developments discussed in this work.