CN108988346A - The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid - Google Patents

The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid Download PDF

Info

Publication number
CN108988346A
CN108988346A CN201811096598.3A CN201811096598A CN108988346A CN 108988346 A CN108988346 A CN 108988346A CN 201811096598 A CN201811096598 A CN 201811096598A CN 108988346 A CN108988346 A CN 108988346A
Authority
CN
China
Prior art keywords
loop
switch
matrix
solution
network
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
Application number
CN201811096598.3A
Other languages
Chinese (zh)
Other versions
CN108988346B (en
Inventor
周步祥
邹家惠
陈鑫
陈实
袁岳
张致强
罗燕萍
刘思聪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan University
Original Assignee
Sichuan University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sichuan University filed Critical Sichuan University
Priority to CN201811096598.3A priority Critical patent/CN108988346B/en
Publication of CN108988346A publication Critical patent/CN108988346A/en
Application granted granted Critical
Publication of CN108988346B publication Critical patent/CN108988346B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/04—Circuit arrangements for ac mains or ac distribution networks for connecting networks of the same frequency but supplied from different sources
    • H02J3/06—Controlling transfer of power between connected networks; Controlling sharing of load between connected networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00—Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Computing Systems (AREA)
  • Algebra (AREA)
  • Public Health (AREA)
  • General Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • General Health & Medical Sciences (AREA)
  • Tourism & Hospitality (AREA)
  • Strategic Management (AREA)
  • Primary Health Care (AREA)
  • Water Supply & Treatment (AREA)
  • Marketing (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Supply And Distribution Of Alternating Current (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses network reconfiguration preprocess methods and pretreatment system that trivial solution is reduced in a kind of power grid, by simplifying to original power grid, and define loop matrix, then piecemeal and recombination are carried out to it, complete the pretreatment of network reconfiguration, it avoids and is searched in infeasible solution, reduce search space, reduce the generation of trivial solution, search speed is improved, time cost is saved, after inventive network reconstruct pretreatment, reconfiguration of electric networks speed can be effectively improved, realizes economy operation of power grid purpose.

Description

The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid
Technical field
The present invention relates in electric power network technique more particularly to a kind of power grid reduce trivial solution network reconfiguration preprocess method and Pretreatment system.
Background technique
Reconfiguration of electric networks is the means for reaching economical operation purpose by changing the state switched in power grid, and method has very much Kind, it is crucial for improving the speed of reconstruct.Have to improve from algorithm and improves search speed to promote reconstructed velocity, such as population The intelligent algorithms such as algorithm, ant group algorithm, but search space is not reduced fundamentally, space to be searched is still very huge, speed Degree is promoted unobvious；There are the method studied in terms of simplifying topological structure, such as the method based on fundamental matrix ring, passes through It defines matrix ring and simplifies particle coding mode, shorten code length, improve search efficiency, but it is still unavoidable bad The generation of solution needs to carry out isolated island detection and still needs to consume excessive time exclusion infeasible solution.As it can be seen that the prior art is in power grid weight When structure, amount of space to be searched is also very big, and search speed is also lower, affects reconfiguration of electric networks speed.
Summary of the invention
Present invention is primarily aimed at provide the network reconfiguration preprocess method that trivial solution is reduced in a kind of power grid and pre- place Reason system reduces search space by simplifying network structure, improves search speed.
The present invention is achieved through the following technical solutions:
The network reconfiguration preprocess method of trivial solution is reduced in a kind of power grid, comprising:
Step 1: the network being simplified according to the radial requirement of electricity grid network, to reduce solution space quantity, and reduces part The appearance of infeasible solution；
Step 2: defining loop matrix H=(hij) a × b, wherein a indicates the total number of power grid intermediate ring road, and b indicates each The maximum value of total number of switches in loop, element hijIndicate the volume of j-th of switch of number since either direction in i-th of loop Number；
Step 3: the nonzero element of row every in the loop matrix being divided into a part, forms loop matrix in block form M= (mij) a × a, which is a row a column square matrix, element mijIndicate the switch set that i-th of loop and j-th of loop share；Institute State loop matrix in block form by the switch of search in need be divided into most a × (a+1)/2 switch set；
Step 4: a subset is selected from most a × (a+1)/2 switch set, then from each subset respectively It selects one to switch and recombinated, selects optimal solution in each combination then obtained by searching algorithm from recombination.
Further, the step 1 includes:
Step 1-1: interconnection switch and block switch all in the network are closed；
Step 1-2: the switch not in any one loop is omitted in topological diagram；
Step 1-3: the switch being connected directly with power supply point is omitted in topological diagram.
Further, in step 2, contained total number of switches is inconsistent in each loop, if total number of switches in some loop Less than b, then 0 is mended behind the row end element, until every row element number is b.
Further, in step 3, if element mijThe switch not shared, then the element is zero, finally removes script Neutral element.
Further, in the step 4, recombinated based on the premise that
In the loop matrix in block form, every a line and each at least one switch set that arranges are selected；
The subset number of selection is equal with the quantity of the total number of the loop and the interconnection switch；
Element in the switch set selected at least one loop matrix in block form on diagonal line.
Further, the step 4 includes:
Selection independent switch first constitutes subset, obtains the initial sets [m of a subset11,m22,m33,...,maa]；
It is assumed that independent switch set m in first loop11It is necessarily selected, then in the other a-1 element of initial sets In fill up surplus element, obtain first step disaggregation [m11,{m12,m22, m32..., ma2, { m13,m23,m33,...,ma3..., {m1a, m2a, m3a..., maa}]；
It concentrates duplicate element to leave out above-mentioned solution, obtains solution space [m11,{m12,m22,m32,...,ma2},{m13, m33,...,ma3..., { m1a,maa], thus obtain set m11The inevitable solution space formed by selection；
Remaining a-1 solution space is successively obtained according to the method described above:
[{m11,m21,m31,...,ma1},m22,{m23,m33..., ma3..., { m2a, maa}]
[{m11, m21,m31,...,ma1},{m22,m32,...,ma2},m33,...,{m3a,maa}]
……
[{m11,m21,m31,...,ma1},{m22,m32..., ma2, { m33, m43..., ma3..., { ma-1a-1,ma-1a}, maa]；
It is checked since second solution space, if the independent switch set m occurred containing frontii, i=1,2,3,, a, Then removed, obtain a final solution space:
[m11,{m12,m22,m32,...,ma2},{m13,m33,...,ma3},...,{m1a,maa}]
[{m21,m31,...,ma1},m22,{m23,m33,...,ma3},...,{m2a,maa}]
[{m21,m31,...,ma1},{m32,...,ma2},m33,...,{m3a,maa}]
…...
[{m21,m31,...,ma1},{m32,...,ma2},{m43,...,ma3},...,ma-1a,maa]。
The network reconfiguration pretreatment system of trivial solution is reduced in a kind of power grid, comprising:
Network reduction module, for simplifying the network according to the radial requirement of electricity grid network, to reduce solution space quantity, And reduce the appearance of part infeasible solution；
Loop matrix constructing module, for defining loop matrix H=(hij) a × b, wherein a indicates the total of power grid intermediate ring road Number, b indicate the maximum value of total number of switches in each loop, element hijIndicate in i-th of loop the number since either direction The number of j-th of switch；
Loop matrix piecemeal module forms ring for the nonzero element of row every in the loop matrix to be divided into a part Road matrix in block form M=(mij) a × a, which is a row a column square matrix, element mijIndicate that i-th of loop and j-th of loop are shared Switch set；The loop matrix in block form by the switch of search in need be divided into most a × (a+1)/2 switch collection It closes；
Loop matrix in block form recombination module, for selecting a subset from most a × (a+1)/2 switch set, One is selected to switch and recombinated respectively from each subset again, in each combination then obtained by searching algorithm from recombination Select optimal solution.
Further, the network reduction module is specifically used for:
It is closed interconnection switch and block switch all in the network, and is omitted not in topological diagram at any one Switch in loop, and the switch being connected directly with power supply point is omitted in topological diagram.
Further, contained total number of switches is inconsistent in each loop, if total number of switches is less than b, institute in some loop It states loop matrix constructing module and mends 0 behind the row end element, until every row element number is b.
Further, if element mijThe switch not shared, then the element is zero, and the loop matrix piecemeal module is last Remove the neutral element of script；
The loop matrix in block form recombination module recombinated based on the premise that
In the loop matrix in block form, every a line and each at least one switch set that arranges are selected；
The subset number of selection is equal with the quantity of the total number of the loop and the interconnection switch；
Element in the switch set selected at least one loop matrix in block form on diagonal line.
Compared with prior art, the network reconfiguration preprocess method of trivial solution is reduced in power grid provided by the invention and is located in advance Reason system by simplifying to original power grid, and defines loop matrix, and piecemeal and recombination are then carried out to it, completes network The pretreatment of reconstruct, avoids and searches in infeasible solution, reduces search space, reduces the generation of trivial solution, improves Search speed saves time cost, after inventive network reconstruct pretreatment, can effectively improve reconfiguration of electric networks speed, Realize economy operation of power grid purpose.
Detailed description of the invention
Fig. 1 is the flow diagram that the network reconfiguration preprocess method of trivial solution is reduced in power grid of the embodiment of the present invention；
Fig. 2 is IEEE33 node schematic diagram；
Fig. 3 is simplified IEEE33 node schematic diagram；
Fig. 4 is the theory of constitution signal that the network reconfiguration pretreatment system of trivial solution is reduced in power grid of the embodiment of the present invention Figure.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below with reference to embodiment and attached drawing, to this Invention is described in further detail.
As shown in Figure 1, reducing the network reconfiguration preprocess method of trivial solution in power grid provided by the invention, comprising:
Step 1: network being simplified according to the radial requirement of electricity grid network, to reduce solution space quantity, and reducing part can not The appearance of row solution；
Step 2: defining loop matrix H=(hij) a × b, wherein a indicates the total number of power grid intermediate ring road, and b indicates each The maximum value of total number of switches in loop, element hijIndicate the volume of j-th of switch of number since either direction in i-th of loop Number；
Step 3: the nonzero element of row every in loop matrix being divided into a part, forms loop matrix in block form M=(mij)a × a, the matrix are a row a column square matrix, element mijIndicate the switch set that i-th of loop and j-th of loop share；Loop piecemeal Matrix by the switch of search in need be divided into most a × (a+1)/2 switch set；
Step 4: selecting a subset from most a × (a+1)/2 switch set, then selected respectively from each subset One switchs and is recombinated, and selects optimal solution in each combination then obtained by searching algorithm from recombination.
In above steps, step 1 includes:
Step 1-1: all interconnection switch and block switch in closed network.
Step 1-2: for the switch not in any one ring, due to will form isolated island after disconnecting, therefore in power distribution network It is necessarily closed, therefore omits the switch not in any one loop in topological diagram.
Step 1-3: since the switch being connected directly with power supply point must be closed, so need not also consider such switch, because This omits the switch being connected directly with power supply point in topological diagram.
The complicated looped network that will be formed closed, each loop after network reduction and contact with each other.
In step 2, it should be noted that contained total number of switches is inconsistent in each loop, if switch in some loop Sum is less than b, then mends 0 behind the row end element, until every row element number is b.
In step 3, if element mijThe switch not shared, then the element is zero, finally removes the neutral element of script.
In step 4, recombinated based on the premise that
1) in loop matrix in block form, every a line and each at least one switch set that arranges are selected, i.e.,
S=[s1,s2,s3,...,sa]
si∈mij(j=1,2 ..., a)；
2) the subset number selected is equal with the quantity of the total number of loop and interconnection switch；
3) element in the switch set selected at least one loop matrix in block form on diagonal line, i.e.,
si∈mjj(i, j=1,2 ..., a).
According to the 3rd premise, since independent switch set there must be one to be selected, then such switch can be selected first Initial sets are obtained out.Based on this, step 4 includes:
Selection independent switch first constitutes subset, obtains the initial sets [m of a subset11,m22,m33,...,maa]；
It is assumed that independent switch set m in first loop11It is necessarily selected, then in the other a-1 element of initial sets In fill up surplus element, obtain first step disaggregation [m11,{m12,m22,m32,...,ma2},{m13,m23,m33,...,ma3},..., {m1a,m2a,m3a,...,maa}]；
Since loop matrix in block form is symmetrical matrix, it concentrates duplicate element to leave out above-mentioned solution, obtains solution space [m11,{m12,m22,m32,...,ma2},{m13,m33,...,ma3},...,{m1a,maa], thus obtain set m11Necessarily it is chosen The solution space selected and formed；
Remaining a-1 solution space is successively obtained according to the method described above:
[{m11,m21,m31,...,ma1},m22,{m23,m33,...,ma3},...,{m2a,maa}]
[{m11,m21,m31,...,ma1},{m22,m32,...,ma2},m33,...,{m3a,maa}]
……
[{m11,m21,m31,...,ma1},{m22,m32,...,ma2},{m33,m43,...,ma3},...,{ma-1a-1,ma-1a}, maa]；
Although without repeating part when selecting disaggregation inside above-mentioned a solution space, between each solution space still without Method avoids searching same solution, as [m may be selected inside each solution space11,m22,m33,...,maa], it constitutes to solution space, institute Need to be further simplified.Therefore, it is checked since second solution space, if the independent switch set occurred containing front mii, i=1,2,3,, a is then removed, obtain a final solution space:
[m11,{m12,m22,m32,...,ma2},{m13,m33,...,ma3},...,{m1a,maa}]
[{m21,m31,...,ma1},m22,{m23,m33,...,ma3},...,{m2a,maa}]
[{m21,m31,...,ma1},{m32,...,ma2},m33,...,{m3a,maa}]
…...
[{m21,m31,...,ma1},{m32,...,ma2},{m43..., ma3..., ma-1a, maa]。
Below by taking IEEE33 node as an example, illustrate technical solution of the present invention:
Fig. 2 is IEEE33 node schematic diagram, one is obtained after simplifying containing there are five the network of loop, Fig. 3 is simplified IEEE33 node schematic diagram.The digital representation node serial number of not zone circle in Fig. 2 and Fig. 3, digital representation loop number in circle.Letter Loop matrix is formed after change:
Then loop matrix in block form is obtained:
It is simplified shown as:
Five solution spaces are selected by recombination:
1:[A, { B, E, F, G }, { H, I }, { C, J, K }, { D, L }], each section switchs number are as follows: 4,7,4,1,10
2:[{ B, C, D }, E, { F, H, I }, { J, K }, { G, L }], each section switchs number are as follows: 6,2,7,8,9
3:[{ B, C, D }, { F, G }, H, { J, K }, { I, L }], each section switchs number are as follows: 6,4,3,8,9
4:[{ B, C, D }, { F, G }, I, J, { K, L }], each section switchs number are as follows: and 6,4, Isosorbide-5-Nitrae, 12
5:[{ B, C, D }, { F, G }, I, K, L], each section switchs number are as follows: and 6,4, Isosorbide-5-Nitrae, 8
It is computed, the reconstruct solution number in above-mentioned five solution spaces is respectively 12320,6048,5184,1152,768, always Number is 25472, has C if being solved by primitive network structure5 37(i.e. 435879) are a.It will using technical solution of the present invention Sum is reduced to original 5.84%, and search space substantially reduces, and improves search efficiency.
As shown in figure 4, being based on above-mentioned preprocess method, the embodiment of the invention also provides reduce trivial solution in a kind of power grid Network reconfiguration pretreatment system, comprising:
Network reduction module to reduce solution space quantity, and subtracts for simplifying network according to the radial requirement of electricity grid network The appearance of small part infeasible solution；
Loop matrix constructing module, for defining loop matrix H=(hij) a × b, wherein a indicates the total of power grid intermediate ring road Number, b indicate the maximum value of total number of switches in each loop, element hijIndicate in i-th of loop the number since either direction The number of j-th of switch；
Loop matrix piecemeal module forms loop point for the nonzero element of row every in loop matrix to be divided into a part Block matrix M=(mij) a × a, which is a row a column square matrix, element mijIndicate that i-th of loop is opened with what j-th of loop shared Close set；Loop matrix in block form by the switch of search in need be divided into most a × (a+1)/2 switch set；
Loop matrix in block form recombination module, for a subset of selection from most a × (a+1)/2 switch set, then from It selects one to switch and recombinated in each subset respectively, is selected in each combination then obtained by searching algorithm from recombination Optimal solution.
Wherein, network reduction module is specifically used for:
All interconnection switch and block switch in closed network, and omit not in topological diagram in any one loop Interior switch, and the switch being connected directly with power supply point is omitted in topological diagram.
Wherein, contained total number of switches is inconsistent in each loop, if total number of switches is less than b, loop square in some loop Battle array constructing module mends 0 behind the row end element, until every row element number is b.
Wherein, if element mijThe switch not shared, then the element is zero, and loop matrix piecemeal module is finally removed originally Neutral element；
Loop matrix in block form recombination module recombinated based on the premise that
In loop matrix in block form, every a line and each at least one switch set that arranges are selected；
The subset number of selection is equal with the quantity of the total number of loop and interconnection switch；
Element in the switch set selected at least one loop matrix in block form on diagonal line.
Each step 1 of the pretreatment system for executing above-mentioned preprocess method, in each module and above-mentioned preprocess method One is corresponding, specifically refers to the description in above-mentioned preprocess method, details are not described herein.
Above-described embodiment is only preferred embodiment, the protection scope being not intended to limit the invention, in spirit of the invention With any modifications, equivalent replacements, and improvements made within principle etc., should all be included in the protection scope of the present invention.

Claims (10)

1. reducing the network reconfiguration preprocess method of trivial solution in a kind of power grid characterized by comprising
Step 1: the network being simplified according to the radial requirement of electricity grid network, to reduce solution space quantity, and reducing part can not The appearance of row solution；
Step 2: defining loop matrix H=(hij) a × b, wherein a indicates the total number of power grid intermediate ring road, and b indicates each loop The maximum value of middle total number of switches, element hijIndicate the number of j-th of switch of number since either direction in i-th of loop；
Step 3: the nonzero element of row every in the loop matrix being divided into a part, forms loop matrix in block form M=(mij)a × a, the matrix are a row a column square matrix, element mijIndicate the switch set that i-th of loop and j-th of loop share；The loop Matrix in block form by the switch of search in need be divided into most a × (a+1)/2 switch set；
Step 4: selecting a subset from most a × (a+1)/2 switch set, then selected respectively from each subset One switchs and is recombinated, and selects optimal solution in each combination then obtained by searching algorithm from recombination.
2. reducing the network reconfiguration preprocess method of trivial solution in power grid as described in claim 1, which is characterized in that the step Rapid 1 includes:
Step 1-1: interconnection switch and block switch all in the network are closed；
Step 1-2: the switch not in any one loop is omitted in topological diagram；
Step 1-3: the switch being connected directly with power supply point is omitted in topological diagram.
3. reducing the network reconfiguration preprocess method of trivial solution in power grid as described in claim 1, which is characterized in that in step In 2, contained total number of switches is inconsistent in each loop, if total number of switches is less than b in some loop, after the row end element Face mends 0, until every row element number is b.
4. reducing the network reconfiguration preprocess method of trivial solution in power grid as claimed in claim 3, which is characterized in that in step In 3, if element mijThe switch not shared, then the element is zero, finally removes the neutral element of script.
5. reducing the network reconfiguration preprocess method of trivial solution in power grid as described in claim 1, which is characterized in that the step In rapid 4, recombinated based on the premise that
In the loop matrix in block form, every a line and each at least one switch set that arranges are selected；
The subset number of selection is equal with the quantity of the total number of the loop and the interconnection switch；
Element in the switch set selected at least one loop matrix in block form on diagonal line.
6. reducing the network reconfiguration preprocess method of trivial solution in power grid as described in claim 1, which is characterized in that the step Rapid 4 include:
Selection independent switch first constitutes subset, obtains the initial sets [m of a subset11,m22, m33..., maa]；
It is assumed that independent switch set m in first loop11It is necessarily selected, is then filled out in the other a-1 element of initial sets Surplus element is mended, first step disaggregation [m is obtained11,{m12,m22,m32,...,ma2},{m13, m23,m33..., ma3..., { m1a, m2a, m3a..., maa}]；
It concentrates duplicate element to leave out above-mentioned solution, obtains solution space [m11,{m12,m22,m32,...,ma2},{m13,m33,..., ma3},...,{m1a,maa], thus obtain set m11The inevitable solution space formed by selection；
Remaining a-1 solution space is successively obtained according to the method described above:
[{m11, m21, m31,...,ma1},m22,{m23,m33,...,ma3},...,{m2a,maa}]
[{m11,m21,m31,...,ma1},{m22,m32,...,ma2},m33,...,{m3a,maa}]
……
[{m11,m21, m31,...,ma1},{m22,m32,...,ma2},{m33,m43,...,ma3},...,{ma-1a-1,ma-1a},maa]；
It is checked since second solution space, if the independent switch set m occurred containing frontii, i=1,2,3,, a then will It removes, and obtains a final solution space:
[m11,{m12,m22,m32..., ma2},{m13,m33,...,ma3},...,{m1a,maa}]
[{m21,m31,...,ma1},m22,{m23,m33,...,ma3},...,{m2a,maa}]
[{m21,m31,...,ma1},{m32,...,ma2},m33,...,{m3a,maa}]
…...
[{m21,m31,...,ma1},{m32,...,ma2},{m43,...,ma3},...,ma-1a,maa]。
7. reducing the network reconfiguration pretreatment system of trivial solution in a kind of power grid characterized by comprising
Network reduction module to reduce solution space quantity, and subtracts for simplifying the network according to the radial requirement of electricity grid network The appearance of small part infeasible solution；
Loop matrix constructing module, for defining loop matrix H=(hij) a × b, wherein a indicates total of power grid intermediate ring road Number, b indicate the maximum value of total number of switches in each loop, element hijIndicate jth several since either direction in i-th of loop The number of a switch；
Loop matrix piecemeal module forms loop point for the nonzero element of row every in the loop matrix to be divided into a part Block matrix M=(mij) a × a, which is a row a column square matrix, element mijIndicate that i-th of loop is opened with what j-th of loop shared Close set；The loop matrix in block form by the switch of search in need be divided into most a × (a+1)/2 switch set；
Loop matrix in block form recombination module, for a subset of selection from most a × (a+1)/2 switch set, then from It selects one to switch and recombinated in each subset respectively, is selected in each combination then obtained by searching algorithm from recombination Optimal solution.
8. reducing the network reconfiguration pretreatment system of trivial solution in power grid as claimed in claim 7, which is characterized in that the net Network simplifies module and is specifically used for:
It is closed interconnection switch and block switch all in the network, and is omitted not in topological diagram in any one loop Interior switch, and the switch being connected directly with power supply point is omitted in topological diagram.
9. reducing the network reconfiguration pretreatment system of trivial solution in power grid as claimed in claim 7, which is characterized in that Mei Gehuan Contained total number of switches is inconsistent in road, if total number of switches is less than b in some loop, the loop matrix constructing module is in the row 0 is mended behind the element of end, until every row element number is b.
10. reducing the network reconfiguration pretreatment system of trivial solution in the power grid stated such as claim 9, which is characterized in that if element mijThe switch not shared, then the element is zero, and the loop matrix piecemeal module finally removes the neutral element of script；
The loop matrix in block form recombination module recombinated based on the premise that
In the loop matrix in block form, every a line and each at least one switch set that arranges are selected；
The subset number of selection is equal with the quantity of the total number of the loop and the interconnection switch；
Element in the switch set selected at least one loop matrix in block form on diagonal line.
CN201811096598.3A 2018-09-19 2018-09-19 Network reconstruction preprocessing method and system for reducing invalid solutions in power grid Expired - Fee Related CN108988346B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811096598.3A CN108988346B (en) 2018-09-19 2018-09-19 Network reconstruction preprocessing method and system for reducing invalid solutions in power grid

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811096598.3A CN108988346B (en) 2018-09-19 2018-09-19 Network reconstruction preprocessing method and system for reducing invalid solutions in power grid

Publications (2)

Publication Number Publication Date
CN108988346A true CN108988346A (en) 2018-12-11
CN108988346B CN108988346B (en) 2020-05-05

Family

ID=64546422

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811096598.3A Expired - Fee Related CN108988346B (en) 2018-09-19 2018-09-19 Network reconstruction preprocessing method and system for reducing invalid solutions in power grid

Country Status (1)

Country Link
CN (1) CN108988346B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120123601A1 (en) * 2010-11-17 2012-05-17 General Electric Company Enhanced plant level support of grid reconstruction
CN105631768A (en) * 2016-01-27 2016-06-01 湖南大学 Coding method of fast acquisition of radiation topology structure in ring power distribution network
CN106981874A (en) * 2017-04-26 2017-07-25 国网江西省电力公司电力科学研究院 Power distribution network reconfiguration based on harmony algorithm avoids the coding method of infeasible solution
CN107579517A (en) * 2017-09-13 2018-01-12 国网黑龙江省电力有限公司电力科学研究院 The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120123601A1 (en) * 2010-11-17 2012-05-17 General Electric Company Enhanced plant level support of grid reconstruction
CN105631768A (en) * 2016-01-27 2016-06-01 湖南大学 Coding method of fast acquisition of radiation topology structure in ring power distribution network
CN106981874A (en) * 2017-04-26 2017-07-25 国网江西省电力公司电力科学研究院 Power distribution network reconfiguration based on harmony algorithm avoids the coding method of infeasible solution
CN107579517A (en) * 2017-09-13 2018-01-12 国网黑龙江省电力有限公司电力科学研究院 The whether feasible determination methods of gained solution in the quantum telepotation reconstruct of Complicated Distribution Network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
林济铿 等: "基于基本树的网络拓扑放射性快速判断方法及配网重构", 《中国电机工程学报》 *
陈春 等: "一种避免不可行解的配电网快速重构方法", 《电工技术学报》 *

Also Published As

Publication number Publication date
CN108988346B (en) 2020-05-05

Similar Documents

Publication Publication Date Title
CN103310065B (en) Meter and the intelligent network distribution reconstructing method of distributed power generation and energy-storage units
CN106253913B (en) The block encoder of polarization code and its coding method
CN105046022A (en) Self-healing method of smart distribution network on the basis of improved ant colony algorithm
CN111431173B (en) Medium-voltage distribution network ring network structure determination method and system considering load complementary characteristics
CN108183502B (en) Active power distribution network reconstruction method for promoting distributed energy consumption
CN105870914B (en) Key transmission cross-section searching method based on the electrical partitioning containing electromagnetic looped network
CN109066674A (en) Reconstruction method of power distribution network based on the full Smoothing Newton Method of Constraints
CN108182498A (en) The restorative reconstructing method of distribution network failure
CN109217284A (en) A kind of reconstruction method of power distribution network based on immune binary particle swarm algorithm
CN106656205A (en) Polarization code decoding method and system capable of reducing memory consumption
CN107609694A (en) Offshore wind farm cluster transmission system structural optimization method and storage medium
CN104881708A (en) Method for reconstructing power distribution network based on topology correction
CN110311372A (en) Sub-area division method based on spectral clustering
CN108988346A (en) The network reconfiguration preprocess method and pretreatment system of trivial solution are reduced in power grid
CN109980651A (en) A kind of looped network type distribution system tidal current computing method
CN110290001A (en) Single-stranded structure optimization method, device and the equipment of power telecom network
CN105069517A (en) Power distribution network multi-objective fault recovery method based on hybrid algorithm
CN105184383B (en) City moving emergency power supply optimal scheduling method based on intelligent optimization method
CN106936708B (en) NxN wavelength routing network topology, photonic integrated chip and optical router
CN104283214B (en) Network reconstruction method for power distribution network
Salkuti Binary bat algorithm for optimal operation of radial distribution networks
CN107861026A (en) A kind of electrical power distribution network fault location method based on hybrid artificial immune system
CN116777670A (en) Hierarchical parallel calculation method, system and terminal for theoretical line loss of power distribution network
Neto et al. External equivalent for electric power distribution networks with radial topology
CN115425637A (en) Floyd-MPSO algorithm-based island power grid emergency reconstruction 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
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200505

Termination date: 20200919

CF01 Termination of patent right due to non-payment of annual fee