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.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
Rectangular stock cutting is the most applied problem in two-dimensional stock cutting problems which are widely existed in industrial application field.
在工业应用领域中存在大量的二维下料问题，其中应用最多的是矩形件下料问题。
应用推荐