基于最小生成树理论的配电网故障恢复算法  

A distribution network reconfiguration algorithm based on least weight tree for service restoration after faults

作　　者：黄宗君[1] 

机构地区：[1]四川大学电气信息学院,四川成都610065

出　　处：《继电器》2003年第12期9-12,共4页Relay

摘　　要：依据图论简化的要求,对配电网络建立了以综合网损最小、开关动作次数最少、电网可靠性最高为目标的函数模型,并且保证配电网连通性、辐射状运行、电源容量等约束条件,得到配电网故障恢复的最优解和一系列次优解。算法具有简单、实用、实时性强等特点,在配电自动化系统中有很强的适用性。算法经过测试,证明了其优越性。Based on the simplification of the real distribution network of graph theory,this mathematical model consists of minimum network loss,minimum switch loss and highest network reliability;meanwhile,it also involves the constraint conditions of distribution connectedness,radiation,and power capacity.It can give an optimal solution and serial sub-optimal solutions to reconfiguration.This algorithm is of simpleness,practice,and real-time,which has high applicability in distribution automation system.Through the calculation for a test system,it shows the advantages of algorithm .

关 键 词：配电网 故障恢复算法 最小生成树理论 电网 可靠性 图论 电力系统 

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