摘要
为了减少在配电网络重构过程中产生的不可行解的数量,减少配电网络重构迭代次数,提高其计算效率,对遗传算法进行了改进:以某段染色体编码中的1的数量作为该段染色体的等效长度,在进行交叉时,以相同等效长度的染色体段进行交叉;在变异过程中以随机分配断开开关点的方法进行变异,不再是盲目的变异。同时采用广度优先搜索算法判断不可行解,最后以IEEE33母线测试系统作为算例进行验证,发现结果合理,迭代次数少,收敛速度快,证明提出的经过改进的遗传算法是行之有效的。
In order to reduce the number of the infeasible solutions produced in the distribution network reconfiguration process,the number of iterations in distribution network reconfiguration,and improve its computational efficiency,the genetic algorithm in this paper is improved as follows： regarding the number of 1 in a certain chromosome code as the equivalent length of the chromosome segment,the chromosome segments which have an equal equivalent length is crossing; in the mutation process,the randomly assigned disconnect switch point method is used to mutate,not blindly,at the same time,the breadth-first search algorithm is used to judge the feasible solutions,and finally the IEEE33-bus test system is applied as an example to validate the algorithm. The results show that the algorithm is reasonable and effective having few iterations,and the convergence speed is faster.
出处
《电测与仪表》
北大核心
2015年第13期101-104,共4页
Electrical Measurement & Instrumentation
关键词
改进遗传算法
配电网络重构
等效长度
广度优先搜索算法
improved genetic algorithm
distribution network reconfiguration
equivalent length
breadth-first search algorithm
