The packing of rectangles is a NP-Complete problem and possesses widespread applications in the industry,such as the cutting of clothing,metal and composition of news.
矩形排样优化属于NPC问题,在工业界有着广泛的应用,如布料切割、金属下料和新闻组版等。
参考来源 - 一种用于矩形排样优化的改进遗传算法·2,447,543篇论文数据，部分数据来源于NoteExpress
因此，开展对二维矩形件优化排样问题的研究具有重要的理论意义和工程应用价值。
Therefore, research on the problem of two-dimensional optimal layout for rectangular parts is very important in theory and applications.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
To resolve the rectangular cutting stock problem, this paper proposes a new greedy algorithm, based on analyzing the main disadvantage of the traditional approximate algorithm.
本算法适合应用于大批量、多种类的矩形零件在定宽无限长板材上的优化排样，获得了较好的优化排样方案；
This algorithm is suitable for optimized layout of rectangle parts with large amounts and many kinds and better optimized layout is got.
应用推荐