检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖南大学电气与信息工程学院,湖南长沙410082
出 处:《继电器》2005年第4期17-21,共5页Relay
摘 要:提出了一种基于叠加原理和前代后代法的用于计算环状配电网潮流的改进算法。运用叠加原理,将环状配电网的潮流计算转化为纯辐射状配电网的潮流计算。以支路功率为变量,通过两层迭代来求解:内层迭代计算纯辐射状网络潮流,而用外层迭代来不断修正解环点支路功率达到整体收敛。针对该文的算法提出了一种基于节点邻接表的搜索方法,用于搜索环网、形成环网阻抗矩阵而无需进行复杂的编码。利用IEEE标准节点系统进行了验算,结果表明,所提出的算法具有良好的收敛特性,特别适合大规模多环状的配电网络的潮流计算。Based on the superposition principle and the forward/backward sweep method, an improved power flow algorithm for meshed distribution networks is proposed. First, the meshed network is converted into pure radial networks by applying the superposition principle. Then, considering branch power as variable, the power flow problem is solved by two-layer iterations. The internal iteration calculates the power flow of pure radial network, the outside one corrects the power flow of broken branch to achieve global convergence. Moreover, a searching method based on the adjacent nodes table is presented to search the loops and obtain its impedance matrix. The proposed algorithm is tested by IEEE systems, and the results indicate that it has a good convergence performance, and is specially fit for the large-scale meshed distribution networks.
分 类 号:TM744[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49