首页 | 本学科首页   官方微博 | 高级检索  
     检索      

电力系统中机组组合问题算法的研究
引用本文:梁华兰,赵晋泉.电力系统中机组组合问题算法的研究[J].伊犁师范学院学报(自然科学版),2009(2):17-21.
作者姓名:梁华兰  赵晋泉
作者单位:河海大学,电气工程学院,江苏,南京,210098
摘    要:机组优化组合问题是电力系统经济调度的一个重要环节,合理的开停机方案可带来很大的经济效益.实践表明机组优化组合比优化分配负荷更加经济,但由于问题十分复杂,很难找出理论上的最优解.介绍了解决机组组合问题的拉格朗日松弛法及遗传算法,并将两者结合起来对实际算例进行了分析.结果表明,两种算法结合求解能有效克服遗传算法的早熟现象,使生成解的对偶间隙减小,振荡现象得到抑制,能很快收敛到最优解,运行效率高,比传统的算法具有更高的鲁棒性.

关 键 词:电力系统  机组组合  拉格朗日松弛法  遗传算法

Research for Unit Commitment Problem Algorithm in Power System
LIANG Hua-lan,ZHAO Jin-quan.Research for Unit Commitment Problem Algorithm in Power System[J].Journal of Ili Normal University,2009(2):17-21.
Authors:LIANG Hua-lan  ZHAO Jin-quan
Institution:(College of Electrical Engineering, Hehai University, Nanjing 210098, China)
Abstract:Unit commitment(UC) is a very important link of generation scheduling in power system economy dispatch, the experience indicated that the optimized unit commitment is more economical than the optimized load distribution. But this problem is very complicated to solve, and it is very hard to find the most optimization conclusion in theory. This paper presents a hybrid method for solving UC problem between Lagrangian relaxation (LR) and the genetic algorithm(GA). Numerical results showed that the feature of easy implementation, better convergence, and highly near-optimal solution to the UC problem can be achieved by the method. It is more robust and adaptive than the traditional methods.
Keywords:Electric power system  Unit commitment  Lagrangian relaxation  Genetic algorithm
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号