Research Of Intelligent Optimal Packing Technology

The aim of the computer aided optimal layout of the parts with different shapes is to find the arrangement of parts and producing the least waste. The problem of optimal layout belongs to the NP-complete problem with tiptop calculate complexity, and cannot find the effective polynomial algorithm up to the present. Conventional layout works all adopt manual operation that have many shortcomings such as low yield, inefficient and long time consuming. People cry for a solution by the modern science and technology because of the need of production. Intelligent optimization algorithms have been used extensively in many domains. In this paper, the application of intelligent optimization algorithms in optimal layout was more investigated. Several new methods were proposed for the problem of optimal layout. The main works and innovation points are listed as follows:(1) In order to solve the problem of rectangular parts optimal layout with dynamic constraints, based on the mathematical model, a novel rectangular optimal layout method is proposed based on novel decoding algorithm - Height Adjustment algorithm (HAA) and niche genetic algorithm (NGA). The problem of rectangular optimal layout can be translated into optimization problem in the field of permutation problem, and then the NGA is used to search the solution space efficiently in order to find the optimal solution of the layout. HAA is used to decode permutation of rectangles to packing pattern during the procedure of optimization. The feasibility of the proposed method is demonstrated by two numerical examples.(2) A novel rectangular optimal layout method using particle swarm optimization (PSO) is proposed. The method coding directly with the positions of the rectangles, determining the packing position of parts by using the left-lower corneal position coordinate, width and length of the parts, and then the PSO with the self-adaptive modulate regulation is used to search the solution space efficientlyin order to find the optimal solution of the layout. The availability of the proposed method is demonstrated by the layout example.(3) A novel particle swarm optimization algorithm based on the simulated annealing algorithm (PSOSA) is presented. The crossover operation and cauchy mutation operation were used to enhance the convergence performance and speed of the algorithm. The proposed algorithm was used to solve the packing problem of two-dimensional irregular parts. Firstly, the proposed method converts the packing problem of two-dimensional irregular parts into rectangular parts packing problem by calculating the surrounding rectangle of irregular parts. Secondly, the proposed algorithm was used to search for the optimal solution of the layout. The strategy of self-adaptive modulation is used to adjust the layout position of each rectangular part during the procedure of optimization. Solutions of two numerical examples show the effectiveness of the proposed algorithm.(4) A novel two-dimensional irregular parts packing method using No Fit Polygon (NFP) and horizontal line scan algorithm is presented. Aiming at the contour of the packing parts, the methods to gain the NFP are discussed step by step, from two convex polygons, one convex polygon and one concave polygon to two concave polygons. And then the polygon compose algorithm, polygon area algorithm and horizontal line scan algorithm were combined with the NFP to solve the problem of two-dimensional irregular parts packing.(5) The design of computer aided optimal layout system is proposed. The demand, the basic function and the module of the layout system are discussed.