Case ID | The number of physical properties | The number of devices | The number of variables | The number of constraints | The number of bilinear constraints |
1 | 22 | 58 | 7229 | 3926 | 1827 |
2 | 36 | 79 | 7230 | 3308 | 1851 |
3 | 22 | 58 | 5365 | 2339 | 379 |
This paper established a mathematical model with nonconvex bilinear terms. It formulated the complex material flow in the petroleum refinery scenario based on the concept of the "P model". The mathematical model described the nonlinear constraints such as linear and nonlinear mass and volume intersection flow blending of crude and middle material physical properties. Additionally, it described the complex inflow and outflow in secondary devices as nonlinear constraints such as delta-base structure and physical property transfer. It is highly difficult to determine the direction and quantity of each material in the network of refineries. An improved interior point algorithm with an initial point strategy was proposed to find a high-quality feasible solution in a short time. The real instances from the petroleum refinery were employed to compare and analyze the solutions from the improved algorithm and commercial solver. The experimental results show that the proposed algorithm framework can balance the solution quality and computational efficiency and perform well in different scenarios of refinery material flow networks.
Citation: Fenglian Dong, Dongdong Ge, Lei Yang, Zhiwei Wei, Sichen Guo, Hekai Xu. Nonlinear modeling and interior point algorithm for the material flow optimization in petroleum refinery[J]. Electronic Research Archive, 2024, 32(2): 915-927. doi: 10.3934/era.2024044
[1] | Mingtao Cui, Wennan Cui, Wang Li, Xiaobo Wang . A polygonal topology optimization method based on the alternating active-phase algorithm. Electronic Research Archive, 2024, 32(2): 1191-1226. doi: 10.3934/era.2024057 |
[2] | Ziqiang Wang, Chunyu Cen, Junying Cao . Topological optimization algorithm for mechanical-electrical coupling of periodic composite materials. Electronic Research Archive, 2023, 31(5): 2689-2707. doi: 10.3934/era.2023136 |
[3] | Mingtao Cui, Min Pan, Jie Wang, Pengjie Li . A parameterized level set method for structural topology optimization based on reaction diffusion equation and fuzzy PID control algorithm. Electronic Research Archive, 2022, 30(7): 2568-2599. doi: 10.3934/era.2022132 |
[4] | Ruyang Yin, Jiping Xing, Pengli Mo, Nan Zheng, Zhiyuan Liu . BO-B&B: A hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems. Electronic Research Archive, 2022, 30(11): 3993-4014. doi: 10.3934/era.2022203 |
[5] | Mingjun Zhou, Jingxue Yin . Continuous subsonic-sonic flows in a two-dimensional semi-infinitely long nozzle. Electronic Research Archive, 2021, 29(3): 2417-2444. doi: 10.3934/era.2020122 |
[6] | Weishang Gao, Qin Gao, Lijie Sun, Yue Chen . Design of a novel multimodal optimization algorithm and its application in logistics optimization. Electronic Research Archive, 2024, 32(3): 1946-1972. doi: 10.3934/era.2024089 |
[7] | Saeedreza Tofighi, Farshad Merrikh-Bayat, Farhad Bayat . Designing and tuning MIMO feedforward controllers using iterated LMI restriction. Electronic Research Archive, 2022, 30(7): 2465-2486. doi: 10.3934/era.2022126 |
[8] | Yujie Wang, Enxi Zheng, Wenyan Wang . A hybrid method for the interior inverse scattering problem. Electronic Research Archive, 2023, 31(6): 3322-3342. doi: 10.3934/era.2023168 |
[9] | Fenglin Huang, Yanping Chen, Tingting Lin . An error estimator for spectral method approximation of flow control with state constraint. Electronic Research Archive, 2022, 30(9): 3193-3210. doi: 10.3934/era.2022162 |
[10] | Jian Gong, Yuan Zhao, Jinde Cao, Wei Huang . Platoon-based collision-free control for connected and automated vehicles at non-signalized intersections. Electronic Research Archive, 2023, 31(4): 2149-2174. doi: 10.3934/era.2023111 |
This paper established a mathematical model with nonconvex bilinear terms. It formulated the complex material flow in the petroleum refinery scenario based on the concept of the "P model". The mathematical model described the nonlinear constraints such as linear and nonlinear mass and volume intersection flow blending of crude and middle material physical properties. Additionally, it described the complex inflow and outflow in secondary devices as nonlinear constraints such as delta-base structure and physical property transfer. It is highly difficult to determine the direction and quantity of each material in the network of refineries. An improved interior point algorithm with an initial point strategy was proposed to find a high-quality feasible solution in a short time. The real instances from the petroleum refinery were employed to compare and analyze the solutions from the improved algorithm and commercial solver. The experimental results show that the proposed algorithm framework can balance the solution quality and computational efficiency and perform well in different scenarios of refinery material flow networks.
The pooling problem, also known as the mixed-flow problem, is a classic revenue maximization problem involving supply, storage, demand, and specified flow mixture constraints and usually appears in petroleum refinery and wastewater treatment scenarios [1]. Crude oils flowing into the petroleum refinery network are refined and processed to produce gasoline, kerosene, diesel, and other liquid fuels, hundreds of kinds of lubricating oil, paraffin, asphalt, and other refinery products, and tens of thousands of synthetic resin, synthetic rubber, synthetic fiber, and other chemical products. Various physical and chemical processes, including crude oil separation, light oil, and gas processing, should be performed for the crude oil processing of various products. Each of these processes is relatively independent in constructing a refinery production unit network, such as the atmospheric-vacuum distillation unit and catalytic cracking, catalytic reforming, hydrocracking, coking, and other secondary devices. Refinery optimization refers to the overall optimization of the whole process of refinery enterprises, including raw material procurement, production, processing, and product delivery, for maximizing the economic benefits of enterprises while satisfying various production constraints. In terms of the pooling problem, the mixture of quality attributes often leads to nonconvex bilinear constraints, causing significant decision-making difficulties. Therefore, the research mainly focuses on the formulation and solution of nonlinear models.
There are three classical modeling methods for the pooling problem: the "P(proportional) model" proposed by Haverly [2], the "Q(quantity) model" improved by Ben-Tal [3], and the "PQ(proportional and quatity) model" further modified by Quesada and Grossmann [4]. The "Q model" takes actual material inflow and product outflow of the processing system as the decision variables. The "P model" replaces the amount of material inflow and outflow by the transformation proportion relationship between all processes to obtain the equivalent form of the "Q model" with fewer variables. Based on the "Q model", the "PQ model" adds constraints of proportional variables and product output to obtain a tighter convex envelope relaxation model [5].
The global optimization algorithms for solving the pooling problem in academia and industry are listed as follows: the nonlinear programming method based on Lagrange relaxation proposed by Ben-Tal et al. [3,6], the branch-and-bound method based on convex relaxation proposed by Zamora and Grossmann [7], the branch-and-bound method for convex relaxation with enhanced lower bound based on discretization proposed by Ruiz and Grossmann [8], reformulation-linearization-technique(RLT) nonlinear method proposed by Meyer and Floudas [9], and external approximation nonlinear method proposed by Bergamini [10]. Although these global optimization algorithms can theoretically guarantee the optimality of the results, their solution's efficiency cannot meet the practical operation requirements for complex problems.
Compared with the global optimization algorithms, several local optimization algorithms have been proposed to solve the pooling problem. These algorithms include the continuous linear programming solution (SLP) designed for refinery scenarios [11,12,13,14], the nonmonotonic continuous linear programming (NMSLP) method [15], the nonlinear term discretization method [16,17,18], the Benders decomposition method proposed by Floudas and Aggarwal [19], the distributed recursive method for solving pooling problems in commercial software [20,21,22], and an interior-point method for solving nonlinear problems in commercial software [23,24]. Among them, the Benders decomposition and interior point methods fail to converge even for a long time. The continuous linear programming and distributed recursive methods easily fall into the local optimum.
This paper proposes a formulation of a nonlinear model suitable for refinery mixed flow based on the modeling of the "P model" in the pooling problem combined with complex real business scenarios. Furthermore, an improved interior point method algorithm is presented, which can find a high-quality feasible solution quickly. This algorithm has contributed to the generalized mixed-flow processing problems considering the complex nonlinear constraints in the refinery process and the generality of the interior point method.
The main contributions of this paper are:
1) A nonconvex and nonlinear model is established considering complex processes, such as mass linear, mass nonlinear, volume linear, and volume nonlinear intersection flow blending of crude and middle material physical properties with delta-base structure and physical property transfer.
2) An improved interior point method is presented to solve the nonconvex and nonlinear model in the allowable time.
3) Numerical experiment shows that the result of the improved interior point method is superior to that of the commercial solver.
The main difficulty of production optimization in the crude oil refinery mainly lies in the significant amount of different raw materials and final products and the complex mutual supply relationship between various devices. Also, to meet different requirements for different final products, it is necessary to perform secondary processing of raw materials and intermediate components for selecting different processing options. It is challenging to construct a detailed optimization model for the above system. Therefore, this paper simplifies the entire industrial production process into five parts: raw material procurement, atmospheric and vacuum unit processing, secondary unit processing, blending, and product sales. By refining the transformation relationships within and between these five parts, the entire system can be well described through a relatively simple and neat model. It is noticeable that no necessary procedure is omitted. The performed simplifications include a summary and refinement of the actual process. The material quantity of inflow and outflow of each device is the main decision variable in the optimization model. These decision variables should meet specific equality or inequality relations caused by production requirements. Meanwhile, there are limited materials processed in each device and system due to the device capacity, production technology, and product delivery indicators. In addition, the inflow and outflow of devices should meet specific constraints caused by processing capacity and physical indicators. Finally, raw materials and final products should meet the business operation constraints, such as purchasing, sales, and warehouse storage. Even after some simplification, the great number of raw materials and final products, the complex processing and transformation relations, and the embedded scheme selection will still lead to a nonconvex and nonlinear model, resulting in significant difficulties for the model's formulation and solution. This paper will give the model formulation in detail in Sections 2.2.1–2.2.6 and the solution algorithm of the optimization model in Section 2.3.
Symbols | Definition |
E | set of device types |
Es | set of devices in link s |
IM | IM=(e,min) is the set of materials flowing into the device |
IG | IG=(e,gin) is the set of the utility system flowing into the device |
G | set of the utility system types |
H | set of unit processing capacity |
Hs | set of unit processing capacity in link s |
M | set of material types |
Ms | set of material types that should be processed in link s |
OM | OM=(e,mout) is the set of device output material |
OG | OG=(e,gout) is the set of the device output utility system |
Xsm | The amount of material m in link s (104 ton), s∈{gm,xs} |
¯Xsm,¯Xsg | The upper limit of material m (utility system g) in link s (104 tons), s∈{gm,xs} |
Xsm_,Xsg_ | The lower limit of material m (utility system g) in link s (104 tons), s∈{gm,xs} |
Xse,min | The amount of material m flowing into device e in link s is the raw material consumption of device e in process s (104 tons), s∈{cy,ec,th} |
Xse,mout | The amount of material m outflowing into device e in link s is the raw material consumption of device e in process s (104 tons), s∈{cy,ec,th} |
Xse,min,p | The amount of material m in link s flowing into device e by the processing scheme p, s∈{cy,ec,th} |
Xse,gin | The amount of the utility system g of link s flowing into device e is the utility system consumption of device e of process s (104 tons), s∈{cy,ec,th} |
Xse,gout | The amount of the utility system g of link s outflowing into device e is the utility system consumption of device e of process s (104 tons), s∈{cy,ec,th} |
Xse,min,mout | The amount of product mout processed from raw material min in device e of link s (104 tons), s∈{cy,ec,th} |
Ysmin,q | q value of the quality attribute flowing into material m in link s, s∈{cy,ec,th} |
Ysmout,q | q value of the quality attribute outflowing material m in link s, s∈{cy,ec,th} |
Yse,min,q | q value of the quality attribute of material m flowing into device e |
¯Ysm,q,Ysm,q_ | upper and lower limits of the q value of the quality attribute of material m in link s. s∈{cy,ec,th} |
superscript | |
s | s∈{gm,cy,ec,th,xs} represents raw material procurement, atmospheric-vacuum distillation unit processing, secondary device processing, blending, and product sales. |
subscript | |
g | Consumption of the utility system |
m | amount of material used |
In the model, the material set is M, the utility system set is G, and the device set is E. The superscript s∈{gm,cy,ec,th,xs} can identify the corresponding production parts, representing raw material procurement, atmospheric-vacuum distillation unit processing, secondary device processing, blending, and product sales, respectively. For example, Ms represents the materials that should be processed in production part s and Es represents the devices employed in production part s. In this study, the consumption pairs of the device, material, and utility system comprise set I and the device's output pairs. Material and utility systems consist of sets O, IM(OM), and IG(OG) as the consumption (output) sets of devices and materials and utility systems, respectively. The quantity of some materials is denoted as X. Xse,min(Xse,gin) and Xse,mout(Xse,gout) represent the inflow and outflow of one material (utility system) in device e in the production part s, respectively. In the model, subscripts in and out represent the inflow and outflow properties of the material or utility system.
The business requirement of refinery optimization implies optimizing the whole process from raw material procurement, production, and processing to product delivery to maximize the economic benefits of enterprises. Therefore, the following objective function is considered for the model to maximize profits:
max∑m∈MxspmXxsm+∑g∈GxspgXxsg−∑m∈MgmcmXgmm−∑g∈GgmcgXgmg | (1) |
where pm is the selling price of material m, pg is the selling price of utility system g, cm is the purchase price of raw material m, and cg is the purchase price of utility system g.
Any material must meet the material quantity balance constraint across the whole plant; that is, the sum of its purchased quantity and its quantity produced by all devices should equal the sum of the sales quantity of the material and the quantity of the material consumed by all devices:
Xgmm+∑s∈{cy,ec,th}∑e∈EsXse,mout=Xxsm+∑s∈{cy,ec,th}∑e∈EsXse,min | (2) |
The atmospheric-vacuum distillation unit is the leading device in refinery enterprises. With crude oil as the main raw material, the output of each side of the atmospheric vacuum device is determined by the amount of processed crude oil and the yield of each fraction of crude oil after distillation. αcye,min,mout is the yield of the fraction mout corresponding to the crude oil min∈Mcy. For each atmospheric-vacuum distillation unit, the amount of material in and out should meet the following requirements:
Xcye,mout=∑min∈Mcyαcye,min,moutXcye,min:=∑min∈McyXcye,min,mout,∀e∈Ecy,(e,min)∈IM,(e,mout)∈OM | (3) |
The secondary unit is a general term for other processing units in refinery enterprises except for the atmospheric-vacuum distillation unit, including residual oil hydrogenation, catalytic cracking, catalytic reforming, hydrocracking, delayed coking, and other types. A set of secondary devices can have many production schemes, where the production process and the nature of raw materials determine each production scheme of raw material consumption and product yield. The delta-base structure of the secondary device should be established to describe the above process accurately [25,26].
Xece,p=∑min∈MecXece,min,p,∀e∈Eec,(e,min)∈IM | (4) |
Xece,mout=∑p∈Pηe,p,moutXece,p+∑(p,d,min,q)γe,p,d,min(Ymin,q−δe,p,d,min,q)Xece,p,∀(e,mout)∈OM | (5) |
where P is the set of alternative processing options, q is the quality attribute, d is the delta-base, ηe,p,mout is the benchmark yield of material m processed by scheme p of refinery unit e, δe,p,d,min,q is the reference value of the quality attribute of feed, and γe,p,d,min is the change rate of the product yield with the feed's quality attribute. The above constraints indicate that the product yield is based on the base and can change with the feed's quality attribute.
The feed of the atmospheric-vacuum distillation unit and the secondary device is usually mixed with multiple strands of materials with different properties. Limited by the production process, the properties of mixed raw materials should meet upper and lower ranges. Additionally, gasoline, diesel, and other final products produced by refinery enterprises are usually mixed with various components. The mixed product properties should meet specific upper and lower limits to meet national or industrial standards. In this paper, the above mixing processes are collectively referred to as blending and are characterized by a virtual device called blending pools. For each blending pool, the amount of material in and out should meet the following constraints:
Xthe,mout=∑minXthe,min,∀e∈Eth | (6) |
The processing capacity of the device defines the maximum and minimum processing capacities of the production device. The device is not allowed to operate beyond the upper or lower capacities in the actual production process to ensure safe production.
In this paper, the processing capacity set of the device is denoted by H and Hs is the processing capacity set of all devices in link s. The upper and lower limits of processing capacity h of device e are denoted as ¯Jsh, Jsh_. Generally, the consumption of primary raw materials characterizes the processing capacity of a device, then for each device, the processing capacity required for processing all major raw materials should not exceed the upper and lower limits; that is, it must meet the following constraints:
¯Jsh≥∑minXse,min≥Jsh_, ∀s∈{cy,ec},∀h∈Hs,e∈Es,(e,min)∈IM | (7) |
Since the quality attribute calculation between the lateral line and the blending discharge is similar, the blending equation is adopted to characterize the quality attribute calculation. Specifically, for the atmospheric-vacuum distillation unit, the quality attribute of one lateral line is equal to the weighted average of the quality attribute of the lateral line produced by each processed crude oil. For the blending pooling, the quality attributes of the discharge are equal to the weighted average of the quality attributes of each feed.
In this paper, Q is the set of quality attributes and Ysm,q is the q value of the quality attribute of material m in link s. The set of quality attributes satisfying the blending relation of the weight is denoted as Qweight and the set of quality attributes satisfying the volume blending relation is Qvolume. The quality attribute calculation in the blending process should satisfy the following equality constraints:
Ysmout,q∑e∈EsXse,mout=∑(e,min)Xse,min,moutΓsq(Ye,min,q),∀q∈Qweight | (8) |
Ysmout,q∑e∈EsZse,mout=∑(e,min)Zse,min,moutΓsq(Ye,min,q),∀q∈Qvolume | (9) |
Ze,moutYe,mout,ρ=Xse,mout | (10) |
Ze,min,moutYe,min,ρ=Xse,minmout | (11) |
where Ye,m,ρ is the material density. The introduction of variable volume Z instead of a fractional expression (volume = weight/density) reduces the nonlinear constraints. Γsq(Y) is the q value of the quality attribute after link s. If the quality attributes conform to a linear blending law, Γsq(Y)=Y; otherwise, this function is determined by the specific physical law.
According to the requirements of the factory standards or the device's tolerance to the raw materials, the physical properties of the blended materials should meet specific upper and lower limits. ¯Ysm,q and Ysm,q_ are the upper and lower limits of the q value of the quality attribute of material m in link s. The material's physical value should meet the following constraints:
Y_smout,q⩽Ysmout,q⩽¯Ysmout,q,∀s∈{cy,th},e∈Es,∀q∈Q | (12) |
The nature of the secondary plant discharge, the primary feed source for the blending pool, usually varies with the processed raw material nature. It is necessary to establish the quality attribute transfer structure of the secondary device to describe the above process accurately [25,26]:
Yecmout,q=∑(e,min)ae,min,mout,qYecmin,q+be,min,mout,q | (13) |
where ae,min,mout,q and be,min,mout,q are the transfer coefficients of the transfer equation of the quality attribute q between the feed min and the discharge mout of secondary device e. Physical properties in secondary devices are not subject to upper and lower limits.
The utility system is a general term for auxiliary facilities to maintain the normal operation of refinery production and processing equipment, also known as supporting works, usually covering the water supply and drainage system, power supply system, compressed air system, steam power system, and wind power system. The production and consumption of the utility system occupy the main variable processing cost of the refinery, which should be modeled and optimized. To reflect the production and marketing process of the refinery utility system, the structures of procurement, utility sales and production, and consumption of the utility system are established in the optimization model of the refinery planning. Common utility systems include fresh water, recycled water, desalted water, deoxygenated water, power, steam, industrial air, instrument air, nitrogen, fuel gas, and fuel oil. In this scenario, the utility system is produced and consumed only in the atmospheric-vacuum distillation unit and secondary plant. The output or consumption of the utility system and the material consumption of the process are expressed with linear relations:
Xcye,g=∑min∈McyXcye,minσcye,g, ∀e∈Ecy, (e,min)∈Icy,g∈G | (14) |
Xece,g=∑min∈McyXece,minσece,g, ∀e∈Eec, (e,min)∈Iec,g∈G | (15) |
where σ represents the correspondence between the produced or consumed utility system and the number of processed materials.
The utility system of the whole plant should balance the output and consumption:
∑e∣(e.gin)∈IGXse,gin=∑e∣(e.gout)∈OGXse,gout | (16) |
In practice, raw material procurement and finished product sales should be within a given upper and lower range:
ˉXsm⩾Xsm⩾X_sm,∀m∈Ms,s∈{gm,xs} | (17) |
The set of the utility system to be procured is Ggm and the set of the utility system available for sale is Gxs. The procurement and sales volume of the utility system should meet the upper and lower limits:
ˉXsg⩾∑e∈EgyXcye,g+∑e∈EgyXece,g⩾X_sg,∀g∈Gs,s∈{gm,xs} | (18) |
Accordingly, the optimization model for this problem is established. The solution algorithm is presented in the next section.
To facilitate the discussion of algorithm design, the optimization model is summarized in the following form:
(P)maxXaX+bs.t.f1(X)=0f2(X)⩽0h1(Y)=0h2(Y)⩽0g1(X,Y)=0X∈R+,Y∈R |
where a and b are parameters in Eq (1); the decision variable X corresponds to Xsm, Xse,m, Xse,m,p, Xsg, Xse,g in the model; the decision variable Y corresponds to Ysm,q and Yse,m,q in the model; f1 is a linear equality constraint on X corresponding to Eqs (2)–(4), (6) and (14)–(16); f2 is a linear inequality constraint on X corresponding to Eqs (7), (17) and (18); h1 is a linear equality constraint on Y corresponding to Eq (13); h2 is a linear inequality constraint on Y corresponding to Eq (12); and g1 is a nonlinear equality constraint on X and Y corresponding to Eqs (5) and (9)–(11).
The optimization model is nonconvex and nonlinear because the chemical reactions can be generally described with a nonlinear model in actual industrial production, such as the delta-base structure in secondary devices and the quality attribute calculation of blending pools. The above problem coupled with the huge number of raw materials and final products makes it challenging to solve the model. Although many commercial or open-source solvers provide nonconvex optimization model solving, their solving efficiency is insufficient to deal with large industrial optimization problems. Therefore, to reduce the solving time of the model, a high-quality initial solution-finding method is proposed based on the problem structure and actual business logic, then this method is combined with the classical interior point method to solve the problem. The interior point method has a guarantee of convergence efficiency [27,28], especially if the initial solution is good.
The similarity between the initial and optimal solutions can significantly influence the efficiency of the interior point method. This paper generates the initial solution from two linear sub-models, whose solutions are combined to form the initial solution. The proposed algorithm consists of three parts: the material (linear model) for solving the initial value corresponding to model (P2), the solution of initial values of quality attributes (linear model) corresponding to questions (P3), and the entire model corresponding to model (P). Among them, the model (P2) ignores the quality attribute based on the model P. Based on constraints such as the raw material purchasing prices, selling price of the product, upper and lower limits of purchase quantity, and upper and lower limits of sales, material balance, the raw material purchasing amount to maximize revenue, product sales, and the flow distribution between devices are determined. Model (P3) relaxes the nonlinear constraints based on model (P), and to avoid obtaining solutions that are grossly infeasible, we refer to the idea of penalty functions [29]. Additionally, based on the material quantity calculated in the (P2) model, the quality attribute value that meets the quality attribute constraints is calculated. Finally, the model P takes the solutions of (P2) and (P3) as the initial points and employs the interior point method. The (P2) and (P3) models are described as follows:
(P2)maxXaX+bs.t.f1(X)=0f2(X)⩽0X∈R+ |
(P3)minY,SL+1,SL−1SL+1+SL−1s.t.h1(Y)=0h2(Y)⩽0g1(ˆX,Y)+SL+1−SL−1=0SL+1,SL−1∈R+ |
where (P2) is the initial model P without quality attribute variables and constraints; P3 is a model in which the initial model P fixes a certain set of material values and only considers quality attribute constraints. In the model (P3), SL+1 and SL−1 are the positive and negative relaxation variables of function g1, respectively. The relaxation cost is taken as the objective function. Minimizing the relaxation cost ensures the satisfaction of the physical constraints as much as possible. The physical constraints can be satisfied by minimizing the slack cost under the determined raw material, product yield, and flow rate between the devices.
For the complete algorithm framework based on the interior point method, we present the solution approach in the form of the following pseudocode:
Improved interior point method algorithm | |
Initialization: model (P) is established according to actual business scenarios and parameters. | |
1) | Based on model P, the models (P2) and (P3) are generated |
2) | The optimal solution ˆX is obtained by solving model (P2) |
3) | ˆX is kept fixed, and the optimal solution ˆY is obtained by solving model (P3) |
4) | X0←ˆX; Y0←ˆY |
5) | Taking X0 and Y0 as the initial solutions of the interior point method, the model (P) is solved. |
Output: the optimal solution X∗ and Y∗ |
This section employs some actual data to establish the model and applies the above algorithm to solve the model. The simulation results indicate the superiority of the proposed algorithm to commercial solvers.
The examples come from two refiners owned by an oil company. These refiners should consider more than 30 kinds of physical properties when optimizing the production plans, including density, sulfur content, acid content, residual carbon content, metal content, octane number, olefin content, aromatics content, freezing point, and viscosity. This paper selects the refining and petrochemical processes of two refineries A and B for the optimization process. Refinery A contains 36 kinds of physical properties and 79 sets of units, including 3 sets of atmospheric-vacuum distillation units, 50 sets of secondary units, and 26 sets of blending pools. Refinery B contains 54 kinds of physical properties and 58 sets of units, including 2 sets of atmospheric-vacuum distillation units, 40 sets of secondary units, and 16 sets of blending pools. After applying the proposed model, Case 1 (refinery A) has 7229 continuous variables and 3926 constraints, 1827 of which are bilinear. Case 2 (refinery A) has 7230 continuous variables and 3308 constraints, 1851 of which are bilinear. Case 3 (refinery B) includes 5365 continuous variables and 2339 constraints, 379 of which are bilinear. The above information is summarized in Table 3.
Case ID | The number of physical properties | The number of devices | The number of variables | The number of constraints | The number of bilinear constraints |
1 | 22 | 58 | 7229 | 3926 | 1827 |
2 | 36 | 79 | 7230 | 3308 | 1851 |
3 | 22 | 58 | 5365 | 2339 | 379 |
As shown in Table 1, all three examples in the numerical experiment have more than 5000 continuous variables and more than 2000 constraints, many of which are bilinear. Since a nonlinear model with such a scale is extremely challenging for a general solver, this paper selects the Gurobi 9.5.1 for comparative evaluation. It improves the original spatial branch-and-bound algorithm and optimizes the solving efficiency of the pooling problem in the refinery. Gurobi's built-in spatial branch-and-bound algorithm can guarantee global optimality theoretically. The proposed algorithm is evaluated by combining the initial solution module with the interior point method solver IPOPT 3.14.5. The test environment is an Intel 2GHz i5 processor with 16 GB memory and MacOS operating system. The results are displayed in Table 2. For Cases 1 and 2, Gurobi cannot find feasible solutions within 1000 s, while the proposed improved interior point algorithm provides feasible solutions within 1 min. Meanwhile, the results of model 3 indicate that the proposed algorithm only needs 8 s to find a feasible solution, and the objective function value of the algorithm is nearly 10% higher than that obtained by Gurobi. Moreover, for Case 3, the theoretical upper bound of the spatial branch-and-bound is also obtained to evaluate the optimality of the proposed algorithm. The difference between the objective function value and the theoretical optimal value is less than or equal to 2.3%.
Case ID | Objective function_solver (RMB) | Upper limit of the objective function_solver (RMB) | Objective function_ algorithm (RMB) | Solution time_solver (s) | Solution time_algorithm (s) |
1 | —— | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | 34, 326.95 | 38, 700.55 | 37, 801.59 | 1000 | 7.8 |
Furthermore, in the experimental process, this paper also verifies the improvement degree of the initial solution module to the solving efficiency of the interior point method. As shown in Table 3, when the initial solution is not set in Cases 1–3 while directly employing the interior point method to solve the problem, a feasible solution cannot be obtained within 1000 s. It can be concluded that the designed initial solution module significantly improves the computational efficiency of the overall interior point method.
Case ID | Objective function _without solver (RMB) | Objective function _solver (RMB) | Solution time _ without solver (s) | Solution time _ solver (s) |
1 | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | —— | 37, 801.59 | 1000 | 7.8 |
This paper employed the traditional P model to formulate the pooling structure in the complex refinery material flow network. Furthermore, an algorithm framework composed of an initial solution strategy and interior point method was designed to obtain and improve the efficiency of the solution. The main conclusions are as follows:
a) Compared with the commercial solver (Gurobi), the proposed solution approach can produce high-quality feasible solutions of the instances we adopt in 1 minute, increasing the revenue of the refinery plant by nearly 10%.
b) The experimental results demonstrate robustness, which improves the stability of the solution under complex scenarios with differences.
c) Although we can generate satisfactory solutions in a reasonable time, there is still much work to improve efficiency and optimality in the initial points generation strategy.
The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.
The authors declare there is no conflict of interest.
[1] | M. Ali, Pooling problem: Modeling, global optimization and computational studies survey, J. Comput. Appl. Math., (2021), 478. |
[2] |
C. A. Haverly, Studies of the behavior of recursion for the pooling problem, Acm Sigmap Bull., 25 (1978), 19–28. https://doi.org/10.1145/1111237.1111238 doi: 10.1145/1111237.1111238
![]() |
[3] |
A. Ben-tal, G. Eiger, V. Gershovitz, Global minimization by reducing the duality gap, Math. Program., 63 (1994), 193–212. https://doi.org/10.1007/BF01582066 doi: 10.1007/BF01582066
![]() |
[4] |
I. Quesada, I. E. Grossmann, Global optimization of bilinear process networks with multicomponent flows, Comput. Chem. Eng., 19 (1995), 1219–1242. https://doi.org/10.1016/0098-1354(94)00123-5 doi: 10.1016/0098-1354(94)00123-5
![]() |
[5] | M. Tawarmalani, N. V. Sahindis, Convexification and global optimization in continuous and mixed-integer nonlinear programming, 2022, Boston, MA: Springer US. https://doi.org/10.1007/978-1-4757-3532-1 |
[6] |
T. Kuno, T. Utsunomiya, A Lagrangian based branch-and-bound algorithm for production-transportation problems, J. Global Optim., 18 (2000), 59–73. https://doi.org/10.1023/A:1008373329033 doi: 10.1023/A:1008373329033
![]() |
[7] |
J. M. Zamora, I. E. Grossmann, A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms, J. Global Optim., 14 (1999), 217–249. https://doi.org/10.1023/A:1008312714792 doi: 10.1023/A:1008312714792
![]() |
[8] |
J. P. Ruiz, I. E. Grossmann, Strengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs, Comput. Chem. Eng., 34 (2010), 914–930. https://doi.org/10.1016/j.compchemeng.2009.10.016 doi: 10.1016/j.compchemeng.2009.10.016
![]() |
[9] |
C. A. Meyer, C. A. Floudas, Global optimization of a combinatorially complex generalized pooling problem, AIChE J., 52 (2006), 1027–1037. https://doi.org/10.1002/aic.10717 doi: 10.1002/aic.10717
![]() |
[10] |
M. L. Bergamini, P. Aguirre, I. Grossmann, Logic-based outer approximation for globally optimal synthesis of process networks, Comput. Chem. Eng., 29 (2005), 1914–1933. https://doi.org/10.1016/j.compchemeng.2005.04.003 doi: 10.1016/j.compchemeng.2005.04.003
![]() |
[11] |
R. E. Griffith, R. A. Stewart, A nonlinear programming technique for the optimization of continuous processing systems, Manage. Sci., 7 (1961), 379–392. https://doi.org/10.1287/mnsc.7.4.379 doi: 10.1287/mnsc.7.4.379
![]() |
[12] |
F. Palacios-Gomez, L. Lasdon, M. Engquist, Nonlinear optimization by successive linear programming, Manage. Sci., 28 (1982), 1106–1120. https://doi.org/10.1287/mnsc.28.10.1106 doi: 10.1287/mnsc.28.10.1106
![]() |
[13] |
T. E. Baker, L. S. Lasdon, Successive linear programming at Exxon, Manage. Sci., 31 (1985), 264–274. https://doi.org/10.1287/mnsc.31.3.264 doi: 10.1287/mnsc.31.3.264
![]() |
[14] |
L. S. Lasdon, A. D. Waren, S. Sarkar, Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms, ACM Sigmap Bull., 27 (1979), 9–15. https://doi.org/10.1145/1111246.1111247 doi: 10.1145/1111246.1111247
![]() |
[15] |
Y. H. Dai, R. Diao, K. Fu, Complexity analysis and algorithm design of pooling problem, J. Oper. Res. Soc. China, 6 (2018), 249–266. https://doi.org/10.1007/s40305-018-0193-7 doi: 10.1007/s40305-018-0193-7
![]() |
[16] |
V. Pham, C. Laird, M. El-Halwagi, Convex hull discretization approach to the global optimization of pooling problems, Ind. Eng. Chem. Res., 48 (2009), 1973. https://doi.org/10.1021/ie8003573 doi: 10.1021/ie8003573
![]() |
[17] |
A. Gupte, S. Ahmed, S. S. Dey, Relaxations and discretizations for the pooling problem, J. Global Optim., 67 (2017), 631–669. https://doi.org/10.1007/s10898-016-0434-4 doi: 10.1007/s10898-016-0434-4
![]() |
[18] | M. Alfaki, D. Haugland, Comparison of discrete and continuous models for the pooling problem. in 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, 2011. https://doi.org/10.4230/OASIcs.ATMOS.2011.112 |
[19] |
C. A. Floudas, A. Aggarwal, A decomposition strategy for global optimum search in the pooling problem, ORSA J. Comput., 2 (1990), 225–235. https://doi.org/10.1287/ijoc.2.3.225 doi: 10.1287/ijoc.2.3.225
![]() |
[20] | How Distributed Recursion Solves the Pooling Problem, 2022. Available from: https://www.haverly.com/kathy-blog/578-blog-4-howdrsolvespooling. |
[21] | Y. R. He, H. Zhang, Solution of pooling problem in planning model with distributed recursive method, Pet. Process. Petrochem., 27 (1996), 4. |
[22] | Y. R. He, J. Z. Xie, Application cases of refinery's production and operation plan optimization, Beijing: China Petrochemical Press, 2018. |
[23] |
A. Wachter, L. T. Biegler, Failure of global convergence for a class of interior point methods for nonlinear programming, Math. Program., 88 (2000), 565–574. https://doi.org/10.1007/PL00011386 doi: 10.1007/PL00011386
![]() |
[24] |
A. Wachter, L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. Program., 106 (2006), 25–57. https://doi.org/10.1007/s10107-004-0559-y doi: 10.1007/s10107-004-0559-y
![]() |
[25] | J. B. Guo, M. S. Yang, Chemical industry's production planning and scheduling optimization, Beijing: Chemical Industry Press, 2006. |
[26] | J. B. Guo, Linear programming technique in petroleum sector: a review, Comput. Appl. Chem., 21 (2004), 1–5. |
[27] |
R. H. Byrd, M. E. Hribar, J. Nocedal, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim., 9 (1999), 877–900. https://doi.org/10.1137/S1052623497325107 doi: 10.1137/S1052623497325107
![]() |
[28] |
O, Güler, Barrier functions in interior point methods, Math. Oper. Res., 21 (1996), 860–885. https://doi.org/10.1287/moor.21.4.860 doi: 10.1287/moor.21.4.860
![]() |
[29] |
G. D. Pillo, L. Grippo, Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27 (1989), 1333–1360. https://doi.org/10.1137/0327068 doi: 10.1137/0327068
![]() |
Case ID | The number of physical properties | The number of devices | The number of variables | The number of constraints | The number of bilinear constraints |
1 | 22 | 58 | 7229 | 3926 | 1827 |
2 | 36 | 79 | 7230 | 3308 | 1851 |
3 | 22 | 58 | 5365 | 2339 | 379 |
Case ID | Objective function_solver (RMB) | Upper limit of the objective function_solver (RMB) | Objective function_ algorithm (RMB) | Solution time_solver (s) | Solution time_algorithm (s) |
1 | —— | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | 34, 326.95 | 38, 700.55 | 37, 801.59 | 1000 | 7.8 |
Case ID | Objective function _without solver (RMB) | Objective function _solver (RMB) | Solution time _ without solver (s) | Solution time _ solver (s) |
1 | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | —— | 37, 801.59 | 1000 | 7.8 |
Case ID | The number of physical properties | The number of devices | The number of variables | The number of constraints | The number of bilinear constraints |
1 | 22 | 58 | 7229 | 3926 | 1827 |
2 | 36 | 79 | 7230 | 3308 | 1851 |
3 | 22 | 58 | 5365 | 2339 | 379 |
Case ID | Objective function_solver (RMB) | Upper limit of the objective function_solver (RMB) | Objective function_ algorithm (RMB) | Solution time_solver (s) | Solution time_algorithm (s) |
1 | —— | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | 34, 326.95 | 38, 700.55 | 37, 801.59 | 1000 | 7.8 |
Case ID | Objective function _without solver (RMB) | Objective function _solver (RMB) | Solution time _ without solver (s) | Solution time _ solver (s) |
1 | —— | 85, 920.37 | 1000 | 16.73 |
2 | —— | 1, 443, 410.4 | 1000 | 63.75 |
3 | —— | 37, 801.59 | 1000 | 7.8 |