电网接线图中布点的数图一体化建模及优化算法研究

【作者】 范超；

【导师】 张焰；

【作者基本信息】 上海交通大学 ， 电力系统及其自动化， 2008， 硕士

【摘要】 近年来,随着国民经济的高速发展,电力系统规模不断扩大,电网接线图越来越复杂,单纯依靠人工手动绘制电网接线图也越来越难,且容易出错。随着计算机技术的快速发展,使得电网接线图的自动绘制、分析及优化成为可能。目前,在电网规划与运行中,电网接线图一般是以Auto-CAD形式给出的,无法对其进行编辑,这对电网的分析计算工作十分不便,需要研究并开发一种能自动绘制可供编辑的电网接线图的系统。在电网接线图自动绘制过程中,最关键的环节是需要确定每个节点的位置及节点间的连接关系。通常已知的数据文件如潮流计算数据只包含节点连接关系,并不包含节点位置,因此,首先需要研究一种能够根据节点连接关系确定每个节点在电网接线图中具体位置的方法。本文在学习图论、网络算法,以及拓扑学相关理论及方法的基础上,建立以节点间连接线路总长度为优化目标的网络模型,提出一种以节点连接关系为基础,对节点位置进行优化布局的方法。为了解决电网规模较大或结构复杂时给绘图过程中的分析计算带来过多工作量的问题,本文首先利用GN算法对电网进行拓扑分割,把电网分成若干个子网络,以每个子网络之间的连接点作为割点,通过对每一次网络分割产生的割点的连接关系进行分析,以及对可进行布点的目标位置的分析,得到割点最佳位置,确立出网络的主干结构。根据已确定位置的节点和节点连接关系,对未确定位置的节点进行搜索,最后根据同样的布点方法,确定普通节点的位置。为了验证所提算法的有效性,本文以IEEE-118系统为例进行分析计算,结果表明,本文提出的算法可以有效地对118个节点组成的网络进行分割和优化,确定各个点的相对位置。更多还原

【Abstract】 In recent years, with the rapid development of the national economy, the scale of power systems is expanding continuously. It is more and more difficult to draw power grids diagram artificially, and it is also easy to make mistakes. With the rapid development of computer technology, it is possible to draw, analysis and optimize complex power grids diagram automatically with computer.In actual planning and operation of the power grid, power grid diagrams are often given in AutoCAD format, which is unable to edit and analysis. This brings the power system staff many inconveniences. Therefore, the research and development of a system which can map power grid diagrams automatically has an important practical significance. In the process of automatic drawing, the most critical aspect is the information of the location of each node and the connections between nodes. But under normal conditions, the data files contain only the data of node connections, does not contain node location. So we need study a method to determine node locations with the basis node connections data.In this paper, upon learning graph theory, network algorithm, as well as topology theory, with the application of math-graph method, , a network model is established with the length of connection lines as the optimization objective and a method to determine node locations with the basis of nodes collections data in accordance with the subject of this paper. The basic idea is to read connections nodes data, analysis and determine position of each node, then according to node connections, drawing out the required grid wiring diagram automatically. In order to solve the large-scale grid computing problem, the large-scale power network need to be separated according to its topology structure, which divide the power grid into several sections with GN algorithm. Each section of the connection contains some cut dotes. According to every network segmentation dotes collections, analysis can be carried out. By layout of the location of the available target, the best position can be got. Through this method, grid structure can be established. Then according to positions of located nodes and node connections, the remaining nodes can be searched. Then with to the same method, locations of normal nodes can be determined.In order to verify the validity of the algorithm, IEEE-118 node system is used in this paper as an example. The calculated results show that the proposed algorithm can be effectively carried out on 118 nodes segmentation and optimization analysis, and determine the relative position of each node.更多还原