Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
复制标题
多周期混合调度的预处理算法和紧缩约束：成本最小化
DOI：
--
复制
发表时间：
2020
影响因子：
1.8
通讯作者：
C. Maravelias
中科院分区：
文献类型：
--
作者：
Yifu Chen;C. Maravelias
尽管已针对多项式混合计划问题（MBSP）提出了一系列模型，但由于双线性项和二进制变量的存在，甚至解决了中等大小的MBSP实例，甚至解决了中等大小的MBSP实例。为了应对这一挑战，我们开发了用于MBSP的解决方案方法，专注于成本最小化目标。我们开发了一种新颖的预处理算法来计算流流的下限。我们定义产品专用流量变量，以解决MBSP中涉及的产品特定功能。然后使用流量和新产品专用流量变量的界限来生成拧紧的约束，从而显着改善了混合整数非线性编程模型的解决方案时间以及基于线性近似值的模型。
While a range of models have been proposed for the multiperiod blend scheduling problem (MBSP), solving even medium-size MBSP instances remains challenging due to the presence of bilinear terms and binary variables. To address this challenge, we develop solution methods for MBSP focusing on the cost minimization objective. We develop a novel preprocessing algorithm to calculate lower bounds on stream flows. We define product dedicated flow variables to address product specific features involved in MBSP. Bounds on stream flows and new product dedicated flow variables are then used to generate tightening constraints which significantly improve the solution time of the mixed integer nonlinear programming models as well as models based on linear approximations.
使用函数式编程识别优化问题中的命名结构：在池化中的应用
影响因子：
3.7
作者：
Ceccon F
通讯作者：
Ceccon F