| 引用本文： |
-
郑文,崔耀东,周密.一种基于递归技术的一维下料算法[J].广西科学院学报,2010,26(4):415-417. [点击复制]
- ZHENG Wen,CUI Yao-dong,ZHOU Mi.A Recursive Algorithm for One-dimensional Cutting Stock Problem[J].Journal of Guangxi Academy of Sciences,2010,26(4):415-417. [点击复制]
|
|
| 摘要: |
| 用递归技术进行排样,并将排样方式与线性规划相结合,提出一种基于递归技术的一维下料算法.该算法通过约束一个排样方式中所含毛坯种数,达到减少开堆数的目的,利用上界技术来减少计算时间.该算法可以大幅缩短计算时间,在材料利用率基本不下降的情况下,可以明显减少最大开堆数. |
| 关键词: 递归算法 一维下料 开堆 线性规划 |
| DOI： |
| 投稿时间：2010-08-15 |
| 基金项目:国家自然科学基金项目(61063031),广西大学科研基金项目(XB2100145)资助。 |
|
| A Recursive Algorithm for One-dimensional Cutting Stock Problem |
|
ZHENG Wen, CUI Yao-dong, ZHOU Mi
|
| (School of Computer, Electronics and Information, Guangxi University, Nanning, Guangxi, 530004, China) |
| Abstract: |
| A recursive algorithm to solve one-dimensional cutting stock problem is proposed.A recursive procedure is used for pattern generation and articulated with linear programming to generate the cutting plan. The algorithm reduces the open stacks by means of constraining the number of item types in each pattern, and using branch and bound method to decrease computing time. The computational results indicate that the presented approach can decrease the computing time significanthy and reduce effectively the open stacks with high material utilization rate. |
| Key words: recursive algorithm one-dimensional cutting stock open stacks linear programming |
