首页 | 官方网站   微博 | 高级检索  
     

解决二维下料问题的顺序启发式算法
引用本文:黄少丽,杨剑,侯桂玉,崔耀东. 解决二维下料问题的顺序启发式算法[J]. 计算机工程与应用, 2011, 47(13): 234-237. DOI: 10.3778/j.issn.1002-8331.2011.13.066
作者姓名:黄少丽  杨剑  侯桂玉  崔耀东
作者单位:广西师范大学 计算机科学与信息工程学院,广西 桂林 541004
基金项目:国家自然科学基金,广西科学基金,广西研究生教育创新计划项目基金
摘    要:求解二维下料问题即求解如何用最少的板材排入所需的全部毛坯的问题。一种基于价值修正策略的顺序启发式算法被用来生成排样方案,方案中的排样方式按单位面积价值最大生成,在各排样方式顺序生成的过程中不断修正方式中使用到的毛坯的价值。迭代调用该过程多次生成多个排样方案,从中选择最优的排样方案。通过实验证明算法的有效性。

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

Sequential heuristic algorithm for two-dimensional cutting stock problem
HUANG Shaoli,YANG Jian,HOU Guiyu,CUI Yaodong. Sequential heuristic algorithm for two-dimensional cutting stock problem[J]. Computer Engineering and Applications, 2011, 47(13): 234-237. DOI: 10.3778/j.issn.1002-8331.2011.13.066
Authors:HUANG Shaoli  YANG Jian  HOU Guiyu  CUI Yaodong
Affiliation:School of Computer Science,Guangxi Normal University,Guilin,Guangxi 541004,China
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.
Keywords:two-dimensional cutting  comer-occupying action  caving degree  Sequential Value Correction (SVC)  SequentialHeuristic Procedure (SHP)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号