Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms
Jian Yang, Bohang Wang, Lina Wang, Jiacheng Chen, Gaoxiang Tang, Zihan Deng, Wending Zhao, Xianfeng Cai

TL;DR
This paper introduces a hybrid quantum-classical approach using Benders Decomposition to efficiently solve complex, large-scale crude oil scheduling problems that are NP-hard, outperforming traditional heuristics and solvers.
Contribution
It develops a novel hybrid framework that reformulates the discrete scheduling problem as a QUBO for quantum solving, enhancing scalability and solution quality.
Findings
Reduces operating costs by approximately 73--80%.
Achieves computational speeds comparable to Gurobi.
Outperforms traditional metaheuristics like Genetic Algorithms and Tabu Search.
Abstract
The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
