配电网重构的混合粒子群算法  

Hybrid Particle Swarm Optimization for Distribution Network Reconfiguration

作　　者：李振坤[1] 陈星莺[1] 余昆[1] 刘皓明[1] 赵波[1] 

机构地区：[1]河海大学电气工程学院,江苏省南京市210098

出　　处：《中国电机工程学报》2008年第31期35-41,共7页Proceedings of the CSEE

基　　金：高等学校博士学科点专项科研基金项目(20060294019)。

摘　　要：通过将二进制粒子群算法和离散粒子群算法相结合,提出一种混合粒子群算法,求解配电网重构问题。在求解过程中,通过对配网支路进行分组,简化了网络,编码时每一支路组用1维表示,不仅显著降低了维数,缩短了编码长度,更有效降低了无效粒子的产生概率。在搜索过程中,根据该文总结的配电网重构的必要条件,有规律地将粒子进化,进一步提高了搜索效率。在优化过程中将每一次迭代由2步完成:第1步根据二进制粒子群算法中的sigmoid()函数值,利用轮盘赌的方法优化选择断开的支路组;第2步利用提出的离散粒子群算法优化选择在第1步中被选中断开的支路组的内部断开支路。最后对一个典型的69节点算例和一个实际算例进行仿真,结果显示,该方法不仅能快速收敛,而且稳定性好。A hybrid particle swarm optimization （PSO） approach composed of the binary PSO and discrete PSO was proposed here and successfully applied to distribution network reconfiguration problem. In the solving process, the distribution network was simplified through grouping the branches, and then each group of branches was represented by one dimensional coding. According to the necessary conditions for reconfiguration summed in the paper the particles were evolved regularly and this improved the efficiency of the search process. In the optimization process each cycle of iteration comprised two steps. Firstly, according to the value of the sigmoid 0 function in binary PSO, the branch-groups that should be open were chosen using the roulette method. Secondly, using a novel discrete PSO algorithm proposed in the paper to select the branch that should be open in the branch-groups that had been selected in the first step. Finally a typical example of 69 nodes and a practical case were simulated through the proposed algorithm. The results show that the method could not only rapidly convergence, but also had good stability.

关 键 词：配电网重构:网络简化 重构必要条件 二进制粒 子群算法 离散粒子群算法 

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