基于最小生成树的配电网故障恢复研究
Study on the recovery for Distrubition Network based on Minimum Spaning Tree
在简化分析的基础上提出利用图论中的最小生成树来选择配电网供电恢复的最优路径。针对经典的最小生成树算法仅仅只能得到一组最优解的缺点，转而采用单亲遗传算法来求取最小生成树，最后将最小生成树引入到配电网故障恢复的问题求解中。本算法可以得到一组包含最优解和次优解的解集合，在最有解所代表的开关发生拒动时，将次优解作为备选方案，提高了恢复方案的可靠性。算法以图中边的权值作为运算对象，是一维数组，而不是传统算法中的权值矩阵，降低了运算维数，减少内存量，提高运算速度。
On the basis of the simplified analysis,the minimum spanning tree is proposed to choose the optimal path of the power recovery.According to the shortcomings of the classic algorithm,the partheno-genetic algorithm is introduced to calculating the minimum spanning tree.A group of the optimal solution and the subprime solution are got by the algorithm.When the switch refuses action,the subprime solution will be a good alternative.The weights of the wides are used as the operands,so the inventory is reduced and the speed is improved.
陈建松、乐秀璠
输配电工程
配电网单亲遗传算法最下生成树
istribution NetworkPartheno-genetic AlgortithmMinimum Spanning Tree
陈建松,乐秀璠.基于最小生成树的配电网故障恢复研究[EB/OL].(2011-05-13)[2025-08-19].http://www.paper.edu.cn/releasepaper/content/201105-309.点此复制
评论