.png){kind=icon}
返回
Accelerating Benders method using covering cut bundle generation
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2009.00706.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Over the years, various techniques have been proposed to speed up the classical Benders decomposition algorithm. The work presented in the literature has focused mainly on either reducing the number of iterations of the algorithm or on restricting the solution space of the decomposed problems. In this article, a new strategy for Benders algorithm is proposed and applied to two case studies in order to evaluate its efficiency. This strategy, referred to as covering cut bundle (CCB) generation, is shown to implement in a novel way the multiple constraints generation idea. The CCB generation is applied to mixed integer problems arising from two types of applications: the scheduling of crude oil and the scheduling problem for multi-product, multi-purpose batch plants. In both cases, CCB significantly decreases the number of iterations of the Benders method, leading to improved resolution times.
Keyword:
Benders decomposition
covering cut bundle
mixed integer programming
multi-generation of cuts
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
查看更多内容