中文

Operations Research Transactions >

2025 , Vol. 29 >Issue 4: 141 - 158

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2025.04.012

Research Article

A hybrid distribution recursion and branch and bound algorithm for Petroluem refinery optimization problem

  • Xin SUN ,
  • Dongdong GE ,
  • Desheng FU ,
  • Zhiwei WEI ,
  • Fenglian DONG ,
  • Shichang PAN
Expand
  • 1. PetroChina Planning and Engineering Institute, Beijing 100086, China
    2. Laboratory of Oil Gas Business Chain Optimization, China National Petroleum Corporation, Beijing 100086, China
    3. Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China
    4. Production and Operation Management Department, China National Petroleum Corporation, Beijing 100007, China

Received date: 2023-11-08

  Online published: 2025-12-11

Copyright

, 2025, All rights reserved. Unauthorized reproduction is prohibited.
Fold

Abstract

The optimization of refinery operations is a critical issue within the crude oil supply chain, garnering extensive research and application interest across both academic and industrial sectors. Typically, refinery optimization problems are modeled as Mixed Integer Non-Linear Programming (MINLP) problems. The complexity of these problems arises from the vast diversity of crude oil types and their derivative products, coupled with intricate processing procedures. Moreover, specific processing steps involve changes in material properties and rules, introducing non-convex, nonlinear, and integer constraints, which increase the solution-finding difficulty. Currently, academic research primarily focuses on modeling and solving small-scale issues or subsystems of operational processes. Commercial solvers like BARON and DICOPT in GAMS are commonly employed for such tasks. This paper introduces a Hybrid Distribution Recursion and Branch and Bound algorithm (Hybrid-DRBB) for solving MINLP in refinery optimization. This method relaxes and solves nonlinear and integer constraints separately, thereby obtaining near-optimal solutions for the original problem. Through numerical experiments utilizing real-world, large-scale data scenarios, we demonstrate the efficiency of our method in comparison to traditional commercial solvers, highlighting its reduced computational cost and improved solving approach.

Key words： refinery optimization; MINLP; distribution recursion algorithm; branch and bound algorithm

Cite this article

Xin SUN , Dongdong GE , Desheng FU , Zhiwei WEI , Fenglian DONG , Shichang PAN . A hybrid distribution recursion and branch and bound algorithm for Petroluem refinery optimization problem[J]. Operations Research Transactions, 2025 , 29(4) : 141 -158 . DOI: 10.15960/j.cnki.issn.1007-6093.2025.04.012

References

1 DarbyM L,NikolaouM.MPC: Current practice and challenges[J].Control Engineering Practice,2012,20(4):328-342.
2 BodingtonC E,BakerT E.A history of mathematical programming in the petroleum industry[J].Interfaces,2019,20(4):117-127.
3 LasdonL S,JoffeB.The Relationship Between Distributive Recursion and Successive Linear Programming in Refining Production Planning Models[M].Washington:National Petroleum Refiners Association,1990.
4 HaverlyC A.Studies of the behavior of recursion for the pooling problem[J].ACM Sigmap Bulletin,1978,25,19-28.
5 Ben-TalA,EigerG,GershovitzV.Global minimization by reducing the duality gap[J].Athematical Programming,1994,63(1-3):193-212.
6 QuesadaI,GrossmannI E.Global optimization of bilinear process networks with multicomponent flows[J].Computers & Chemical Engineering,1995,19(12):1219-1242.
7 PintoJ M,MoroL F L.A planning model for petroleum refineries[J].Brazilian Journal of Chemical Engineering,2000,17,575-586.
8 PittyS S,LiW K,AdhityaA,et al.Decision support for integrated refinery supply chains: Part 1. Dynamic simulation[J].Computers & Chemical Engineering,2008,32(11):2767-2786.
9 KooL Y,AdhityaA,SrinivasanR,et al.Decision support for integrated refinery supply chains: Part 2. Design and operation[J].Computers & Chemical Engineering,2008,32(11):2787-2800.
10 RochaR,GrossmannI E,Poggi de Arag?oM,et al.Petroleum allocation at PETROBRAS: Mathematical model and a solution algorithm[J].Computers & Chemical Engineering,2009,33(12):2123-2133.
11 NeiroS M,PintoJ.Multiperiod optimization for production planning of petroleum refineries[J].Chemical Engineering Communications,2005,192(1):62-88.
12 MouretS,GrossmannI E,PestiauxP.A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling[J].Computers & Chemical Engineering,2005,35(12):2750-2766.
13 AlattasA M,GrossmannI E,Palou-RiveraI.Refinery production planning: Multiperiod MINLP with nonlinear CDU model[J].Industrial & Engineering Chemistry Research,2012,51(39):12852-12861.
14 CastilloC P,CastroP M,MahalecV.Global optimization algorithm for large-scale refinery planning models with bilinear terms[J].Industrial & Engineering Chemistry Research,2017,56(2):530-548.
15 LoteroI,TrespalaciosF,GrossmannI E,et al.An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem[J].Computers & Chemical Engineering,2016,87,13-35.
16 DemirhanC D,BoukouvalaF,KimK W,et al.An integrated data-driven modeling & global optimization approach for multi-period nonlinear production planning problems[J].Computers & Chemical Engineering,2020,141,107007.
17 BoucheikhchoukhA,BergerV,SwartzC L E,et al.Multiperiod refinery optimization for mitigating the impact of process unit shutdowns[J].Computers & Chemical Engineering,2022,164,107873.
18 DechterR,PearlJ.Generalized best-first search strategies and the optimality of A*[J].Journal of the ACM,1985,32(3):505-536.
19 MorrisonD R,SauppeJ J,ZhangW D,et al.Cyclic best first search: Using contours to guide branch-and-bound algorithms[J].Naval Research Logistics,2017,64(1):64-82.
20 NaddefD.Polyhedral theory and branch-and-cut algorithms for the symmetric TSP[J].The Traveling Salesman Problem and Its Variations,2007,29-116.
21 AchterbergT,KochT,MartinA,et al.Branching rules revisited[J].Operations Research Letters,2005,33(1):42-54.
22 BénichouM,GauthierJ M,GirodetP,et al.Experiments in mixed-integer linear programming[J].Mathematical Programming,1971,1,76-94.
23 Achterberg T. Constraint integer programming[D]. Berlin: Technische Universit?t, 2007.
24 PryorJ,ChinneckJ W.Faster integer-feasibility in mixed-integer linear programs by branching to force change[J].Computers & Operations Research,2011,38(8):1143-1152.
25 GendronB,KhuongP V,SemetF.A Lagrangian-based branch-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints[J].Transportation Science,2016,50(4):1286-1299.
26 BertaccoL,FischettiM,LodiA.A feasibility pump heuristic for general mixed-integer problems[J].Discrete Optimization,2007,4(1):63-76.
27 BüdenbenderK,GrünertT,SebastianH.A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem[J].Transportation Science,2000,34(4):364-380.
28 郭锦标,杨明诗.化工生产计划与调度的优化[M].北京:化学工业出版社,2006.
29 郭锦标.线性规划技术在石油化工行业的应用——生产计划优化的历史、现状[J].计算机与应用科学,2004,21(1):1-5.
Options
Outlines

/

〈 〉