改进的拉格朗日松弛法求解机组组合问题  

Unit commitment using an improved lagrangian relaxation method

作　　者：何小宇[1] 张粒子[1] 谢国辉[1] 

机构地区：[1]华北电力大学电气工程学院,北京102206

出　　处：《电力系统保护与控制》2010年第17期16-21,共6页Power System Protection and Control

摘　　要：提出了一种求解机组组合问题的改进拉格朗日松弛算法。与现有此类方法相比,此算法进行了以下三个方面改进:基于启发式排序法得到较优的拉格朗日乘子初值;改进了动态规划求解单机问题时的累计费用以获得更优的机组启停决策;采用自适应性次梯度法结合集结投影次梯度法的联合优化策略加快算法收敛速度。10机到100机的6个算例表明,自适应性次梯度法和集结投影次梯度法的联合优化策略更易跳出其单一策略时的振荡现象,从而加快收敛。This paper proposes an improved lagrangian relaxation approach for the unit commitment problem. This method has improved the following three aspects ：f irst,a heuristic sorting method is used to get better initial lagrangian multipliers; second,the total cost of solving the single-unit problem by dynamic programming is reduced to achieve a better commitment start stop decision; at last,the optimization strategy of adaptive subgradient combined with aggregative projection subgradient is applied to accelerate the convergence.Simulation examples with the number of generating units in the range of 10 to 100 show that the two strategies used alternately can alleviate the oscillation and speed up convergence.

关 键 词：机组组合 改进拉格朗日松弛法 自适应性次梯度 集结投影次梯度 动态规划 

分 类 号：TM73[电气工程—电力系统及自动化]