主动解列策略求解过程中的网络化简  

Network Simplification for Active Splitting Strategy Searching

作　　者：吴学娟[1] 沈沉[2] 向学军[1] 乔颖[2] 

机构地区：[1]三峡大学电气信息学院,湖北省宜昌市443002 [2]电力系统及发电设备控制和仿真国家重点实验室(清华大学电机系),北京市海淀区100084

出　　处：《中国电机工程学报》2008年第7期7-12,共6页Proceedings of the CSEE

基　　金：国家自然科学基金项目(50677031;50595411)~~

摘　　要：系统解列(system splitting,SS)问题是指如何决定合理的解列点(或称为解列策略)的问题。大规模系统的SS问题一般非常复杂,因为策略求解会遭遇组合爆炸问题,所以网络化简非常必要。该文根据"就近原则"设计一种新的网络化简方法。该方法可极大程度地简化系统规模,排除大量的非可行解列策略,加快搜索校验,从而为解决大规模系统的解列问题提供可能。通过在IEEE68节点系统和中国东北系统上进行测试,证明该方法的有效性和可行性。System splitting （SS） problem which is to determine proper splitting points （or called splitting strategies） is very complicated in general, especially for large-scale power system, because a combinatorial explosion of strategy space happens. So it is necessary to simplify the network before really starting solving the problem. A new method of network simplification is presented based on ＂principle of proximity＂, which can further reduce scale of large power systems than current existed methods while keeping as many feasible strategies as possible. Testing results on the IEEE 68-bus system and China north-east grid show that proposed method is feasible and effective for reducing system scale and speeding up strategy searching and verifying.

关 键 词：解列 系统分区 节点聚合 紧急控制 电力系统 

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