摘要
电力系统实际运行中常常发生n-k（k重同时故障）事故,严重时可引发连锁故障。针对目前的随机搜索算法在识别最小n-k事故时计算量大,而现有故障筛选方法大多数只针对导致系统失稳的故障的问题,可利用随机化学算法来有效识别最小n-k事故集合,同时获得大量可能引发连锁故障的最小n-k事故集合。与其他搜索算法相比,寻找一个最小n-k事故集合最多只需O（log（n））次仿真。以中国东部某电网为例,仿真试验运用改进的OPA（ORNL—PSerc-Alaska）模型,验证了随机化学算法识别最小n-k事故集合的有效性。此外,随机化学算法可为识别系统脆性线路提供新的思路。
In the practical power system,n-k contingencies（k multiple simultaneous failures） do occur,which may trigger sequences of cascading outages when severe.However,the current random searching algorithms（RSA） generally require large computation when identifying n-k minimal contingencies.In addition,the present contingency screening methods only target the failures which result in system instability.Under this circumstance,a random chemistry（RC） algorithm for identifying n-k minimal contingencies is described,with massive collections of n-k minimal contingencies that are likely to trigger cascading outages being obtained.This method requires only O（log（n）） simulations per contingency identified,which is orders of magnitude faster than the other RSA.The algorithm is applied to a certain power network in Eastern China with an improved OPA（ORNL—PSerc-Alaska） model,and the simulation results prove the validity of RC algorithm in identifying n-k minimal contingencies.What’s worth mentioning is that this RC algorithm may offer a new idea for identifying system vulnerability.
出处
《电力系统保护与控制》
EI
CSCD
北大核心
2015年第8期35-40,共6页
Power System Protection and Control
基金
天津市科技支撑计划重点资助项目（13ZCZDGX03800）
关键词
连锁故障
随机化学算法
恶性故障集
最小n-k事故集合
脆性线路
cascading outage
random chemistry algorithm
collections of malignancies
n-k minimal contingencies
system vulnerability
