-log Plot Of The Distribution Grid Wiring Diagram Integrated Modeling And Optimization Algorithm

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.