搜索法电力系统网络拓扑算法设计(申波).doc

大连海事大学 毕 业 论 文 二○一〇年六月 搜索法电力系统网络拓扑算法设计 专业班级： 06港电一班 姓 名： 申波 指导教师： 姚玉斌 轮机工程学院  摘 要 网络拓扑分析是能量管理系统和配电管理系统的重要组成部分，对其研究具有重要的理论价值和应用价值。它是能量管理系统和配电管理系统中其它高级应用软件的基础，作为一个公用的基础模块，其可靠性和快速性直接影响能量管理系统和配电管理系统的性能。 本文介绍了网络拓扑分析中常用的三种方法：矩阵法，搜索法和方程就求法。详细阐述了搜索法的特点，原理与算法设计。 搜索法是目前网络拓扑分析中应用最广泛的拓扑分析方法之一。该方法是通过搜索节点的相邻节点的方法来进行网络拓扑分析的。拓扑分析是从某一个节点开始，搜索通过闭合开关和该节点连接在一起的节点，将他们划分为一条母线。电气岛分析是搜索通过支路连接在一起的母线，将这些母线以及连接在这些母线上的支路划分为一个电气岛。 搜索法根据搜索方法的不同，有深度优先搜索DFS(Depth First Search)和广度优先搜索BFS（Breadth First Search ）。基于深度（或广度）优先搜索的方法是电力系统拓扑分析的基本算法。该算法对数据安排和结构设计合理，运算速度快，对大规模电网，此方法相对于其他两种算法速度优势更明显。 Abstract This article first has made the brief outline to the development of the electrical power system load flow computational method and to its research vital significance , then in has analyzed the power distribution network and in the electric transmission network structure difference foundationcin , in view of the electric transmission network ring-like structure characteristic , introduced briefly restraining performance good Newton abdicates the law and the PQ decoupled mothod .While in view of the distribution network radiation structure characteristic , as well as considered in the electrical power system voltage model , we have used the load flow computational method which is called back/forward sweep method . Back/forward sweep method request network the analysis topology must reflect the iterative variable the recursion computation order .Starts from the root node , first searches the traversal leg according to the breadth the order for the leg serial number .This serial number method has the systematic characteristic front , it can satisfy the request of back/forward sweep method , but its flaw lies in works as when network architecture change , the leg number must disrupt arranges , insufficiently nimble .But , for all this , back/forward sweep method still was one kind quite suitably in the distribution network lo