“一刀切”约束下的矩形件优化排样算法比较与整合分析.pdfVIP

RESEARCH ON COMPARISON AND INTEGRATION OF RECTANGULAR OPTIMAL LAYOUT ALGORITHMS UNDER CONSTRAINT OF GUILLOTINE ABSTRACT The problem of rectangular layout is very complicated in computing theory,but it has got the extensive application in the actual manufacture.It prevalent in many areas of industrial production,and occupies an important position. A good packing scheme can improve the utilization of raw materials effectively, reduce the production cost and bring economic benefits for enterprises.Because of the different of cutting craft and plate situation,the problem of rectangular layout need to be divided into a few problems to solve. One class is cutting stock must meet the constraint of guillotine,it prevalent in machining of glass, newspaper typesetting and furniture manufacturing.The research in this paper is for this kind of problem.In order to find a better rectangular layout program,consultend a large number of domestic and foreign literature, in-depth study on the rectangular optimal layout algorithm. First,this paper expatiates the background and significance of the subject,summarizes and analyzes the research status of the problem of rectangular layout in domestic and foreign,sums up the related theory of the problem of rectangular layout and established the mathematical model.Introduces several common heuristic layout algorithm,and analyzes of the advantages and disadvantages of each algorithm.Proposed an improved minimum contour search algorithm based on the result,and make it as the decoding method of Genetic Algorithm.And then introduces the basic theory of Genetic Algorithm and Ant Colony Algorithm.Design and improvement the two basic algorithms based on the features of the problem,give