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.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Rectangular stock cutting is the most applied problem in two-dimensional stock cutting problems which are widely existed in industrial application field.
在工业应用领域中存在大量的二维下料问题，其中应用最多的是矩形件下料问题。
Cutting and Packing Problems are widely occurred in the area of stock-cutting, two-Dimensional layout design and three-Dimensional layout design of many industries.
裁剪与装填问题广泛存在于各行业的材料剪裁、平面布局设计及三维布局设计等方面。
The algorithm for constrained two dimensional cutting stock problems is modified to generate cutting patterns. The algorithm is described in detail and a method of th...
本文对两维约束排样算法进行修改，使之能生成所述排样问题的切割方式。
The algorithm for constrained two dimensional cutting stock problems is modified to generate cutting patterns. The algorithm is described in detail and a method of th...
本文对两维约束排样算法进行修改，使之能生成所述排样问题的切割方式。
应用推荐