Research Layout Optimization Algorithms Of Two-dimensional Irregular Parts And Implement System

The optimized layout of two-dimensioned irregular parts is typical of combinatorial optimization problem, through searching the optimized scheme of parts cutting in a allocating panel, improve the utilization rate of plank and redcue the time of labor operation. In the processing and manufacturing industries, mechanical, clothing, shipbuiding, stone and etc, layout problem exist widely, so researching this issue have a extremely high value.The rapid development of computer aided technology, the time of consuming in traditional manual layout, the requirements of sort experience and the production demand of large quantities and small scale in modern society, make the computer arrangement become inevitable. The parts graphic of two-dimensioned is arranging via computer, and then adjusting the layout result by artificial before cutting, so as to improving the production of quality and reducing the cost of production.This paper mainly aims at the problem of optimized layout of two-dimensioned irregular parts, research for the preprocessing technologies of two-dimensioned irregular parts, the collision algorithm of two-dimensioned irregular parts, proposing the improvement of the adjusting of lowest horizontal line’searching of combining of simulate anneal algorithm and genetic algorithm for the solution of problem of the two-dimensioned layout, and then the framework of the software structure and the function of echch module of layout system are introduced, the main work as follows:(1) analyse the preprocessing technologies of two-dimensioned irregular parts, including the rule of the positive and negative direction of polygon and the provision of the direction of roatation, the movement and rotation operation of polygon, the convex bag algorithm of polygon, the judgement of convex and concave of polygon, and all kinds of envelope of polygon.(2) reserach the collision algorithm of two-dimensioned irregular parts, including the judgement of rule of gradually moving of encryption point, the method of point by point scanning offset and the scanning method of fixed length and iteration based on the judgement of intersecting and separation. the projection and moving of collision algorithm of the vector information of outline and the collision algorithm of bitmap based on the judgement of distance and moving.(3) research the improvement of the adjusting of lowest horizontal line’ searching of combining of simulate anneal algorithm and genetic algorithm, including the math model of parts, the improvement of the adjusting of lowest horizontal line’ searching, compare simulate anneal algorithm to genetic algorithm in characteristic and weakness, the intelligent and optimized algorithm was designed to arragement the two-dimensioned irregular parts, and introduce the way of encoding and deconding, the definition of fitness function and each operator in detail.(4) design and realize the system of optimization arrangement of stone, the performance of reuse and expansibility are analysed and researched to the system, the method of combining template model, strategy model and dynamci link library is used to develop the system, to achieve the stability and flexibility of the system, introduce the each module and operation process of the system, finally showing the experiment result of the system.