Rectangular stock cutting is the most applied problem in two-dimensional stock cutting problems which are widely existed in industrial application field.
在工业应用领域中存在大量的二维下料问题，其中应用最多的是矩形件下料问题。
While designing the algorithm, we have considered the situation at large. Thus, the algorithm is feasible in solving most of the actual stock cutting problems especially in large scale.
算法设计时考虑了普遍的情况，所以算法在解决大多数实际下料问题，特别是大规模下料问题时是切实有效的。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
应用推荐