基于Mayeda生成树实用算法与粒子群算法的配电网络重构

发布时间：2018-04-21 05:23

本文选题：配网重构 + Mayeda生成树　；参考：《中国电机工程学报》2014年34期

【摘要】：网络重构是配电自动化的重要功能之一,随着智能电网建设的发展,其重要性越发显现。针对随机类优化算法用于配网重构计算速度慢的缺点,提出基于Mayeda生成树的新编码及解码策略,将该策略与粒子群算法相结合,得到配网重构新方法。基于Mayeda生成树的新编码及解码策略使随机进化优化解空间被限定在拓扑可行解空间中,从而无须进行拓扑放射性检测,提高了进化速度;同时,由于Mayeda生成树方法所形成树的不重复性(即不同的树支交换必定生成不同的树),使原网络的任一拓扑可行解必对应编码空间上的唯一一块连续空间,克服了编码重复度高的缺点而具有很高的进化效率。多个算例证明了该方法相对于其他方法的优越性;且随着系统规模的增大,优势越发明显。
[Abstract]:Network reconfiguration is one of the important functions of distribution automation. With the development of smart grid construction, its importance is becoming more and more important. Aiming at the shortcoming of the slow computing speed of the distribution network reconfiguration, a new coding and decoding strategy based on the Mayeda spanning tree is proposed. The strategy is combined with the particle swarm optimization algorithm to get the new distribution network reconfiguration. Method. The new coding and decoding strategy based on the Mayeda spanning tree makes the random evolutionary optimal solution space restricted to the topological feasible solution space, so that no topology radioactivity detection is needed to improve the evolution speed. At the same time, the non repeatability of the tree formed by the Mayeda spanning tree method (that is, the different tree exchange must generate different trees), Any topological feasible solution of the original network must correspond to the only continuous space on the coded space, which overcomes the disadvantage of high coding repeatability and has high evolutionary efficiency. Many examples prove the superiority of the method compared with other methods, and the advantages of the system are more obvious with the scale of the system.

【作者单位】：同济大学电子与信息工程学院;中国电力科学研究院;国网天津市电力公司经济技术研究院;智能电网教育部重点实验室(天津大学);
【分类号】：TM76

【参考文献】