节点文献
基于节点搜索的网架重构方法
Network-Reconfiguration Scheme Based on Node Search
【摘要】 复杂电力系统网架重构中以线路的通断为状态变量的建模方法,存在寻优问题维数过大,且在搜索目标网架时可能造成结果冗余的问题。该文提出一种以节点恢复与否为状态变量进行建模的方法。该方法以电力系统中的节点为搜索对象,寻优得到唯一的节点恢复序列,通过选择性地闭合恢复节点之间的线路得到目标网架,所得目标网架满足拓扑连通性和安全、稳定运行约束。同时,针对目前保证目标网架连通性方法的不足,提出一种基于迪杰斯特拉算法(Dijkstra algorithm)的目标网架选择方法,并以IEEE 118节点系统和某地区电网为算例,验证了所提方法的有效性。
【Abstract】 The modelling method based on line break state for complex power system network-reconfiguration has the problems that the dimension of optimization problem is too large and searching the target network may result in redundant results. Aiming at these problems,this paper proposes a modelling method with taking node recovery or not as state variable. The method takes the nodes in the power system as the search object,and obtains the unique sequence of recovery nodes through optimization. The target network can be obtained by connecting lines between those recovery nodes selectively,which meets the conditions of constraint,namely topological connectivity,safe and stable operation constraints.Meanwhile,according to the draw back of existing method for network connectivity assurance,this paper proposes a target network selection method based on Dijkstra algorithm,and verifies the validity of the proposed method with taking IEEE118-bus system and a regional power grid as examples.
【Key words】 power system restoration; network-reconfiguration; network connectivity; Dijkstra algorithm;
- 【文献出处】 电力建设 ,Electric Power Construction , 编辑部邮箱 ,2018年01期
- 【分类号】TM711
- 【被引频次】2
- 【下载频次】138