Research On Packing Algorithm And Cutting Path Optimization Of Rectangular Pieces

Rectangular packing problem is common in the field of machinery, clothing, leather and so on. And professional CAD/CAM software has been used in packing and NC cutting programming. Rectangular packing is the foundation of packing problem and many algorithms are presented by domestic and foreign researchers. In this paper, a new algorithm for rectangular packing is proposed after studying and analyzing many related algorithms. At the same time, cutting path of rectangle panels is in-depth studied and the optimum path is obtained. The work is summarized as follows: A rectangular packing algorithm based on two-dimensional bin packing problem is designed. The algorithm is hybridized with Genetic Algorithm to solve rectangular packing problem. In consideration of the packing height not exceeding the length of board,a new board will be added to arrange the remaining components.A rectangular layer packing algorithm based on two-dimensional strip packing problem is designed. The algorithm is hybridized with simulated annealing algorithm to solve rectangular layer packing problem. And this algorithm meets the technological requirements of straight-line cutting .The strip was divided into layers whose numbers depend on components.For the rectangle outline cutting problem, a method of optimization of cutting path is designed to handle with the two kinds of placement of rectangle in order to avoid repeatable cutting. For the empty run of cutting problem among several rectangles, with the Ant colony algorithm, a method of optimization of empty run path is designed to solve the TSP problem of empty run.Based on above researches, a software system of cabinet NC programming is developed with VC++ and Open CASCADE. It includes some modules, such as drawing import and export, packing optimization, generation of the cutting path and of the corresponding G codes, etc.