Glass Cutting Optimal Nesting System Design And Implementation

Glass is widely used in our life, such as decorations and buildings. Since glass is indispensable, its market potential is very large. How to improve automation degree and reduce the raw’s wear ratio in the glass cutting is deeply concerned by enterprises, since it concerns the cost of glass products, and even the operational efficiency of production process of the company. The main purpose of the glass layout optimization is to via the computer optimal algorithm to optimize the layout, speed up the typesetting, and reduce the raw’s wear ratio.The optimal rectangular packing problem is a kind of NP-complete problem. When doing large-scale packing problem, the amount of the combination explosion make it difficult to get the optimal solution in a certain time. Glass packing problem is divided into regular and irregular situation, and to irregular packing problem there often forms a rectangular envelope, and then to pack the rectangular envelope. Glass packing problem belongs to the rectangular parts packing problem, there is no breakthrough in theory. People always choose heuristic method or meta-heuristic method to solve glass packing problem. A heuristic method is based on general experience it does not require to get the optimal result of the problem, but within the scope of time that people can wait to provide the approximate optimal solution. Heuristic method will determines the initial order and the arrangement position. But the meta-heuristic method is random, it is difficult to accurate the various parameters, and different problems need to specify different parameters in order to get more optimal solution.In view of the above questions, This paper proposes a heuristic method:the filling algorithm based on the minimum horizon and the system realizes functions such as the management of plank information, the management of customer information, the function of generate layout picture, the function of project summary and layout results’print and print preview, etc.This paper proposes the filling algorithm based on the minimum horizon is simple and easy to realize, it has good expansibility. Its fast operation ability, especially suitable for the large-scale packing problem. It can save operation time and give a satisfying layout result.