基于BPSO算法电力系统故障可观的PMU配置  

Optimal PMU Placement for Fault Observability of Power System Based on BPSO

作　　者：李金灿[1] 邹恩[2] 

机构地区：[1]华南农业大学珠江学院,广东广州510900 [2]华南农业大学工程学院,广东广州510642

出　　处：《江西师范大学学报（自然科学版）》2017年第2期122-126,共5页Journal of Jiangxi Normal University(Natural Science Edition)

基　　金：广东省自然科学基金(S2013040016144)资助项目

摘　　要：针对电力系统故障可观状态下的PMU最优配置,提出了使用二进制粒子群优化算法(BPSO)进行处理.为了使用最少的PMU数目找到电力系统网络任一支路的故障,首先使用线性整数规划(ILP)对系统进行建模,再将BPSO算法引入进行优化,最后将该算法应用到IEEE-14,30和57节点标准测试系统,其优化过程亦考虑了零注入节点的影响.结果表明:该算法快速有效,适应用电力系统各种问题的优化.The paper proposed the Binary Particle Swarm Optimization（BPSO） algorithm for optimal placement of phasor measurement units（PMU） to ensure observability under faulted conditions in power systems.The problem is to minimize the number of PMUs in order to locate any fault in a power system.Integer linear programming procedure is used for problem formulation.And then the BPSO algorithm is introduced to solve the problem.The algorithm is implemented on the IEEE-14 bus,30-bus and 57-bus standard test systems with and without considering of zero injection buses.The simulation results show that the BPSO algorithm is fast and efficient.It is suitable for optimization problems of power systems.

关 键 词：PMU最优配置 电力系统 故障可观 线性整数规划 二进制粒子群优化算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]