Automatic discharging method

Abstract

The invention discloses an automatic discharging method which comprises the following steps that a genetic algorithm is adopted to set up an algorithm mathematical model, a drawing of parts to be discharged is loaded, and the parts to be discharged are preprocessed; the genetic algorithm is subjected to initialization which comprises group initialization and setting of operation parameters and end conditions of the genetic algorithm; the parts to be discharged are placed on plates according to a gene sequence in the algorithm mathematical model, and the fitness values of all individuals in a group are calculated; judgment of the end conditions is carried out, if the end conditions are not met, the group is subjected to selection operation, crossover operation and mutation operation to obtain a next-generation group, and the last step is executed again; if the end conditions are met, the optimal solution is output. According to the method, automatic discharging is achieved through effective combination of the genetic algorithm and the computer graphics, the sequence and the placement angle of the parts to be discharged can be generated randomly through the genetic algorithm, the parts to be discharged are placed on the plates through an algorithm of no-fit polygon, and automatic discharging efficiency and the utilization rate of the plates are improved.

Description

technical field [0001] The invention relates to an automatic material discharge method, in particular to an automatic material discharge method for plate cutting. Background technique [0002] In engineering applications, the problem of automatic nesting refers to placing one or more pieces of material and several parts to be arranged reasonably on the material to maximize the utilization rate of the material. The nesting problem requires specific constraints: any two parts to be arranged do not overlap each other; any part to be arranged cannot exceed the range of the plate and must be placed inside the plate. [0003] The nesting problem is a class of problems with the highest computational complexity——NP-complete problems. NP-complete problems refer to a class of problems that cannot be solved within the range of polynomial time complexity. It is generally believed that when the time complexity of the algorithm has a polynomial bound, the calculation time is acceptable....

AI Technical Summary

Problems solved by technology

[0005] Most of the existing nesting algorithms are based on the nesting of rectangular parts, and the smallest envelope rectangle of the parts to be sorted is used to replace the parts to be sorted, which cannot achieve a high utilization rate for irregular graphics; The amount of calculation is complex and the efficiency is low, so it is difficult to achieve a high plate utilization rate

Images