当前位置: X-MOL 学术Comput. Chem. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An approximate method for the optimization of long-Horizon tank blending and scheduling operations
Computers & Chemical Engineering ( IF 4.3 ) Pub Date : 2020-05-20 , DOI: 10.1016/j.compchemeng.2020.106839
Benjamin Beach , Robert Hildebrand , Kimberly Ellis , Baptiste Lebreton

We address a challenging tank blending and scheduling problem that arises in the specialty chemical industry. We model the problem as a nonconvex mixed-integer quadratically-constrainted programm (MIQCP) and then approximate this model as a mixed-integer linear program (MILP) using a discretization-based approach. We combine a rolling horizon approach with the discretization of individual chemical property specifications to deal with long scheduling horizons, time-varying quality specifications, and multiple suppliers with discrete arrival times. This approach has been evaluated using industry-representative data sets from the specialty chemical industry. We demonstrate that the proposed approach supports fast planning cycles.



中文翻译:

优化长视场坦克混合和调度操作的一种近似方法

我们解决了特种化学工业中出现的充满挑战的储罐混合和调度问题。我们将问题建模为非凸混合整数二次约束程​​序(MIQCP),然后使用基于离散化的方法将此模型近似为混合整数线性程序(MILP)。我们将滚动式方法与各个化学性质规格的离散化相结合,以应对较长的调度期,随时间变化的质量规格以及到达时间离散的多个供应商。已使用来自特种化学行业的行业代表性数据集对该方法进行了评估。我们证明了所提出的方法支持快速的计划周期。

更新日期:2020-06-26
down
wechat
bug