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

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. [ABSTRACT FROM AUTHOR]

当前逐渐增大的电力系统规模和逐渐拓展的模拟周期使得快速求解机组组合问题面临巨大挑战。提 出一种基于拉格朗日松弛和子问题解耦动态规划的周机组组合快速求解方法, 以提高周机组组合计算效率。 引入拉格朗日对偶乘子对原始问题中的耦合约束进行松弛, 并分解得到若干单机组子问题; 构建单机组子问 题的状态转移图及状态转移成本, 利用动态规划算法计算单机组最优状态转移, 以获得单机组子问题最优 解; 对问题进行迭代求解直至收敛, 从而快速得到周机组组合结果。将所提方法应用于 IEEE 118 节点系统、 IEEE 300 节点系统和贵州电网, 验证其优异的计算效率. [ABSTRACT FROM AUTHOR]

Copyright of Electric Power Automation Equipment / Dianli Zidonghua Shebei is the property of Electric Power Automation Equipment Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)