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 条
[21]   A Global Optimization Approach to Non-Convex Problems [J].
Lu, Z. F. ;
Lan, Y. .
PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INDUSTRIAL ENGINEERING (AIIE 2015), 2015, 123 :449-452
[22]   A test-suite of non-convex constrained optimization problems from the real-world and some baseline results [J].
Kumar, Abhishek ;
Wu, Guohua ;
Ali, Mostafa Z. ;
Mallipeddi, Rammohan ;
Suganthan, Ponnuthurai Nagaratnam ;
Das, Swagatam .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 56
[23]   Global solution of non-convex quadratically constrained quadratic programs [J].
Elloumi, Sourour ;
Lambert, Amelie .
OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (01) :98-114
[24]   A chance-constrained programming framework to handle uncertainties in radiation therapy treatment planning [J].
Zaghian, Maryam ;
Lim, Gino J. ;
Khabazian, Azin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (02) :736-745
[25]   An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems [J].
Bai, Xiaodi ;
Sun, Jie ;
Zheng, Xiaojin .
INFORMS JOURNAL ON COMPUTING, 2021, 33 (03) :1056-1069
[26]   CHANCE-CONSTRAINED METHODS FOR OPTIMIZATION PROBLEMS WITH RANDOM AND FUZZY PARAMETERS [J].
Yang, Lixing .
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (02) :413-422
[27]   Robust optimization approach for a chance-constrained binary knapsack problem [J].
Jinil Han ;
Kyungsik Lee ;
Chungmok Lee ;
Ki-Seok Choi ;
Sungsoo Park .
Mathematical Programming, 2016, 157 :277-296
[28]   Robust optimization approach for a chance-constrained binary knapsack problem [J].
Han, Jinil ;
Lee, Kyungsik ;
Lee, Chungmok ;
Choi, Ki-Seok ;
Park, Sungsoo .
MATHEMATICAL PROGRAMMING, 2016, 157 (01) :277-296
[29]   Parallel Global Optimization for Non-convex Mixed-Integer Problems [J].
Barkalov, Konstantin ;
Lebedev, Ilya .
SUPERCOMPUTING (RUSCDAYS 2019), 2019, 1129 :98-109
[30]   An Approach for Parallel Solving the Multicriterial Optimization Problems with Non-convex Constraints [J].
Gergel, Victor ;
Kozinov, Evgeny .
SUPERCOMPUTING, RUSCDAYS 2017, 2017, 793 :121-135