This article presents a numerical method based on quantum computing to solve two unresolved key issues for alkali–surfactant–polymer (ASP) flooding in oil exploitation: uncertainties affecting development planning and a switch control regarding injection oil wells. First, a fuzzy multi-objective mixed-integer optimal control model describing the mechanism of ASP flooding is established. Then, an improved possibilistic programming algorithm is presented to remove fuzziness and transform the model into a deterministic single-objective mixed-integer nonlinear programming (MINLP) model. On this basis, a bi-level quantum computing algorithm including quantum annealing and quantum ant colony algorithm is proposed to solve the MINLP and acquire the optimal mixed-integer control variables. The superiority of the proposed algorithm is verified by testing a number of benchmark examples. Finally, the numerical method based on quantum computing is adopted to solve successfully a mixed-integer optimal control problem for ASP flooding under uncertainty.
This article presents a numerical method based on quantum computing to solve two unresolved key issues for alkali–surfactant–polymer (ASP) flooding in oil exploitation: uncertainties affecting development planning and a switch control regarding injection oil wells. First, a fuzzy multi-objective mixed-integer optimal control model describing the mechanism of ASP flooding is established. Then, an improved possibilistic programming algorithm is presented to remove fuzziness and transform the model into a deterministic single-objective mixed-integer nonlinear programming (MINLP) model. On this basis, a bi-level quantum computing algorithm including quantum annealing and quantum ant colony algorithm is proposed to solve the MINLP and acquire the optimal mixed-integer control variables. The superiority of the proposed algorithm is verified by testing a number of benchmark examples. Finally, the numerical method based on quantum computing is adopted to solve successfully a mixed-integer optimal control problem for ASP flooding under uncertainty.
Mixed Integer Linear Programming (MILP) can be considered the backbone of the modern power system optimization process, with a large application spectrum, from Unit Commitment and Optimal Transmission Switching to verifying Neural Networks for power system applications. The main issue of these formulations is the computational complexity of the solution algorithms, as they are considered NP-Hard problems. Quantum computing can give a direct solution to this problem, as it has been experimentally shown that it can provide significant speedups in solving MILPs. In this work, we present a general framework for solving power system optimization problems with a Quantum Computer (QC), which leverages mathematical tools and QCs’ sampling ability to provide accelerated solutions. Our guiding applications are the optimal transmission switching and the verification of neural networks trained to solve a DC Optimal Power Flow. Specifically, using an accelerated version of Benders Decomposition , we split a given MILP into an Integer Master Problem and a linear Subproblem and solve it through a hybrid “quantum-classical” approach, getting the best of both worlds. We provide 2 use cases, and benchmark the developed framework against other classical and hybrid methodologies, to demonstrate the opportunities and challenges of hybrid quantum-classical algorithms for power system mixed integer optimization problems.
Mixed Integer Linear Programming (MILP) can be considered the backbone of the modern power system optimization process, with a large application spectrum, from Unit Commitment and Optimal Transmission Switching to verifying Neural Networks for power system applications. The main issue of these formulations is the computational complexity of the solution algorithms, as they are considered NP-Hard problems. Quantum computing has been tested as a potential solution towards reducing the computational burden imposed by these problems, providing promising results, motivating the can be used to speedup the solution of MILPs. In this work, we present a general framework for solving power system optimization problems with a Quantum Computer (QC), which leverages mathematical tools and QCs' sampling ability to provide accelerated solutions. Our guiding applications are the optimal transmission switching and the verification of neural networks trained to solve a DC Optimal Power Flow. Specifically, using an accelerated version of Benders Decomposition , we split a given MILP into an Integer Master Problem and a linear Subproblem and solve it through a hybrid ``quantum-classical'' approach, getting the best of both worlds. We provide 2 use cases, and benchmark the developed framework against other classical and hybrid methodologies, to demonstrate the opportunities and challenges of hybrid quantum-classical algorithms for power system mixed integer optimization problems.
This paper addressed the computational challenges of solving large-scale fuzzy 0-1 Integer Linear Programming (ILP) problems by proposing a Fuzzy-Hybrid Quantum-Classical Optimization Algorithm (F-HQCOA).The novel approach employed α-cut based transformations to convert fuzzy ILP models into a family of crisp Quadratic Unconstrained Binary Optimization (QUBO) problems, which were then solved using hybrid quantumclassical techniques.Unlike multi-objective formulations, the proposed framework performed a parametric analysis over α-levels to generate a spectrum of solutions that reflected trade-offs between objective optimality and feasibility satisfaction under uncertainty.The degree of satisfaction (µ) was adopted as an evaluation metric to assess solution quality rather than as an independent optimization objective.The method was evaluated on fuzzy Multi-Dimensional Knapsack and Set Covering problems.Results showed that the proposed approach could efficiently handle larger instances and provided a diverse set of solutions across α-levels.While quantum-assisted methods demonstrated reduced Time-to-Solution (TTS) in certain settings, comparisons were presented with careful consideration of differences in computational paradigms.The proposed framework offers a practical decision-support tool for optimization under uncertainty and establishes a foundation for future extensions toward true multi-objective fuzzy quantum optimization.
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to solve unconstrained binary programming problems, while mixed-integer linear programming is of most interest in practice. We attempt to bridge the gap between the capability of quantum computing and real-world applications by developing a new approach for mixed-integer programming. The approach applies Benders decomposition to decompose the mixed-integer programming into binary programming and linear programming sub-problems, which are solved by a noisy intermediate-scale quantum processor and conventional processor, respectively. The algorithm is provably able to reach the optimal solution of the original mixed-integer programming problem. The algorithm is tested on a D-Wave 2000Q quantum processing unit and is shown to be effective for small-scaled test cases. We also test the algorithm on a mixed-integer programming inspired by power system applications. Many insights are drawn from the numerical results for both the capabilities and limitations of the proposed algorithm.
Quantum computing (QC) holds great promise to open up a new era of computing and has been receiving significant attention recently. To overcome the performance limitations of near-term QC, utilizing the current quantum computers to complement classical techniques for solving real-world problems is of utmost importance. In this paper, we develop QC-based solution strategies that exploit quantum annealing and classical optimization techniques for solving large-scale scheduling problems in manufacturing systems. The applications of the proposed algorithms are illustrated through two case studies in production scheduling. First, we present a hybrid QC-based solution approach for the job-shop scheduling problem. Second, we propose a hybrid QC-based parametric method for the multi-purpose batch scheduling problem with a fractional objective. The proposed hybrid algorithms can tackle optimization problems formulated as mixed-integer linear and mixed-integer fractional programs, respectively, and provide feasibility guarantees. Performance comparison between state-of-the-art exact and heuristic solvers and the proposed QC-based hybrid solution techniques is presented for both job-shop and batch scheduling problems. Unlike conventional classical solution techniques, the proposed hybrid frameworks harness quantum annealing to supplement established deterministic optimization algorithms and demonstrate performance efficiency over standard off-the-shelf optimization solvers.
Mixed Integer Linear Programming (MILP) can be considered the backbone of the modern power system optimization process, with a large application spectrum, from Unit Commitment and Optimal Transmission Switching to verifying Neural Networks for power system applications. The main issue of these formulations is the computational complexity of the solution algorithms, as they are considered NP-Hard problems. Quantum computing can give a direct solution to this problem, as it has been experimentally shown that it can provide significant speedups in solving MILPs. In this work, we present a general framework for solving power system optimization problems with a Quantum Computer (QC), which leverages mathematical tools and QCs' sampling ability to provide accelerated solutions. Our guiding applications are the optimal transmission switching and the verification of neural networks trained to solve a DC Optimal Power Flow. Specifically, using an accelerated version of Benders Decomposition , we split a given MILP into an Integer Master Problem and a linear Subproblem and solve it through a hybrid ``quantum-classical'' approach, getting the best of both worlds. We provide 2 use cases, and benchmark the developed framework against other classical and hybrid methodologies, to demonstrate the opportunities and challenges of hybrid quantum-classical algorithms for power system mixed integer optimization problems.