基于拉格朗日松弛及子问题解耦动态规划的周机组组合快速求解方法

At present，the gradually increasing scale of power system and the gradually expanding simulation cycle have brought big challenge to the rapid solution of unit commitment problems. A fast solving method for weekly unit commitment based on Lagrangian relaxation and subproblem decoupling dynamic programming is proposed to improve the calculation efficiency of weekly unit commitment. The Lagrangian dual multiplier is introduced to relax and decompose the coupling constraints of original problem into several single unit sub-problems. The state transition graph and state transition cost for single unit sub-problems are constructed，and the dynamic programming algorithm is used to calculate the optimal state transition of single unit and obtain the optimal solution for each unit sub-problem. The problems are iteratively solved until the convergence，thus the weekly unit commitment results are rapidly obtained. The proposed method is applied in IEEE 118-bus system，IEEE 300-bus system and Guizhou Power Grid，and its excellent calculation efficiency is demonstrated.