.png){kind=icon}
返回
Improved flow-based formulations for the skiving stock problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.104770.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Thanks to the rapidly advancing development of (commercial) MILP software and hardware components, pseudo-polynomial formulations have been established as a powerful tool for solving cutting and packing problems in recent years. In this paper, we focus on the one-dimensional skiving stock problem (SSP), where a given inventory of small items has to be recomposed to obtain a maximum number of larger objects, each satisfying a minimum threshold length. In the literature, different modeling approaches for the SSP have been proposed, and the standard flow-based formulation has turned out to lead to the best trade-off between efficiency and solution time. However, especially for instances of practically meaningful sizes, the resulting models involve very large numbers of variables and constraints, so that appropriate reduction techniques are required to decrease the numerical efforts. For that reason, this paper introduces two improved flow-based formulations for the skiving stock problem that are able to cope with much larger problem sizes. By means of extensive experiments, these new models are shown to possess significantly fewer variables as well as an average better computational performance compared to the standard arcflow formulation. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Cutting and packing
Skiving stock problem
Arcflow model
Integer linear programs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
PREAI
分享收藏A heuristic for the skiving and cutting stock problem in paper and plastic film industries纸和塑料薄膜行业的切削和切削问题的启发式方法OAAI
OAAI分享收藏分享收藏
查看更多内容