Cutting stock problem 下料问题 ; 切割问题 ; 切割存货问题 ; 问题
one dimensional stock cutting problem 一维下料问题
two-dimensional stock cutting problem 二维下料问题
d cutting-stock problem 维下料问题
one cutting stock problem 一维下料
-d cutting-stock problem 二维下料问题
rectangular cutting stock problem 矩形件排样优化
2-d cutting-stock problem 二维下料问题
Rectangular stock cutting is the most applied problem in two-dimensional stock cutting problems which are widely existed in industrial application field.
在工业应用领域中存在大量的二维下料问题，其中应用最多的是矩形件下料问题。
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 paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
应用推荐