解决二维下料问题的顺序启发式算法  

Sequential heuristic algorithm for two-dimensional cutting stock problem

作　　者：黄少丽[1] 杨剑[1] 侯桂玉[1] 崔耀东[1] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《计算机工程与应用》2011年第13期234-237,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.61063031;广西科学基金(No.0728100);广西研究生教育创新计划项目基金(No.2009106020812M64)~~

摘　　要：求解二维下料问题即求解如何用最少的板材排入所需的全部毛坯的问题。一种基于价值修正策略的顺序启发式算法被用来生成排样方案,方案中的排样方式按单位面积价值最大生成,在各排样方式顺序生成的过程中不断修正方式中使用到的毛坯的价值。迭代调用该过程多次生成多个排样方案,从中选择最优的排样方案。通过实验证明算法的有效性。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.

关 键 词：二维下料 占角动作 穴度 顺序价值修正 顺序启发式算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]