CN107579517A - The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network - Google Patents
The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network Download PDFInfo
- Publication number
- CN107579517A CN107579517A CN201710825596.2A CN201710825596A CN107579517A CN 107579517 A CN107579517 A CN 107579517A CN 201710825596 A CN201710825596 A CN 201710825596A CN 107579517 A CN107579517 A CN 107579517A
- Authority
- CN
- China
- Prior art keywords
- distribution network
- node
- matrix
- switch
- solution
- 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 whether feasible determination methods of gained solution, belong to distribution network planning and optimization operation field in the quantum telepotation reconstruct of Complicated Distribution Network, solve the problems, such as that efficiency existing for artificial intelligence optimization's reconstruct of existing Complicated Distribution Network is low and time-consuming.Methods described include using the coding method of integer type looped network the block switch in power distribution network and interconnection switch are encoded the step of, for switch encode after power distribution network, the step of particle solution is obtained using quantum particle swarm optimization, and decoded according to the coding method of integer type looped network to particle solution, judge the step of whether decoded particle solution is loop infeasible solution, judge the step of whether feasible particle solution of loop is isolated island infeasible solution and provide the step of judging conclusion.The whether feasible determination methods of gained solution are applied to the quick on-line reorganization of Complicated Distribution Network in the quantum telepotation reconstruct of Complicated Distribution Network of the present invention.
Description
Technical field
The present invention relates to the whether feasible determination methods of gained solution in a kind of power distribution network reconfiguration, belong to distribution network planning with it is excellent
Change operation field.
Background technology
At present, China's power distribution network generally use closed loop design, the power supply mode of open loop operation.In power distribution network, there is
A large amount of block switches and a small amount of interconnection switch.Power distribution network reconfiguration is in the case where meeting the constraint of distribution network operation, is matched somebody with somebody by changing
The opening and closing assembled state of block switch and interconnection switch switches over to distribution network topological structure in power network, different feeder lines it
Between transfer load, so as to realize the optimization of power distribution network run.
According to the difference of emphasis, power distribution network reconfiguration can be divided into static network optimal reconfiguration and fault recovery weight
Structure.Static network optimal reconfiguration makes system losses reach minimum by optimizing distribution network structure, so improve power supply can
By property.And fault recovery reconstruct refers to when power distribution network breaks down and failure is isolated, in order to reduce power failure area, use up
It may be more customer power supplies and distribution network structure is adjusted, its is heavy to restore electricity after a failure, is to realize distribution
The basis of net self-healing control.
Because China's power network is using closed loop design, the power supply mode of open loop operation, therefore power distribution network reconfiguration is related to more
An optimal solution is selected in individual distribution network structure, it is had radial pattern and connectedness concurrently, and meet object function.It is existing big
The power distribution network reconfiguration generally use intelligent algorithm of scale searches out optimal distribution network structure.But due to artificial intelligence
Energy algorithm seeks optimal distribution network structure by the way of random search, can be produced during optimal solution is searched for a large amount of
The infeasible solution of the radial and connective topological constraints of network is unsatisfactory for, and can not in being reconstructed on power distribution network artificial intelligence optimization
The judgement of row solution, there is judge that efficiency is low and the problem of time-consuming always for a long time so that power distribution network artificial intelligence optimization
The efficiency of reconstruct can not be improved significantly, and then can not realize that real-time online reconstructs.
The content of the invention
The present invention proposes the whether feasible judgement of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network a kind of
Method, for solving the problems, such as that efficiency existing for the artificial intelligence optimization of existing Complicated Distribution Network reconstruct is low and time-consuming.
The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network of the present invention
Including：
Step 1, using integer type looped network coding method treat reconstruct power distribution network in X block switch and Y contact open
Put capable coding into, its detailed process is：
It is 1~X+Y by block switch and interconnection switch number consecutively, as respective switch number；
It is in the 1~looped network to the block switch in the looped network that is determined by each interconnection switch and interconnection switch number consecutively
Total number of switches, as switch number in respective looped network；
Step 2, encoded for switch after power distribution network, particle solution is obtained using quantum particle swarm optimization, and according to
Switch number is decoded as switch number in the looped network that the coding method of integer type looped network includes particle solution；
Step 3, switch-loop matrix is generated to each decoded particle solution, judge whether to occur in the matrix identical
Two row elements, when judged result for be when, judge the particle solution for loop infeasible solution, perform step 5, otherwise, perform step
Rapid 4；
Step 4, according to nodal hierarchy algorithm, obtain the nodal hierarchy matrix of power distribution network topological structure and its corresponding upper strata
Node matrix equation, and judge whether first non-element of upper layer node matrix 0 element occurs, when judged result for when be that judge should
Particle solution is isolated island infeasible solution, performs step 5, otherwise, it is determined that the particle solution is feasible solution, performs step 5；
Step 5, provide judgement conclusion.
It is excellent as selecting, in step 4, according to the branch parameters matrix B ranchM=[branch roads of power distribution network topological structure
First node branch road tail node branch impedance parameter] and node parameter matrix N odeM=[node number node burden with power node is idle
Load] determine the node incidence matrix NodeN of power distribution network topological structure：
Wherein, N is the nodes of the network topology structure of power distribution network, and i and j are appointing in the network topology structure of power distribution network
Two nodes of meaning；
The nodal hierarchy matrix and its corresponding upper layer node matrix are obtained according to node incidence matrix NodeN.
Determination methods of the present invention propose switch-loop matrix under a kind of looped network coded system based on integer type
The whether feasible determination methods with the power distribution network reconfiguration gained solution of nodal hierarchy strategy.The determination methods use integer type looped network
Coding method treat reconstruct power distribution network in block switch and interconnection switch encoded, considerably reduce power distribution network quantum grain
The dimension of particle in the optimal reconfiguration of subgroup, greatly reduces its search space, improves the efficiency of reconstruct optimizing.Further,
The determination methods only need to as switch-loop matrix i.e. can determine whether in power distribution network reconfiguration obtained by solution whether be that loop is infeasible
Solution, when gained solution is loop feasible solution, directly carried out using nodal hierarchy matrix and its corresponding upper layer node matrix follow-up
Pushed back before nodal hierarchy for Load flow calculation, and then judge whether the gained solution is isolated island infeasible solution, it is convenient and simple, save program
Run time.
Brief description of the drawings
Hereinafter by based on embodiment and refer to the attached drawing come the quantum particle swarm to Complicated Distribution Network of the present invention
The whether feasible determination methods of gained solution are described in more detail in optimal reconfiguration, wherein：
Fig. 1 is the judgement that whether gained solution is feasible during the quantum telepotation of the Complicated Distribution Network described in embodiment reconstructs
The flow chart of method；
Fig. 2 is the IEEE33 Node power distribution system figures that embodiment refers to；
Fig. 3 is the three feeder line IEEE16 node primitive network figures that embodiment refers to；
Fig. 4 is that the three feeder line IEEE16 nodes that embodiment refers to simplify equivalent network figure；
Fig. 5 is the trend flow graph that the IEEE16 nodes that embodiment refers to simplify equivalent network.
Embodiment
It is to gained solution in the quantum telepotation reconstruct of Complicated Distribution Network of the present invention below in conjunction with accompanying drawing
No feasible determination methods further illustrate.
Embodiment：The present embodiment is explained with reference to Fig. 1 to Fig. 5.
Complicated Distribution Network described in the present embodiment quantum telepotation reconstruct in gained solution whether feasible judgement side
Method includes：
Step 1, using integer type looped network coding method treat reconstruct power distribution network in X block switch and Y contact open
Put capable coding into, its detailed process is：
It is 1~X+Y by block switch and interconnection switch number consecutively, as respective switch number；
It is in the 1~looped network to the block switch in the looped network that is determined by each interconnection switch and interconnection switch number consecutively
Total number of switches, as switch number in respective looped network；
Step 2, encoded for switch after power distribution network, particle solution is obtained using quantum particle swarm optimization, and according to
Switch number is decoded as switch number in the looped network that the coding method of integer type looped network includes particle solution；
Step 3, switch-loop matrix is generated to each decoded particle solution, judge whether to occur in the matrix identical
Two row elements, when judged result for be when, judge the particle solution for loop infeasible solution, perform step 5, otherwise, perform step
Rapid 4；
Step 4, according to nodal hierarchy algorithm, obtain the nodal hierarchy matrix of power distribution network topological structure and its corresponding upper strata
Node matrix equation, and judge whether first non-element of upper layer node matrix 0 element occurs, when judged result for when be that judge should
Particle solution is isolated island infeasible solution, performs step 5, otherwise, it is determined that the particle solution is feasible solution, performs step 5；
Step 5, provide judgement conclusion.
In step 4, according to branch parameters matrix B ranchM=[the branch road first node branch road tails of power distribution network topological structure
Node branch impedance parameter] and node parameter matrix N odeM=[node number node burden with power node load or burden without work] determine match somebody with somebody
The node incidence matrix NodeN of topological structure of electric：
Wherein, N is the nodes of the network topology structure of power distribution network, and i and j are appointing in the network topology structure of power distribution network
Two nodes of meaning；
The nodal hierarchy matrix and its corresponding upper layer node matrix are obtained according to node incidence matrix NodeN.
Integer type looped network coding method described in the present embodiment：
Optimization method can substantially be divided into heuritic approach and intelligent algorithm two used by existing power distribution network reconfiguration
Major class.Wherein, intelligent algorithm causes its optimizing effect often better than heuristic because that can realize the optimizing of quick multiple dimension degree
Algorithm.As a kind of conventional power distribution network reconfiguration optimization method, population of the quantum particle swarm optimization (QPSO) to classics
Optimized algorithm (PSO) is improved, and it thinks that particle has the behavior of quantum.When updating particle position, its emphasis considers
Current the local optimum positional information and global optimum's positional information of each particle, need to compile particle before reconstruct
Code.
The coded system for solving the problems, such as power distribution network reconfiguration mainly has binary coding and integer type to encode two kinds.In power distribution network
In, switch only has closed and disconnected two states.In binary coding, 0 represents to switch off, and 1 represents switch closure, particle
Dimension be equal to the sum that switchs in power distribution network.This coded system clear principle, it is simple and convenient, but it does not make full use of
The design feature of power distribution network itself, cause particle dimension larger, during optimal solution is searched for, easily produce and largely can not
Row solution, cause reconstruct efficiency low.
Limited by distribution network radial pattern, the folding switched in power distribution network is not any combination.By to power distribution network
Network topological structure carries out analysis and observation and understood：An interconnection switch is closed, a small ring will be formed, it is necessary to open one in this ring
Individual block switch, power distribution network can be just set to keep radial pattern.Therefore, an interconnection switch determines a looped network, all interconnection switches
Opening and closing combination constitute the reconfiguration scheme of power distribution network.
The rule of integer type looped network coding is as follows：X block switch in power distribution network to be reconstructed and Y contact are opened first
Pass number consecutively is 1~X+Y, as respective switch number.Then the segmentation in the looped network that is determined by each interconnection switch is opened
Close and interconnection switch number consecutively is the total number of switches in the 1~looped network, as switch number in respective looped network.Wherein, join
The number of network switch represents the dimension of particle, and the numbering that each looped network breaks switch is every one-dimensional element of particle.Fig. 2 is
IEEE33 Node power distribution system figures, the present embodiment describe integer type looped network coding method in detail by taking the distribution system diagram as an example.
In the system diagram, switch 1~switch 32 is block switch, indicated by the solid line, and switch 33~switch 37 is interconnection switch,
It is represented by dashed line.It is made up of the looped network that interconnection switch 33 determines 7-6-5-4-3-2-20-19-18-33 branch roads, is defined as No. 1
Looped network.Branch road in looped network is numbered as 1-2-3-4-5-6-7-8-9-10, interconnection switch is in looped network from 1 from left to right
The branch road finally numbered.The integer type looped network coding of IEEE33 Node power distribution systems is as shown in table 1：
The integer type looped network coding of the node system of table 1 33
Because switch 1 is not in any one looped network, therefore switchs 1 and coding is needed not participate in power distribution network reconfiguration.It is right
In IEEE33 Node power distribution systems, when using binary coding mode, particle dimension is 32, and corresponding search space size is
The ratio of 232=4.295 × 109, wherein infeasible solution is up to 98.54%, and this will expend a large amount of computing resources, need to spend big
The amount time obtains optimal reconstruct solution.However, the integer type looped network coding that the present embodiment uses can make particle dimension be down to 5, no
The ratio of feasible solution declines 24.16% compared to binary coding, substantially increases reconstruct Searching efficiency.
Switch-loop matrix described in the present embodiment：
For simple Single-ring network, the integer type looped network coded system of the present embodiment is highly effective, and feasible solution ratio is reachable
To 100%.But for the Complicated Distribution Network containing common switch between two loops, such as IEEE33 nodes shown in Fig. 2 are matched somebody with somebody
Multiple looped network be present in electric system, the distribution system, looped network 1. with looped network 3., 4., 5. have common branch, be triple looped networks；Looped network
3. with looped network 1., 2., 4., 5. have common branch, be quadruple looped network., will can not in reconstruct for this Complicated Distribution Network
Produce a large amount of infeasible solutions with avoiding.Therefore, for the distribution system containing multiple looped network, encoded not by integer type looped network merely
100% elimination infeasible solution can be reached.
Therefore, the present embodiment, which proposes switch-loop matrix, quickly to judge whether reconstruct gained solution is that loop is infeasible
Solution：
Define switch-loop matrix SL：
In formula, N is to close the loop number that all interconnection switches are formed, and row represents the loop formed in network, and row represent
Every one-dimensional represented disconnection switch number of particle, matrix element are that 0 expression switchs not in the loop, represent that switch exists for 1
In loop.For example, a23=1 represents the switch of particle 3-dimensional expression in No. 2 loops.
When switch-loop matrix SL is diagonal matrix, then it represents that the switch for selecting to disconnect is not loop common switch, i.e.,
For simple Single-ring network situation, solution individual must be feasible solution.When switch-loop matrix SL is not diagonal matrix, then selection is disconnected
The switch opened necessarily has loop common switch, it is necessary to determine whether looped network occur, is infeasible solution if there is looped network.If particle
There is the row of identical 2 in SL matrixes corresponding to individual, then it represents that single switch is disconnected the common switch quilt of 2 times or 2 loops
Disconnect 2 times, loop now occurs, it is possible to determine that this solution is infeasible solution.
Nodal hierarchy algorithm described in the present embodiment：
If identical row is not present in switch-loop matrix SL, but there is complicated common switch disconnection, using opening
Pass-loop matrix SL judges that the method for infeasible solution has not applied to.Then application node Stratified Strategy NS quickly to judge again
Heterocycle infeasible solution off the net.
With reference to the radial feature of power distribution network, application node hierarchical algorithm describes power distribution network topological structure, the original of power distribution network
Beginning parameter uses following data format：
Branch parameters matrix B ranchM=[branch road first node branch road tail node branch impedance parameter]
Node parameter matrix N odeM=[node number node burden with power node load or burden without work]
Any power distribution network topological structure is uniquely described according to matrix B ranchM and NodeM can.By branch parameters matrix
The node incidence matrix NodeN (N-dimensional square formation) that BranchM easily tries to achieve this distribution net topology is：
Wherein N is number of network node, and i, j are the arbitrary node of network two.
Define two nodal hierarchy companion matrixs, nodal hierarchy matrix L ayerN and its corresponding upper layer node matrix U N.
LayerN sizes are specifically layered determination according to network.Columns represents hierarchy number, contains in each column element representation layer
Node number.UN is 1 × N matrix, and wherein each column element representation is saved using the place columns of this element as upper strata corresponding to node number
Period, if node corresponding to this column element without upper layer node, or formation isolated island, then this column element is set to 0 in UN matrixes.
Fig. 3 is the three feeder line IEEE16 node primitive network figures that embodiment refers to, as shown in figure 3, containing 14 in the network
Individual node, 13 block switches, 3 interconnection switches.Under normal circumstances, block switch 1~13 closes, and interconnection switch 14~
16 disconnect.In order to illustrate nodal hierarchy principle, the three feeder lines IEEE16 node primitive networks are reduced to equivalent network, such as
Shown in Fig. 4.
According to the branch parameters matrix B ranchM of power distribution network topological structure and node parameter matrix N odeM, node pass is obtained
Join matrix N odeN, node incidence matrix NodeN is symmetrical matrix, only its upper triangular matrix NodeN ' need to be taken just to characterize completely
The topological relation of network, so carrying out network node layering according to NodeN ' in following analysis.
The first step：Power supply node is 1, then it is first layer to make power supply node, and the 1st of nodal hierarchy matrix arranges the 1st behavior
" 1 ", LayerN=[1], corresponding UN=[00000000000000]；
Second step：Search the second node layer.Due to containing No. 1 node in first layer, then sought from the 1st row of NodeN ' matrixes
The columns looked for where 1 element, respective nodes number are charged to LayerN secondary series, obtained
Therefore contain node 2 in the second layer, and 3,4, corresponding upper layer node is 1.Due to removing the 1st column element in UN matrixes,
Still with the presence of 0 element, then still there is most of node not yet to find upper layer node, then should continue to search for next node layer.
3rd step：Search third layer node.Take the 2nd of LayerN to arrange the 1st row element " 2 ", look in NodeN ' and be in the 2nd row
" 5 " and " 6 " are classified as where " 1 " element, the 3rd that " 5 " and " 6 " are charged to nodal hierarchy matrix L ayerN arranges the 1st row and the 2nd row.
UN the 5th row and the 6th row are designated as 2；Looked for again from the 3rd of NodeN ' row as " 1 " element column " 8 " and " 11 ", " 8 " and
" 11 " sequentially charge to the 3rd of nodal hierarchy matrix L ayerN and arrange the 3rd row and the 4th row, and UN the 5th row and the 6th row are designated as 3；Press
Search to obtain all nodes of third layer according to above method, obtain
Due to removing the 1st column element in UN matrixes, still with the presence of 0 element, then still there are 7,9,10,14 nodes not yet to find upper strata
Node, then it should continue to search for next node layer.
4th step：The 4th node layer is searched again.Take LayerN the 3rd to arrange the 1st row element " 5 ", look in NodeN ' and be in the 5th row
" 7 " are classified as where " 1 " element, charge to LayerN the 4th arranges the 1st row.The 6th row in NodeN ' is looked for successively, is found without " 1 " element,
It has been frontier node then to illustrate 6 nodes, without next node layer, does not change NodeN ' matrixes and UN matrixes.Continue to look for NodeN '
The 8th be classified as 1 element, 9,10 nodes are charged into the 4th of LayerN arranges the 2nd row and the 3rd row, corresponding UN the 9th row and the 10th
Row are all 8.Search to obtain the 4th layer of all nodes according to above method, obtain
The 1st column element is removed in UN matrixes, remaining element is non-zero element, i.e., all nodes all have found upper layer node,
Network hierarchy leaves it at that.
Then the 4th step obtains final nodal hierarchy matrix and its upper layer node matrix.
Be clear that nodal hierarchy situation from LayerN, and can also quickly find from UN frontier node and
Upper layer node corresponding to each node.In the case where disconnecting interconnection switch 14,15,16, three feeder line IEEE16 shown in Fig. 4
Node, which simplifies equivalent network, can be divided into four layers, and first layer is power supply node, and the 4th layer is frontier node 7,9,10,14.Above shape
Into matrix node hierarchical matrix LayerN and corresponding upper layer node matrix U N can be used for follow-up nodal hierarchy before push back generation
Load flow calculation, and as the completion of nodal hierarchy, the direction of tide of network are also determined, as shown in Figure 4.
During power distribution network optimal reconfiguration or failure reconfiguration, network have it is a variety of cut-off combination, its topological structure also with
Change, resulting nodal hierarchy matrix L ayerN and upper layer node matrix U N also can be with changes.Such as open switch [9
1016], rest switch all closes, and according to above nodal hierarchy method, obtains
Then frontier node becomes 7,10,9,11,14, and corresponding network trend flow graph can also change.
Network topology structure change is adapted to using nodal hierarchy method, topology after quick identification change, is not required to complicated volume
Number, suitable for power distribution network reconfiguration correlative study.
Complicated Distribution Network described in the present embodiment quantum telepotation reconstruct in gained solution whether feasible judgement side
Method, it is namely based on what the two matrixes were judged.Nodal hierarchy is carried out to network, forms two matrixes, if feasible solution, then
Network is exactly radial pattern, without island network, and all nodes in addition to first node should all have its upper layer node, i.e. upper layer node square
The battle array UN all elements in addition to first element all should be nonzero element, some nodes otherwise just occur without first node (nothing
Upper strata supply node), there is isolated island situation, i.e. infeasible solution situation.Accordingly, can be according to upper layer node matrix U N element
Characteristic carries out the judgement of complicated looped network infeasible solution.
Complicated Distribution Network described in the present embodiment quantum telepotation reconstruct in gained solution whether feasible judgement side
Method is correctly effective, and has versatility, for specifying network, as long as according to program, is judged according to step, then can be just
Really judge the feasibility of solution.In addition, if it is determined that be feasible solution, can directly using obtained nodal hierarchy matrix L ayerN with it is right
The upper layer node matrix U N answered is pushed back for Load flow calculation before carrying out subsequent node layering, convenient and simple, when can save program operation
Between.
Complicated Distribution Network described in the present embodiment quantum telepotation reconstruct in gained solution whether feasible judgement side
Method has the following advantages that：
1st, this method is based on integer type looped network coded system, embodies the radial feature of power distribution network.
2nd, it can fast and efficiently judge all infeasible solutions, feasible solution ratio is reached 100%.When only there is Single-ring network
During infeasible solution, it can only demand to take away pass-loop matrix and can differentiate and solve feasibility, be not required to carry out nodal hierarchy, can subtract
The time is judged less.
3rd, pushed back before nodal hierarchy can be embedded into for the node in power flow algorithm, formed in infeasible solution decision process point
Layer matrix LayerN and its corresponding upper layer node matrix U N can be used for carrying out follow-up Load flow calculation, when reducing program operation
Between, improve reconstruct efficiency.
Simulation example：
With the IEEE33 Node power distribution systems shown in Fig. 2 with experimental subjects, the determination methods described in the present embodiment are carried out
Emulation：
Contain 5 interconnection switches in the network, be 33,34,35,36,37 respectively, be represented by dashed line in figure, solid line represents
Block switch, numeral represent switch number.
Particle is encoded by integer type looped network coding method first, then entered by quantum particle swarm optimization
Row particle initializes, and forms a series of initialization particles, infeasible solution judgement is carried out to particle, result of determination and judgement time are such as
Shown in table 2.Program is run on Intel Core i5-4590CPU 3.3GHz processor ram 8.00GB computers.
The result of determination of infeasible solution under the different schemes of table 2 and judgement time
For scheme 1：
Step 1：The particle Swarm=[6,6,9,21,6] of integer type looped network coding；
Step 2：Gray code, obtain switch combination [2,9,3,36,26]；
Step 3：Switch-loop matrix SL
Any two row of the matrix differs, then loop infeasible solution is not present in network；
Step 4：In order to determine whether that network whether there is isolated island, then nodal hierarchy judgement is carried out, is obtained
UN=[0 105678 21 8 11 12 22 12 15 9 15 16 17 2 19 20 21 0006
0 0 0 0 0 0 0]
It can be seen that the network is divided into 11 layers from LayerN, the 3rd, 23,24,25,27,28,29,30 are found out from UN,
31,32,33 column elements are 0, it is possible to determine that and there is isolated island in the network, and the solution is infeasible solution, and 3,23,24,25,27,28,
29,30,31,32,33, which amount to 11 nodes, forms isolated island.So it is lonely from which node is UN matrixes can simply identify
Island node, aspect are accurate.
Step 5：Judge the solution for isolated island infeasible solution.
Other decision scheme steps similarly, repeat no more.
The judgement time of determination methods described in the present embodiment is Millisecond, can reach power distribution network reconfiguration application on site water
It is flat.
Although the present invention is described herein with reference to specific embodiment, it should be understood that, these realities
Apply the example that example is only principles and applications.It should therefore be understood that exemplary embodiment can be permitted
More modifications, and can be designed that other arrangements, the spirit of the invention limited without departing from appended claims and
Scope.It should be understood that different appurtenances can be combined by way of different from described by original claim
It is required that and feature specifically described herein.It will also be appreciated that the feature with reference to described by separate embodiments can be used at it
In his embodiment.
Claims (2)
1. the whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network, it is characterised in that institute
Stating determination methods includes：
Step 1, using integer type looped network coding method treat reconstruct power distribution network in X block switch and Y interconnection switch enter
Row coding, its detailed process are：
It is 1~X+Y by block switch and interconnection switch number consecutively, as respective switch number；
It is opening in the 1~looped network to the block switch in the looped network that is determined by each interconnection switch and interconnection switch number consecutively
Sum is closed, as switch number in respective looped network；
Step 2, encoded for switch after power distribution network, particle solution is obtained using quantum particle swarm optimization, and according to integer
Switch number is decoded as switch number in the looped network that the coding method of type ring net includes particle solution；
Step 3, switch-loop matrix is generated to each decoded particle solution, judge whether occur identical two in the matrix
Row element, when judged result when being, to judge the particle solution for loop infeasible solution, step 5 is performed, otherwise, performs step 4；
Step 4, according to nodal hierarchy algorithm, obtain the nodal hierarchy matrix of power distribution network topological structure and its corresponding upper layer node
Matrix, and judge whether first non-element of upper layer node matrix 0 element occurs, when judged result for when be to judge the particle
Solve as isolated island infeasible solution, perform step 5, otherwise, it is determined that the particle solution be feasible solution, execution step 5；
Step 5, provide judgement conclusion.
2. Complicated Distribution Network as claimed in claim 1 quantum telepotation reconstruct in gained solution whether feasible judgement side
Method, it is characterised in that in step 4, according to branch parameters matrix B ranchM=[the branch road first nodes of power distribution network topological structure
Branch road tail node branch impedance parameter] and node parameter matrix N odeM=[node number node burden with power node load or burden without work]
Determine the node incidence matrix NodeN of power distribution network topological structure：
Wherein, N is the nodes of the network topology structure of power distribution network, and i and j are any two in the network topology structure of power distribution network
Individual node；
The nodal hierarchy matrix and its corresponding upper layer node matrix are obtained according to node incidence matrix NodeN.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710825596.2A CN107579517A (en) | 2017-09-13 | 2017-09-13 | The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710825596.2A CN107579517A (en) | 2017-09-13 | 2017-09-13 | The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107579517A true CN107579517A (en) | 2018-01-12 |
Family
ID=61032902
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710825596.2A Pending CN107579517A (en) | 2017-09-13 | 2017-09-13 | The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107579517A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108182498A (en) * | 2018-01-15 | 2018-06-19 | 国网黑龙江省电力有限公司电力科学研究院 | The restorative reconstructing method of distribution network failure |
| CN108988346A (en) * | 2018-09-19 | 2018-12-11 | 四川大学 | The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid |
| CN109873409A (en) * | 2019-04-09 | 2019-06-11 | 中国计量大学 | A kind of restorative reconstructing method of distribution network failure |
| CN113505530A (en) * | 2021-07-02 | 2021-10-15 | 广西电网有限责任公司桂林供电局 | Method for optimizing power grid reconstruction with high reliability of distribution network and related equipment |
-
2017
- 2017-09-13 CN CN201710825596.2A patent/CN107579517A/en active Pending
Non-Patent Citations (1)
| Title |
|---|
| 关万琳: "分布式电源优化配置与配电网重构", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108182498A (en) * | 2018-01-15 | 2018-06-19 | 国网黑龙江省电力有限公司电力科学研究院 | The restorative reconstructing method of distribution network failure |
| CN108988346A (en) * | 2018-09-19 | 2018-12-11 | 四川大学 | The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid |
| CN108988346B (en) * | 2018-09-19 | 2020-05-05 | 四川大学 | Network reconstruction preprocessing method and system for reducing invalid solutions in power grid |
| CN109873409A (en) * | 2019-04-09 | 2019-06-11 | 中国计量大学 | A kind of restorative reconstructing method of distribution network failure |
| CN113505530A (en) * | 2021-07-02 | 2021-10-15 | 广西电网有限责任公司桂林供电局 | Method for optimizing power grid reconstruction with high reliability of distribution network and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107579517A (en) | The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network | |
| Ahuja et al. | An AIS-ACO hybrid approach for multi-objective distribution system reconfiguration | |
| de Macêdo Braz et al. | Distribution network reconfiguration using genetic algorithms with sequential encoding: Subtractive and additive approaches | |
| CN102648477B (en) | With the recovery Switch Analysis of genetic algorithm | |
| Syahputra | Fuzzy multi-objective approach for the improvement of distribution network efficiency by considering DG | |
| CN103036234B (en) | Power distribution network anti-error optimization method | |
| CN112671029A (en) | Multi-stage fault recovery method for distribution network with distributed power supply | |
| CN106786546A (en) | Power distribution network fault recovery strategy optimization method based on risk assessment | |
| Sharma et al. | A review of PV array reconfiguration techniques for maximum power extraction under partial shading conditions | |
| CN108182498A (en) | The restorative reconstructing method of distribution network failure | |
| Jena et al. | Solving distribution feeder reconfiguration and concurrent DG installation problems for power loss minimization by multi swarm cooperative PSO algorithm | |
| CN104764980A (en) | Positioning method for distribution circuit fault section based on BPSO and GA | |
| CN107658840A (en) | Distribution network failure restoration methods based on A* algorithms Yu fireworks algorithm | |
| CN104200096A (en) | Lightning arrester grading ring optimization method based on differential evolutionary algorithm and BP neural network | |
| CN106451439A (en) | Two-stage reconstruction method for power distribution network of comprehensive power propulsion system of ship | |
| Baziar et al. | An intelligent multi-objective stochastic framework to solve the distribution feeder reconfiguration considering uncertainty | |
| CN108539781B (en) | Extended black start scheme two-layer planning optimization method for improving safety of recovery process | |
| Ahmad et al. | Multi-objective quantum-inspired Artificial Immune System approach for optimal network reconfiguration in distribution system | |
| CN106487001A (en) | A kind of isolated power system intelligent reconstruction method | |
| CN117458453A (en) | Method, system, equipment and storage medium for predicting transient stability of power system | |
| Zhang et al. | A fault reconfiguration strategy based on adjustable space operator discrete state transition algorithm for ship microgrid system | |
| CN104283214B (en) | Network reconstruction method for power distribution network | |
| Sharma et al. | An efficient power extraction using artificial intelligence based machine learning model for SPV array reconfiguration in solar industries | |
| CN110365006B (en) | Power grid partitioning method based on nwbbo algorithm | |
| CN113421004B (en) | Transmission and distribution cooperative active power distribution network distributed robust extension planning system and method |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180112 |