A planning model for multiple blending schemes

doi:10.1016/j.cjche.2015.01.007

Chin.J.Chem.Eng. ›› 2015, Vol. 23 ›› Issue (4): 675-680.DOI: 10.1016/j.cjche.2015.01.007

• PROCESS SYSTEMS ENGINEERING • Previous Articles Next Articles

A planning model for multiple blending schemes

Zhen Gao

Institute of Industrial Engineering & Logistics Optimization, Northeastern University, Shenyang 110819, China;
State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China

Received:2014-08-21 Revised:2015-01-06 Online:2015-05-13 Published:2015-04-28
Contact: Zhen Gao
Supported by:
Supported by the State Key Laboratory of Synthetical Automation for Process Industries Fundamental Research Funds (2013ZCX02).

A planning model for multiple blending schemes

Zhen Gao

Institute of Industrial Engineering & Logistics Optimization, Northeastern University, Shenyang 110819, China;
State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China

通讯作者: Zhen Gao
基金资助:
Supported by the State Key Laboratory of Synthetical Automation for Process Industries Fundamental Research Funds (2013ZCX02).

Abstract

Abstract: The key of production planning of refineries is to determine the production planning of units and blending schemes of blends in each period of the plan horizon, since they affect the effective utilization of components of refineries and hence profits. The optimization is difficult, because of many complicated product production-consumption relationships in production processes,which are closely related to the running modes of the units. Additionally, the blending products, such as gasoline and diesel, may use multiple blending schemes for their production that increase the complexity of the problem. This paper models the production planning problem as a mixed integer nonlinear programming. Computational experiments for a refinery show the effectiveness of the model. The optimal results give the effective utilization of the self-produced components and increase of the profit.

Key words: Refinery productionplanning, Running mode, Blending scheme, Mixed integer nonlinear programming

摘要： The key of production planning of refineries is to determine the production planning of units and blending schemes of blends in each period of the plan horizon, since they affect the effective utilization of components of refineries and hence profits. The optimization is difficult, because of many complicated product production-consumption relationships in production processes,which are closely related to the running modes of the units. Additionally, the blending products, such as gasoline and diesel, may use multiple blending schemes for their production that increase the complexity of the problem. This paper models the production planning problem as a mixed integer nonlinear programming. Computational experiments for a refinery show the effectiveness of the model. The optimal results give the effective utilization of the self-produced components and increase of the profit.

关键词: Refinery productionplanning, Running mode, Blending scheme, Mixed integer nonlinear programming

Zhen Gao. A planning model for multiple blending schemes[J]. Chin.J.Chem.Eng., 2015, 23(4): 675-680.

Zhen Gao. A planning model for multiple blending schemes[J]. Chinese Journal of Chemical Engineering, 2015, 23(4): 675-680.

References

[1] J. Guo, M. Yang, Optimization of chemical engineering production and scheduling, Chem. Ind. Press (2006) 33-50 (in Chinese).

[2] N. Zhang, X.X. Zhu, A novel modelling and decomposition strategy for overall refinery optimization, Comp. Chem. Eng. 24 (2000) 1543-1548.

[3] M.G. Lundgren, J.T. Lundgren, J.A. Persson, An optimization model for refinery production scheduling, Int. J. Prod. Econ. 78 (2002) 255-270.

[4] Z. Gao, L. Tang, H. Jin, N. Xu, An optimization model for the production planning of overall refinery, Chin. J. Chem. Eng. 16 (1) (2008) 67-70.

[5] L.F.L. Moro, A.C. Zanin, J.M. Pinto, A planning model for refinery diesel production, Comp. Chem. Eng. 22 (10) (1998) 1039-1042.

[6] J.M. Pinto, M. Joly, L.F.L. Moro, Planning and scheduling models for refinery operations, Comp. Chem. Eng. 24 (10) (2000) 2259-2276.

[7] M. Joly, L.F.L. Moro, J.M. Pinto, planning and scheduling for petroleum refineries using mathematical programming, Braz. J. Chem. Eng. 19 (2) (2002) 207-228.

[8] B.L. Zhang, B. Hua, Effective MILP model for oil refinery-wide production planning and better energy utilization, J. Clean. Prod. 15 (2007) 439-448.

[9] R. Misener, C.A. Floudas, Advances for the pooling problem: modeling, global optimization, and computational studies, Appl. Comput. Math. 8 (1) (2009) 3-22.

