An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.
This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.
Department of Automation, Shanghai Jiao Tong University, Dongchuan Road 800, Shanghai, China.
Qianqian
Q
Duan
Department of Automation, Shanghai Jiao Tong University, Dongchuan Road 800, Shanghai, China.
Genke
G
Yang
College of Mathematics and Information, Shanghai Lixin University of Commerce, China.
Guanglin
G
Xu
Department of Automation, Shanghai Jiao Tong University, Dongchuan Road 800, Shanghai, China.
Changchun
C
Pan
D008962:Models, Theoretical; D010578:Petroleum; D035501:Uncertainty
D010578:Petroleum