Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.11312 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917869976027136 |
|---|---|
| author | Salgado, Bruna Sequeira, André Santos, Luis Paulo |
| author_facet | Salgado, Bruna Sequeira, André Santos, Luis Paulo |
| contents | The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify the optimal unit combination and classical methods to determine individual unit powers. The proposed hybrid algorithm is the first to include both the spinning reserve constraint (thus improving its applicability to real-world scenarios) and to explore QAOA warm-start optimization in this context. The effectiveness of this optimization was illustrated for specific instances of the UC problem, not only in terms of solution accuracy but also by reducing the number of iterations required for QAOA convergence. Hybrid solutions achieved using a single-layer warm-start QAOA (p=1) are within a 5.1 % margin of the reference (approximate) classical solution, while guaranteeing polynomial time complexity on the number of power generation units and time intervals. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11312 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A hybrid classical-quantum approach to highly constrained Unit Commitment problems Salgado, Bruna Sequeira, André Santos, Luis Paulo Quantum Physics The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify the optimal unit combination and classical methods to determine individual unit powers. The proposed hybrid algorithm is the first to include both the spinning reserve constraint (thus improving its applicability to real-world scenarios) and to explore QAOA warm-start optimization in this context. The effectiveness of this optimization was illustrated for specific instances of the UC problem, not only in terms of solution accuracy but also by reducing the number of iterations required for QAOA convergence. Hybrid solutions achieved using a single-layer warm-start QAOA (p=1) are within a 5.1 % margin of the reference (approximate) classical solution, while guaranteeing polynomial time complexity on the number of power generation units and time intervals. |
| title | A hybrid classical-quantum approach to highly constrained Unit Commitment problems |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.11312 |