大电网互联格局下的解列断面双阶段搜索方法

发布时间：2018-01-02 01:27

本文关键词：大电网互联格局下的解列断面双阶段搜索方法　出处：《高电压技术》2015年03期 　论文类型：期刊论文

【摘要】：针对大区互联电网受扰失稳后应及时进行解列的问题,提出了一种解列断面双阶段搜索方法。首先,基于有功对相角的灵敏度计算各母线节点之间的电气距离,利用K-medoids算法对互联电网进行预分区,再将子区域进行聚合,得到互联电网的初始简化结构图;然后,构建主动解列断面搜索的数学模型,设置有功不平衡功率最小的目标函数及约束条件;最后,利用改进的蚁群算法求解最优解列断面。结果表明所提出的双阶段解列断面搜索方法在不丢失可行解的情况下可将IEEE 118节点算例和某实际大电网算例分别简化为20节点与310节点的系统,并在不平衡功率分别为1.01 MW和189.1 MW搜索到了解列断面,总过程耗时分别为0.21 s与4.35 s,满足了解列搜索过程所要求的快速性与有效性。
[Abstract]:In order to solve the problem that the disturbance and instability of the interconnected power network in large area should be carried out in time, a two-stage search method is proposed. Firstly, based on the sensitivity of the active power phase angle, the electrical distance between the busbar nodes is calculated. The K-medoids algorithm is used to prepartition the interconnected power grid, and then the sub-regions are aggregated to get the initial simplified structure diagram of the interconnected power network. Then, the mathematical model of active unlisting section search is constructed, and the objective function and constraint condition of minimum active power imbalance power are set up. Finally. The improved ant colony algorithm is used to solve the optimal discontinuous section. The results show that the proposed two-stage de-listing cross-section search method can solve the problem of IEEE without losing the feasible solution. The 118-bus example and the actual large grid example are simplified to 20-bus and 310-bus systems, respectively. At the unbalanced power of 1.01 MW and 189.1 MW, the total process time is 0.21 s and 4.35 s, respectively. Meet the speed and effectiveness required for understanding the column search process.
【作者单位】：武汉大学电气工程学院;
【基金】：博士后科学基金(2014M552080) 国家电网公司大电网重大专项资助项目课题(SGCC-MPLG029-2012)~~
【分类号】：TM744
【正文快照】： 0引言1国民经济的飞速发展极大促进了电力事业的建设,2015年“三华”(华北、华东、华中)特高压电网将形成“三纵三横一环网”的主网架结构[1-2],“高电压、远距离、大容量”大电网的形成已成为了一种必然[3-4]。特高压互联电网在充分展现其优越性的同时,也增强了区域电网间的

【相似文献】