基于改进禁忌-粒子群算法的配电网重构  

Improved Tabu Search-particle Swarm Optimization Algorithm for Reconfiguration of Distribution Network

作　　者：杨婷[1] 苏宏升[1] 

机构地区：[1]兰州交通大学自动化与电气工程学院,兰州730070

出　　处：《科学技术与工程》2012年第31期8221-8225,共5页Science Technology and Engineering

摘　　要：为解决配电网重构问题,提出一种改进的禁忌-粒子群算法。该方法结合禁忌搜索算法的短期记忆功能,克服了粒子群算法局部搜索能力较弱和容易陷入早熟收敛的缺陷。算法结合配电网络结构的特点,采用十进制编码策略,提高了迭代过程中解的有效性。最后通过典型的IEEE测试系统进行优化计算,并与文献其他方法优化比较。结果表明了算法的搜索效率更有效。In order to solve distribution network network reconfiguration problem, a modified tabu search-parti- cle swarm optimization algorithm is presented. The particle swarm optimization algorithm＇ s local search ability weak and easy to fall into premature convergence problems were overcome. The effectiveness of the solution in the itera- tive process were improved based on the characteristics of the distribution network structure with decimal encoding method combines the algorithm. Finally, the optimization calculations of a typical IEEE testing system by the pres- ented method are conducted and the calculation results are compared with other methods, the comparison results demonstrate the validity and effectiveness of the proposed method.

关 键 词：配电网重构 粒子群算法 禁忌搜索算法 拓扑分析 十进制编码 

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