A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling
The aim of this paper is to introduce a methodology to solve a large-scale mixed-integer nonlinear program (MINLP) integrating the two main optimization problems appearing in the oil refining industry: refinery planning and crude-oil operations scheduling. The proposed approach consists of using Lagrangian decomposition to efficiently integrate both problems. The main advantage of this technique is to solve each problem separately. A new hybrid dual problem is introduced to update the Lagrange multipliers. It uses the classical concepts of cutting planes, subgradient, and boxstep. The proposed approach is compared to a basic sequential approach and to standard MINLP solvers. The results obtained on a case study and a larger refinery problem show that the new Lagrangian decomposition algorithm is more robust than the other approaches and produces better solutions in reasonable times. (C) 2011 Elsevier Ltd. All rights reserved.
lagrangian decomposition refinery planning crude-oil scheduling mixed-integer nonlinear programming