基于Jaya算法的分布式电源配电系统无功优化  

Reactive power optimization of distributed power distribution system based on Jaya algorithm

作　　者：杨占博 马平 YANG Zhanbo;MA Ping(College of Electrical Engineering,Qingdao University,Qingdao 266071,China)

机构地区：[1]青岛大学电气工程学院,山东青岛266071

出　　处：《电子设计工程》2023年第8期143-146,151,共5页Electronic Design Engineering

摘　　要：分布式发电(Distributed Generation,DG)对配电网的电压质量和经济运行有重要影响。该文以有功网损、无功补偿成本和节点电压偏移为目标函数,以DGs供电的无功功率和无功补偿设备出力为控制变量建立配电网多目标无功优化模型。针对目前大部分优化算法过度依赖控制参数的问题,该文采用了不需要问题相关控制参数的Jaya算法,并在此基础上引入非支配排序法和拥挤距离计算机制。在改进IEEE-33节点系统仿真分析中,将优化后的改进Jaya算法与基本Jaya算法和粒子群算法作对比,结果表明该文算法具有更强的全局搜索能力、更高的收敛精度和更快的收敛速度。Distributed Generation(DG)plays an important role in voltage quality and economic operation of distribution network.In this paper,a multi⁃objective reactive power optimization model of distribution network is established by taking active network loss,reactive power compensation cost and node voltage offset as objective functions,and the reactive power of DGs power supply and the output of reactive power compensation equipment as control variables.Aiming at the problem that most modern optimization algorithms rely too much on control parameters,this paper adopts the Jaya algorithm that does not need the relevant control parameters of the problem,and then introduces the non⁃dominated sorting method and the crowding distance calculation mechanism.In the simulation analysis of the improved IEEE-33 node system,the optimized Jaya algorithm is compared with the basic Jaya algorithm and particle swarm optimization algorithm,and the results show that the algorithm has stronger global search ability,higher convergence accuracy and faster convergence speed.

关 键 词：分布式发电 Jaya算法 非支配排序法 拥挤距离计算机制 

分 类 号：TN99[电子电信—信号与信息处理]