[10] M.H. Rusin, The structure of nonlinear blending models, Chem. Eng. Sci. 30 (1975) 937-944.

[11] C.A. Haverly, Studies of the behavior of recursion for the pooling problem, ACM SIGMAP Bull. 25 (1978) 19-28.

[12] T.E. Baker, L.S. Lasdon, Successive linear programming at exxon, Manag. Sci. 31 (1985) 264-274.

[13] C.A. Floudas, A. Aggarwal, A decomposition strategy for optimum search in the pooling problem, ORSA J. Comput. 2 (3) (1990) 225-235.

[14] L.R. Foulds, D. Haugland, K. Jornsten, A bilinear approach to the pooling problem, Optimization 24 (1992) 165-180.

[15] I. Quesada, I.E. Grossmann, Global optimization of bilinear process networks with multi-component flows, Comp. Chem. Eng. 19 (1995) 1219-1242.

[16] C.W. DeWitt, L.S. Lasdon, A.D. Waren, D.A. Brenner, S. Melham, OMEGA: An improved gasoline blending system for Texaco, Interfaces 19 (1) (1989) 85-101.

[17] N. Adhya, M. Tawarmalani, N.V. Sahinidis, A Lagrangian approach to the pooling problem, Ind. Eng. Chem. Res. 38 (5) (1999) 965-1972.

[18] M.A. Duran, I.E. Grossmann, An outer-approximation algorithm for a class of mixedinteger nonlinear programs, Math. Program. 36 (1986) 307-339.

[19] R. Fletcher, S. Leyffer, Solving mixed integer programs by outer approximation, Math. Program. 66 (1994) 327-349.

[20] A.M. Geoffrion, A generalized benders decomposition, J. Optim. Theory Appl. 10 (4) (1972) 237-260.

[21] T. Westerlund, F. Petersson, A cutting plane method for solving convex MINLP problems, Comp. Chem. Eng. 19 (1995) 131-136.

[22] O.K. Gupta, A. Ravindran, Branch and bound experiments in convex nonlinear integer programming, Manag. Sci. 31 (12) (1985) 1533-1546.

[23] I. Quesada, I.E. Grossmann, An LP/NLP based branch and bound algorithmfor convex MINLP optimization problems, Comp. Chem. Eng. 16 (10/11) (1992) 937-947.

[24] I. Grossmann, Review of nonlinear mixed-integer and disjunctive programming techniques, Optim. Eng. 3 (2002) 227-252.

A planning model for multiple blending schemes

A planning model for multiple blending schemes

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 7

Recommended Articles

Metrics

Comments

[1]	Tao Yang, Yiqing Luo, Yingjie Ma, Xigang Yuan. Optimal synthesis of compression refrigeration system using a novel MINLP approach [J]. Chin.J.Chem.Eng., 2018, 26(8): 1662-1669.
[2]	Danlei Chen, Xue Ma, Yiqing Luo, Yingjie Ma, Xigang Yuan. Synthesis of refrigeration system based on generalized disjunctive programming model [J]. Chin.J.Chem.Eng., 2018, 26(8): 1613-1620.
[3]	Jin Lang, Jiao Zhao. Modeling and optimization for oil well production scheduling [J]. , 2016, 24(10): 1423-1430.
[4]	Shan Lu, Hongye Su, Charlotta Johnsson, YueWang, Lei Xie . Modeling and optimization methods of integrated production planning for steel plate mill with flexible customization [J]. Chin.J.Chem.Eng., 2015, 23(12): 2037-2047.
[5]	JIAO Yunqiang, SU Hongye, LIAO Zuwei, HOU Weifeng. Modeling and Multi-objective Optimization of Refinery Hydrogen Network [J]. , 2011, 19(6): 990-998.
[6]	AN Weizhong, YU Fengjuan, DONG Fenglei, HU Yangdong. Simulated Annealing Approach to the Optimal Synthesis of Distillation Column with Intermediate Heat Exchangers [J]. Chin.J.Chem.Eng., 2008, 16(1): 30-35.
[7]	CHEN Li, WANG Kefeng, XU Xiaoyu, YAO Pingjing. Hierarchical On-line Scheduling of Multiproduct Batch Plants with a Combined Approach of Mathematical Programming and Genetic Algorithm [J]. , 2004, 12(1): 78-84.