## Servicios Personalizados

## Articulo

## Indicadores

- Citado por SciELO

## Links relacionados

- Citado por Google
- Similares en SciELO
- Similares en Google

## Bookmark

## Latin American applied research

*versión impresa* ISSN 0327-0793

### Lat. Am. appl. res. v.36 n.4 Bahía Blanca oct./dic. 2006

**Langrangean decomposition applied to multiperiod planning of petroleum refineries under uncertainty**

**S. M. S. Neiro ^{1} and J. M. Pinto^{1,2}**

^{1} *Department of Chemical Engineering - University of São Paulo 05508 São Paulo, Brazil Sergio.Neiro@aspentech.com*

^{2}

*Othmer Department of Chemical and Biological Engineering - Polytechnic University, Brooklyn, NY, USA*

jpinto@poly.edu

jpinto@poly.edu

*Abstract* — This work presents a stochastic multiperiod model for representing a petroleum refinery. Uncertainty is taken into account in parameters such as demands, product sale prices and crude oil prices. In the present work, uncertainty is considered as a set of discrete scenarios, each representing a possible shifting of market expectations. Every environment is weighted through an expected probability of occurrence. Previous work revealed that the computational effort of uncertain multiperiod refinery production planning models grows exponentially with the number of time periods and scenarios. Therefore, in order to reduce the computational effort over uncertain long-planning horizons, special techniques must be employed. The proposal is to apply Lagrangean Decomposition, which exploits the block-diagonal structure of the problem, to reduce solution time by decomposing the model on a temporal basis. Solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation solver.

*Keywords* — Lagrangean Decomposition. Uncertainty. Petroleum Refinery. Planning. MINLP.

**I. INTRODUCTION**

Commercial tools that can support the decision making process of production planning of refineries are currently based on linear models that rely on constant yields. This limitation motivated the developed of more accurate representations. One of the first contributions to consider nonlinearity in the production planning is that of Pinto and Moro (2000). According to their proposed framework, every unit is represented as an entity and the complete refinery topology is defined by connecting unit streams. Nonlinearity arises mainly from blending equations and physical properties. Later, Neiro and Pinto (2005) extended the model by accounting for multiple time periods and uncertainty expressed in terms of discrete scenarios.

In order to tackle the large computational effort that results from the size of planning problems, tailored solutions strategies were developed. Ponnambalam et al. (1992) developed an approach that combines the simplex method for linear programming with an interior point method for solving a multiperiod planning model in the oil refinery industry. Neiro and Pinto (2006) developed decomposition methods that are derived from the cross -decomposition theory that prevents the use of master problems. The proposed strategies rely on methods such as Lagrangean decomposition and Lagrangean/surrogate relaxation.

The objective of this paper is to develop efficient solution techniques for multiperiod planning models under uncertainty. The refinery planning model of Neiro and Pinto (2005) with discrete scenarios and corresponding probabilities assigned to the possible market environments is used. The resulting model generates large-scale MINLP problems that are then solved with Lagrangean-based decomposition methods.

**II. PROBLEM STATEMENT**

The problem to be considered concerns a real-world production planning of the REVAP refinery from Petrobras, located in São José dos Campos (SP, Brazil). A broader discussion on refinery models for planning operations can be found in Pinto *et al.* (2000) and Neiro and Pinto (2005). Generally, it is assumed that in each unit intermediate inlet streams are always mixed and intermediate streams that leave any unit may be sent to several destinations. Therefore, there may be mixing (splitting) before (after) each of the units. The refinery may acquire crude oil from different suppliers that are able to provide petroleum types with different properties and purchase prices. The refinery produces several products that present varied demand profiles and selling prices along a planning horizon that is divided into *t* discrete time periods of equal duration, *t* ∈ **T**. In addition, uncertainty for petroleum purchase prices, product selling prices as well as product demands are represented through discrete scenarios, *c* ∈ **C**. Each scenario is weighted according to its occurrence probability as detailed in the following section.

**III. UNCERTAINTY SCENARIO REPRESENTATION**

The main goal of a model that considers uncertainty is to provide a forecast to the planner of how the refinery should perform under several possible scenarios that result from different values of the stochastic parameters. Moreover, it should be noted that solutions do not change depending on the distribution of the probabilities assumed for each scenario. Table 1 shows solutions of an illustrative example in terms of the feedstock selection for three different problems considering a single time period. The first problem considers that a single scenario is feasible, in the second problem two scenarios are possible with the following probability distribution: scenario *c _{1}* with

