Scheduling of Crude Oil Operations Under Uncertainty: A Robust Optimization Framework Coupled with Global Optimization

Wednesday, October 19, 2011: 1:50 PM
101 D (Minneapolis Convention Center)
Jie Li, Ruth Misener and Christodoulos A. Floudas, Department of Chemical and Biological Engineering, Princeton University, Princeton, NJ

Scheduling of crude oil operations is an important component of overall refinery operations, because crude oil costs account for about 80% of the refinery turnover. Optimal crude oil scheduling can increase profits by exploiting cheaper but poor quality crudes, minimizing crude changeovers, avoiding ship demurrage, and managing crude inventory optimally. The mathematical modeling of blending different crudes in storage tanks results in many bilinear terms, which transform the problem into a challenging, nonconvex, mixed integer nonlinear programming (MINLP) optimization model.

The crude oil scheduling problem has received considerable attention with researchers developing different models based on discrete- and continuous-time representations [1]. In our previous work [1], we have developed a novel unit-specific event-based continuous-time MINLP formulation, and have proposed a branch and bound global optimization algorithm with piecewise-linear underestimation of the bilinear terms for this problem. The proposed model incorporated many realistic operational features such as single buoy mooring (SBM), multiple jetties, multi-parcel vessels, crude blending, brine settling, crude segregation, and fifteen important volume-based or weight-based crude property indices, and significantly reduced the number of bilinear terms and problem size compared to the discrete-time formulation of Reddy et al. [2] and Li et al. [3]. The proposed branch and bound global optimization algorithm resulted in better integer feasible solutions, which were guaranteed to be within 2% of global optimality.

All of the aforementioned models assume that the parameters used in the models are deterministic in nature. However, frequent uncertainties in practice are unavoidable such as demand fluctuations, ship arrival delays, crude quality specification variations, uncertainty on crude profit margin, demurrage cost, inventory cost, changeover cost and safety stock penalty, and equipment malfunction, and tank unavailability. In the presence of these uncertainties, an optimal crude schedule obtained using nominal parameter values may often be suboptimal or even become infeasible. In general, two approaches can be used to address those uncertainties: reactive scheduling and preventative scheduling [4]. For detailed reviews on planning and scheduling under uncertainty, the reader is directed to Li and Ierapetritou [5], and Verderame et al. [4]

Robust optimization focuses on developing preventive models to minimize the effects of uncertainties on the performance measure such as profit, and operating cost. Its main objective is to ensure that the generated solutions are robust, while maintaining a high level of solution quality. Li et al. [6] developed scenario-based models for demand and ship arrival uncertainties separately. However, the number of scenarios exponentially increases with the number of uncertain parameters, and hence makes their model intractable for practical problems with large number of uncertain parameters. Cao et al. [7] proposed an optimization model based on chance constrained programming to generate robust schedules under demand uncertainty during scheduling of crude oil operations. However, their approach cannot be used to deal with uncertain parameters following a discrete probability distribution [8]. More importantly, their approach results in composition discrepancy. Recently, Wang and Rong [8] developed a two-stage robust optimization model for crude oil scheduling problem to address demand and ship arrival uncertainty separately. Although their model can cope with a wide variety of uncertainties, the generated schedule from their model also results in composition discrepancy. Most importantly, these approaches cannot ensure the generated solution to be feasible for the nominal parameters.

In this paper, we extend the robust optimization framework proposed by Lin et al. [9], Janak et al. [10], Verderame and Floudas [11-13] and Li et al. [14] to develop a deterministic robust counterpart optimization model for demand and ship arrival uncertainty during crude oil scheduling operations. The robust solution from the robust optimization framework is guaranteed to be feasible for the nominal parameters. The recently proposed branch and bound global optimization algorithm with piecewise-linear underestimation of bilinear terms by Li et al. [1] is also extended to solve the non-convex MINLP deterministic robust counterpart optimization model and generate robust schedules. Two examples are used to illustrate the capability of the proposed robust optimization approach and the extended branch and bound global optimization algorithm. The computational results demonstrate that the obtained schedules are robust in the presence of demand and ship arrival uncertainty.

References

[1] Li J, Misener R, Floudas CA. Continuous-time modeling and global optimization approach for scheduling of crude oil operations. AIChE Journal, In press, 2011.

[2] Reddy PCP, Karimi IA, Srinivasan R. Novel solution approach for optimization crude oil operations. AIChE Journal. 2004, 50: 1177-1197.

[3] Li J, Li WK, Karimi IA, Srinivasan R. Improving the robustness and efficiency of crude scheduling algorithms. AIChE Journal. 2007, 53: 2659-2680.

[4] Verderame PM, Elia JA, Li J, Floudas CA. Planning and scheduling under uncertainty: A review across multiple sections. Industrial and Engineering Chemistry Research. 2010; 49: 3993-4017.

[5] Li Z, Ierapetritou M. Processing scheduling under uncertainty: Review and challenges. Computers and Chemical Engineering. 2008; 32: 715-727.

[6] Li J, Karimi IA, Srinivasan R. Robust scheduling of crude oil operations under demand and ship arrival uncertainty. Presented at the AIChE Annual Meeting, San Francisco, CA, Nov. 12-17, 2006.

[7] Cao CW, Gu XS, Xin Z. Chance constrained programming models for refinery short-term crude oil scheduling problem. Appl. Math. Model. 2009; 33: 1696-1707.

[8] Wang JS, Rong G. Robust optimization model for crude oil scheduling under uncertainty. Ind. Eng. Chem. Res. 2010; 49: 1737-1748.

[9] Lin X, Janak SL, Floudas CA. A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertainty. Computers and Chemical Engineering. 2004; 28: 1069-1085.

[10] Janak SL, Lin X, Floudas CA. A new robust optimization approach for scheduling under uncertainty. II. Uncertainty with known probability distribution. Computers and Chemical Engineering. 2007: 31: 171-195.

[11] Verderame PM, Floudas CA. Operational planning of large-scale industrial batch plants under demand due date and amount uncertainty. I. Robust optimization framework. Industrial and Engineering Chemistry Research. 2009; 48: 7214-7231.

[12] Verderame PM, Floudas CA. Integration of operational planning and medium-term scheduling for large-scale industrial batch plants under demand and processing time uncertainty. Industrial and Engineering Chemistry Research. 2010; 49: 4948-4965.

[13] Verderame PM, Floudas CA. Multisite planning under demand and transportation uncertainty: Robust optimization and conditional value at risk framework. Industrial and Engineering Chemistry Research. In Press, 2011. DOI: 10.1021/ie101401k.

[14] Li ZK, Ding R, Floudas CA. A comparative theoretical and computational study on robust counterpart optimization: I. Robust linear optimization and robust mixed-integer linear optimization. Industrial and Engineering Chemistry Research, Submitted for Publication, 2011.

 


Extended Abstract: File Not Uploaded
See more of this Session: Design and Operations Under Uncertainty I
See more of this Group/Topical: Computing and Systems Technology Division