摘要
为了更有效地解决配电网络重构问题,该文将结合粒子群算法特性的改进型细菌觅食算法应用于该问题求解。文中将粒子群算法的群体寻优机制引入细菌觅食算法中,并针对细菌觅食算法后期种群过于单一、易陷入局部最优的缺陷,通过算法机理分析,提出了采用均分变异繁殖的方式和新的驱散规则。既赋予了算法搜索的导向性,也保护了种群繁殖后的多样性,有效提高了算法寻优速度与全局搜索能力。最后,将改进后算法应用于配电网络重构求解。算例结果表明,该算法能快速有效地得到最优解,是可行的。
In order to solve the problem of distribution network reconfiguration more effectively, an improved bacterial foraging algorithm (BFA) is proposed by combining the characteristics of particle swarm optimization (PSO) algorithm. Firstly, group optimization mechanism of PSO is introduced to BFA. Secondly, considering the defects of BFA in the later stage such as single particle swam and the vulnerability of being easily trapped in a local optimum, the average variation of reproduction and new dispersal rules are proposed through mechanism analysis, which not only changes the random search of BFA into a guided search but also diversifies the swarm after reproduction, thus the searching speed and global searching ability of the proposed algorithm are effectively improved. Finally, the improved algorithm is ap- plied to distribution network reconfiguration. The simulation result of an example shows that the proposed algorithm can fast and effectively find the optimum solution, thus it is feasible.
作者
彭文强
毛弋
邓海潮
刘小丽
梁杉
范幸
PENG Wenqiang MAO Yi DENG Haichao LIU Xiaoli LIANG Shan FAN Xing(College of Electrical and Information Engineering, Hunan University, Changsha 410082, China)
出处
《电力系统及其自动化学报》
CSCD
北大核心
2017年第7期93-97,共5页
Proceedings of the CSU-EPSA
关键词
细菌觅食算法
粒子群优化算法
配电网重构
网损
bacterial foraging algorithm (BFA)
particle swarm optimization (PSO) algorithm
distribution network reconfiguration
network loss