CN105023069A - Distribution network reconstruction method - Google Patents
Distribution network reconstruction method Download PDFInfo
- Publication number
- CN105023069A CN105023069A CN201510485774.2A CN201510485774A CN105023069A CN 105023069 A CN105023069 A CN 105023069A CN 201510485774 A CN201510485774 A CN 201510485774A CN 105023069 A CN105023069 A CN 105023069A
- Authority
- CN
- China
- Prior art keywords
- distribution network
- switch
- undirected
- model
- illustraton
- 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.)
- Pending
Links
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a distribution network reconstruction method. The method comprises following steps of establishing an undirected graph model for a distribution network so as to form a distribution network undirected model graph, wherein each side of the distribution network undirected model graph comprises a switch, and each switch has two states, namely, on and off; firstly, calculating an initial weight value of each side; then, calculating a weight change factor of each side; and finally, determining a branch weight of each side, and seeking, through a Dijkstra shortest path searching algorithm, the shortest path for providing power for each load node by a root node. Through adoption of the method, the distribution network is reconstructed, and the work efficiency is improved.
Description
Technical field
The present invention relates to a kind of Distribution Network Reconfiguration in power transmission and distribution field.
Background technology
Topological analysis is an indispensable part in Network Reconfiguration Algorithm, and in power distribution network network reconfiguration, topological analysis is used under the method for operation of continuous converting network, finds the network structure meeting the optimum of objective function.Therefore, topological analysis is the basis of whole Network Reconfiguration Algorithm.
Graph theory plays an important role in Network topology, namely the concept of distribution network figure can be described.Consider that the starting point of distribution feeder is substation bus bar, all substation bus bars are equivalent to a common node, thus when all block switches are closed, interconnection switch disconnects, whole distribution network is exactly a tree having common root node.Switch is the main object of power distribution network reconfiguration, make switch as the arc of figure, and make the node of the formation figure such as feeder line section, distribution transforming, load between switch, whole distribution network just constitutes between any two nodes to be had and the total indirected graph only having an arc connected, i.e. the undirected illustraton of model of power distribution network.Obviously, the result of reconstruct just in time forms a subgraph of this total indirected graph (the undirected illustraton of model of power distribution network).In order to ensure that all loads can both obtain electric power supply, this subgraph must be communicated with, and comprises all nodes in total indirected graph, and namely this subgraph is the support subgraph of the connection of total indirected graph.Simultaneously in order to ensure radial power supply, this subgraph must be without circle (open loop).Comprehensively above-mentioned, the formation method of distribution network figure is as follows:
(1) starting point (substation bus bar) of all feeder lines is equivalent to a node, is called root node;
(2) outlet switch, block switch, interconnection switch are equivalent to the arc of figure;
(3) between switch, the element equivalent such as feeder line section, distribution transforming, load is node.
Due to power distribution network be closed loop design, open loop runs radially, all load buses are powered by power supply point, therefore can be understood as in weighted graph, and all load buses all need to set up the access path with root node.Therefore, the optimum solution required by For Distribution Networks Reconfiguration problem can think that finding in weighted graph with root node is starting point, meets the power supply shortest route problem of root node to other nodes of a certain objective function.Significant advantage shortest path algorithm being applied to For Distribution Networks Reconfiguration is exactly can set up in the process be connected with root node at all load buses automatically to form radial networks.
When recycling shortest path algorithm carries out For Distribution Networks Reconfiguration, need the branch road weights first determining every bar limit in the undirected illustraton of model of power distribution network, then utilize the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus, and then carry out For Distribution Networks Reconfiguration.Because Dijkstra Shortest Path Searching Algorithm does not rely on the initial configuration of network, respectively its supply path is found to each load bus, make to form tree network and become easy.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, a kind of Distribution Network Reconfiguration is provided, it fast and effeciently can determine the branch road weights on every bar limit in the undirected illustraton of model of power distribution network, then the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus is utilized, and then carry out For Distribution Networks Reconfiguration, increase work efficiency.
A kind of technical scheme realizing above-mentioned purpose is: a kind of Distribution Network Reconfiguration, comprises the following steps:
S1, for distribution network sets up a non-directed graph model, form the undirected illustraton of model of power distribution network, in the undirected illustraton of model of this power distribution network, every bar limit comprises a switch, and each switch has two states, and namely switch closes and switch opens;
S2, the initializes weights function OW on every bar limit is as shown in formula (1):
In formula (1), the initializes weights value on every bar limit depends on the state of the switch on every bar limit, if switch closes, the initializes weights value on this limit is set to 1; If switch disconnects, the initializes weights value on this limit is set to 100;
S3, calculate all switches in power distribution network undirected illustraton of model close situation under power flow of ring net distribution, the weight changed factor WA on every bar limit is as shown in formula (2):
WA＝|△U
jk| (2)
In formula (2), △ U
jkit is the absolute value of per unit voltage drop on the jk of limit;
S4, in the undirected illustraton of model of power distribution network, the branch road weight FW on every bar limit is as shown in formula (3):
FW＝OW+WA (3)；
S5, according to the branch road weight on every bar limit, utilizes the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus, and then carries out For Distribution Networks Reconfiguration.
Above-mentioned a kind of Distribution Network Reconfiguration, is characterized in that, the switch in the undirected illustraton of model of described power distribution network comprises interconnection switch and block switch.
Above-mentioned a kind of Distribution Network Reconfiguration, is characterized in that, described root node is the starting point of all feeder lines in distribution network, i.e. substation bus bar;
Described load bus comprises feeder line section between distribution network breaker in middle, distribution transforming and load cell.
Have employed the technical scheme of a kind of Distribution Network Reconfiguration of the present invention, it fast and effeciently can determine the branch road weights on every bar limit in the undirected illustraton of model of power distribution network, then the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus is utilized, and then carry out For Distribution Networks Reconfiguration, increase work efficiency, because Dijkstra Shortest Path Searching Algorithm does not rely on the initial configuration of network, respectively its supply path is found to each load bus, make to form tree network and become easy.
Embodiment
The present inventor, in order to understand technical scheme of the present invention better, is described in detail below by embodiment particularly:
Embodiments of the invention, a kind of Distribution Network Reconfiguration, comprises the following steps:
S1, for distribution network sets up a non-directed graph model, form the undirected illustraton of model of power distribution network, in the undirected illustraton of model of this power distribution network, every bar limit comprises a switch, and each switch has two states, and namely switch closes and switch opens;
S2, the initializes weights function OW on every bar limit is as shown in formula (1):
In formula (1), the initializes weights value on every bar limit depends on the state of the switch on every bar limit, if switch closes, the initializes weights value on this limit is set to 1; If switch disconnects, the initializes weights value on this limit is set to 100;
S3, calculate all switches in power distribution network undirected illustraton of model close situation under power flow of ring net distribution, the weight changed factor WA on every bar limit is as shown in formula (2):
WA＝|△U
jk| (2)
In formula (2), △ U
jkit is the absolute value of per unit voltage drop on the jk of limit;
S4, in the undirected illustraton of model of power distribution network, the branch road weight FW on every bar limit is as shown in formula (3):
FW＝OW+WA (3)；
S5, according to the branch road weight on every bar limit, utilizes the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus, and then carries out For Distribution Networks Reconfiguration.
Switch in the undirected illustraton of model of power distribution network comprises interconnection switch and block switch.Root node is the starting point of all feeder lines in distribution network, i.e. substation bus bar; Load bus comprises feeder line section between distribution network breaker in middle, distribution transforming and load cell.
A kind of Distribution Network Reconfiguration of the present invention, fast and effeciently can determine the branch road weights on every bar limit in the undirected illustraton of model of power distribution network, then the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus is utilized, and then carry out For Distribution Networks Reconfiguration, increase work efficiency, because Dijkstra Shortest Path Searching Algorithm does not rely on the initial configuration of network, respectively its supply path is found to each load bus, make to form tree network and become easy.
Those of ordinary skill in the art will be appreciated that, above embodiment is only used to the present invention is described, and be not used as limitation of the invention, as long as in spirit of the present invention, all will drop in Claims scope of the present invention the change of the above embodiment, modification.
Claims (3)
1. a Distribution Network Reconfiguration, is characterized in that, comprises the following steps:
S1, for distribution network sets up a non-directed graph model, form the undirected illustraton of model of power distribution network, in the undirected illustraton of model of this power distribution network, every bar limit comprises a switch, and each switch has two states, and namely switch closes and switch opens;
S2, the initializes weights function OW on every bar limit is as shown in formula (1):
In formula (1), the initializes weights value on every bar limit depends on the state of the switch on every bar limit, if switch closes, the initializes weights value on this limit is set to 1; If switch disconnects, the initializes weights value on this limit is set to 100;
S3, calculate all switches in power distribution network undirected illustraton of model close situation under power flow of ring net distribution, the weight changed factor WA on every bar limit is as shown in formula (2):
WA＝|△U
jk| (2)
In formula (2), △ U
jkit is the absolute value of per unit voltage drop on the jk of limit;
S4, in the undirected illustraton of model of power distribution network, the branch road weight FW on every bar limit is as shown in formula (3):
FW＝OW+WA (3)；
S5, according to the branch road weight on every bar limit, utilizes the shortest path that Dijkstra Shortest Path Searching Algorithm searching root node is powered to each load bus, and then carries out For Distribution Networks Reconfiguration.
2. a kind of Distribution Network Reconfiguration according to claim 1, is characterized in that, the switch in the undirected illustraton of model of described power distribution network comprises interconnection switch and block switch.
3. a kind of Distribution Network Reconfiguration according to claim 1, is characterized in that, described root node is the starting point of all feeder lines in distribution network, i.e. substation bus bar;
Described load bus comprises feeder line section between distribution network breaker in middle, distribution transforming and load cell.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510485774.2A CN105023069A (en) | 2015-08-10 | 2015-08-10 | Distribution network reconstruction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510485774.2A CN105023069A (en) | 2015-08-10 | 2015-08-10 | Distribution network reconstruction method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105023069A true CN105023069A (en) | 2015-11-04 |
Family
ID=54413022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510485774.2A Pending CN105023069A (en) | 2015-08-10 | 2015-08-10 | Distribution network reconstruction method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105023069A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105514951A (en) * | 2015-11-27 | 2016-04-20 | 国家电网公司 | Open-communication-realization-based distributed feeder automatic decision-making method |
| CN105550947A (en) * | 2016-02-04 | 2016-05-04 | 陆如 | Power distribution network reconstruction method |
| CN106021596A (en) * | 2016-06-07 | 2016-10-12 | 国网江苏省电力公司电力科学研究院 | Analyzing method of grid fault current shock topological graph |
| CN108418211A (en) * | 2018-03-14 | 2018-08-17 | 国网黑龙江省电力有限公司电力科学研究院 | A kind of supply path optimization method based on Dijlstra algorithms and genetic algorithm |
| CN108649569A (en) * | 2018-06-01 | 2018-10-12 | 国网江苏省电力有限公司 | Power distribution network based on the optimization of multi-joint network feeder switch can open capacity calculation methods |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104124688A (en) * | 2014-08-12 | 2014-10-29 | 西南石油大学 | Heuristic power distribution network reconstructing method based on minimum spanning tree |
-
2015
- 2015-08-10 CN CN201510485774.2A patent/CN105023069A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104124688A (en) * | 2014-08-12 | 2014-10-29 | 西南石油大学 | Heuristic power distribution network reconstructing method based on minimum spanning tree |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105514951A (en) * | 2015-11-27 | 2016-04-20 | 国家电网公司 | Open-communication-realization-based distributed feeder automatic decision-making method |
| CN105514951B (en) * | 2015-11-27 | 2018-04-20 | 国家电网公司 | A kind of distributed feeder automation decision-making technique realized based on open communication |
| CN105550947A (en) * | 2016-02-04 | 2016-05-04 | 陆如 | Power distribution network reconstruction method |
| CN106021596A (en) * | 2016-06-07 | 2016-10-12 | 国网江苏省电力公司电力科学研究院 | Analyzing method of grid fault current shock topological graph |
| CN106021596B (en) * | 2016-06-07 | 2019-10-22 | 国网江苏省电力公司电力科学研究院 | A kind of analysis method of electric network fault rush of current topological diagram |
| CN108418211A (en) * | 2018-03-14 | 2018-08-17 | 国网黑龙江省电力有限公司电力科学研究院 | A kind of supply path optimization method based on Dijlstra algorithms and genetic algorithm |
| CN108418211B (en) * | 2018-03-14 | 2021-02-09 | 国网黑龙江省电力有限公司电力科学研究院 | Power supply path optimization method based on Dijlstra algorithm and genetic algorithm |
| CN108649569A (en) * | 2018-06-01 | 2018-10-12 | 国网江苏省电力有限公司 | Power distribution network based on the optimization of multi-joint network feeder switch can open capacity calculation methods |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105023069A (en) | Distribution network reconstruction method | |
| Prakash et al. | Review of power system distribution network architecture | |
| CN106230121B (en) | A kind of self-adaptive healing guard method applied to the power distribution network containing hybrid switch | |
| Kabalci et al. | Modeling and analysis of a smart grid monitoring system for renewable energy sources | |
| CN103928926B (en) | Load transfer plan system and method during distribution network failure | |
| CN104377696B (en) | Mine high voltage power network quick-break setting simulation inspection method based on incidence matrixes | |
| Ustun et al. | Implementation of Dijkstra's algorithm in a dynamic microgrid for relay hierarchy detection | |
| CN104795800B (en) | The adaptive short circuit calculation method of mining high-voltage electric-network based on interconnection switch state | |
| CN102832618A (en) | Practical method for calculation of closed-loop impact current of power distribution network based on combination of power transmission network and power distribution network | |
| Ustun et al. | Simulation of communication infrastructure of a centralized microgrid protection system based on IEC 61850-7-420 | |
| CN104410066A (en) | Incidence matrix-based automatic short-circuit calculation method of mine high-voltage power supply system | |
| Maya et al. | A three phase power flow algorithm for distribution network incorporating the impact of distributed generation models | |
| CN107272645B (en) | The photovoltaic electric station grid connection fault model and analysis method of Neutral Grounding through Resistance in Electrical | |
| Kontos et al. | Fast DC fault recovery technique for H-bridge MMC-based HVDC networks | |
| CN103390887A (en) | Method for isolating faults of power distribution system with micro-grid | |
| CN104778632A (en) | Intelligent decision making aiding method and system for transfer power supply | |
| CN110197302B (en) | Power distribution network planning method considering wiring mode topology constraints | |
| CN107332290B (en) | Regional load transfer method based on direct current circuit | |
| CN105226642A (en) | Power distribution network service restoration method under a kind of transformer station shut down accident | |
| Xiaoyu et al. | A service restoration method for active distribution network | |
| CN110311372A (en) | Sub-area division method based on spectral clustering | |
| Ma et al. | Line loss optimization based OPF strategy by hierarchical control for DC microgrid | |
| Qi et al. | Reliability analysis of distribution system with DG considering operation homogeneity | |
| CN109741207A (en) | A kind of Distribution system method for improving new energy and receiving ability | |
| Do et al. | Distribution network planning tool for rural areas |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20151104 |