*prob*= 40% and scenario

_{1}*c*, with

_{2}*prob*= 60%. Finally, in the third problem it is considered that two scenarios are possible with the following probability distribution: scenario

_{2}*c*with

_{1}*prob*= 60% and scenario

_{1}*c*with

_{2}*prob*= 40%. Problems 2 and 3 have the same scenario

_{2}*c*as the only scenario for Problem 1, and scenarios

_{1}*c*are also the same in Problems 2 and 3.

_{2} Table 1 shows that the solution for scenario *c _{1}* is the same regardless of the problem and the same behavior is observed for scenario

*c*. Solutions for the same scenario do not change because the constraints are the same and the only difference concerns the probability parameter of the revenue and costs terms in the objective function. The objective function value should change since each scenario contributes with different probability. So, the multiscenario model returns a weighted objective function based on the probability at which each scenario occurs. More importantly, however, is that the optimization model satisfies the constraints under all different scenarios, as expressed in the model of section 3, which renders a conservative approach for handling uncertainty.

_{2} **Table 1** - Feedstock selection for three problems considering different scenarios

**IV. MATHEMATICAL MODEL**

The following notation is used in the mathematical model:

Indices:

c | scenario |

p | property |

s | stream |

t | time period |

u, u' | unit |

v | operating variable |

Sets:

C | scenarios { c | c = 1, ...,NC } |

PI_{u} | properties of the inlet stream of unit u |

PO_{u,s} | properties of outlet stream s of unit u |

SO_{u} | outlet streams of unit u |

T | time periods { t | t = 1, ...,NT } |

U | units of the refinery complex |

U_{f} | petroleum tanks |

U_{feed} | units that process petroleum |

UI_{u} | units whose outlet streams feed unit u |

UO_{u,s} | units that are fed by stream s of unit u |

U_{p} | product tanks |

