Optimizing The Rectangular Parts Placement To Metal Curtain Wall

Metal curtain wall is widely used in large scale building, because of its good characteristic of the flexibleThe metal curtain wall according to curve surface of the building is partitioned into many small curvesurfaces, they are outspreaded into plane, and then the external minimal rectangle of plane as a rectangularobject is cut from the plate. After that, all rectangular objects are cut into the forms of its plane, and combinedthe wall. To large scale rectangular objects, the different placements make the different ratio of using sheets. Finding the optimal placement is very helpful to reduce the cost of production.The optimal cutting for metal decorated can be regarded as the problem of rectangular parts placement. It is the two dimension layout problem. To the large scale rectangular objects with many kinds of specification, finding the optimal solution is difficult. Actually, it is a NP-hard combinatorial optimization problem. At present, the polynomial algorithms to the problem have not been fond. Hence, the method of finding the sub-optimal solution in acceptable time is considered as one of solving the problem, such as approximate algorithm, heuristic algorithm, and genetic algorithm. Based on the analysis of the methods proposed in the published papers, this thesis propose a method combined a rectangle matching- partition algorithm and genetic algorithm according to the needs of arts and crafts.By the test of computation to a few of layouts, the results show that the method proposed in this thesis can achieve the optimal solution of rectangular object layout, and is very practical and useful.