摘要
以快速恢复对大停电事故后系统的供电为目的,对比分析介绍了机组串、并行恢复两种策略。串行恢复将机组启动划分为几个时步,在各个时步内,先由遍历法确定可参加启动的机组,其后由选择排序法确定初期机组的启动,回溯算法以实现最大发电功率决定后续机组的启动。并行恢复以基于社团结构理论的分裂算法对系统分区,寻找各子分区时,由计算并移除最大边介数依次得到,其后各个分区同时并行启动。可以发现串行恢复适合小范围的停电事故,而大范围的停电事故下并行恢复更为合理。最后以10机39节点系统为例验证了这两种恢复策略预案。
In order to fast recovery the power system after blackout, this paper contrastively analyzs units of serial, parallel recovery effect of two strategies. Serial recovery unit startup is divided into several time steps, at each time step, traversal method is initially used to determine the unit which can be start, then the selection sort is used to deter- mine the initial unit start, backtracking algorithm treats maximum power as the goal to decide subsequent unit startup. Parallel recovery is with the help of splitting method via the theory of the community structure onto realize the system partition, then searches for each sub-partition, ordered by calculation and removes the maximum edge betweenness, then each subsequent partition starts at the same time. It can be asserted that the serial recovery is suitable for relatively small area power outage, while blackout accident under parallel recovery is more reasonable. Finally, the 10-generator 39-bus system is utilized to validate these two recovery strategy plan.
出处
《电力系统及其自动化学报》
CSCD
北大核心
2013年第6期66-71,共6页
Proceedings of the CSU-EPSA
基金
贵州电网公司重大科研项目(12H0594)
四川省科技支撑项目(2011GZ0036)
关键词
串行恢复
并行恢复
数据包络分析
社团结构理论
回溯算法
serial restoration
parallel restoration
data envelopment analysis
community structure theory
back-tracking algorithm