Development Of Layout Optimization Of System In Glass Cutting

AbstractGlass has been widely applied to various fields as important decorative building materials because of their various properties. The first working procedure of glass deep processing is glass cutting, while the cost of glass cutting process depends on the first, degree of automation in the whole process, because it can directly affect the processing efficiency, then the second whether the utilization of processing raw materials waste least. Because the cost of these two aspects occupies more than 90% of the entire processing.The workflow, workload and the production cost can be reduced by layout optimization. The researches of optimization layout algorithm not only have higher theoretical significance but also have higher practical value. Optimization layout algorithm can play its efficiency not just in the field of glass cutting, still could play a considerable role in leather processing and clothing manufacturing industry, because of more expensive raw materials in these areas therefore pay more attention to maximize the use of the material.In this paper, classification has been used in the layout parts and needs, the algorithm will be taken different by the parts and needs. The irregular of Two-dimensional shape layout algorithm have been done and realized by computer advanced programming language. Then, layout optimization of system in Glass cutting has been accomplished. One innovation of this paper is the scheduling point search method and remaining space search approach used in rectangular samples greatly improve the layout efficiency and material utilization.The order of optimization is one of the most important parts during optimum layout process. Genetic algorithm has been used in this article. Genetic algorithm is simulation abstraction of the process of biological genetic evolution; it makes full use of survival of the fittest, natural selection law of development in biological evolution. By coding the optimization target generated the initial population, then by implementing crossover and mutation among chromosomes encoded and calculating the applicable function, then make sort of new species aroused, re-select the same size individuals as the offspring, and then repeat results of previous process to solve until meeting the requirements。The most important step in irregular polygon in the layout process is to check the overlap between twoshape. The problem has been solved by no-fit polygon in this paper.The so-called NFP is that when a graphic move around another graphic touch but not overlap,then select a point on the moving shape as a reference point,trace the reference point we wil get NFP. The Minkowski Sum has been used to solve the NFP.