Hybrid Quantum-Classical General Benders Decomposition Algorithm for
Unit Commitment with Multiple Networked Microgrids
- URL: http://arxiv.org/abs/2210.06678v1
- Date: Thu, 13 Oct 2022 02:26:27 GMT
- Title: Hybrid Quantum-Classical General Benders Decomposition Algorithm for
Unit Commitment with Multiple Networked Microgrids
- Authors: Fang Gao, Dejian Huang, Ziwei Zhao, Wei Dai, Mingyu Yang, Feng Shuang
- Abstract summary: Unit commitment with multiple networked microgrids (UCMNM) is a typical mixed-integer nonlinear programming problem.
We introduce quantum computing in Generalized Benders decomposition algorithm (GBDA) framework.
For privacy-preserving and independent decision-making, HQC-GBDA decomposes the UCMNM problem into a master problem and a series of sub-problems.
- Score: 5.6035987109587895
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Unit commitment with multiple networked microgrids (UCMNM) is a typical
mixed-integer nonlinear programming problem. It requires coordination between
the local utility grid and the microgrids. We introduce quantum computing in
Generalized Benders decomposition algorithm (GBDA) framework and propose a
hybrid distributed decomposition algorithm in this work, named as hybrid
quantum-classical generalized Benders decomposition algorithm (HQC-GBDA). For
privacy-preserving and independent decision-making, HQC-GBDA decomposes the
UCMNM problem into a master problem and a series of sub-problems. The NP-Hard
master problem with discrete variables can be transformed into the quadratic
unconstrained binary optimization (QUBO) problem, which can be settled by the
quantum annealing algorithm. The main contributions of this work include: 1)
Based on GBDA, we propose a multi-cut generalized Benders decomposition
algorithm (MC-GBDA), which adds the Benders feasibility cutting planes to the
master problem more efficiently; 2) In HQC-GBDA, we reconstruct the NP-Hard
master problem into the QUBO problem, which is suitable to be solved by quantum
computing and further reduce the complexity of the master problem; 3) We use
the D-WAVE quantum annealing machine to solve the QUBO problem of HQC-GBDA and
find that HQC-GBDA is faster than its classical counterpart MC-GBDA when
dealing with more complex UCMNM problems.
Related papers
- Evaluating Quantum Optimization for Dynamic Self-Reliant Community Detection [3.6021182997326022]
We formulate a Quadratic Unconstrained Binary Optimization (QUBO) problem suitable for solving using quantum computationcolorblue.
The formulation aims to find communities with maximal self-sufficiency and minimal power flowing between them.
We benchmark the solution quality for multiple approaches: D-Wave's hybrid quantum-classical solvers, classicals, and a branch-and-bound solver.
arXiv Detail & Related papers (2024-07-09T11:44:58Z) - An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem.
We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
arXiv Detail & Related papers (2024-06-11T04:40:05Z) - Mixed Integer Linear Programming Solver Using Benders Decomposition Assisted by Neutral Atom Quantum Processor [0.0]
This paper presents a new hybrid classical-quantum approach to solve Mixed Linear Programming (MILP)
We apply Benders decomposition (BD) to segment MILPs into a master problem (MP) and a subproblem (SP)
Our MILP to QUBO conversion tightens the upper bounds of the involved continuous variables, positively impacting the required qubit count, and the convergence of the algorithm.
arXiv Detail & Related papers (2024-02-08T15:33:09Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum-inspired optimization for wavelength assignment [51.55491037321065]
We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem.
Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
arXiv Detail & Related papers (2022-11-01T07:52:47Z) - QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum
machines [81.4597482536073]
Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution.
We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines.
Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
arXiv Detail & Related papers (2022-05-24T03:49:10Z) - Hybrid Quantum-Classical Unit Commitment [0.0]
This paper proposes a hybrid quantum-classical algorithm to solve a fundamental power system problem called unit commitment (UC)
Using Qiskit on the IBM Q system as the simulation environment, simulation results demonstrate the validity of the proposed algorithm to solve the UC problem.
arXiv Detail & Related papers (2022-01-07T01:48:58Z) - Hybrid Quantum-Classical Multi-cut Benders Approach with a Power System
Application [0.0]
A quantum-classical (HQC) solution to the Unit Commitment (UC) problem is presented.
The validity and computational viability of the proposed approach are demonstrated using the D-Wave Advantage 4.1 quantum annealer.
arXiv Detail & Related papers (2021-12-10T16:16:09Z) - Quantum Permutation Synchronization [88.4588059792167]
We present QuantumSync, the quantum algorithm for solving a quantum vision problem in the context of computer vision.
We show how to insert permutation constraints into a QUBO problem and to solve the constrained QUBO problem on the current generation of the abatic quantum DWave computer.
arXiv Detail & Related papers (2021-01-19T17:51:02Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Accelerating Generalized Benders Decomposition for Wireless Resource
Allocation [40.75748765274763]
Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems.
We propose to leverage machine learning (ML) techniques to accelerate GBD aiming at decreasing the complexity of the master problem.
arXiv Detail & Related papers (2020-03-03T02:11:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.