改进二进制粒子群算法在配电网重构中的应用  

Improved binary particle swarm algorithm for distribution network reconfiguration

作　　者：束成文 朱金荣 SHU Chengwen;ZHU Jinrong(School of Electric Power Engineering,Nanjing Institute of Technology,Nanjing 211167,China)

机构地区：[1]南京工程学院电力工程学院,江苏南京211167

出　　处：《电子设计工程》2023年第23期122-126,共5页Electronic Design Engineering

摘　　要：为了实现配电系统安全经济地运行,针对传统算法收敛速度与精度较低等缺点,对传统的二进制粒子群算法进行了改进,将自适应比例选择策略与混沌搜索引入算法中,避免传统算法容易陷入局部最优、收敛速度较慢等问题。以IEEE33节点配电系统为研究对象,以有功网损和节点电压偏移作为目标函数,进行了配电网重构的仿真试验,并考虑了含有多种分布式电源的情况。试验表明,相比于传统算法,该算法收敛速度提升约2.5倍,系统网损下降约51%,电压偏移下降约49%,具有更佳的重构效果。In order to realize the safe and economic operation of the distribution system.In view of the low convergence speed and accuracy of traditional algorithms,an improved binary particle swarm optimization algorithm is introduced,incorporating an adaptive proportion selection strategy and chaotic search,in order to avoid the issues that traditional algorithms are prone to local optimization and slow convergence speed.Taking the IEEE33 bus distribution system as the research object,and taking active power loss and node voltage offset as the objective function,a simulation test of distribution network reconfiguration is carried out,and the case with multiple distributed generations is considered.The experiment shows that,compared with the traditional algorithm,the convergence speed of the algorithm is improved by about 2.5 times,the system loss is reduced by about 51%,and the voltage offset is reduced by about 49%,resulting in a better reconstruction effect.

关 键 词：二进制粒子群 自适应比例选择 混沌搜索 分布式电源 配电网重构 

分 类 号：TN081[电子电信—物理电子学]