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

负荷的快速恢复算法研究
引用本文:周云海,闵勇.负荷的快速恢复算法研究[J].中国电机工程学报,2003,23(3):74-79.
作者姓名:周云海  闵勇
作者单位:1. 三峡大学电气信息学院,宜昌,443002
2. 清华大学电机工程系,北京100084
摘    要:该文系统地研究了负荷的快速恢复在线算法。它是一个包含整数规划和线性规划的混合规划问题,并具有众多的安全稳定约束条件,直接求解十分困难,文中先将该问题松驰为只考虑系统稳态频率约束的0-1规划问题,系统的稳态频率用“扩展的潮流计算”求解,并进行了灵敏度分析,由于它仍为NPC难题,大规模“背包”问题的近似算法被用于求解系统的最大可恢复负荷量,利用线性解偶最优潮流算法来消除系统越限,并利用松弛规划负荷处理不可行解,保证了算法的可靠性,该文算法为多项式时间算法,能应用于大系统,为在线制定负荷恢复方案提供了有力的定量分析工具,使恢复过程变得更快,更安全,更精确,最后以IEEE118系统为算例,验证了上述算法的有效性。

关 键 词:快速恢复算法  潮流计算  电力系统  目标函数  电力负荷
文章编号:0258-8013(2003)03-0074-06
修稿时间:2002年6月25日

OPTIMAL ALGORITHM FOR FAST LOAD RECOVERY
ZHOU Yun-hai,MIN Yong.OPTIMAL ALGORITHM FOR FAST LOAD RECOVERY[J].Proceedings of the CSEE,2003,23(3):74-79.
Authors:ZHOU Yun-hai  MIN Yong
Affiliation:ZHOU Yun-hai1,MIN Yong2
Abstract:The load recovery problem is a hybridprogramming problem combining with the zero-one integerprogramming and the linear programming problem and hasmany safe constraints. Firstly, the problem is relaxed as azero-one integer programming problem with only frequencyconstraint, but it is still a non-polynomial complete (NPC) hard problem, so the algorithm of the large zero-one knapsackproblem is adopted to decide the maximal restorable loads, and the "extended power flow" is developed to calculate thefrequency. Secondly, the linear optimal power flow method isemployed to eliminate the violated constrains and the infeasible situation is solved by relaxation of load. A systematic on-line dispatch tool is developed by modeling and optimizing thewhole process of the load restoretion. The possibility of erroroperation caused by dispatchers is erduced, the restoration isgetting safer and faster. All of the algorithms are polynomialtime character istic and the effectiveness of them is verified bythe IEEE118 system.
Keywords:Restoration  Optimal Power Flow (OPF)  Knapsack problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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