切割问题(Cutting Stock Problem)的概念与栈板装载问题不同,栈板装载问题必须考虑到非截断 式的情况(non-guillotine),因此其复杂度较切割问题为高,栈板装载问题...
基于20个网页-相关网页
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.
通过实验,优化了改进算法的参数,并用改进后的蚁群算法求解了一维下料问题。
参考来源 - 智能计算及应用研究·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.
另外还讨论了拼板问题、背包问题和下料问题的关系。
The two-dimensional cutting stock problem is a problem about how to minimize the material input to pack all the blanks required.
求解二维下料问题即求解如何用最少的板材排入所需的全部毛坯的问题。
The cutting stock problem possesses important and widespread application in the engineering techniques and the industrial production.
“下料问题”在工程技术和工业生产中有着重要和广泛的应用。
应用推荐