摘要
在简单的支路始末节点数据输入的基础上确定配网拓扑结构表 ,经过遍历深度优先搜索形成层次结构和节点队列以决定潮流计算的节点顺序 ,以基于支路电流的前推后代法为理论基础 ,形成一种实用的配电网潮流计算方法 ,算例表明该方法无需复杂的网络编号、不用形成导纳矩阵、迭代次数少。
The topology structure table of distribution network is defined based on the simple input data,and the depth-first strategy is employed to identify hiberarchy and nodes queue so deciding the nodes' sequence for power flow calculation. Based on branch current ,this back/forward sweep algorithm is very efficient for distribution network power flow calculation. The 30-bus system numerical results show the advantages of the algorithm.
出处
《继电器》
CSCD
北大核心
2002年第5期6-8,13,共4页
Relay
