A Quantum-aided Algorithm for Unit Commitment Problems
Mingyu Yang, Fang Gao, Guojian Wu, Beili Gong, Huibin Cao, Feng Shuang · 2023
Unit Commitment (UC) is important in economy and security of power system operation. As one kind of nonlinear mixed integer quadratic programming (MIQP) problems, the UC problem has attracted attention due to its NP-hard nature. This paper presents a quantum-aided algorithm in the framework of alternating direction method of multipliers (ADMM) and Tabu Search (TS) to tackle UC problems. With ADMM, the UC problem is decomposed into a quadratic unconstrained binary optimization (QUBO) subproblem that can be solved with quantum algorithms and a continuous optimization subproblem that can be solved with classical optimization solvers. With TS, the taboo list is introduced in our algorithm to escape from the local minimum. Case studies verify the validity of the proposed algorithm.