欢迎访问《图学学报》 分享到:

图学学报

• 几何设计与计算 • 上一篇    下一篇

圆形件下料顺序分组启发式算法的设计与实现

  

  1. 1. 广西大学计算机与电子信息学院,广西 南宁 530004;2. 华南理工大学工商管理学院,广东 广州 510640
  • 出版日期:2017-02-28 发布日期:2017-02-22
  • 基金资助:
    :国家自然科学基金项目(61363026,71371058)

The Cutting Stock Problem of Circular Items Based on#br# Sequential Grouping Heuristic Algorithm

  1. 1. Department of Computer and Electronic Information, Guangxi University, Nanning Guangxi 530004, China;
    2. Department of Business Administration, South China University of Technology, Guangzhou Guangdong 510640, China
  • Online:2017-02-28 Published:2017-02-22

摘要: 针对特殊应用背景下的小批量圆形件下料问题,在顺序启发式过程的基础上,引入
分组的思想,提出基于分组选择策略的顺序分组启发式算法,并将顺序分组启发式算法与递推算
法相结合生成一种最优的下料方案。实验结果表明,该算法计算时间合理,并能有效提高平均材
料利用率,具有现实性的指导意义。

关键词: 顺序分组启发式算法, 圆形件下料, 小批量, 递推算法

Abstract: Aiming at the special application background of the small batch cutting problem of circular
items, this paper introduces the thought of parallel group on the basis of sequential heuristic
procedure, and presents the sequential grouping heuristic algorithm (SGHA) based on the group
selection strategy. The SGHA combined with recursion method can generate a large number of optimal
cutting plans, and the best cutting plan of circular items can be selected with the parameter regulation.
Experimental result proves that the computational time is reasonable, the algorithm in this paper can
improve the average utilization rate of material effectively, and it has a realistic significance.

Key words: sequential grouping heuristic algorithm, cutting stock of circular items, small batch;
recursion method