基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
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.
矩形件排样问题，是二维下料问题的一个分支。
The rectangular cutting problem is a branch of the two-dimensional cutting problems.
因此，开展对二维矩形件优化排样问题的研究具有重要的理论意义和工程应用价值。
Therefore, research on the problem of two-dimensional optimal layout for rectangular parts is very important in theory and applications.
应用推荐