Algorithm Research And Optimization Based On PCD Layout Problem

The computer aided optimal layout has a wide application in our real life. PCDlayout problems are studied from domestic and foreign research results, Twodimensional rectangular layout problems are analyzed on this paper. CombiningGenetic Algorithm (GA) with Heuristic Algorithm (HA), a new algorithm based on thediscretization of the container into a grid of cells was proposed to solvetwo-dimensional rectangular packing problems on the basis of research background.The main idea of this algorithm is the discretization of the container into a grid ofcells, finding the appropriate resolution ratio, defined the structure andorientation order of packing problem and optimal layout criteria according to theadvantage of Genetic Algorithm and Heuristic Algorithm. The experimental data arerandomly generated on the computer simulation to realize the automatic packing.Further a mixture of heuristic algorithm and genetic algorithm, finding the geneticseed from genetic algorithm and hybrid algorithm shows a very good overallperformance, especially in the treatment of large problem has very goodperformance and breakthrough. By comparison, the solutions show that approachachieves a better effect of improving the utilization rate of material and reduce thearrangement empty area and waste area.This paper has proposed and discussed in depth layout algorithm of PCDthrough the research of diamond tool wear test and process parameters. Theexperiments results show that the algorithm based on grid spatial can improve thematerial utilization and reduce the average operation time which has a greatsignificance on the research of layout problem.