计算机工程与应用2011，Vol.47Issue(13)：234-237,4.DOI:10.3778/j.issn.1002-8331.2011.13.066
解决二维下料问题的顺序启发式算法
Sequential heuristic algorithm for two-dimensional cutting stock problem
摘要
Abstract
The two-dimensional cutting stock problem is a problem about how to minimize the material input to pack all the blanks required.A sequential heuristic algorithm based on the value correction strategy is presented to generate cutting stock plan.Patterns in the plan are generated sequentially according to the maximum unit value and the values of blanks assigned to the current pattern are adjusted.Several solutions are constructed iteratively and at last the best one is selected.The computational results show the effectiveness of the presented algorithm.关键词
二维下料/占角动作/穴度/顺序价值修正/顺序启发式算法Key words
two-dimensional cutting/comer-occupying action/caving degree/Sequential Value Correction(SVC)/Sequential Heuristic Procedure(SHP )分类
信息技术与安全科学引用本文复制引用
黄少丽,杨剑,侯桂玉,崔耀东..解决二维下料问题的顺序启发式算法[J].计算机工程与应用,2011,47(13):234-237,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.61063031) （the National Natural Science Foundation of China under Grant No.61063031）
广西科学基金(No.0728100) （No.0728100）
广西研究生教育创新计划项目基金(No.2009106020812M64). （No.2009106020812M64）
