The paper applied an improved ant colony algorithm in the combinatorial optimization in one-dimensional cutting stock problem. Through experiments, optimizing the algorithm parameters, the simulation results verify the algorithm for solving one-dimensional cutting stock problem of good performance.
通过实验,优化了改进算法的参数,并用改进后的蚁群算法求解了一维下料问题。
参考来源 - 智能计算及应用研究Rectangle packing problem is a kind of cutting problem, usually consists of packing given rectangle pieces into a large rectangle stock plate, with a requirement of maximum usage of the stock plate.
矩形优化排样问题作为优化下料问题的一个分支,通常是指在给定矩形板材上排放所需的矩形件,要求板材的材料利用率最大化。
参考来源 - 求解矩形排样问题的离散粒子群算法·2,447,543篇论文数据，部分数据来源于NoteExpress
矩形件排样问题，是二维下料问题的一个分支。
The rectangular cutting problem is a branch of the two-dimensional cutting problems.
在国民经济生产中，存在着大量的切割下料问题。
In national economical production, there have a lot of cutting stock problems.
“下料问题”在工程技术和工业生产中有着重要和广泛的应用。
The cutting stock problem possesses important and widespread application in the engineering techniques and the industrial production.
应用推荐