CN106920015A - Suitable for the most short loop method for dynamically partitioning of power distribution network reconfiguration representation - Google Patents
Suitable for the most short loop method for dynamically partitioning of power distribution network reconfiguration representation Download PDFInfo
- Publication number
- CN106920015A CN106920015A CN201710234012.4A CN201710234012A CN106920015A CN 106920015 A CN106920015 A CN 106920015A CN 201710234012 A CN201710234012 A CN 201710234012A CN 106920015 A CN106920015 A CN 106920015A
- Authority
- CN
- China
- Prior art keywords
- loop
- branch road
- distribution network
- power distribution
- node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000000638 solvent extraction Methods 0.000 title claims abstract description 19
- 238000012986 modification Methods 0.000 claims description 14
- 230000004048 modification Effects 0.000 claims description 14
- 239000011159 matrix material Substances 0.000 claims description 9
- 238000007689 inspection Methods 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 claims description 2
- 239000000203 mixture Substances 0.000 claims description 2
- 238000000151 deposition Methods 0.000 claims 1
- 238000005457 optimization Methods 0.000 abstract description 3
- 230000006835 compression Effects 0.000 abstract description 2
- 238000007906 compression Methods 0.000 abstract description 2
- 238000012544 monitoring process Methods 0.000 abstract 1
- 238000011160 research Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000002068 genetic effect Effects 0.000 description 2
- 239000002245 particle Substances 0.000 description 2
- 238000002922 simulated annealing Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The present invention relates to a kind of most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation, belong to power distribution network optimization operation control field.The method can be with the topologies change of dynamic monitoring distribution network, the most short loop collection of automatic searching distribution network, the switch in every most short loop is encoded again, the quick rejecting of infeasible solution is carried out using radiativity Rule of judgment, finally it is applied to solve the intelligent algorithm of power distribution network reconfiguration problem, algorithm is more preferably more efficient found optimal solution.The technical scheme overcome conventional electrical distribution net reconstructing method cannot dynamically adapting rack change shortcoming, most short loop can be found out according to rack change, the total solution room of compression, the optimal power distribution network method of operation is found, is further to realize that theoretical foundation has been established in long duration dynamic restructuring and uncertainty models reconstruct.
Description
Technical field
The present invention relates to a kind of method for dynamically partitioning, and in particular to a kind of suitable for the most short of power distribution network reconfiguration representation
Loop dynamic division methods, belong to power distribution network optimization operation control technology field.
Background technology
Distribution Networks Reconfiguration (Power Distribution Network Reconfiguration, PDNR) is power distribution network
Network optimizes the very important means in one, field of operation, and it can realize feeder line or transformer station by easy economic switching manipulation
Between load transfer, so as to lift the operating index of distribution system, realize economical operation.In the solution of power distribution network reconfiguration problem
On at present using it is more be intelligent algorithm, there is genetic algorithm, particle swarm optimization algorithm, simulated annealing, taboo to search
Rope algorithm etc..These algorithms are all suffered from how being encoded to distribution network and cause that Algorithm for Solving is in hgher efficiency, and solution space is smaller
Problem.
Coded system based on loop originates from " Circle- Analysis " as used by figure spanning tree in graph theory, and the method is only to network
In ring encoded, the branch road unrelated with ring is not considered, greatly reduced solution space.But do not examined also in current research
Consider loop influence of the length to Searching efficiency, how in the network environment of dynamic change the most short loop collection of dynamical research
Close, how to improve and reject based on loop coding generation the problems such as not starting solution on a small quantity.Therefore rational loop dividing mode
Of crucial importance, the field makes in the urgent need to a kind of most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation
Obtaining intelligent algorithm more preferably can efficiently solve the problems, such as power distribution network reconfiguration.
The content of the invention
The present invention is just being directed to the technical problem for existing in the prior art, there is provided a kind of to be compiled suitable for power distribution network reconfiguration problem
The most short loop method for dynamically partitioning of code, the technical scheme is used for the solution of power distribution network reconfiguration problem, and the method can be supervised dynamically
It is measured the topologies change of electric network, the most short loop collection of automatic searching distribution network, then to opening in every most short loop
Put capable coding into, the quick rejecting of infeasible solution is carried out using radiativity Rule of judgment so that intelligent algorithm can more preferably more
Power distribution network reconfiguration is efficiently solved the problems, such as, is further to realize that long duration dynamic restructuring and uncertainty models reconstruct are established
Theoretical foundation.
To achieve these goals, technical scheme is as follows, a kind of suitable for power distribution network reconfiguration representation
Most short loop method for dynamically partitioning, it is characterised in that the described method comprises the following steps：
The adjacency matrix of step S1, reading network structure information, including node status information and network, forms topological structure
Figure；
Step S2, carries out simplifying treatment to network, in addition to branch road where power supply node, deletes remaining section unrelated with loop
Point and branch road；
Step S3, for the network after simplification, deletes the node that all number of degrees are 2, and branch road where it is merged into branch
Road chain, assigns to this branch road chain and weighs, and weights are the number of branches that the branch road chain is included, and are designated as weighted graph G；
Step S4, to the weighted graph G for generating, with power supply node as root node, the Kruskal algorithms in application drawing opinion are tried to achieve
The minimum spanning tree T of the figure, the set on remaining L bars side is designated as G-T in figure G；
Step S5, a line e in G-T is removed from weighted graph G, the Floyd-Warshall algorithms in application drawing opinion
Shortest path between figure G-e ask for two summits of side e, the path tried to achieve constitutes a loop, is designated as loop 1 with side e, time
The all sides gone through in G-T, until each edge all once, forms L bar loops by from weighted graph G removals；
Step S6, the loop that inspection has been generated is concentrated with the presence or absence of repetition loop, if so, then by seeking time most short loop
Method is modified, until the generation unduplicated loop of L bars；
Because there may be the side e that m bars belong to G-T in same loop1、e2……em, at this moment need to list side e1、
e2……emThe secondary shortest path of corresponding vertex reconstitutes new m bar loops, selection wherein m-1 bars power and minimum ring with side
Road, and retain original 1 repetition loop, constitute m bar loops.By that analogy, until forming the different loop of L bars；
Step S7, real coding is carried out based on most short loop, and each individuality has L to tie up, and the ring is represent per one-dimensional real number
The switch number being opened on road；The a small amount of topological infeasible individuality for occurring is rejected in modification.
In the program, it is possible to topological infeasible individuality occur, therefore to modify or reject：Judgment mode is：If
Identical switch is opened in different loops, then a switch will be reselected in each loop；If it is inconsistent to open switch
But cause network no longer to connect, that is, form acnode or isolated island, then directly reject；The coded system is applied to solution power distribution network
The coding of the intelligent algorithm (such as genetic algorithm, particle cluster algorithm, simulated annealing) of reconstruction.
Used as a modification of the present invention, in the step S2 in the branch road unrelated with loop, all number of degrees are 1 non-electrical
Source node will be removed from figure.Node can only obtain single-side power and powers by the branch road downstream, be to be not involved in certainly
Power distribution network reconfiguration process, it is possible to during simplification delete, although and power supply node where branch road may also with loop
It is unrelated, but in general should retain the node.
As a modification of the present invention, in the step S3, the number referred to as section for the branch road that node is abutted
The degree of point, only needs to retain power supply node and degree in simplified weighted graph>2 node, after deletion degree is 2 node, will spend originally
The branch road where 2 node is merged into branch road chain, and weights are assigned to branch road chain, and weights are the former branch road number on the branch road chain,
The figure for obtaining is referred to as simplifying weighted graph G.
As a modification of the present invention, the typical minimal spanning tree algorithm in graph theory is applied in the step S4
Kruskal algorithms, algorithm comprised the concrete steps that 1. for there is a n weighted graph of node, wherein n >=2, selects weights minimum first
Branch road e1；If 2. have selected branch road e1、e2……ek, then e is selected from remaining branch roadk+1, ek+1It is to meet e1、e2……
ek、ek+1Do not exist the weights minimum leg of this condition of ring in the figure of composition；3. repeat 2., until have chosen n-1 bar branch
Road, the figure that this n-1 bars branch road is constituted is exactly the minimum spanning tree T of weighted graph G, and the collection of remaining branch road is combined into G-T.
As a modification of the present invention, applied in the step S5 typical shortest path first Floyd in graph theory-
Warshall algorithms, algorithm comprises the following steps that, 1. makes dijIt is vertex viTo vertex vjBeeline, ωijRepresent side vivjOn
Power, if vi, vjIt is non-conterminous, then make ωij=+∞, for all of i, j, there is dij=ωij；2. d is updatedij, since k=1,
K gradually add up k=k+1, to all i, j, if dij＞ dik+dkj, then d is madeij=dik+dkj；3. repeat 2., (n is section until k=n
Point sum) stop.
Used as a modification of the present invention, the L bar loops for checking the most short loop for having generated to concentrate in the step S6 are
It is no to there is identical loop, if in the presence of, it is necessary to find out the m bar branch road chains in the corresponding G-T of identical most short loop, asking for these branch
The secondary shortest path on road Lian Liangge summits, loop is constituted with the branch road chain, contrast newly-generated loop weights and, find power and most
Small m-1 bars, m bars most short loop is reconstituted together with identical that loop；By that analogy, differ until forming L bars
The loop of sample；The algorithm of secondary shortest path is comprised the following steps that, 1. set from vertex viTo vertex vjShortest path comprising p bars it is oriented
Side；2. the side in shortest path in former weight matrix W is left out every time, so as to obtain the p new weights with W only one of which element difference
Matrix；3. one from vertex v is obtained respectively to this p weight matrixiTo vertex vjShortest path, by this p bar shortest path select power
Value is most short, and this paths is exactly vertex viTo vertex vjTime short circuit of this shortest path.
As a modification of the present invention, L bars most short loop is applied to power distribution network reconfiguration problem people in the step S7
In the coding of work intelligent algorithm, with real coding, each individuality has L to tie up, and is represent per one-dimensional real number and is beaten on the loop
The switch number opened, opens a switch in each loop, then can generate a spanning tree of power distribution network, and spanning tree is presented spoke
Shape is penetrated, meets topological constraints during distribution network operation；The a small amount of topological infeasible individuality for occurring is rejected in modification.
Used as a modification of the present invention, in the step S7, a small amount of topology that modification or rejecting occur is infeasible
Individuality, judgment mode is as follows, if opening identical switch in different loops, one will be reselected in each loop and is opened
Close；If it is inconsistent to open switch, cause network no longer to connect, that is, form acnode or isolated island, then directly reject.
Relative to prior art, the invention has the advantages that, 1) technical scheme suitable for power distribution network reconfiguration problem compile
The most short loop method for dynamically partitioning of code, on the basis of the early-stage Study encoded based on loop, is solved dynamic and divides loop
Problem, can be by the different loop of algorithm dynamical research, 2) technical scheme compares the length of required loop, it is ensured that every time
The loop-length of dynamical research is all most short, huge compression solution space, finally solve based on loop coding it is a small amount of not
The decision problem of feasible solution, can fast and accurately correct or propose infeasible solution so that artificial intelligence by this method of calibration
Algorithm can apply the coded system based on most short loop more preferably efficiently to solve the problems, such as power distribution network reconfiguration, be further reality
Theoretical foundation has been established in existing long duration dynamic restructuring and uncertainty models reconstruct.
Brief description of the drawings
A kind of most short loop method for dynamically partitioning stream suitable for power distribution network reconfiguration representation that Fig. 1 is provided for the present invention
Cheng Tu；
Fig. 2 is IEEE33 node power distribution net networks；
Fig. 3 is only to retain power supply node and degree>The simplified weighted graph G of 3 nodes；
Fig. 4 is the minimum spanning tree T for simplifying weighted graph G；
Fig. 5 is the remainder G-T after figure G removal minimum spanning trees T；
Fig. 6 is the shortest path 12-9-15 of node 12 and 15, and it constitutes a most short loop 12-9- with branch road 12-15
15-12；
Fig. 7 is the secondary shortest path 12-21-8-9-15, the secondary shortest path 9-8-21- of node 9 and 12 of node 12 and 15
12；
Fig. 8 is 5 most short loops of IEEE33 node power distribution net networks.
Specific embodiment：
In order to deepen the understanding of the present invention, the present embodiment is described in detail below in conjunction with the accompanying drawings.
Embodiment 1：Referring to Fig. 1-Fig. 8, Fig. 2 is IEEE33 node power distribution net networks, has node in 33 node power distribution nets
33, block switch 32, interconnection switch 5, switch amounts to 37, thus judges loop number L=5.
A kind of most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation, comprises the following steps：
The adjacency matrix of step S1, reading network structure information, including node status information and network, forms topological structure
Figure；The topology diagram of the network is illustrated in Fig. 2, its interior joint 1 is power supply node, the direct syntople of node such as Fig. 2
Shown in, wherein, solid line represents block switch, and dotted line represents interconnection switch；
Step S2, carries out simplifying treatment to network, in addition to branch road where power supply node, deletes remaining section unrelated with loop
Point and branch road, do not exist such node in present case Fig. 2；
Step S3, for the network 2 after simplification, rectangle node therein is the special section of power supply node or degree more than 3
Point, it is all retained；And circular node all degree of being are equal to 2 ordinary node, the branch road where it is merged into branch road chain, with
The number of branches that the branch road chain is included assigns weights to the branch road chain, sees Fig. 3.Such as branch road 3-23-24-25-29, retain special section
Point 3 and 29, the branch road chain 3-29 weights of generation are 3.) it is designated as weighted graph G by the entitled network icon of simplification.
Step S4, to weighted graph G, with power supply node as root node, the Kruskal algorithms in application drawing opinion try to achieve the figure
Minimum spanning tree T, such as Fig. 4, the set on remaining L bars side is designated as G-T, such as Fig. 5 in figure G, and L=5 bars side is had in G-T；
Step S5, branch road 12-15 is taken out from weighted graph G, and application drawing tries to achieve branch road by Floyd-Warshall algorithms
The shortest path on 12-15 summits 12 and 15 be 12-9-15, then 12-9-15-12 be a loop, power and be 7, such as Fig. 6, by G-T
In 5 sides all by this step perform, until traversal terminate；
Step S6, the loop that inspection has been generated is concentrated with the presence or absence of repetition loop.When shortest path is taken to branch road 9-12,
It is possible to duplicate the situation of loop.If side 9-12 takes shortest path 9-15-12, the loop 9-15-15-9 that is formed with
The loop 12-9-15-12 that Step 5 is obtained is identical.Now need to ask for the secondary shortest path of branch road 9-12 and branch road 12-15, point
Not Wei 9-8-21-12-9 (power and be 7) and 12-21-8-9-15-12 (weigh and be 8), see Fig. 7.Right to choose and smaller new loop
9-8-21-12-9, and retain repetition loop 12-9-15-12,2 different loops are formed as branch road 9-12 and branch road 12-
15 corresponding loop.
Step S7, real coding is carried out based on most short loop according to loop sequence number, and each individuality has L=5 to tie up, per one-dimensional
Real number represents the switch number being opened on the loop.The most short loop collection of IEEE33 node power distribution nets is as shown in figure 8, this net
The topological feasible solution (i.e. spanning tree) totally 50751 of network figure, traditional encodes according on off state, and solution space size isFeasible solution accounting 11.64%, and it is 10 × 7 × 7 × 16 × 11 to use most short loop to encode solution space size
=86240, feasible solution accounts for the 58.85% of total solution space, is that this can significantly improve intelligence according on off state coding more than 5 times
The Searching efficiency of algorithm.But the topological infeasible individuality of inspection is still needed in its searching process：Such as be encoded to [4,21,13,33,4], then open identical switch in different loops4, a switch can be reselected in loop 118Open, code modification is
[18,21,13,33,4]；Again or be encoded to [3,21,13,33,5], then not connecting occurs in network, i.e., node [4,5] forms orphan
Island, can directly reject.
It should be noted that above-described embodiment, not for limiting protection scope of the present invention, in above-mentioned technical proposal
On the basis of done equivalents or replacement each fall within the scope that the claims in the present invention are protected.
Claims (9)
1. a kind of most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation, it is characterised in that methods described
Comprise the following steps：
The adjacency matrix of step S1, reading network structure information, including node status information and network, forms topology diagram；
Step S2, carries out simplifying treatment to network, in addition to the branch road where the power supply node, delete remaining node unrelated with loop and
Branch road；
Step S3, for the network after simplification, deletes the node that all number of degrees are 2, and branch road where it is merged into branch road chain,
Assigned to this branch road chain and weighed, weights are the number of branches that the branch road chain is included, and are designated as weighted graph G；
Step S4, to the weighted graph G for generating, with power supply node as root node, the Kruskal algorithms in application drawing opinion try to achieve the figure
Minimum spanning tree T, the set on remaining L bars side is designated as G-T in figure G；
Step S5, a line e in G-T is removed from weighted graph G, and the Floyd-Warshall algorithms in application drawing opinion are in figure
G-e ask for the shortest path between two summits of side e, and the path tried to achieve constitutes a loop with side e, are designated as loop 1, and traversal G-
All sides in T, until each edge all once, forms L bar loops by from weighted graph G removals；
Step S6, the loop that inspection has been generated is concentrated with the presence or absence of repetition loop, if so, the then method by seeking time most short loop
It is modified, until the generation unduplicated loop of L bars；
Step S7, real coding is carried out based on most short loop, and each individuality has L to tie up, and is represent on the loop per one-dimensional real number
The switch number being opened；The a small amount of topological infeasible individuality for occurring is rejected in modification.
2. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 1, it is special
Levy and be, in the step S2 in the branch road unrelated with loop, all number of degrees are that 1 non-electrical source node will be by from figure
Remove.
3. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 2, it is special
Levy and be, in the step S3, the degree of the number referred to as node of the branch road that node is abutted simplifies and only need in weighted graph
Retain power supply node and degree>2 node, after deletion degree is 2 node, original degree branch road where 2 node is merged into
Branch road chain, weights are assigned to branch road chain, and weights are the former branch road number on the branch road chain, and the figure for obtaining is referred to as simplifying weighted graph G.
4. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 3, it is special
Levy and be, the typical minimal spanning tree algorithm Kruskal algorithms in graph theory are applied in the step S4, algorithm is comprised the concrete steps that
1. for having the n weighted graph of node, wherein n >=2, the first minimum branch road e of selection weights1；If 2. have selected branch road
e1、e2……ek, then e is selected from remaining branch roadk+1, ek+1It is to meet e1、e2……ek、ek+1Do not exist ring in the figure of composition
This condition weights minimum leg；3. repeat 2., until have chosen n-1 bar branch roads, the figure that this n-1 bars branch road is constituted is exactly
The minimum spanning tree T of weighted graph G, the collection of remaining branch road is combined into G-T.
5. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 3 or 4, its
It is characterised by, the typical shortest path first Floyd-Warshall algorithms in graph theory, algorithm tool is applied in the step S5
Body step is as follows, 1. makes dijIt is vertex viTo vertex vjBeeline, ωijRepresent side vivjOn power, if vi, vjIt is non-conterminous,
Then make ωij=+∞, for all of i, j, there is dij=ωij；2. d is updatedij, since k=1, k gradually add up k=k+1, it is right
All i, j, if dij＞ dik+dkj, then d is madeij=dik+dkj；3. repeat 2., until k=n (n is node total number) stops.
6. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 5, it is special
Levy and be, the L bars loop that the most short loop for having generated is concentrated is checked in the step S6 with the presence or absence of identical loop, if depositing
, it is necessary to m bar branch road chains in finding out the corresponding G-T of identical most short loop, the time most short of two summits of these branch road chains is being asked for
Path, loop is constituted with the branch road chain, contrast newly-generated loop weights and, find power and minimum m-1 bars, with identical that
One loop reconstitutes m bars most short loop together；By that analogy, until forming the different loop of L bars.
7. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 5, it is special
Levy and be, the algorithm of time shortest path is comprised the following steps that in the step S6, is 1. set from vertex viTo vertex vjShortest path bag
The directed edge of bar containing p；2. the side in shortest path in former weight matrix W is left out every time, it is poor with W only one of which elements so as to obtain p
Other new weight matrix；3. one from vertex v is obtained respectively to this p weight matrixiTo vertex vjShortest path, by this p bar most
Select weights most short in short circuit, this paths is exactly vertex viTo vertex vjTime short circuit of this shortest path.
8. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 7, it is special
Levy and be, L bars most short loop is applied in the coding of power distribution network reconfiguration problem intelligent algorithm in the step S7, with
Real coding, each individuality has L to tie up, and the switch number being opened on the loop is represent per one-dimensional real number, in each loop
A switch is opened, then can generate a spanning tree of power distribution network, spanning tree is presented radial, when meeting distribution network operation
Topological constraints；The a small amount of topological infeasible individuality for occurring is rejected in modification.
9. the most short loop method for dynamically partitioning suitable for power distribution network reconfiguration representation according to claim 8, it is special
Levy and be, in the step S7, a small amount of topological infeasible individuality that modification or rejecting occur, judgment mode is as follows, if not
Switched with identical is opened in loop, then a switch will be reselected in each loop；If it is inconsistent to open switch, lead
Cause network no longer to connect, that is, form acnode or isolated island, then directly reject.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710234012.4A CN106920015B (en) | 2017-04-11 | 2017-04-11 | Shortest loop dynamic division method suitable for power distribution network reconstruction problem codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710234012.4A CN106920015B (en) | 2017-04-11 | 2017-04-11 | Shortest loop dynamic division method suitable for power distribution network reconstruction problem codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106920015A true CN106920015A (en) | 2017-07-04 |
| CN106920015B CN106920015B (en) | 2021-05-11 |
Family
ID=59567874
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710234012.4A Active CN106920015B (en) | 2017-04-11 | 2017-04-11 | Shortest loop dynamic division method suitable for power distribution network reconstruction problem codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106920015B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107748499A (en) * | 2017-10-27 | 2018-03-02 | 合肥工业大学 | The optimization method and device of fixed-wing unmanned plane multizone detection mission planning |
| CN108268710A (en) * | 2018-01-03 | 2018-07-10 | 北京航空航天大学 | A kind of IMA system dynamic restructuring policy optimization methods based on genetic algorithm |
| CN109889440A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of correcting and eleting codes failure node reconstruct routing resource based on maximum spanning tree |
| CN110851926A (en) * | 2019-10-31 | 2020-02-28 | 武汉科技大学 | Planetary gear train isomorphism judgment method, system and medium based on traversal loop |
| CN111347927A (en) * | 2020-03-04 | 2020-06-30 | 广东工业大学 | Reconfigurable battery pack switch control method for immune short circuit risk |
| CN112035988A (en) * | 2020-08-28 | 2020-12-04 | 燕山大学 | Microgrid loop planning based on multiple DGs |
| CN112801499A (en) * | 2021-01-26 | 2021-05-14 | 水利部交通运输部国家能源局南京水利科学研究院 | Dimension reduction analysis method and system suitable for water-energy-grain socioeconomic complex network system |
| CN112909926A (en) * | 2021-01-25 | 2021-06-04 | 浙江大学 | Radial constraint set generation method and device for power distribution system optimization problem |
| CN113688485A (en) * | 2021-07-08 | 2021-11-23 | 国网山东省电力公司济宁供电公司 | Traveling wave device configuration method and system based on topological structure layering |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2004269785A1 (en) * | 2004-10-29 | 2006-05-18 | The Australian Gas Light Company | Fault detection and location in power distribution networks |
| CN102684229A (en) * | 2012-05-15 | 2012-09-19 | 天津大学 | Random neighborhood searching method for distribution network reconfiguration |
| CN102945296A (en) * | 2012-10-15 | 2013-02-27 | 河海大学 | Method for reconstructing and modeling uncertainty of distribution network in demand response viewing angle |
| CN103440521A (en) * | 2013-08-21 | 2013-12-11 | 南昌大学 | Coding and genetic algorithm suitable for power distribution network and application in distribution network reconfiguration |
| CN103795057A (en) * | 2014-01-23 | 2014-05-14 | 华北电力大学（保定） | Power distribution network topology serial number generating method based on searching in power distribution network load flow calculation |
| CN105701717A (en) * | 2015-11-11 | 2016-06-22 | 东南大学 | Power distribution network interactive solution programming method based on improved genetic algorithm |
| US20170093705A1 (en) * | 2015-09-27 | 2017-03-30 | Infinera Corporation | Systems and methods for latency based routing |
-
2017
- 2017-04-11 CN CN201710234012.4A patent/CN106920015B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2004269785A1 (en) * | 2004-10-29 | 2006-05-18 | The Australian Gas Light Company | Fault detection and location in power distribution networks |
| CN102684229A (en) * | 2012-05-15 | 2012-09-19 | 天津大学 | Random neighborhood searching method for distribution network reconfiguration |
| CN102945296A (en) * | 2012-10-15 | 2013-02-27 | 河海大学 | Method for reconstructing and modeling uncertainty of distribution network in demand response viewing angle |
| CN103440521A (en) * | 2013-08-21 | 2013-12-11 | 南昌大学 | Coding and genetic algorithm suitable for power distribution network and application in distribution network reconfiguration |
| CN103795057A (en) * | 2014-01-23 | 2014-05-14 | 华北电力大学（保定） | Power distribution network topology serial number generating method based on searching in power distribution network load flow calculation |
| US20170093705A1 (en) * | 2015-09-27 | 2017-03-30 | Infinera Corporation | Systems and methods for latency based routing |
| CN105701717A (en) * | 2015-11-11 | 2016-06-22 | 东南大学 | Power distribution network interactive solution programming method based on improved genetic algorithm |
Non-Patent Citations (8)
| Title |
|---|
| 林济铿等: "基于基本树的网络拓扑放射性快速判断方法及配网重构", 《中国电机工程学报》 * |
| 秦昆: "《GIS空间分析理论与方法》", 31 March 2010 * |
| 胡元义: "《数据结构 C语言 实践教程 第2版》", 31 August 2014 * |
| 胡旭红: "《全国青少年信息学竞赛培训教材 初赛》", 30 June 2012 * |
| 赵青杉: "《数据结构》", 31 March 2006 * |
| 陈春等: "一种避免不可行解的配电网快速重构方法", 《电工技术学报》 * |
| 韩燕: "基于图论与网络最优化算法的油田配电网的重构研究", 《中国优秀硕士学位论文全文数据库 工程科技II辑（月刊）》 * |
| 马草原等: "基于双重混合粒子群算法的配电网重构", 《电工技术学报》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107748499B (en) * | 2017-10-27 | 2020-09-01 | 合肥工业大学 | Optimization method and device for multi-zone detection task planning of fixed-wing unmanned aerial vehicle |
| CN107748499A (en) * | 2017-10-27 | 2018-03-02 | 合肥工业大学 | The optimization method and device of fixed-wing unmanned plane multizone detection mission planning |
| CN108268710A (en) * | 2018-01-03 | 2018-07-10 | 北京航空航天大学 | A kind of IMA system dynamic restructuring policy optimization methods based on genetic algorithm |
| CN109889440A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of correcting and eleting codes failure node reconstruct routing resource based on maximum spanning tree |
| CN110851926B (en) * | 2019-10-31 | 2023-09-01 | 武汉科技大学 | Planetary gear train isomorphism judging method, system and medium based on traversal loop |
| CN110851926A (en) * | 2019-10-31 | 2020-02-28 | 武汉科技大学 | Planetary gear train isomorphism judgment method, system and medium based on traversal loop |
| CN111347927A (en) * | 2020-03-04 | 2020-06-30 | 广东工业大学 | Reconfigurable battery pack switch control method for immune short circuit risk |
| CN112035988A (en) * | 2020-08-28 | 2020-12-04 | 燕山大学 | Microgrid loop planning based on multiple DGs |
| CN112035988B (en) * | 2020-08-28 | 2022-10-25 | 燕山大学 | Microgrid loop planning method based on multiple DGs |
| CN112909926A (en) * | 2021-01-25 | 2021-06-04 | 浙江大学 | Radial constraint set generation method and device for power distribution system optimization problem |
| CN112909926B (en) * | 2021-01-25 | 2022-06-17 | 浙江大学 | Radial constraint set generation method and device for power distribution system optimization problem |
| CN112801499A (en) * | 2021-01-26 | 2021-05-14 | 水利部交通运输部国家能源局南京水利科学研究院 | Dimension reduction analysis method and system suitable for water-energy-grain socioeconomic complex network system |
| CN112801499B (en) * | 2021-01-26 | 2023-10-27 | 水利部交通运输部国家能源局南京水利科学研究院 | Dimension reduction analysis method and dimension reduction analysis system suitable for water-energy-grain socioeconomic complex network system |
| CN113688485A (en) * | 2021-07-08 | 2021-11-23 | 国网山东省电力公司济宁供电公司 | Traveling wave device configuration method and system based on topological structure layering |
| CN113688485B (en) * | 2021-07-08 | 2024-02-09 | 国网山东省电力公司济宁供电公司 | Traveling wave device configuration method and system based on topological structure layering |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106920015B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106920015A (en) | Suitable for the most short loop method for dynamically partitioning of power distribution network reconfiguration representation | |
| Alonso et al. | Artificial immune systems optimization approach for multiobjective distribution system reconfiguration | |
| CN110348048B (en) | Power distribution network optimization reconstruction method based on consideration of heat island effect load prediction | |
| CN107666412B (en) | The virtual network function dispositions method of service function chain | |
| CN105098762B (en) | A kind of isolated island division methods containing distributed power distribution network | |
| CN103873363B (en) | A kind of double route collocation method of power optical fiber communication network service | |
| CN103903055B (en) | Network reconstruction method based on all spanning trees of non-directed graph | |
| CN103440521B (en) | A kind of coding be applicable to power distribution network and genetic algorithm and the application Distribution system | |
| CN106777449A (en) | Distribution Network Reconfiguration based on binary particle swarm algorithm | |
| CN105896528A (en) | Power distribution network reconstruction method based on isolation ecological niche genetic algorithm | |
| CN107318058A (en) | ONU dispositions methods in power distribution communication net based on Optimum cost and load balancing | |
| Moshtagh et al. | Optimal distribution system reconfiguration using non dominated sorting genetic algorithm (NSGA-II) | |
| CN105072194B (en) | A kind of storage data in distributed file system repair structure and restorative procedure | |
| CN109217284A (en) | A kind of reconstruction method of power distribution network based on immune binary particle swarm algorithm | |
| CN108880886A (en) | Method for planning protection communication network of cross-regional power system | |
| CN104881708A (en) | Method for reconstructing power distribution network based on topology correction | |
| CN108233359A (en) | A kind of partition zone optimizing method and system of extra-high voltage alternating current-direct current feed-in receiving end power grid | |
| CN110401183A (en) | A kind of toughness method for improving based on the reconstruct of distribution system two stages | |
| CN108270216B (en) | Multi-target-considered complex power distribution network fault recovery system and method | |
| CN115395557A (en) | Active power distribution network fault rapid recovery method based on directed graph traversal | |
| CN106877497B (en) | Power terminal communication access network and optimization method | |
| CN105069517B (en) | Power distribution network multiple target fault recovery method based on hybrid algorithm | |
| CN107808200A (en) | Short-time maintenance plan optimization method and device for power distribution network | |
| White et al. | Genetic algorithms and network ring design | |
| CN103944166B (en) | Area power grid reconstructing method based on single transformer station power supply mode collection |
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 |