.png){kind=icon}
.png){kind=icon}
Return
Consensus-Based Distributed Quantum Decomposition Algorithm for Security-Constrained Unit Commitment Considering Optimal Transmission Switching
.png){kind=icon}
PRE
AI
DOI：10.1002/qute.202500241.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To enhance controllability, flexibility, and economic performance, this approach develops a dynamic model for the joint optimization of unit commitment (UC) and optimal transmission switching (OTS), considering grid topology changes. This mixed-integer nonlinear problem sees computational complexity rise sharply with system size. A consensus-based distributed quantum decomposition algorithm (QDA) is proposed, splitting the problem into locally relaxed sub-problems (SPs) and consensus-constrained master problems (MPs). Multi-stage strategy is employed to iteratively refine solutions by incorporating cutting planes. For MPs, quadratic unconstrained binary optimization Hamiltonians are designed to be compatible with quantum computing, their complexity is simplified by inserting up/down constraint Hamiltonians that eliminate auxiliary binary variables. Leveraging quantum annealing and a photonic quantum computer, these Hamiltonians are efficiently solved to explore optimal UC and grid topology. Results on the 6-Bus System validate the centralized QDA, while the consensus-based distributed QDA outperforms Gurobi9 in operational costs and solution time for the IEEE RTS 24-Bus System. The joint UC-OTS optimization reduces costs compared to static networks’ UC, demonstrating the mutual influence of unit and topology optimization. This approach won the Grand Prize of the 2024 “Challenge and Leadership Selection” Special Competition of the 19th National Challenge Cup Competition.
Keywords:
consensus
distributed
optimal transmission switching
quantum computing
unit commitment
Journal
A
IF:
4.3
Papers:
409
Citations:
3.2K
Organization
View more organizations