Incentivising Demand Side Response through Discount Scheduling using Hybrid Quantum Optimization
arXiv:2309.05502 · doi:10.1109/TQE.2024.3407236
Abstract
Demand Side Response (DSR) is a strategy that enables consumers to actively participate in managing electricity demand. It aims to alleviate strain on the grid during high demand and promote a more balanced and efficient use of (renewable) electricity resources. We implement DSR through discount scheduling, which involves offering discrete price incentives to consumers to adjust their electricity consumption patterns to times when their local energy mix consists of more renewable energy. Since we tailor the discounts to individual customers' consumption, the Discount Scheduling Problem (DSP) becomes a large combinatorial optimization task. Consequently, we adopt a hybrid quantum computing approach, using D-Wave's Leap Hybrid Cloud. We benchmark Leap against Gurobi, a classical Mixed Integer optimizer in terms of solution quality at fixed runtime and fairness in terms of discount allocation. Furthermore, we propose a large-scale decomposition algorithm/heuristic for the DSP, applied with either quantum or classical computers running the subroutines, which significantly reduces the problem size while maintaining solution quality. Using synthetic data generated from real-world data, we observe that the classical decomposition method obtains the best overall \newp{solution quality for problem sizes up to 3200 consumers, however, the hybrid quantum approach provides more evenly distributed discounts across consumers.
References in corpus (23)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Approximate Optimization Algorithm
- Adiabatic Quantum Computing
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum computing for energy systems optimization: Challenges and opportunities
- What is the Computational Value of Finite Range Tunneling?
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
- Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
- Practical Quantum K-Means Clustering: Performance Analysis and Applications in Energy Grid Classification
- Solving large Maximum Clique problems on a quantum annealer
- Solving large Minimum Vertex Cover problems on a quantum annealer
- Decomposition algorithms for solving NP-hard problems on a quantum annealer
- GCS-Q: Quantum Graph Coalition Structure Generation
- Quantum Local Search with the Quantum Alternating Operator Ansatz
- Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms
- Experimental Quantum Computing to Solve Network DC Power Flow Problem
- Community Detection in Electrical Grids Using Quantum Annealing
- BILP-Q: Quantum Coalition Structure Generation
- Quantum Computing Solution of DC Power Flow
- An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware