首页> 外文会议>IEEE PES/IAS PowerAfrica Conference >Distribution Network Reconfiguration Method with Distributed Generators Based on an Improved Shuffled Frog Leaping Algorithm
【24h】

Distribution Network Reconfiguration Method with Distributed Generators Based on an Improved Shuffled Frog Leaping Algorithm

机译:基于改进蛙跳算法的分布式发电机配电网重构方法

获取原文

摘要

Reconstruction of a distribution network is a complex nonlinear combinatorial optimization problem. A reconfiguration algorithm of a distribution network based on an improved shuffled frog leaping algorithm using molecular dynamics theory and cloud simulation theory was proposed to solve the problems of slow convergence for current distribution network reconfiguration method. The reconstruction optimization process of the distribution network was as follows. First, the integer coding strategy based on the independent loop was adopted, and the initial data of distribution network was input, followed by random generation of the effective initial swarm of corresponding scale; Second, the distribution network was simplified, and the effective solution was obtained based on the reconfiguration network simplification principle; Third, the back forward sweep algorithm method for was used for the power flow calculation of effective solutions; Finally, iterative swarm optimization was conducted based on the improved shuffled frog leaping algorithm(SFLA). The simulation results based on the IEEE33 node distribution system showed that the active network loss value of the system was decreased obviously, reaching 16.57%. The active power P increased significantly compared with that before the reconfiguration in which the distributed generators (DGs) were accessed. The proposed algorithm has good optimization performance in solving the problem of distribution network reconfiguration compared with the traditional particle swarm optimization (PSO) and the differential evolution algorithm (DE).
机译:配电网络的重构是一个复杂的非线性组合优化问题。提出了一种基于改进蛙蛙跳算法的分子网络和云仿真理论的配电网重构算法,以解决当前配电网重构方法收敛速度慢的问题。配电网的重构优化过程如下。首先,采用基于独立循环的整数编码策略,输入配电网的初始数据,然后随机生成相应规模的有效初始群。其次,简化了配电网络,并根据可重构网络简化原理获得了有效的解决方案。第三,采用后向扫频算法方法进行有效解的潮流计算。最后,基于改进的改组蛙跳算法(SFLA)进行了迭代群优化。基于IEEE33节点分发系统的仿真结果表明,该系统的活动网络损耗值明显降低,达到16.57%。与访问分布式发电机(DG)的重新配置之前相比,有功功率P显着增加。与传统的粒子群优化算法(PSO)和差分进化算法(DE)相比,该算法在解决配电网重构问题上具有良好的优化性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号