Non-convex chance-constrained optimization for blending recipe design under uncertainties

被引:7
作者
Yang, Yu [1 ]
dela Rosa, Loren [1 ]
Chow, Tsz Yuet Matthew [2 ]
机构
[1] Calif State Univ Long Beach, Dept Chem Engn, Long Beach, CA 90840 USA
[2] Univ Michigan, Dept Chem Engn, Ann Arbor, MI 48109 USA
关键词
Chance-constrained program; Global optimization; Second-order cone program; Gasoline blending; GLOBAL OPTIMIZATION; ROBUST-OPTIMIZATION; POOLING PROBLEMS; ALGORITHM;
D O I
10.1016/j.compchemeng.2020.106868
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A global optimization algorithm is proposed to design blending recipes for gasoline production with non-linear mixing law and parameter uncertainty. Important fuels, such as gasoline, are produced by mixing several intermediate feedstocks in such a way that all quality specifications are met, and total profit is maximized. Conventional blending design approaches that rely on linear models and deterministic optimization may generate a suboptimal or infeasible solution due to model inaccuracy and failure to account for parameter uncertainty. The proposed work designs the blending recipe subject to chance constraints with normally distributed uncertain parameters and nonlinear mixing rule. The resulting non-convex joint chance-constrained program is solved to a near-global optimum through second-order cone relaxation, branch-and-bound, optimality-based bound tightening, and reformulate-linearization techniques. A case study involving nine feedstocks and two grades of gasoline is presented to demonstrate the effectiveness of the proposed method. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:14
相关论文
共 50 条
[31]   Improved Harris hawks optimization for non-convex function optimization and design optimization problems [J].
Kang, Helei ;
Liu, Renyun ;
Yao, Yifei ;
Yu, Fanhua .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 204 :619-639
[32]   Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations [J].
Anureet Saxena ;
Pierre Bonami ;
Jon Lee .
Mathematical Programming, 2010, 124 :383-411
[33]   Dynamic particle swarm optimizer with escaping prey for solving constrained non-convex and piecewise optimization problems [J].
Chen, Jiajia ;
Zheng, Jiehui ;
Wu, Peterzhe ;
Zhang, Luliang ;
Wu, Qinghua .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 86 :208-223
[34]   Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations [J].
Anureet Saxena ;
Pierre Bonami ;
Jon Lee .
Mathematical Programming, 2011, 130 :359-413
[35]   A chance-constrained programming model for airport ground movement optimisation with taxi time uncertainties [J].
Wang, Xinwei ;
Brownlee, Alexander E., I ;
Weiszer, Michal ;
Woodward, John R. ;
Mahfouf, Mahdi ;
Chen, Jun .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 132
[36]   Distributionally robust chance-constrained optimization with Gaussian mixture ambiguity set [J].
Kammammettu, Sanjula ;
Yang, Shu-Bo ;
Li, Zukui .
COMPUTERS & CHEMICAL ENGINEERING, 2024, 186
[37]   Scheduling of Energy Hub Resources Using Robust Chance-Constrained Optimization [J].
Esmaeel Nezhad, Ali ;
Nardelli, Pedro H. J. ;
Sahoo, Subham ;
Ghanavati, Farideh .
IEEE ACCESS, 2022, 10 :129738-129753
[38]   Approximating the chance-constrained capacitated vehicle routing problem with robust optimization [J].
Karina Thiebaut ;
Artur Pessoa .
4OR, 2023, 21 :513-531
[39]   Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems [J].
van Ackooij, Wim ;
Perez-Aros, Pedro ;
Soto, Claudia ;
Vilches, Emilio .
MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (03) :1419-1451
[40]   Approximating the chance-constrained capacitated vehicle routing problem with robust optimization [J].
Thiebaut, Karina ;
Pessoa, Artur .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (03) :513-531