US_{u} | ordered pair (u',s) that feeds u |

VO_{u} | operating variables of unit u |

Parameters:

Cb_{u} | pumping cost for unit u |

Cf_{u,t,c} | price of petroleum u at t and under c |

Cinv_{u,t,c} | inventory cost of product u at t and under c |

Cp_{u,t,c} | price of product u at t and under c |

Cr_{u} | fixed operating cost of unit u |

Cv_{u,v} | variable cost for operating variable v of u |

Dem_{u,t,c} | demand of u at t (u ∈ U) under _{p}c |

PF^{L}_{u,t} | LB of inlet property p of unit u |

PF^{U}_{u,t} | UB of inlet property p of unit u |

prob_{t,c} | probability of scenario c at time period t |

Prop_{u,s,p} | static property p of outlet stream s from u |

QF^{L}_{u} | LB for feed flow rate of unit u |

QF^{U}_{u} | UB for feed flow rate of unit u |

Qgain_{u,s} | flow rate gain of outlet stream s of unit u |

Q^{L}_{u,c} | LB for outlet flow rate of unit u under scenario c |

QS^{L}_{u} | LB for outlet flow rate of unit u |

QS^{U}_{u} | UB for outlet flow rate of unit u |

Q^{U}_{u,c} | UB for outlet flow rate of unit u under scenario c |

V^{L}_{u,v} | LB for operating variable v of unit u |

Vol_{u}^{Max} | storing capacity of tank u |

V^{U}_{u,v} | UB for operating variable v of unit u |

Variables:

PF_{u,p,t,c} | property p of the feed stream of unit u at time period t under scenario c |

PS_{u,s,p,t,c} | property p of the outlet stream s at unit u at time period t under scenario c |

QF_{u,t,c} | feed flow rate of unit u at time period t under scenario c |

QS_{u,s,t,c} | outlet flow rate of stream s at unit u at time period t under scenario c |

Q_{u,s,u',t,c} | flow rate of stream s between units u' and u in time period t for scenario c |

Vol_{u,t,c} | inventory level of u at time period t under scenario c |

V_{u,v,t,c} | operating variable v of unit u in time period t under scenario c |

y_{u,t,c} | binary variable that is 1 if petroleum u (u ∈ U) is chosen at _{f}t under scenario c; 0, else. |

The problem is denoted **RMP** (Refinery Multiperiod Planning) and is defined as follows:

(1) |

Subject to:

Constraints on process units:

(2) | |

(3) | |

(4) | |

(5) | |

(6) |

Production balance:

(7) |

Petroleum supply constraint:

(8) |

Operation and product quality specifications:

(9) | |

(10) | |

(11) | |

(12) |

The objective function (1) is defined as the maximization of the revenue obtained by the product sales minus costs related to raw material and operation. The operating cost is a non-linear term that depends on the operating mode of the unit and on the flow rate of the inlet stream. If the unit is operated at its design condition, a base cost that is proportional to the feed flow rate is incurred. Moreover, a proportional cost is incurred, which depends on the value of the deviation variable.

Equation (2) describes mass balances at inlet of unit *u*. Equation (3) denotes the relationship of the product flow rates with the feed flow rate (*QF _{u,t}*), feed properties (

*PF*) and operating variables (

_{u,p,t}*V*) at each time period

_{u,v,t}*t*. Equation (3) is valid for units whose product yields closely depend on the petroleum types, such as atmospheric and vacuum distillation columns. Other units usually operate at constant yields; this implies that the variable

*PF*is replaced by a corresponding constant parameter. Therefore, Eq. (3) becomes linear for these cases. Equation (4) represents the mass balance at the outlet of unit

_{u,p,t}*u*. Equation (5) represents a weighted average that relates properties of the unit feed stream with properties of the inlet streams. There are some cases for which properties must be replaced by mixing indices in order to apply Eq. (5) and some properties must be weighted on a mass basis. In the latter cases, the density of the corresponding stream must multiply every term in the numerator and denominator of Eq. (5). Specific examples of Eqs. (3) and (5) are shown in Neiro and Pinto (2004). Equation (6) shows the general relationship among outlet properties, feed properties and operating variables. The functional form of Eq. (6) depends on the unit, stream and property under consideration. Most of the outlet properties are considered constant values, and therefore only a few are estimated. Those are usually properties that depend on petroleum types, such as sulfur content.

Equation (7) represents the inventory level for product tanks at every time period. Equation (8) bounds outlet flow rate for petroleum tanks that are selected; note that there are binary variables *y _{u,t}* that correspond to the choice of petroleum type

*u*at time period

*t*in order to avoid that insignificant amounts of crude oil are selected ("tea spoons"). Equation (9) refers to unit capacities, whereas Eq. (10) refers to the properties for product tanks. Equation (11) specifies the operating variable range and Eq.(12) defines domain for the optimization variables. It is important to note that the constraints are defined for each time period t and scenario c, and the objective function (1) maximizes profit under all these time periods and scenarios.

Problem RMP is a Mixed Integer Nonlinear Programming (MINLP) model whose main decisions concern the selection of petroleum types to be processed by the refinery at each time period as well as the amount selected for each of them, the processing units operating plan and inventory management of final products along the planning horizon. Examples of application of the planning model in real-world refineries are presented in Neiro and Pinto (2004, 2005).

**V. DECOMPOSITION STRATEGIES**

Neiro and Pinto (2005) have solved Problem **RMP** up to 20 time periods and up to 5 scenarios. Results in Figure 1 show an exponential increase in solution time with the number of time periods, as well as with the number of scenarios. Therefore, in order to solve problems for larger number of time periods and scenarios in reasonable solution time, it is necessary to develop a more efficient solution approach.

**Fig. 1** - Solution time versus number of time periods and scenarios (Neiro and Pinto, 2005)

**Fig. 2** - Structure of model **RMP**

Because Problem **RMP** presents a block structure (see Fig. 2), Lagrangean Decomposition is a suitable approach that can be applied in order to reduce solution time by decomposing and solving smaller problems with respect to the original problem (Guignard and Kim, 1987).

Neiro and Pinto (2006) and Neiro (2004) have presented several different approaches for solving multiperiod planning problems using Lagrangean Decomposition. In this work the idea is to apply similar ideas in which the planning horizon of **T** time periods is decomposed in **T** problems and solved independently. Figure 3 shows a diagram of the general decomposition steps. The algorithm is initialized with a set of Lagrange multipliers; the dual subproblem (**SDλ **) is then solved and provides an upper bound on the full-scale problem and *y* for the primal subproblem (**SP*** _{y}*). The solution of the primal subproblem provides a lower bound (maximization) for the full-scale problem and the Lagrangean multipliers, λ , that are obtained for fixed primal variables, for the dual subproblem. Concerning the convergence test, it checks for bound-improvement and it is based on the observation that solutions of consecutive iterations generated by each of the subproblems are always different, unless the optimal solution is reached. As a result, cycling is prohibited and the algorithm has finite convergence (Van Roy, 1983).

**Fig. 3** - Modified Cross Decomposition Method

A set of different combinations of primal-dual subproblems can be used in the decomposition approach of Fig. 3. In this work, two strategies were tested for the solution of the multiperiod production planning for the single refinery model described in section IV. These basically differ in the way the primal subproblems are solved. Sub-sections A and B show the dual and primal subproblems of **RMP** respectively adopted in the two proposed strategies.

**A. Dual Subproblem of RMP**

Equation (7) can be rewritten as follows:

(13) | |

(14) |

Now, dualizing constraint (14) yields the following objective function:

(15) |

where λ * _{u,t,c}* are the Lagrangean multipliers for constraint (14). Observe also that the inventory variable is used in the first and fifth terms. This procedure leads to the following subproblem for a given time period

*t*and scenario

*c*:

Subproblem **RMPLR**_{t,c}

(16) |

Subject to:

Constraints on process units: Eqs (2-6)

Production balance: Eq (13)

Petroleum supply constraint: Eq (8)

Operation and product quality specifications: Eq (9-12)

For every time period *t* and scenario *c*

Constraints in subproblem **RMPLR*** _{t,c}* are defined similarly to the ones from Section IV; note however that these constraints are solved independently for each time period and scenario. In other words, the problem for each time period and scenario contains only its corresponding set of constraints and therefore these are not indexed in

*t*and

*c*. An upper bound to the optimal solution of (1) is then given as the sum of the optimal objective values that are obtained with each subproblem

**RMPLR**

*over the planning horizon.*

_{t,c}(17) |

where *T* denotes the last time period. However, it may be noted that the duplicated variable only appears on the objective function and therefore would be unbounded; thus, it is substituted by its copy that is bounded at *T*-1. Hence

(19) |

**B. Primal Subproblems of RMP**

Concerning Problem **RMP**, if the inventory variables are fixed at , connection among time periods is also eliminated. Therefore |**T**| independent subproblems can be defined for every time period *t* and scenario *c *as follows:

Subproblem **RMPS**_{t,c}

(20) |

Subject to

Eqs. (2-12)

In (20), denotes a fixed value for the inventory variables. The objective function given by (1) is then equivalent to:

(21) |

Another possible primal subproblem is obtained by solving problem **RMP** with fixed the binary variables to the values obtained with the solution of the dual subproblem presented in section A.

**VI. PROPOSED STRATEGIES**

Fig. 4 presents the modified cross decomposition method of Fig 3 applying the dual and primal subproblems described in the previous section. In this figure, *ZUB ^{k}* and

*ZLB*represent upper and lower bounds in iteration

^{k}*k*, respectively, whereas

*UB*and

*LB*represent global upper and lower bounds, respectively. Other symbols are: The main difference between

**and**

*Strategy 1***is that instead of fixing the binary variables in the primal subproblem as in Strategy**

*Strategy*2**1**, the inventory variables (

*Vol*) are fixed at the values obtained by the dual subproblem.

_{u,t,c} **Fig. 4** - Studied strategies

**VII. RESULTS AND DISCUSSION**

Strategies described in the previous section were used to solve the production planning problem for the REVAP refinery with up to 10 time periods and 5 scenarios. The same problem was solved in Neiro and Pinto (2005) without the use of Lagrangean decomposition. Figure 5 shows the computational solution time of the full-scale Problem **RMP** and of the two proposed strategies. All models and solution algorithms were coded in the GAMS (Brooke *et al.*, 1998) modeling environment. DICOPT++(Viswanathan and Grossmann, 1990) was used to solve the MINLP problems. The NLP subproblems were solved using CONOPT2 (Drud, 1994) and the MILP subproblems were solved with OSL (IBM, 1991) on a PC, Pentium M / 1.6 MHz platform. Table 2 shows the increase in problem size in terms of the number of constraints, continuous variables, binary variables and solution time for the full-scale problem with the increase of the number of time periods and 5 scenarios, which represents the largest instance. Figure 6 shows the comparison of the objective function value obtained through the proposed strategies from that obtained for Problem **RMP** using DICOPT++.

**Fig. 5** - Solution time results for ** Strategies 1** and

**and DICOPT++**

*2* **Table 2** - Statistics of Problem **RMP** as function of the number of time period and 5 scenarios

It can be seen from Fig. 5 that both decomposition strategies showed better performance in comparison with DICOPT++ in terms of computational time. This agrees with the expected behavior that the solution process is improved by solving a set of smaller problems rather than a single large full-scale problem, regardless of the number of scenarios. In Fig. 5*d* it can also be observed that ** Strategy 2** also shows smaller solution times in comparison with those obtained for

**. This can also be explained in terms of the size of the subproblems.**

*Strategy 1***solves smaller MINLP dual subproblems, whereas it deals with larger NLP primal subproblems.**

*Strategy 1***, on the other hand, solves small MINLP problems in terms of both dual and primal subproblems.**

*Strategy 2* Regarding the quality of the solutions, that is, how different the solution found in the full-scale problem and that in the proposed strategies are, the opposite behavior is observed. This analysis is presented in this work in terms of the objective function in Fig. 6 and it can be observed that ** Strategy 1** presents slightly better performance in comparison with

**.**

*Strategy 2*

**Fig. 6** - Comparison between the objective functions obtained by DICOPT++ and by the proposed strategies.

**VIII. CONCLUSIONS**

This paper showed that in order to solve more realistic problems that encompass multiple time periods it is imperative to rely on decomposition techniques. Two decomposition strategies were proposed and have performed very well in the long-range production planning of a petroleum refinery under uncertainty. ** Strategy 1** stands for a dual problem that is given by a Lagrangean relaxed problem and whose primal problem corresponds to the original problem with the binary decision variables fixed to the values obtained with the dual problem. The Lagrangean multipliers are updated at each iteration through the subgradient optimization.

**differs from**

*Strategy 2***only with respect to the primal problem whose fixed decision variables are not the same.**

*Strategy 1***fixes binary variables, whereas**

*Strategy 1***fixes inventory variables. Both strategies showed to be very efficient for problems that consider uncertainty in the way of discrete scenarios.**

*Strategy 2*Moreover, it is important to note that the paper relied on model instances that could be solved by the decomposition as well as the full-scale methods, since the main objective was to compare the computational effort and the quality of the solutions for all approaches.

Although global optimality is not guaranteed (neither it is in the solution of standard MINLP), such methods perform relatively well and can be extended to large-scale problems.

**ACKNOWLEDGMENTS**

The authors acknowledge financial support from FAPESP under grants 98/14384-3, 00/02403-5 and 03/10399-6

**REFERENCES**

1. Brooke, A., D. Kendrick, and A. Meeraus "*GAMS - A User's Guide*", The Scientific Press, San Francisco, CA (1998). [ Links ]

2. Drud, A.S. "CONOPT - A Large Scale GRG Code", *ORSA J. Comp*., 6, 207 (1994). [ Links ]

3. Guignard, M. and S. Kim "Lagrangean Decomposition for integer programming: theory and applications". *Op. Res.*, **21**, 307 (1987). [ Links ]

4. Neiro, S.M.S. "*Integrated planning of production-distribution in petroleum supply chains*", Ph.D. Thesis, University of São Paulo, SP, Brazil (2004). [ Links ]

5. Neiro, S.M.S. and J.M. Pinto "A general modeling framework for the operational planning of petroleum supply chains". *Comp. Chem. Eng.*, **28**, 871 (2004). [ Links ]

6. Neiro, S.M.S. and J.M. Pinto "Multiperiod Optimization for Production Planning of Petroleum Refineries", *Chem. Eng. Comm.*, **192**, 62 (2005). [ Links ]

7. Neiro, S.M.S. and J.M. Pinto "Lagrangean-based Decomposition Techniques Applied to the Long-range Production Planning of Petroleum Refineries", *Comp. Chem. Eng.*, submitted (2006). [ Links ]

8. Pinto, J.M. and L.F.L. Moro "A Planning Model for Petroleum Refineries", *Braz. J. Chem. Eng.*, **17**, 575 (2000). [ Links ]

9. Pinto, J.M., M. Joly and L.F.L. Moro, "Planning and scheduling models for refinery operations". *Comp. Chem. Eng.*, **24**, 2259 (2000). [ Links ]

10. Ponnambalam, K., A.Vannelli and S. Woo "An Interior Point Method Implementation for Solving Large Planning Problems in the Oil Refinery Industry", *Can. J. Chem. Eng.*, **70** (2), 368 (1992). [ Links ]

11. Van Roy, T.J. "Cross Decomposition for Mixed Integer Programming", *Math. Prog.*, **25**, 46 (1983). [ Links ]

12. Viswanathan, J. and I.E. Grossmann "A Combined Penalty Function and Outer-Approximation Method for MINLP Optimization", *Comp. Chem. Eng.*, **14**, 769 (1990). [ Links ]

**Received: January 25, 2006. Accepted for publication: July 15, 2006. Recommended by Editor A. Bandoni.**