摘要
为解决传统配网动态重构算法迭代计算量较大的问题,提出基于协同进化的配网动态重构算法.首先根据配网各节点负荷的变化情况进行时段划分,再在划分的区段内采用改进的遗传算法进行静态重构,将各区段静态重构得到的优化解集作为动态重构的初始解集,最后以所有时段总运行费用最小为目标函数,采用协同进化算法,通过协调各区段的重构操作得到所有时段的重构方案.对修改后的IEEE-33测试系统进行仿真计算,结果表明所提出的动态重构算法能够有效减少潮流计算的次数,同时提高了计算效率.
To solve the problem of great computation existed in traditional algorithms of distribution network dynamic reconfiguration, a dynamic reconfiguration algorithm of the distribution network based on the co evolution algorithm was proposed. First of all, according to the change of loads, the dynamic partition of time intervals was performed. Then the improved genetic algorithm was applied in each time interval to carry on the static reconfiguration. The solution set obtained from the static reconfiguration in each time interval was regarded as the initial solution set of the dynamic reconfiguration. Finally, the co-evolution algorithm was applied to determining the dynamic reconfiguration schemes with the principle of the lowest operation cost by adjusting the reconfiguration schemes in each time interval. The simulative results of the IEEE33-bus testing system showed that the proposed dynamic reconfiguration algorithm could significantly reduce the number of power flow calculation and improve computational efficiency.
出处
《安徽大学学报(自然科学版)》
CAS
北大核心
2016年第4期58-66,共9页
Journal of Anhui University(Natural Science Edition)
基金
国家科技支撑计划资助项目(2013BAA01B03)
山东省科技发展计划资助项目(2012G0020503)
关键词
配电网络
动态重构
时段划分
遗传算法
协同进化
distribution network
dynamic reconfiguration
partition of time intervals
genetic algorithm
co-evolution algorithm