TY - JOUR
T1 - A novel approach to optimization of refining schedules for crude oil operations in refinery
AU - Wu, Nai Qi
AU - Bai, Liping
AU - Zhou, Mengchu
AU - Chu, Feng
AU - Mammar, Saïd
N1 - Funding Information:
Manuscript received June 1, 2011; revised September 6, 2011; accepted December 16, 2011. Date of publication April 17, 2012; date of current version October 12, 2012. This work was supported in part by the National Science Foundation of China under Grants 60474061 and 61034004. This paper was recommended by Associate Editor J. Lazansky.
PY - 2012
Y1 - 2012
N2 - Short-term scheduling for crude oil operations is a combinatorial problem and involves extreme detail. Thus, it is very complicated and, up to now, there is no efficient technique and software tool for it. To search for efficient techniques, a two-layer hierarchical solution is proposed for it. At the upper level, one finds a realizable refining schedule to optimize some objectives. At the lower level, a detailed schedule is obtained to realize it. A methodology has been presented to solve the lower level problem from a control perspective by the authors of this paper. In this paper, the upper level problem for finding optimal refining schedules is addressed, and a novel method is proposed based on the results obtained at the lower level. This method solves a linear programming problem to determine the maximal production rate and a transportation problem to optimally assign crude oil types and volume to the distillers. This way, the method is computationally very efficient. An industrial case study is presented to show the application of the proposed method.
AB - Short-term scheduling for crude oil operations is a combinatorial problem and involves extreme detail. Thus, it is very complicated and, up to now, there is no efficient technique and software tool for it. To search for efficient techniques, a two-layer hierarchical solution is proposed for it. At the upper level, one finds a realizable refining schedule to optimize some objectives. At the lower level, a detailed schedule is obtained to realize it. A methodology has been presented to solve the lower level problem from a control perspective by the authors of this paper. In this paper, the upper level problem for finding optimal refining schedules is addressed, and a novel method is proposed based on the results obtained at the lower level. This method solves a linear programming problem to determine the maximal production rate and a transportation problem to optimally assign crude oil types and volume to the distillers. This way, the method is computationally very efficient. An industrial case study is presented to show the application of the proposed method.
KW - Crude oil operations
KW - linear programming
KW - short-term scheduling
KW - transportation problem
UR - http://www.scopus.com/inward/record.url?scp=84867884609&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867884609&partnerID=8YFLogxK
U2 - 10.1109/TSMCC.2012.2185226
DO - 10.1109/TSMCC.2012.2185226
M3 - Article
AN - SCOPUS:84867884609
SN - 1094-6977
VL - 42
SP - 1042
EP - 1053
JO - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
JF - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
IS - 6
M1 - 6185692
ER -