.png){kind=icon}
返回
Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2013.03.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A sequential grouping heuristic (SGH) that supports parallel computing is presented for solving the two-dimensional cutting stock problem with pattern reduction, where a set of rectangular items with given demand are cut from rectangular stock plates of the same size, considering both input-minimization (main objective) and pattern reduction (auxiliary objective). It is based on the sequential heuristic procedure that generates each next pattern to fulfill some portion of the remaining items and repeats until all items are fulfilled. The SGH uses a grouping technique to select the items that can be used to generate the next pattern, and adjusts the item values according to the sequential value correction method after the next pattern is generated. Each next pattern is generated using a dynamic programming recursion. The computational results indicate that the SGH is powerful in both input-minimization and pattern reduction, and the parallel computing is useful to reduce computation time. (C) 2013 Published by Elsevier B.V.
Keyword:
Two-dimensional cutting stock
Sequential heuristic procedure
Sequential value correction method
Pattern reduction
Sequential grouping heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
A hybrid heuristic to reduce the number of different patterns in cutting stock problems一种混合启发式方法，用于减少切割库存问题中不同模式的数量
PREAI
分享收藏分享收藏
查看更多内容