首页> 外文会议>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%。与在访问分布式发电机(DGS)的重新配置之前,有功功率P显着增加。该算法具有良好的优化性能,用于解决与传统粒子群优化(PSO)和差分演进算法(DE)相比解决分发网络重新配置问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号