%0 Journal Article
%T 有顺序依赖损耗的一维下料问题<br>The one-dimensional cutting stock problem with sequence-dependent cut losses
%A 梁泽华
%A 崔耀东
%A 张雨&lt
%A br&gt
%A LIANG Zehua
%A CUI Yaodong
%A ZHANG Yu
%J 山东大学学报（工学版）
%D 2018
%R 10.6040/j.issn.1672-3961.0.2017.425
%X 摘要： 针对从具体工业应用中抽象出的一种特殊一维下料问题,提出一种基于顺序价值校正框架的下料算法,在考虑问题特殊性的同时求取最小化线材使用量的下料方案。定义并求得每两个毛坯间的损耗值后,顺序生成各个排样图,并得到下料方案。通过不断修正毛坯价值,生成多个下料方案,取其中线材消耗量最小者来逼近最优解。与其他算法进行比较的结果表明,本算法有较少的材料消耗量与合适的计算时间。<br>Abstract: For a particular one-dimensional cutting stock problem abstracted from specific industrial applications, an algorithm based on sequential value correction proposed with considering minimize stock material waste and the problems special properties was proposed. The cutting patterns were generated sequentially after defining and getting the cost between each two items, and then a cutting plan make-up was got by these patterns. Many different cutting plans were produced by continuously correcting the value of items, and the best one was chosen to approach optimal solution. Compared with the other algorithms, the results showed that the proposed approach could get less consumption of raw material and low computation time
%K 顺序依赖损耗
%K 顺序价值校正
%K 一维下料问题
%K &lt
%K br&gt
%K one-dimensional cutting stock problem
%K sequential value correction
%K sequence-dependent cut losses
%U http://gxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1672-3961.0.2017.425