摘要
遗传算法应用在配电网重构计算中,通过不断的交叉、变异来改变配电网中开关的开合状态,以产生更多新的网络拓扑图来供选择,但同时会产生大量的不可行解,从而影响算法的收敛速度。本文提出了一些改进的遗传算法,可以减少不可行解,得到以网损最小作为目标函数的全局最优解,同时提高遗传算法的收敛速度。
Genetic algorithm, applied in the distribution grid reconstruction calculation, controls the switch in the distribution network the through crossover and mutation, and can produce more new network topologies to choose from. However, at the same time, it can produce a large number of infeasible solutions which may affect the convergence speed of the algorithm. This paper puts forward some improved methods of genetic algorithm which can reduce non-feasible solutions to get the minimum network loss as the global optimal solution of the objective function. At the same time, the convergence speed of genetic algorithm is improved.
出处
《科技广场》
2016年第1期42-45,共4页
Science Mosaic
关键词
配电网重构
改进遗传算法
不可行解
网损最小
收敛速度
Distribution Reconfiguration
Improved Genetic Algorithm
Non-Feasible Solution
Minimum Network Loss
Rate of Convergence