CN111353267A - Medium voltage distribution network topology simplified abstract method based on graph model - Google Patents
Medium voltage distribution network topology simplified abstract method based on graph model Download PDFInfo
- Publication number
- CN111353267A CN111353267A CN202010134103.2A CN202010134103A CN111353267A CN 111353267 A CN111353267 A CN 111353267A CN 202010134103 A CN202010134103 A CN 202010134103A CN 111353267 A CN111353267 A CN 111353267A
- Authority
- CN
- China
- Prior art keywords
- path
- nodes
- feeder
- core
- feeder line
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/06—Electricity, gas or water supply
Abstract
The invention discloses a medium-voltage distribution network topology simplifying and abstracting method based on a graph model, which is used for modeling medium-voltage distribution network topology, simplifying medium-voltage distribution network, realizing progressive abstract simplification of an original path, a key path, a core path and a core extremely simple path by using technologies such as homomorphic transformation, repeated edge elimination and the like in a graph theory, and providing an applicable topology level for application scenes such as microcosmic, mesoscopic and macroscopic aspects, such as feeder line overhaul and inspection, distribution network overhaul and regulation operation, power grid planning and the like. The invention effectively reduces the complexity of the distribution network topology while maintaining the network characteristics of the distribution network by abstracting layer by layer, thereby realizing the rapid analysis and visualization of various microscopic, intermediate and macroscopic service scenes such as feeder line patrol inspection, distribution network supply transfer analysis, power grid planning and the like.
Description
Technical Field
The invention relates to a medium voltage distribution network topology simplified abstract method based on a graph model, and belongs to the technical field of distribution network topology analysis.
Background
The power distribution network is used as a final link for supplying power to users by a power grid, and normal production and living orders of the society are directly influenced. Due to the fact that regions are scattered, equipment is numerous and complex, and the operation and maintenance management mode of the distribution network is rough. The medium-voltage distribution network is composed of a large number of feeders, the feeders are connected with each other through interconnection switches, and a large number of section switches are contained in the feeders. The feeder is a tree with the breaker as a root node and the distribution transformer and the tie switch as leaf nodes. Under the general condition, the sectionalizing switch is normally closed, and the contact switch is normally open, switches through sectionalizing switch and contact switch's state, can realize joining in marriage the nimble adjustment of net operational mode.
In recent years, with the continuous expansion of the construction scale of a power distribution network, more and more medium-voltage lines adopt a multi-section multi-connection or annular structure, and the topological structure of the power distribution network is increasingly complex. Meanwhile, the service applications of distribution network operation and maintenance, regulation and control, planning and the like gradually evolve from extensive management to lean management and control, and the dependence on clear and accurate distribution network topology is gradually promoted. However, the demands of these service scenarios are different, and there are also large differences in the distribution network area ranges that need to be analyzed, calculated and displayed.
The method has the advantages that a microscopic scene represented by line daily inspection, line high loss and electricity stealing analysis can be independently analyzed for each feeder line, the analysis granularity is an equipment level, and equipment elements and connection relations in the feeder lines are required to be complete and detailed as far as possible; in a mesoscopic scene represented by planned maintenance of a distribution network, failure and power failure recovery and the like, operation optimization of a heavy overload line is required, the analysis range needs to be expanded to a plurality of feeders with a connection relation, the analysis granularity is a feeder section which can be controlled by a connection/section switch, and the analysis granularity is more focused on the overall load characteristic of the feeder section rather than the equipment details, so that the internal structure of the feeder section belongs to negligible topological details; the method is characterized in that a macro scene represented by network frame reliability analysis, newly-built substation distribution point planning and network frame weak area upgrading and transformation needs to be analyzed for a medium-voltage distribution network full link formed by medium-voltage buses and feeders of substations of various voltage classes in a power supply area, the analyzed granularity is a distribution network connection unit or feeder, the distribution network connection unit or feeder is more focused on feeder connection characteristics, and the structure irrelevant to the connection characteristics in the feeder can be ignored.
The micro, mesoscopic and macroscopic service scenes relate to the large difference of power supply area ranges, the difference of the device volume can reach 3-5 orders of magnitude, the analysis characteristics of corresponding topological levels are different, and the dimensionality reduction is carried out by a hierarchical topological simplified abstract method, so that the topological analysis and visualization requirements of various scenes are met.
In terms of model storage, the traditional distribution network topology is based on a "connection point-terminal" model, and device connection information is stored by using a relational database. With the increase of the scale and complexity of the power distribution network and the shortening of the requirements on topology analysis calculation and visual rendering delay, the traditional relational database faces performance bottlenecks. The method of the invention provides a new solution on the application of dealing with the medium voltage distribution network service scene with massive and complex incidence relation by using the mathematical theory of graph theory and based on the graph database of the graph model through distributed parallel computation.
Disclosure of Invention
The purpose is as follows: the invention provides a simplified abstract method for a medium-voltage distribution network topology based on a graph model, and aims to solve the problems that in the prior art, differential modeling is not adopted for the medium-voltage distribution network topology aiming at service applications such as distribution network operation and maintenance, regulation and planning, and the like, so that the analysis efficiency is low, the visualization effect is poor, and the like.
The technical scheme is as follows: in order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a medium voltage distribution network topology simplification abstraction method based on a graph model comprises the following steps:
the method comprises the following steps: obtaining an original single line diagram of each feeder line, and constructing a feeder line original path model based on a diagram model;
step two: traversing each feeder line original path model, identifying a feeder line main path, marking load nodes, bifurcation nodes and relay nodes on the feeder line main path, identifying all feeder line segments, contracting the load nodes and the relay nodes in the feeder line segments and generating virtual load nodes to form a feeder line key path model;
step three: traversing each feeder line key path model, identifying all core feeder line segments, and aggregating virtual load nodes and section switches in the core feeder line segments to form a feeder line core path model;
step four: traversing each feeder core path model, identifying equivalent interconnection switches among the feeder core path models, carrying out recursive cascade combination on the equivalent interconnection switches to form virtual interconnection switches, and forming a feeder core simple path model.
Preferably, the method further comprises a fifth step of: the method comprises the steps of communicating all feeder line original path models into an area power distribution network original path model, communicating all feeder line key path models into an area power distribution network key path model, communicating all feeder line core path models into an area power distribution network core path model, communicating all feeder line core simple path models into an area power distribution network core simple path model, constructing four logically independent topological planes in a graph database, and respectively storing nodes and edges of the power distribution network model in the four independent topological planes.
Preferably, the method further comprises a sixth step of: and establishing a mapping relation between the topological planes.
Preferably, the step one comprises the following steps:
reading an original single line diagram of each feeder line of the production management system, abstracting non-conducting wire type equipment of the feeder lines into nodes, and constructing a node set V; for the wires connected between the nodes, the wires are abstracted into the edges connecting the nodes, an edge set E is constructed, and a feeder line original path model G is formed as (V, E).
Preferably, the second step comprises the following steps:
traversing the original path model of each feeder line, sequentially accessing n contact switches of the feeder line from the circuit breaker node at the outlet of the feeder line to obtain n path paths1～pathn,pathnRepresenting the path from the feeder outlet breaker to the nth tie switch, whereinn is the number of interconnection switches, and a feeder main path Gmain is obtained after n paths are merged, namely:
marking nodes which have the ascending degrees of 3 or more and are connected with load subtrees in the main path of the feeder line as load nodes; the load subtree is a subtree formed by nodes on a non-feeder line main path;
subtracting the load subtree on each path node in the main path of the feeder line, and marking the node with the degree more than or equal to 3 as a bifurcation node;
marking non-switch nodes with the degree of 2 of each path in the main path of the feeder line as relay nodes;
traversing the main feeder path, and labeling a path between any two adjacent switch class nodes on each path of the main feeder path as a feeder segment if no bifurcation node exists; if the bifurcation node exists, marking a path between the bifurcation node and each switching node as a feeder line segment; the switch nodes are a feeder circuit breaker, a section switch and a tie switch;
and (3) contracting all load nodes or relay nodes in the feeder line segment into edges, inserting a node into the edges, wherein the node is called as a virtual load node, and obtaining a feeder line key path model.
Preferably, the third step comprises the following specific steps:
traversing each feeder line key path model, and marking a path between any two adjacent core nodes on each path in the main feeder line path as a core feeder line segment; contracting the section switches and the virtual load nodes in each core feeder section to form a feeder core path model; the core nodes are feeder circuit breakers, bifurcation nodes and interconnection switches.
Preferably, the fourth step comprises the following specific steps:
traversing two feeder core path models connected through interconnection switches, checking feeder pairs at two ends of the interconnection switches, and if bifurcation nodes exist at two ends of the feeder pairs and two or more interconnection switches which are parallel and directly connected with the bifurcation nodes exist between the bifurcation nodes, calling the interconnection switches as equivalent interconnection switches; merging the equivalent interconnection switches into a virtual interconnection switch connected between the bifurcation nodes, then contracting the bifurcation nodes at the two ends into edges, and calling the bifurcation nodes contracted into the edges as virtual interconnection switch nodes; and checking whether an equivalent interconnection switch consisting of the virtual interconnection switch and the interconnection switch exists between the two feeder core path models or not, if so, merging the equivalent interconnection switch consisting of the virtual interconnection switch and the virtual interconnection switch into a virtual interconnection switch until no equivalent interconnection switch exists, and obtaining the feeder core extremely simple path model.
As a preferred scheme, the topology planes are respectively marked as an original path, a critical path, a core path and a core simple path, and the original path model, the critical path model, the core path model and the core simple path model of the area distribution network are respectively and correspondingly stored in the storage area distribution network; labels of 'Primary', 'Key', 'Core' and 'Core-E' are marked on the nodes which respectively correspond to the storage.
Preferably, the sixth step comprises the following specific steps: the abstract levels of an original path model, a key path model, a core path model and a core simple path model of the regional power distribution network are sequentially arranged from low to high, and for entity nodes in a topological plane with a high abstract level, one-to-one mapping edges are established with corresponding entity nodes of adjacent topological planes with a low level;
for a virtual node, establishing a one-to-many mapping edge from a high abstraction level topology plane to a plurality of entity nodes of an adjacent lower level topology plane, comprising:
1) establishing mapping edges between the virtual load nodes on the key path and a plurality of corresponding load nodes on the original path plane;
2) and establishing mapping edges between the newly generated virtual contact switch nodes on the core extremely-simple path topological plane and a plurality of corresponding equivalent contact switch nodes on the core path topological plane.
Has the advantages that: the invention provides a medium-voltage distribution network topology simplifying and abstracting method based on a graph model, which is characterized in that the graph model is used for modeling medium-voltage distribution network topology, the medium-voltage distribution network is simplified into complicated, original paths, key paths, core paths and core extremely simple paths are progressively abstracted and simplified by using the technologies of homomorphic transformation, repeated edge elimination and the like in a graph theory, and a suitable topology hierarchy is provided for application scenes such as microcosmic, mesoscopic and macroscopic aspects, such as feeder line overhaul and inspection, distribution network overhaul and regulation operation, power network planning and the like. The invention effectively reduces the complexity of the distribution network topology while maintaining the network characteristics of the distribution network by abstracting layer by layer, thereby realizing the rapid analysis and visualization of various microscopic, intermediate and macroscopic service scenes such as feeder line patrol inspection, distribution network supply transfer analysis, power grid planning and the like.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a partial schematic diagram of a single feeder line original single line diagram;
FIG. 3 is a schematic diagram of a local connection point-terminal model of a single feeder line original single line diagram;
FIG. 4 is a schematic diagram of a partial graph model of a single feeder original path model;
FIG. 5 is an exemplary diagram of a feeder critical path model building process;
FIG. 6 is an exemplary diagram of a feeder core path model building process;
FIG. 7 is an exemplary diagram of a plurality of parallel tie switches at the end of two feeder core paths;
FIG. 8 is a diagram illustrating an example of a core minimalist path model building process.
Fig. 9 is a diagram illustrating an example of the construction and mapping of a topology plane of a multi-level hierarchical network.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, a simplified abstract method for a topology of a medium voltage distribution network based on a graph model includes the following steps:
the method comprises the following steps: obtaining an original single line diagram of each feeder line, and constructing a feeder line original path model based on a diagram model;
reading an original single line diagram of each feeder line of a Production Management System (PMS), and constructing a feeder line original path model by applying a graph theory method: abstracting non-conducting line equipment (including station buses, feeder outlet circuit breakers, section switches, tie switches, towers and distribution transformers) of the feeder line into nodes (nodes), and constructing a Node set V; for wires connected between nodes, the wires are abstracted into edges (Edge) connecting the nodes, an Edge set E is constructed, and a graph model G (V, E) is formed, namely graph model formalized description is carried out on the original path topology of each feeder line in the power distribution network.
Step two: traversing each feeder line original path model, identifying a feeder line main path, marking load nodes, bifurcation nodes and relay nodes on the feeder line main path, identifying all feeder line segments, contracting the load nodes and the relay nodes in the feeder line segments and generating virtual load nodes to form a feeder line key path model;
traversing the original path model of each feeder line, sequentially accessing n contact switches of the feeder line from the circuit breaker node at the outlet of the feeder line to obtain n path paths1～pathn,pathnRepresenting a path from a feeder outlet circuit breaker to an nth tie switch, wherein n is the number of tie switches, and obtaining a feeder main path Gmain after merging the n paths, namely:
marking nodes which have the ascending degrees of 3 or more and are connected with load subtrees in the main path of the feeder line as load nodes; the load subtree is a subtree formed by nodes on a non-feeder line main path;
subtracting the load subtree on each path node in the main path of the feeder line, and marking the node with the degree more than or equal to 3 as a bifurcation node;
and marking the non-switching nodes with the degree of 2 on each path in the main path of the feeder line as relay nodes.
Traversing the main feeder path, and labeling a path between any two adjacent switch class nodes on each path of the main feeder path as a feeder segment if no bifurcation node exists; if the bifurcation node exists, marking a path between the bifurcation node and each switching node as a feeder line segment; the switch nodes are a feeder circuit breaker, a section switch and a tie switch;
and (3) contracting all load nodes or relay nodes in the feeder line segment into edges, inserting a node on the edges, wherein the node is called as a virtual load node, and the virtual load node is used as a load agent of the feeder line segment, so that a feeder line key path model is obtained.
Step three: traversing each feeder line key path model, identifying all core feeder line segments, and aggregating virtual load nodes and section switches in the core feeder line segments to form a feeder line core path model;
traversing each feeder line key path model, and marking a path between any two adjacent core nodes on each path in the main feeder line path as a core feeder line segment; contracting the section switches and the virtual load nodes in each core feeder section to form a feeder core path model; the core nodes are feeder circuit breakers, bifurcation nodes and interconnection switches.
Step four: traversing each feeder core path model, identifying equivalent interconnection switches among the feeder core path models, carrying out recursive cascade combination on the equivalent interconnection switches to form virtual interconnection switches, and forming a feeder core simple path model;
traversing two feeder core path models connected through interconnection switches, checking feeder pairs at two ends of the interconnection switches, and if bifurcation nodes exist at two ends of the feeder pairs and two or more interconnection switches which are parallel and directly connected with the bifurcation nodes exist between the bifurcation nodes, calling the interconnection switches as equivalent interconnection switches; merging the equivalent interconnection switches into a virtual interconnection switch connected between the bifurcation nodes, then contracting the bifurcation nodes at the two ends into edges, and calling the bifurcation nodes contracted into the edges as virtual interconnection switch nodes; and checking whether an equivalent interconnection switch consisting of the virtual interconnection switch and the interconnection switch exists between the two feeder core path models or not, and if so, merging the equivalent interconnection switch consisting of the virtual interconnection switch and the virtual interconnection switch into a virtual interconnection switch until no equivalent interconnection switch exists, thereby obtaining the feeder core extremely simple path model.
Step five: the method comprises the steps of communicating all feeder line original path models to form an area power distribution network original path model, communicating all feeder line key path models to form an area power distribution network key path model, communicating all feeder line core path models to form an area power distribution network core path model, communicating all feeder line core simple path models to form an area power distribution network core simple path model, building four logically independent topological planes in a graph database, respectively storing nodes and edges of the power distribution network model in the four independent topological planes, and building a mapping relation among the topological planes.
The topological planes are respectively marked as an original path, a key path, a core path and a core simple path, and the original path model, the key path model, the core path model and the core simple path model of the regional power distribution network are respectively and correspondingly stored; labels of 'Primary', 'Key', 'Core' and 'Core-E' are marked on the nodes which respectively correspond to the storage.
The abstract levels of an original path model, a key path model, a core path model and a core simple path model of the regional power distribution network are sequentially arranged from low to high, and for entity nodes (such as switches, bifurcation points and the like) in a topological plane of a high abstract level, one-to-one mapping edges are established between the entity nodes and corresponding entity nodes of adjacent topological planes of low levels;
for a virtual node (virtual load node, virtual tie switch node), establishing a one-to-many mapping edge from a high abstraction level topology plane to a plurality of entity nodes of an adjacent low level topology plane, comprising:
1) establishing mapping edges between the virtual load nodes on the key path and a plurality of corresponding load nodes on the original path plane;
2) and establishing mapping edges between the newly generated virtual contact switch nodes on the core extremely-simple path topological plane and a plurality of corresponding equivalent contact switch nodes on the core path topological plane.
Example 1:
the embodiment of the invention provides a medium voltage distribution network topology simplified abstract method based on a graph model, which comprises the following steps:
the method comprises the following steps: obtaining an original single line diagram of each feeder line, and constructing a feeder line original path model based on a diagram model, wherein the specific example is as follows: as shown in fig. 2: in the figure, T represents distribution transformation, X represents a tower, TS represents a tie switch, CB represents a section switch, and L represents a line; the traditional 'connection point-terminal' model construction is locally carried out based on the single feeder of fig. 2, as shown in fig. 3: in the figure, small circles represent terminals, triangles represent connection points, and it can be seen that the complexity of the traditional model is extremely high; graph model construction is performed locally based on the single feeder shown in fig. 2, as shown in fig. 4: node represents a Node, Edge represents an Edge, and the graph model of the feeder line original path model is G ═ V, E.
As shown in fig. 5, step two: traversing each feeder original path model, identifying a feeder main path, and sequentially accessing 2 tie switches TS1 of the feeder from a feeder outlet breaker node,
TS2, get 2 paths path1、path2The main path Gmain of the feeder line is path1、path2A collection of (a).
For path1The load node, the fork node and the relay node on the network node are labeled, and specific examples are as follows: as shown in fig. 5-1, a schematic diagram of a representative feeder original path model is shown, where P0 is a branch node, P1, P2, P4, P5, and P8 are load nodes, and P3, P6, and P7 are relay nodes;
the original path model of the feeder line is suitable for a micro service scene, the scene is generally limited to the interior of a single feeder line, and typical micro applications comprise equipment asset management, line daily inspection, line high loss and electricity stealing analysis and the like. Therefore, the microscopic scene can independently perform analysis aiming at each feeder line, the analysis granularity is the equipment level, and the requirement on the completeness of equipment elements and connection relations in the feeder lines is required.
Then, traversing the feeder original path model, identifying all feeder segments, contracting load nodes and relay nodes in the feeder segments to generate virtual load nodes, and constructing a feeder key path model, wherein the specific example is as follows: the original feeder path model segment shown in fig. 5-1, a path in the main feeder path from the branch point P0 to the interconnection switch TS11，path1The nodes are P0-P88, wherein 6 nodes of P0, P1, P2, P4, P5 and P8 have load subtrees, and the distribution changes corresponding to the load subtrees are { T1, T2}, { T3}, { T4, T5, T6}, { T7}, { T8}, and { T9, T10}, respectively. First, a branch node BV1 is denoted as P0, relay nodes RV1 to RV3 are denoted as P3, P6 and P7, load nodes LV1 to LV5 are denoted as P1, P2, P4, P5 and P8, and all load subtrees are removed, as shown in fig. 5-2, representing an intermediate state model diagram. Then, the path1A branch node BV1, section switches CB1 and CB2, a tie switch TS1 are arranged on the path1And (3) three feeder segments of { BV1, CB1}, { CB1, CB2}, { CB2, and TS1}, wherein load nodes or relay nodes in the feeder segments are shrunk to edges and inserted into virtual load nodes VV1 to VV3, so as to obtain a feeder critical path model, which is shown in fig. 5-3 and represents a feeder critical path model schematic diagram.
The feeder line key path model is suitable for a medium-view service scene, the scene comprises services such as distribution network planned maintenance, fault power failure recovery and the like, heavy overload line operation optimization and the like, the switching supply analysis among feeder lines is related, a single feeder line cannot meet the requirement of independent analysis, the analysis range needs to be expanded to a plurality of feeder lines with contact relation, the analysis granularity is a feeder line section which can be controlled through a contact/section switch, the integral load characteristic of the feeder line section is emphasized rather than the equipment detail, and therefore the internal structure of the feeder line section belongs to negligible topological detail.
Step three: traversing the feeder line key path model, identifying all core feeder line segments, and aggregating virtual load nodes and sectional switch nodes in the core feeder line segments to form the feeder line core path modelSpecific examples are: fig. 6-1 shows a schematic diagram representing a feeder line critical path model, a feeder line breaker BRK, a bifurcation node BV1, tie switches TS1 and TS2, and identifies a feeder line main path1、path2The three core feeder segments { BRK, BV1}, { BV1, TS1}, { BV1, TS2} are respectively shrunk by the virtual load nodes VV0 on the { BRK, BV1} path, the virtual load nodes VV1 to VV3 and the segmented switch nodes CB1 to CB2 on the { BV1, TS1} path, and the virtual load nodes VV4 to VV5 and the segmented switches CB3 to CB4 on the { BV1, TS2} path, so as to obtain a feeder core path model, which is shown in fig. 6-2 and represents a feeder core path model schematic diagram.
Step four: traversing all feeder core path models, identifying equivalent interconnection switches among the feeder core path models, performing recursive cascade combination to form a virtual interconnection switch, and forming a core extremely simple path model of each feeder, wherein the specific example is as follows:
as shown in fig. 7, the feeder core path models a and the feeder core path models B are connected by six shared interconnection switches TS1 to TS6, and the feeder pairs at both ends of the six interconnection switches respectively have four branch nodes A3, a4, B3, and B4. TS1 to TS3 and TS4 to TS6 are equivalent interconnection switches between the branch node pairs { A3, B3} and { a4, B4}, respectively, and the a feeder core path model and the C feeder core path model, and the B feeder core path model and the D feeder core path model are interconnected at the end of the line by the common interconnection switches TS7 and TS8, respectively.
An example of core minimalist path model production is shown in figure 8. Fig. 8 is simplified on the basis of the feeder core path model shown in fig. 7, and a core minimum path model is formed.
Step 1: equivalent tie switches TS 1-TS 3 and TS 4-TS 6 in fig. 7 are combined to generate virtual tie switches TSV1 and TSV2, respectively. In the process, the degrees of the branch nodes A3, a4, B3, B4 all decrease from 4 to 2, as shown in fig. 8-1, which represents a schematic diagram generated by the feeder core path model virtual tie switch.
Step 2: and degrading the 4 degraded branch nodes into the relay nodes, and shrinking the relay nodes. Upon completion, the virtual tie switches TSV1 and TSV2 between the node pair { A2, B2} form equivalent tie switches, as shown in FIG. 8-2, which illustrates the degradation contraction of the branch node.
And step 3: and carrying out secondary combination on the virtual contact switch nodes TSV1 and TSV2 to obtain a virtual contact switch node TSV 3. In this process, the degree of each of the bifurcation nodes a2, B2 drops from 3 to 2, as shown in fig. 8-3, which represents a schematic diagram of the generation of the virtual tie switch.
And 4, step 4: the degraded forking nodes a2, B2 are shrunk a second time, as shown in fig. 8-4, representing the core minimalist path model. After the operation is completed, it is checked that there is no equivalent interconnection switch between the feeder a and the feeder B.
The core extremely simple path is suitable for a macro service scene, a typical macro application is distribution network investment planning, the distribution network investment planning comprises the scenes of network frame reliability analysis, newly-built substation distribution point planning, network frame weak area upgrading and reconstruction and the like, a medium-voltage distribution network full link formed by medium-voltage buses and feeders of substations of various voltage classes in a power supply area needs to be analyzed, the analyzed granularity is distribution network connection units or feeders, the feeder connection characteristics are emphasized, and the structure irrelevant to the connection characteristics in the feeders can be ignored. It should be noted that there is a requirement for analyzing a part of service scenarios in a layer-by-layer progressive manner, i.e., macro, then medium/micro, and switching between topology layers is required.
Step five: four logically independent topology planes are constructed in a graph database, nodes and edges of an area power distribution network original path model, an area power distribution network critical path model, an area power distribution network core path model and an area power distribution network core simple path model are respectively stored, and a mapping relation is established among the topology planes, as shown in fig. 9 specifically:
and when the feeder line model is communicated with the corresponding regional distribution network model, the feeder line model at one end is connected with the corresponding shared interconnection switch of the feeder line model at the other end after deleting the shared interconnection switch.
And creating corresponding nodes and edges in a graph database according to the feeder lines of each hierarchy and the regional power distribution network model. Labels of 'original path', 'key path', 'core path' and 'core simple path' are added to each level of nodes and edges respectively for marking and distinguishing, and therefore four logically independent topology planes are constructed.
For entity nodes (such as switches, bifurcation points and the like) in a topological plane with a high abstraction level, establishing one-to-one mapping edges with corresponding entity nodes of an adjacent lower level plane, as shown by flat dotted lines in FIG. 9;
for a virtual node (virtual load node, virtual tie switch node), a one-to-many mapping edge is established from a topology plane of a high abstraction level to a plurality of entity nodes of an adjacent lower level plane, as shown by dotted lines in fig. 9, including:
1) establishing mapping edges between the virtual load nodes on the key path and a plurality of corresponding load nodes on the original path plane;
2) establishing mapping edges between the newly generated virtual contact switch nodes on the core minimalist path topological plane and a plurality of corresponding equivalent contact switch nodes on the core path topological plane
The above description is only of the preferred embodiments of the present invention, and it should be noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and these are intended to be within the scope of the invention.
Claims (9)
1. A medium voltage distribution network topology simplification abstract method based on a graph model is characterized in that: the method comprises the following steps:
the method comprises the following steps: obtaining an original single line diagram of each feeder line, and constructing a feeder line original path model based on a diagram model;
step two: traversing each feeder line original path model, identifying a feeder line main path, marking load nodes, bifurcation nodes and relay nodes on the feeder line main path, identifying all feeder line segments, contracting the load nodes and the relay nodes in the feeder line segments and generating virtual load nodes to form a feeder line key path model;
step three: traversing each feeder line key path model, identifying all core feeder line segments, and aggregating virtual load nodes and section switches in the core feeder line segments to form a feeder line core path model;
step four: traversing each feeder core path model, identifying equivalent interconnection switches among the feeder core path models, carrying out recursive cascade combination on the equivalent interconnection switches to form virtual interconnection switches, and forming a feeder core simple path model.
2. The medium voltage distribution network topology simplification abstraction method based on the graph model according to claim 1, is characterized in that: further comprising a fifth step of: the method comprises the steps of communicating all feeder line original path models into an area power distribution network original path model, communicating all feeder line key path models into an area power distribution network key path model, communicating all feeder line core path models into an area power distribution network core path model, communicating all feeder line core simple path models into an area power distribution network core simple path model, constructing four logically independent topological planes in a graph database, and respectively storing nodes and edges of the power distribution network model in the four independent topological planes.
3. The medium voltage distribution network topology simplification abstraction method based on the graph model according to claim 2, characterized in that: further comprising a sixth step of: and establishing a mapping relation between the topological planes.
4. The method for simplifying and abstracting topology of a medium voltage distribution network based on a graph model according to any one of claims 1 to 3, characterized in that: the first step is as follows:
reading an original single line diagram of each feeder line of the production management system, abstracting non-conducting wire type equipment of the feeder lines into nodes, and constructing a node set V; for the wires connected between the nodes, the wires are abstracted into the edges connecting the nodes, an edge set E is constructed, and a feeder line original path model G is formed as (V, E).
5. The method for simplifying and abstracting topology of a medium voltage distribution network based on a graph model according to any one of claims 1 to 3, characterized in that: the second step comprises the following specific steps:
traversing the original path model of each feeder line, sequentially accessing n contact switches of the feeder line from the circuit breaker node at the outlet of the feeder line to obtain n path paths1～pathn,pathnRepresenting a path from a feeder outlet circuit breaker to an nth tie switch, wherein n is the number of tie switches, and obtaining a feeder main path Gmain after merging the n paths, namely:
marking nodes which have the ascending degrees of 3 or more and are connected with load subtrees in the main path of the feeder line as load nodes; the load subtree is a subtree formed by nodes on a non-feeder line main path;
subtracting the load subtree on each path node in the main path of the feeder line, and marking the node with the degree more than or equal to 3 as a bifurcation node;
marking non-switch nodes with the degree of 2 of each path in the main path of the feeder line as relay nodes;
traversing the main feeder path, and labeling a path between any two adjacent switch class nodes on each path of the main feeder path as a feeder segment if no bifurcation node exists; if the bifurcation node exists, marking a path between the bifurcation node and each switching node as a feeder line segment; the switch nodes are a feeder circuit breaker, a section switch and a tie switch;
and (3) contracting all load nodes or relay nodes in the feeder line segment into edges, inserting a node into the edges, wherein the node is called as a virtual load node, and obtaining a feeder line key path model.
6. The method for simplifying and abstracting topology of a medium voltage distribution network based on a graph model according to any one of claims 1 to 3, characterized in that: the third step comprises the following specific steps:
traversing each feeder line key path model, and marking a path between any two adjacent core nodes on each path in the main feeder line path as a core feeder line segment; contracting the section switches and the virtual load nodes in each core feeder section to form a feeder core path model; the core nodes are feeder circuit breakers, bifurcation nodes and interconnection switches.
7. The method for simplifying and abstracting topology of a medium voltage distribution network based on a graph model according to any one of claims 1 to 3, characterized in that: the fourth step comprises the following specific steps:
traversing two feeder core path models connected through interconnection switches, checking feeder pairs at two ends of the interconnection switches, and if bifurcation nodes exist at two ends of the feeder pairs and two or more interconnection switches which are parallel and directly connected with the bifurcation nodes exist between the bifurcation nodes, calling the interconnection switches as equivalent interconnection switches; merging the equivalent interconnection switches into a virtual interconnection switch connected between the bifurcation nodes, then contracting the bifurcation nodes at the two ends into edges, and calling the bifurcation nodes contracted into the edges as virtual interconnection switch nodes; and checking whether an equivalent interconnection switch consisting of the virtual interconnection switch and the interconnection switch exists between the two feeder core path models or not, if so, merging the equivalent interconnection switch consisting of the virtual interconnection switch and the virtual interconnection switch into a virtual interconnection switch until no equivalent interconnection switch exists, and obtaining the feeder core extremely simple path model.
8. The method for simplifying and abstracting topology of a medium voltage distribution network based on a graph model according to claim 2 or 3, characterized in that: the topological planes are respectively marked as an original path, a key path, a core path and a core simple path, and the original path model, the key path model, the core path model and the core simple path model of the regional power distribution network are respectively and correspondingly stored; labels of 'Primary', 'Key', 'Core' and 'Core-E' are marked on the nodes which respectively correspond to the storage.
9. The medium voltage distribution network topology simplification abstraction method based on the graph model according to claim 3, characterized in that: the sixth concrete step is as follows:
the abstract levels of an original path model, a key path model, a core path model and a core simple path model of the regional power distribution network are sequentially arranged from low to high, and for entity nodes in a topological plane with a high abstract level, one-to-one mapping edges are established with corresponding entity nodes of adjacent topological planes with a low level;
for a virtual node, establishing a one-to-many mapping edge from a high abstraction level topology plane to a plurality of entity nodes of an adjacent lower level topology plane, comprising:
1) establishing mapping edges between the virtual load nodes on the key path and a plurality of corresponding load nodes on the original path plane;
2) and establishing mapping edges between the newly generated virtual contact switch nodes on the core extremely-simple path topological plane and a plurality of corresponding equivalent contact switch nodes on the core path topological plane.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010134103.2A CN111353267B (en) | 2020-02-28 | 2020-02-28 | Medium voltage distribution network topology simplified abstract method based on graph model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010134103.2A CN111353267B (en) | 2020-02-28 | 2020-02-28 | Medium voltage distribution network topology simplified abstract method based on graph model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111353267A true CN111353267A (en) | 2020-06-30 |
| CN111353267B CN111353267B (en) | 2021-07-20 |
Family
ID=71195909
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010134103.2A Active CN111353267B (en) | 2020-02-28 | 2020-02-28 | Medium voltage distribution network topology simplified abstract method based on graph model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111353267B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111898925A (en) * | 2020-08-13 | 2020-11-06 | 国网湖南省电力有限公司 | Area protection power supply risk analysis method based on event tree |
| CN113190947A (en) * | 2021-05-27 | 2021-07-30 | 广东电网有限责任公司 | Feed line group dividing method and device |
| CN114399124A (en) * | 2022-03-24 | 2022-04-26 | 腾讯科技（深圳）有限公司 | Path data processing method, path planning method, path data processing device, path planning device and computer equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090216820A1 (en) * | 2006-05-11 | 2009-08-27 | Geistiges Eigentum, Inc. | Fast computation of compact poset isomorphism certificates |
| CN103150425A (en) * | 2013-02-06 | 2013-06-12 | 上海交通大学 | Automatic generation method used for single line diagram of distribution network and based on topological hierarchy |
| CN104361105A (en) * | 2014-11-28 | 2015-02-18 | 国家电网公司 | Power distribution network model and topology checking method based on ontology reasoning |
| CN104810853A (en) * | 2015-05-08 | 2015-07-29 | 杭州沃瑞电力科技有限公司 | Digraph-based islanding method of distribution network including distributed generations |
| CN105138764A (en) * | 2015-08-20 | 2015-12-09 | 国网山东省电力公司电力科学研究院 | Automatic power grid thematic map model generating method based on multi-objective optimization |
| WO2018082364A1 (en) * | 2016-11-02 | 2018-05-11 | 全球能源互联网研究院有限公司 | Method and device for analyzing power-off range of power distribution network, and computer storage medium |
| CN109933953A (en) * | 2019-04-11 | 2019-06-25 | 东南大学 | Composition of Switching State of Distribution Network discrimination method based on probability graph model |
-
2020
- 2020-02-28 CN CN202010134103.2A patent/CN111353267B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090216820A1 (en) * | 2006-05-11 | 2009-08-27 | Geistiges Eigentum, Inc. | Fast computation of compact poset isomorphism certificates |
| CN103150425A (en) * | 2013-02-06 | 2013-06-12 | 上海交通大学 | Automatic generation method used for single line diagram of distribution network and based on topological hierarchy |
| CN104361105A (en) * | 2014-11-28 | 2015-02-18 | 国家电网公司 | Power distribution network model and topology checking method based on ontology reasoning |
| CN104810853A (en) * | 2015-05-08 | 2015-07-29 | 杭州沃瑞电力科技有限公司 | Digraph-based islanding method of distribution network including distributed generations |
| CN105138764A (en) * | 2015-08-20 | 2015-12-09 | 国网山东省电力公司电力科学研究院 | Automatic power grid thematic map model generating method based on multi-objective optimization |
| WO2018082364A1 (en) * | 2016-11-02 | 2018-05-11 | 全球能源互联网研究院有限公司 | Method and device for analyzing power-off range of power distribution network, and computer storage medium |
| CN109933953A (en) * | 2019-04-11 | 2019-06-25 | 东南大学 | Composition of Switching State of Distribution Network discrimination method based on probability graph model |
Non-Patent Citations (1)
| Title |
|---|
| 蒋玮: "基于集成深度神经网络的配电网联络关系辨识技术", 《电力系统自动化》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111898925A (en) * | 2020-08-13 | 2020-11-06 | 国网湖南省电力有限公司 | Area protection power supply risk analysis method based on event tree |
| CN111898925B (en) * | 2020-08-13 | 2022-08-05 | 国网湖南省电力有限公司 | Area protection power supply risk analysis method based on event tree |
| CN113190947A (en) * | 2021-05-27 | 2021-07-30 | 广东电网有限责任公司 | Feed line group dividing method and device |
| CN114399124A (en) * | 2022-03-24 | 2022-04-26 | 腾讯科技（深圳）有限公司 | Path data processing method, path planning method, path data processing device, path planning device and computer equipment |
| CN114399124B (en) * | 2022-03-24 | 2022-06-17 | 腾讯科技（深圳）有限公司 | Path data processing method, path planning method, path data processing device, path planning device and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111353267B (en) | 2021-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111353267B (en) | Medium voltage distribution network topology simplified abstract method based on graph model | |
| CN110276532B (en) | Power distribution network reliability calculation method based on research of load blocks | |
| CN102403718B (en) | Generating method for power grid topological relationship based on Arcgis | |
| Lin et al. | Heuristic rule-based phase balancing of distribution systems by considering customer load patterns | |
| Huang et al. | Service restoration of distribution systems under distributed generation scenarios | |
| CN105449676A (en) | Regional node network generating method and system of power distribution network | |
| He et al. | Reliability analyses of wide-area protection system considering cyber-physical system constraints | |
| CN112966385A (en) | Method and system for identifying topology weak points of power distribution network frame | |
| Bakirtzis et al. | Decentralised DC load flow and applications to transmission management | |
| CN111563304B (en) | Power distribution network frame meta-model construction method | |
| CN109871566A (en) | Circuit construction method and storage medium based on power network topology technology | |
| CN105243248A (en) | Method and system for producing substation main wiring model used for PSD-BPA simulation | |
| Shum et al. | Modeling and simulating communications of multiagent systems in smart grid | |
| CN107591802A (en) | A kind of abstract method of calibration of distribution network model | |
| CN110197302B (en) | Power distribution network planning method considering wiring mode topology constraints | |
| CN107909226B (en) | Business expansion installation power supply scheme design method and device | |
| CN106407275A (en) | Data fusion-based power grid topology analysis method | |
| CN115879742A (en) | Power distribution network transformation method and system, electronic equipment and storage medium | |
| Chen et al. | Hierarchical distribution network topology formulation and dimensionality reduction using homeomorphism transformation | |
| CN109102170A (en) | Device model title modification method, device and storage medium based on OMS | |
| CN114492966A (en) | Urban distribution network tie line optimization method and system based on two-tie connection mode | |
| CN113627766A (en) | Risk identification method for topology identification power failure maintenance plan | |
| Bessani et al. | Robustness of reconfigurable complex systems by a multi-agent simulation: Application on power distribution systems | |
| JP5014254B2 (en) | System separation judgment method and program thereof | |
| Wu et al. | Distribution network topology modelling and automatic mapping based on CIM and GIS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |