针对炼油厂系统性运营优化问题的混合分布递归及分支定界算法

doi:10.15960/j.cnki.issn.1007-6093.2025.04.012

运筹学学报（中英文） ›› 2025, Vol. 29 ›› Issue (4): 141-158.doi: 10.15960/j.cnki.issn.1007-6093.2025.04.012

• • 上一篇

针对炼油厂系统性运营优化问题的混合分布递归及分支定界算法

孙鑫^1,2, 葛冬冬^3,†, 付德生⁴, 魏志伟^1,2, 董丰莲^1,2, 潘师畅³

1. 中国石油天然气股份有限公司规划总院, 北京 100086;
2. 中国石油天然气集团有限公司油气业务链优化重点实验室, 北京 100086;
3. 上海交通大学安泰经济与管理学院, 上海 200030;
4. 中国石油天然气集团有限公司生产经营管理部, 北京 100007

收稿日期:2023-11-08 发布日期:2025-12-11
通讯作者: 葛冬冬 E-mail:ddge@sjtu.edu.cn

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

SUN Xin^1,2, GE Dongdong^3,†, FU Desheng⁴, WEI Zhiwei^1,2, DONG Fenglian^1,2, PAN Shichang³

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:2023-11-08 Published:2025-12-11

摘要/Abstract

摘要： 炼油厂运营优化问题是原油产业链中非常重要的问题, 在学术界和工业界都有非常多的研究和应用。一般而言, 炼油厂优化问题会被建模为混合非线性整数规划问题(MINLP)。由于原油品种和相关产品繁多并且加工装置复杂多样, 所以变量维度较大。并且在具体的加工过程中涉及物料物性变化和加工规则, 从而产生非凸非线性和整数约束, 使得问题求解难度变大。目前学术界研究主要针对小规模问题或者运营流程的子系统进行建模求解, 并且求解方法集中在使用商用求解器, 如GAMS环境中的BARON、DICOPT等。本文针对炼厂优化的MINLP提出了一种混合分布递归和分支定界算法(Hybrid-DRBB), 分别对非线性约束和整数约束进行松弛和求解, 从而得到原问题的近似最优解。在实际的工业场景大规模数据中, 本文的算法速度被证实优于直接调用求解器的建模求解方式。

关键词: 炼厂运营优化, 混合非线性整数规划, 分布递归算法, 分支定界算法

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

中图分类号:

O221.2

孙鑫, 葛冬冬, 付德生, 魏志伟, 董丰莲, 潘师畅. 针对炼油厂系统性运营优化问题的混合分布递归及分支定界算法[J]. 运筹学学报（中英文）, 2025, 29(4): 141-158.

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

参考文献

[1] Darby M L, Nikolaou M. MPC: Current practice and challenges [J]. Control Engineering Practice, 2012, 20(4): 328-342.
[2] Bodington C E, Baker T E. A history of mathematical programming in the petroleum industry [J]. Interfaces, 2019, 20(4): 117-127.
[3] Lasdon L S, Joffe B. The Relationship Between Distributive Recursion and Successive Linear Programming in Refining Production Planning Models [M]. Washington: National Petroleum Refiners Association, 1990.
[4] Haverly C A. Studies of the behavior of recursion for the pooling problem [J]. ACM Sigmap Bulletin, 1978, 25: 19-28.
[5] Ben-Tal A, Eiger G, Gershovitz V. Global minimization by reducing the duality gap [J]. Athematical Programming, 1994, 63(1-3): 193-212.
[6] Quesada I, Grossmann I E. Global optimization of bilinear process networks with multicomponent flows [J]. Computers & Chemical Engineering, 1995, 19(12): 1219-1242.
[7] Pinto J M, Moro L F L. A planning model for petroleum refineries [J]. Brazilian Journal of Chemical Engineering, 2000, 17: 575-586.
[8] Pitty S S, Li W K, Adhitya A, et al. Decision support for integrated refinery supply chains: Part 1. Dynamic simulation [J]. Computers & Chemical Engineering, 2008, 32(11): 2767-2786.
[9] Koo L Y, Adhitya A, Srinivasan R, et al. Decision support for integrated refinery supply chains: Part 2. Design and operation [J]. Computers & Chemical Engineering, 2008, 32(11): 2787-2800.
[10] Rocha R, Grossmann I E, Poggi de Aragão M, et al. Petroleum allocation at PETROBRAS: Mathematical model and a solution algorithm [J]. Computers & Chemical Engineering, 2009, 33(12): 2123-2133.
[11] Neiro S M, Pinto J. Multiperiod optimization for production planning of petroleum refineries [J]. Chemical Engineering Communications, 2005, 192(1): 62-88.
[12] Mouret S, Grossmann I E, Pestiaux P. 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] Alattas A M, Grossmann I E, Palou-Rivera I. Refinery production planning: Multiperiod MINLP with nonlinear CDU model [J]. Industrial & Engineering Chemistry Research, 2012, 51(39): 12852-12861.
[14] Castillo C P, Castro P M, Mahalec V. Global optimization algorithm for large-scale refinery planning models with bilinear terms [J]. Industrial & Engineering Chemistry Research, 2017, 56(2): 530-548.
[15] Lotero I, Trespalacios F, Grossmann I 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] Demirhan C D, Boukouvala F, Kim K 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] Boucheikhchoukh A, Berger V, Swartz C L E, et al. Multiperiod refinery optimization for mitigating the impact of process unit shutdowns [J]. Computers & Chemical Engineering, 2022, 164: 107873.
[18] Dechter R, Pearl J. Generalized best-first search strategies and the optimality of A? [J]. Journal of the ACM, 1985, 32(3): 505-536.
[19] Morrison D R, Sauppe J J, Zhang W 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] Naddef D. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP [J]. The Traveling Salesman Problem and Its Variations, 2007: 29-116.
[21] Achterberg T, Koch T, Martin A, et al. Branching rules revisited [J]. Operations Research Letters, 2005, 33(1): 42-54.
[22] Bénichou M, Gauthier J M, Girodet P, 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] Pryor J, Chinneck J W. Faster integer-feasibility in mixed-integer linear programs by branching to force change [J]. Computers & Operations Research, 2011, 38(8): 1143-1152.
[25] Gendron B, Khuong P V, Semet F. 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] Bertacco L, Fischetti M, Lodi A. A feasibility pump heuristic for general mixed-integer problems [J]. Discrete Optimization, 2007, 4(1): 63-76.
[27] Büdenbender K, Grünert T, Sebastian H. 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.

针对炼油厂系统性运营优化问题的混合分布递归及分支定界算法

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价