1. State Key Laboratory of Chemical Engineering, Department of Chemical Engineering, Tsinghua University, Beijing 100084, China 2. Department of Chemical Engineering, Tsinghua University, Beijing 100084, China
This paper focuses on the integrated problem of long-term planning and short-term scheduling in a large-scale refinery-petrochemical complex, and considers the overall manufacturing process from the upstream refinery to the downstream petrochemical site. Different time scales are incorporated from the planning and scheduling subproblems. At the end of each discrete time period, additional constraints are imposed to ensure material balance between different time scales. Discrete time representation is applied to the planning subproblem, while continuous time is applied to the scheduling of ethylene cracking and polymerization processes in the petrochemical site. An enterprise-wide mathematical model is formulated through mixed integer nonlinear programming. To solve the problem efficiently, a heuristic algorithm combined with a convolutional neural network (CNN), is proposed. Binary variables are used as the CNN input, leading to the integration of a data-driven approach and classical optimization by which a heuristic algorithm is established. The results do not only illustrate the detailed operations in a refinery and petrochemical complex under planning and scheduling, but also confirm the high efficiency of the proposed algorithm for solving large-scale problems.
Set for time plots in scheduling of ethylene cracking
J
Set for time plots in scheduling of polymerization process
S
Set for stream
R
Set for raw materials
U
Set for processing units
M
Set for operation modes
I
Set for intermediate stream tanks
P
Set for products
K
Set for cracking furnaces
Q
Set for polymerization reactors
L
Set for polymer products
G
Set for grades of polymer products
Price of product p at time t
Price of grade g in polymer l from reactor q at time t
Price of crude oil o for CDU c at time t
Price of raw material r at time t
Inventory cost of crude oil o in CDU c
Inventory cost of product p
Inventory cost of grade g in polymer l from reactor q
Process cost of crude oil o in CDU c
Operation cost of unit u
Operation cost of furnace k
Operation cost of reactor q
Clean up cost of furnace k
Changeover cost from intermediate i to ii in furnace k
Changeover cost from grade g to g' in polymer l from reactor q
Minimum capacity of CDU c
Maximum capacity of CDU c
Minimum purchase amount of crude oil o to CDU c
Maximum purchase amount of crude oil o to CDU c
Initial inventory of crude oil o to CDU c
Minimum inventory of crude oil o to CDU c
Maximum inventory of crude oil o to CDU c
Minimum cut point for stream s of crude oil o from CDU c
Maximum cut point for stream s of crude oil o from CDU c
Constant inlet ratio of raw material r to unit u
Minimum capacity of unit u
Maximum capacity of unit u
Constant yield of stream s in mode m in unit u
Initial inventory of intermediate i
Time length of each time period
Minimum flowrate of intermediate i to furnace k in slot n at time t
Maximum flowrate of intermediate i to furnace k in slot n at time t
Maximum operation time for furnace k in slot n at time t
Coefficient of yield of stream s from intermediate i in furnace k
Coefficient of yield of stream s from intermediate i in furnace k
Coefficient of yield of stream s from intermediate i in furnace k
Minimum yield of grade g of polymer l from reactor q
Maximum yield of grade g of polymer l from reactor q
Constant changeover time from grade g to g' of polymer l in reactor q
Minimum capacity of reactor q
Maximum capacity of reactor q
Minimum demand of grade g of polymer l from reactor q at time t
Maximum demand of grade g of polymer l from reactor q at time t
Minimum demand of product p at time t
Maximum demand of product p at time t
Purchase decision of crude oil o for CDU c at time t
Process decision of crude oil o for CDU c at time t
Assignment of operation mode m to unit u at time t
Assignment of intermediate i to furnace k in plot n at time t
Assignment of changeover from intermediate i to ii for furnace k in plot n at time t
Assignment of clean up operation to furnace k in plot n at time t
Assignment of grade g to polymer l from reactor q in plot j at time t
Assignment of changeover from grade g to g' of polymer l from reactor q in plot j at time t
z
Total profit as the objective function
Process flowrate of crude oil o for CDU c at time t
Purchase amount of crude oil o for CDU c at time t
Inventory amount of crude oil o for CDU c at time t
Cut point of stream s from crude oil o for CDU c at time t
Yield value of stream s from crude oil o for CDU c at time t
Outlet flowrate of stream s from CDU c at time t
Outlet flowrate of stream s from CDU c to unit u at time t
Outlet flowrate of stream s from CDU c to product p at time t
Inlet flowrate to unit u at time t
Outlet flowrate of intermediate i to unit u at time t
Outlet flowrate of raw material r to unit u at time t
Outlet flowrate of stream s from unit u’ to unit u at time t
Inlet flowrate to mode m in unit u at time t
Outlet flowrate of stream s from unit u at time t
Outlet flowrate of stream s from unit u to product p at time t
Outlet flowrate of stream s from unit u to intermediate i at time t
Inventory amount of intermediate i at time t
Outlet flowrate of stream s from furnace k to intermediate i at time t
Outlet flowrate of intermediate i to furnace k at time t
Outlet flowrate of intermediate i to reactor q in slot j at time t
Start time of slot n in furnace k at time t
End time of slot n in furnace k at time t
Duration time of slot n in furnace k at time t
Total operation time for furnace k in slot n at time t
Outlet flowrate of intermediate i to furnace k in slot n at time t
Yield of stream s from intermediate i in furnace k in slot n at time t
Outlet flowrate of stream s from furnace k in slot n at time t
Start time of slot j in reactor q at time t
End time of slot j in reactor q at time t
Duration time of slot j in reactor q at time t
Yield of grade g in polymer l in reactor q in slot j at time t
Changeover time of reactor q in slot j at time t
Inlet flowrate to reactor q in slot j at time t
Inlet flowrate to reactor q from raw material r in slot j at time t
Outlet flowrate of grade g in polymer l from reactor q in slot j at time t
Sale amount of grade g in polymer l from reactor q at time t
Inventory amount of grade g in polymer l from reactor q at time t
Sale amount of product p at time t
Inventory amount of product p at time t
1
N Sahinidis, I Grossmann, R Fornari, M Chathrathi. Optimization model for long range planning in the chemical industry. Computers & Chemical Engineering, 1989, 13(9): 1049–1063 https://doi.org/10.1016/0098-1354(89)87046-2
J M Pinto, M Joly, L F L Moro. Planning and scheduling models for refinery operations. Computers & Chemical Engineering, 2000, 24(9–10): 2259–2276 https://doi.org/10.1016/S0098-1354(00)00571-8
4
W Li, C W Hui, A Li. Integrating CDU, FCC and product blending models into refinery planning. Computers & Chemical Engineering, 2005, 29(9): 2010–2028 https://doi.org/10.1016/j.compchemeng.2005.05.010
5
A M Alattas, I E Grossmann, I Palou-Rivera. Integration of nonlinear crude distillation unit models in refinery planning optimization. Industrial & Engineering Chemistry Research, 2011, 50(11): 6860–6870 https://doi.org/10.1021/ie200151e
6
A M Alattas, I E Grossmann, I Palou-Rivera. Refinery production planning: multiperiod minlp with nonlinear CDU model. Industrial & Engineering Chemistry Research, 2012, 51(39): 12852–12861 https://doi.org/10.1021/ie3002638
7
J Li, R Misener, C A Floudas. Continuous-time modeling and global optimization approach for scheduling of crude oil operations. AIChE Journal, 2012, 58(1): 205–226 https://doi.org/10.1002/aic.12623</jrn
8
L Zhang, Z Yuan, B Chen. Refinery-wide planning operations under uncertainty via robust optimization approach coupled with global optimization. Computers & Chemical Engineering, 2021, 146: 107205 https://doi.org/10.1016/j.compchemeng.2020.107205
9
P M Castro, I E Grossmann, Q Zhang. Expanding scope and computational challenges in process scheduling. Computers & Chemical Engineering, 2018, 114: 14–42 https://doi.org/10.1016/j.compchemeng.2018.01.020
10
M E Dogan, I E Grossmann. A decomposition method for the simultaneous planning and scheduling of single-stage continuous multiproduct plants. Industrial & Engineering Chemistry Research, 2006, 45(1): 299–315 https://doi.org/10.1021/ie050778z
11
M Erdirik-Dogan, I E Grossmann. Simultaneous planning and scheduling of single-stage multi-product continuous plants with parallel lines. Computers & Chemical Engineering, 2008, 32(11): 2664–2683 https://doi.org/10.1016/j.compchemeng.2007.07.010
12
Z Li, M G Ierapetritou. Production planning and scheduling integration through augmented Lagrangian optimization. Computers & Chemical Engineering, 2010, 34(6): 996–1006 https://doi.org/10.1016/j.compchemeng.2009.11.016
13
S Mouret, I E Grossmann, P Pestiaux. A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling. Computers & Chemical Engineering, 2011, 35(12): 2750–2766 https://doi.org/10.1016/j.compchemeng.2011.03.026
14
J Li, X Xiao, F Boukouvala, C A Floudas, B Zhao, G Du, X Su, H Liu. Data-driven mathematical modeling and global optimization framework for entire petrochemical planning operations. AIChE Journal, 2016, 62(9): 3020–3040 https://doi.org/10.1002/aic.15220
15
Z Wang, Z Li, Y Feng, G Rong. Integrated short-term scheduling and production planning in an ethylene plant based on Lagrangian decomposition. Canadian Journal of Chemical Engineering, 2016, 94(9): 1723–1739 https://doi.org/10.1002/cjce.22544
16
H Zhao, M G Ierapetritou, N K Shah, G Rong. Integrated model of refining and petrochemical plant for enterprise-wide optimization. Computers & Chemical Engineering, 2017, 97: 194–207 https://doi.org/10.1016/j.compchemeng.2016.11.020
17
E Ketabchi, E Mechleri, H Arellano-Garcia. Increasing operational efficiency through the integration of an oil refinery and an ethylene production plant. Chemical Engineering Research & Design, 2019, 152: 85–94 https://doi.org/10.1016/j.cherd.2019.09.028
18
A Uribe-Rodriguez, P M Castro, G G Gonzalo, B Chachuat. Global optimization of large-scale MIQCQPs via cluster decomposition: application to short-term planning of an integrated refinery-petrochemical complex. Computers & Chemical Engineering, 2020, 140: 106883 https://doi.org/10.1016/j.compchemeng.2020.106883
19
H Yang, D E Bernal, R E Franzoi, F G Engineer, K Kwon, S Lee, I E Grossmann. Integration of crude-oil scheduling and refinery planning by Lagrangean decomposition. Computers & Chemical Engineering, 2020, 138: 106812 https://doi.org/10.1016/j.compchemeng.2020.106812
20
L Zhang, Z Yuan, B Chen. Adjustable robust optimization for the multi-period planning operations of an integrated refinery-petrochemical site under uncertainty. Computers & Chemical Engineering, 2022, 160: 107703 https://doi.org/10.1016/j.compchemeng.2022.107703
21
Y BaoY Peng C WuZ Li, eds. Online Job Scheduling in Distributed Machine Learning Clusters. IEEE INFOCOM 2018–IEEE Conference on Computer Communications. IEEE, 2018: 495–503
22
S WangD LiJ Geng, eds. Geryon: Accelerating Distributed CNN Training by Network-Level Flow Scheduling. IEEE INFOCOM 2020–IEEE Conference on Computer Communications. IEEE, 2020: 1678–1687
23
P Guo, W Cheng, Y Wang. Hybrid evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems. Expert Systems with Applications, 2017, 71: 57–68 https://doi.org/10.1016/j.eswa.2016.11.025
24
O Aoun, M Sarhani, A El Afia. Investigation of hidden markov model for the tuning of metaheuristics in airline scheduling problems. IFAC-PapersOnLine, 2016, 49(3): 347–352 https://doi.org/10.1016/j.ifacol.2016.07.058
25
H Aytug, S Bhattacharyya, G J Koehler, J L Snowdon. A review of machine learning in scheduling. IEEE Transactions on Engineering Management, 1994, 41(2): 165–171 https://doi.org/10.1109/17.293383
26
S A Bagloee, M Asadi, M Sarvi, M Patriksson. A hybrid machine-learning and optimization method to solve bi-level problems. Expert Systems with Applications, 2018, 95: 142–152 https://doi.org/10.1016/j.eswa.2017.11.039
27
Y Bengio, A Lodi, A Prouvost. Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research, 2021, 290(2): 405–421 https://doi.org/10.1016/j.ejor.2020.07.063
28
S Misra, L Roald, Y Ng. Learning for constrained optimization: identifying optimal active constraint sets. INFORMS Journal on Computing, 2022, 34(1): 463–480 https://doi.org/10.1287/ijoc.2020.1037
29
A M Alvarez, Q Louveaux, L Wehenkel. A machine learning-based approximation of strong branching. INFORMS Journal on Computing, 2017, 29(1): 185–195 https://doi.org/10.1287/ijoc.2016.0723
30
M Morabit, G Desaulniers, A Lodi. Machine-learning-based column selection for column generation. Transportation Science, 2021, 55(4): 815–831 https://doi.org/10.1287/trsc.2021.1045
31
Y Hou, N Wu, M Zhou, Z Li. Pareto-optimization for scheduling of crude oil operations in refinery via genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics. Systems, 2015, 47(3): 517–530 https://doi.org/10.1109/TSMC.2015.2507161
32
Z Zhao, S Liu, M Zhou, A Abusorrah. Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE/CAA Journal of Automatica Sinica, 2020, 8(6): 1199–1209
33
W S McCulloch, W Pitts. A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 1943, 5(4): 115–133 https://doi.org/10.1007/BF02478259
34
D H Hubel, T N Wiesel. Receptive fields, binocular interaction and functional architecture in the cat’s visual cortex. Journal of Physiology, 1962, 160(1): 106–154 https://doi.org/10.1113/jphysiol.1962.sp006837
35
K FukushimaS Miyake. Neocognitron: a self-organizing neural network model for a mechanism of visual pattern recognition. In: Competition and Cooperation in Neural Nets. Heidelberg: Springer, 1982, 267–285
36
Y LeCun, L Bottou, Y Bengio, P Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 1998, 86(11): 2278–2324 https://doi.org/10.1109/5.726791
37
A Krizhevsky, I Sutskever, G E Hinton. Imagenet classification with deep convolutional neural networks. Communications of the ACM, 2017, 60(6): 84–90 https://doi.org/10.1145/3065386
38
M D ZeilerR Fergus. Visualizing and Understanding Convolutional Networks. European Conference on Computer Vision. Cham: Springer, 2014, 818–833
39
C SzegedyW LiuY JiaP SermanetS Reed D AnguelovD ErhanV VanhouckeA Rabinovich. Going Deeper With Convolutions. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2015, 1–9
40
K SimonyanA Zisserman. Very deep convolutional networks for large-scale image recognition. arXiv preprint, 2014, 1409.1556
41
K HeX Zhang S RenJ Sun. Deep Residual Learning for Image Recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2016, 770–778
42
C Ieracitano, A Paviglianiti, M Campolo, A Hussain, E Pasero, F C Morabito. A novel automatic classification system based on hybrid unsupervised and supervised machine learning for electrospun nanofibers. IEEE/CAA Journal of Automatica Sinica, 2020, 8(1): 64–76
43
A Muzahid, W Wan, F Sohel, L Wu, L Hou. CurveNet: curvature-based multitask learning deep networks for 3D object recognition. IEEE/CAA Journal of Automatica Sinica, 2020, 8(6): 1177–1187
44
M Tawarmalani, N V Sahinidis. A polyhedral branch-and-cut approach to global optimization. Mathematical Programming, 2005, 103(2): 225–249 https://doi.org/10.1007/s10107-005-0581-8
45
I E Grossmann, J Viswanathan, A Vecchietti, R Raman, E Kalvelagen. GAMS/DICOPT: a discrete continuous optimization package. GAMS Corporation Inc, 2002, 37: 55
46
O K Gupta, A Ravindran. Branch and bound experiments in convex nonlinear integer programming. Management Science, 1985, 31(12): 1533–1546 https://doi.org/10.1287/mnsc.31.12.1533
47
M R Bussieck, A Pruessner. Mixed-integer nonlinear programming. SIAG/OPT Newsletter. Views & News, 2003, 14(1): 19–22
48
M A Duran, I E Grossmann. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 1986, 36(3): 307–339 https://doi.org/10.1007/BF02592064
49
A M Geoffrion. Generalized benders decomposition. Journal of Optimization Theory and Applications, 1972, 10(4): 237–260 https://doi.org/10.1007/BF00934810