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

被引:8
作者
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 条
[41]   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
[42]   Differential Evolution with DEoptim An Application to Non-Convex Portfolio Optimization [J].
Ardia, David ;
Boudt, Kris ;
Carl, Peter ;
Mullen, Katharine M. ;
Peterson, Brian G. .
R JOURNAL, 2011, 3 (01) :27-34
[43]   One dimensional consensus based algorithm for non-convex optimization [J].
Choi, Young-Pil ;
Koo, Dowan .
APPLIED MATHEMATICS LETTERS, 2022, 124
[44]   Non-convex global optimization by the beta algorithm: A MAPLE code [J].
Delgado Pineda, M. .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2005, 63 (5-7) :E769-E777
[45]   Global optimization of non-convex piecewise linear regression splines [J].
Nadia Martinez ;
Hadis Anahideh ;
Jay M. Rosenberger ;
Diana Martinez ;
Victoria C. P. Chen ;
Bo Ping Wang .
Journal of Global Optimization, 2017, 68 :563-586
[46]   A New Filled Function Method for the Non-convex Global Optimization [J].
Qiao Bao-Ming ;
Gao Le ;
Wei Fei .
2017 13TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2017, :219-223
[47]   Online Non-Convex Optimization with Imperfect Feedback [J].
Heliou, Amelie ;
Martin, Matthieu ;
Mertikopoulos, Panayotis ;
Rahier, Thibaud .
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
[48]   Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization [J].
Lin, Qihang ;
Ma, Runchao ;
Xu, Yangyang .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 82 (01) :175-224
[49]   Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability [J].
Mercier, Q. ;
Poirion, F. ;
Desideri, J. A. .
ENGINEERING OPTIMIZATION, 2019, 51 (05) :733-752
[50]   Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints [J].
Strongin, Roman ;
Barkalov, Konstantin ;
Bevzuk, Semen .
SOFT COMPUTING, 2020, 24 (16) :11853-11865