Research On Two-dimensional Layout Algorithm Based On Genetic Algorithm

The two-dimensional irregular template layout problem is to seek the optimal representation of the optimal layout problem in the plane.Many experts and scholars at home and abroad have focused their attention on how to solve these problems,but because the two-dimensional irregular template layout problem is an NP problem,the solution method has not yet reached a unified deterministic conclusion in the world.In this paper,for the various problems of the two-dimensional irregular template layout,according to the specific requirements of the user,the constraints are determined and the next analysis is carried out.Finally,a two-dimensional template layout algorithm optimization algorithm is proposed,which improves the two-dimensional The utilization rate of the template layout problem.The main research contents of this article are as follows:First,according to the actual needs,analyze the limitations and constraints of the problem,propose optimization goals,establish a mathematical model of the two-dimensional template layout problem,and complete the template preprocessing.Through the polygon processing of the template,the number of template outline points is reduced,and the time performance is optimized.Complete convex polygons and prepare for subsequent template layout algorithms.Secondly,a rectangular template layout optimization algorithm is proposed.The proposed sequencing strategy,positioning strategy and moving strategy in the algorithm are one of the innovations of this paper.The ordering strategy mainly completes the preliminary template classification through priority rules,and the subsequent template sorting is completed by the same-level partition rules.Two positioning rules are proposed in the positioning strategy.The perimeter connection rule takes precedence over the minimum coordinate selection rule.The movement rule mainly completes the template integration operation through the change of the movable value.Again,an irregular template layout algorithm is proposed.Aiming at the shortcomings of the current NFP generation strategy,an NFP generation strategy based on angle rotation is proposed.The minimum center of gravity distance between the two polygons is used as an indicator to complete the placement of the two polygons.In this process,the generation of the template layout input chain is completed by an adaptive genetic algorithm.The fitness function is designed as an adaptive genetic algorithm decision standard,and the algorithm process is completed by selecting a cross mutation operation.At the end of this paper,through the method of experimental comparison,the performance analysis of the algorithm is completed.The rectangular template layout algorithm proposed in this paper can achieve more than 95% in terms of material utilization rate.Compared with other algorithms,the utilization rate improvement range is 7.61%-9.28%.The time performance loss is very small,compared with other algorithms.It can be ignored.Compared with the comparison algorithm,the irregular template layout algorithm proposed in this paper has a certain degree of improvement in material utilization.In terms of material height,by reducing the material occupation height,the demand for material area is reduced.In general,the overall efficiency of the two algorithms proposed in this paper is good,and both can achieve the expected results,and have application value in actual manufacturing.