基于混合算法用于配电网多重故障的自愈研究  

Research on Self-healing of Multiple Faults of Distribution Network Based on a Hybrid Algorithm

作　　者：王力 倪俊 吕静 钟建伟 WANG Li;NI Jun;LU Jing;ZHONG Jianwei(College of Information Engineering,Hubei University tbr Nationalities,Enshi 445000,China;Enshi Power Supply Company,State Grid Hubei Electric PouTer Courpany,Enshi 445000,China)

机构地区：[1]湖北民族学院信息工程学院,湖北恩施445000 [2]国网湖北省电力有限公司恩施供电公司,湖北恩施445000

出　　处：《湖北民族学院学报（自然科学版）》2018年第3期356-360,共5页Journal of Hubei Minzu University(Natural Science Edition)

基　　金：国家自然科学基金项目(61263030;61463014)

摘　　要：配电网自愈是实现配电网故障恢复的一项重要手段,为了克服蚁群算法用于配电网重构中的易陷入局部最优且效率较低的问题,通过将Huffman算法与蚁群算法结合,提出一种混合算法,利用Huffman树的快速延伸能力,来提高蚁群算法的搜索效率和全局搜索能力,防止局部最优.该算法主要针对配电网二重故障处的关键支路进行实时的快速编码,分割了故障区与非故障区,简化了网络,发挥了两种算法各自的优越性,最后通过算例分析,证明了该方法的可行性和有效性.The distribution network self-healing is an important means to achieve distribution network fault recovery. In order to overcome the problem of easily getting into local optimum and low efficiency when the ant colony algorithm is applied to distribution network reconfiguration,we present a hybrid algorithm by combining the Huffman algorithm and ant colony algorithm,which uses the rapid extension ability of Huffman tree to improve the search efficiency and global search ability of ant colony algorithm and prevent local optimum. The algorithm can fast encode for the key branch of the double fault in the distribution network on real-time basis,segment fault zone and the non-fault zone,simplify the network and bring the superiority of the two algorithms into full play. Finally,through analysis of examples,the feasibility and effectiveness of the algorithm are proved.

关 键 词：配电网 HUFFMAN树 混合算法 自愈 多重故障 

分 类 号：TM761[电气工程—电力系统及自动化]