作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (13): 227-229. doi: 10.3969/j.issn.1000-3428.2010.13.081

• 工程应用技术与实现 • 上一篇    下一篇

一种求解圆形件下料问题的启发式算法

侯桂玉,崔耀东,黄少丽,杨 剑,潘 涛   

  1. (广西师范大学计算机科学与信息工程学院,桂林 541004)
  • 出版日期:2010-07-05 发布日期:2010-07-05
  • 作者简介:侯桂玉(1982-),女,硕士研究生,主研方向:优化计算,CAD;崔耀东,教授、博士;黄少丽、杨 剑,硕士研究生;潘 涛,本科生
  • 基金资助:
    国家自然科学基金资助项目(60763011);广西科学基金资助项目(桂科自0728100);广西研究生教育创新计划基金资助项目(2009106020812M64)

Heuristic Algorithm for Cutting Stock Problem of Circular Item

HOU Gui-yu, CUI Yao-dong, HUANG Shao-li, YANG Jian, PAN Tao   

  1. (College of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004)
  • Online:2010-07-05 Published:2010-07-05

摘要: 针对二维圆形件下料问题,提出一种改进的顺序启发式算法。在生成排样方式的过程中,采用价值修正策略不断修正当前排入圆片的价值,使之趋于合理,选取价值最大的排样方式组成当前排样方案,迭代调用该过程多次,从中选取最优的排样方案。实验结果证明,与线性规划算法相比,该算法更有效。

关键词: 顺序启发式算法, 顺序价值修正, 圆形件下料

Abstract: Aiming at two-dimensional cutting stock problem of circular items, this paper presents an improved Sequential Heuristic Procedure(SHP). In the process of generating cutting patterns, Sequential Value Correction(SVC) strategy is used to update the value of circular items contained in the current pattern, making them more reasonable. The pattern with maximum value is selected to form the current cutting plan. Several solutions are constructed iteratively to select the best one. Experimental result proves that compared with LP algorithm, the algorithm is more effective.

Key words: Sequential Heuristic Procedure(SHP), Sequential Value Correction(SVC), cutting stock of circular item

中图分类号: