CN105631768B - The coding method of radial topological structure in a kind of quick obtaining ring distribution system - Google Patents
The coding method of radial topological structure in a kind of quick obtaining ring distribution system Download PDFInfo
- Publication number
- CN105631768B CN105631768B CN201610055451.4A CN201610055451A CN105631768B CN 105631768 B CN105631768 B CN 105631768B CN 201610055451 A CN201610055451 A CN 201610055451A CN 105631768 B CN105631768 B CN 105631768B
- Authority
- CN
- China
- Prior art keywords
- switch
- looped network
- variable
- chain
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 239000011159 matrix material Substances 0.000 claims abstract description 31
- 230000000694 effects Effects 0.000 claims abstract description 3
- 230000015572 biosynthetic process Effects 0.000 claims description 5
- 238000000926 separation method Methods 0.000 claims description 4
- 108091081062 Repeated sequence (DNA) Proteins 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000005457 optimization Methods 0.000 description 8
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram 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
- 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
-
- 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
-
- 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
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Power Engineering (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The present invention relates to a kind of coding methods of radial topological structure in quick obtaining ring distribution system, using following steps: 1) obtaining loop networks switch, the loop networks switch is all switches being closed in looped network formed in power distribution network, comprising block switch and interconnection switch, the feasible topological structure in distribution is indicated with disconnection switching variable；2) simplify looped network；3) determine that principle forms loop-switch matrix according to looped network；4) variable in space encoder is determined according to the variables choice principle for being designed with effect coding method；5) diagonal element in fixed matrix obtains the disaggregation space of multiple feasible topological structures according to switch selection principle；6) number of switches involved in each variable is analyzed, determines switch combination number in each disaggregation space.The above method simplifies topological structure, reduces network size, shortens code length, reduces the number of parameter, and making to calculate becomes simple.
Description
Technical field
The present invention relates to radial in electric power system optimization engineering field more particularly to a kind of quick obtaining ring distribution system
The coding method of topological structure.
Background technique
Power distribution network topological structure determines the method for operation of distribution system, it will be to the power supply reliability of electric system, warp
Ji property and investment etc. have a significant impact.The topological structure of Modern power distribution net can be changed by changing block switch and interconnection switch
Network structure.When normal or abnormal operation, in order to realize the targets such as system loss is minimum, failure is quickly repaired, usually in distribution
An optimal topological structure is found under the constraint condition of the radial operation of net holding.
Often contain a large amount of block switch and interconnection switch in Modern power distribution net, change the state of these switches, leads to
Many different topological structures can often be generated.One is obtained from these topological Solutions using optimizing search method meets constraint condition
Just become research hotspot with the optimal topological structure of operational objective.One optimum network configuration design be a multiple target,
Multiple constraint combinatorial optimization problem, it may be necessary to analyze the state of multiple switch vector, then find a new configuration appropriate.
Encoding scheme indicates all possibility in network with a series of real combinings code as the basis for solving this optimization problem
Topological structure, these topological structures can also be referred to as topological disaggregation.Space encoder depends on of topological structure in system
Number, the more more then presentation code spaces of number are bigger, search out that an optimal solution needs to grow very much from large-scale space encoder when
Between.In addition, there may be a certain number of infeasible solutions for space encoder, this requires each solution must be directed in search process
Validity check is executed, to increase the complexity of searching algorithm.Therefore topological disaggregation in a kind of good acquisition power distribution network
Encoding scheme, on improve optimization method efficiency and shorten convergence time have apparent influence.
Summary of the invention
In order to solve the above technical problems, the invention proposes radial topological structures in a kind of quick obtaining ring distribution system
Coding method, can be used for the determination in disaggregation space in power distribution network optimization algorithm, the topological Solution generated is only limited to feasible
In the range of, the optimizing space in optimization algorithm is reduced, and do not need to carry out topological radioactivity (validity) for each solution
It examines, reduces the runing time of algorithm.
The technical scheme adopted by the invention is as follows: the method is realized using following steps:
1) acquisition of loop networks switch, the loop networks switch are all switches being closed in looped network formed in power distribution network
(comprising block switch and interconnection switch), the feasible topological structure in distribution are indicated with disconnection switching variable；
2) simplify looped network；
3) loop-switch matrix is formed according to the determination principle of looped network；
4) variable in space encoder is determined according to the variables choice principle for being designed with effect coding method；
5) diagonal element in fixed matrix, according to switch selection principle, the disaggregation for obtaining multiple feasible topological structures is empty
Between.
6) number of switches involved in each variable is analyzed, determines switch combination number in each disaggregation space.
Wherein, step 1), the acquisition of loop networks switch are according to all switches being closed in initial power distribution network, and reservation is formed back
The switch on road, the switch outside circuit are not involved in coding.
Step 2), the adjacency matrix in looped network between n node:
A=(αij)n×n
Here, aijThere is no branch switch, α between=0 two nodes of expressionijBetween two nodes of=1 expression there are
Branch switch.Then retain Dvi>=3 T node, and the switch between two T nodes merges switch chain.
The determination principle of step 3) looped network is: the number of looped network is equal with interconnection switch number；It is at least wrapped in each looped network
An interconnection switch chain is contained；The number of the switch chain contained in looped network is minimum；If it is determined that when the looped network of a certain interconnection switch,
It may be simultaneously present the identical possible looped network of two or more switch chain numbers, take wherein contain interconnection switch chain number most at this time
More looped networks.The relevance analyzed between every two looped network in this case obtains corresponding looped network-branch matrix, looped network-
Switch chain matrix has the characteristics that symmetry, therefore has between every two association looped network and an only common branch switch
Chain then forms looped network-branch matrix L=(lij)m×m.Wherein m indicates the number of interconnection switch number alternatively looped network, lijTable
Show between two looped networks with the presence or absence of common switch chain, if it exists then lijIndicate the label of public chain, there is no be then 0.
Multiple cryptoprinciples are devised in step 4), (1) is compiled using looped network-switch chain matrix line number m as initial looped network
The number of code space, columns are the variable number of each space encoder；(2) appearance of isolated island in order to prevent, in the same switch chain
There can only be the switch of 1 disconnection；(3) formation of loop in order to prevent, in each space encoder, the switch chain on diagonal line is extremely
Rare one is to disconnect；(4) it must at least open a switch chain in every a line of matrix and each column, otherwise be formed back
Road.The switch chain that can choose by the available initial space encoder number of these coding rules and each variable.Such as i-th
The range of choice of a space encoder, variable j is fixed for diagonal element [lij] (i=j)；The range of choice of other variables should be
[l1j, l2j...lmj] (i ≠ j).
In step 4) after initial space encoder is formed, judge between the optional branch chain of variable in each space encoder
With the presence or absence of repeat element, generation trivial solution will lead to if it exists, separated by space encoder to eliminate these trivial solutions.Separation
Process is as follows: when (1) for each variable is determined, in order to guarantee not generate trivial solution, if the optional element in each variable
Have with the optional element of other fixed variables and then remove this element when repetition, be consequently formed one can guarantee do not generate it is invalid
The space encoder of solution.(2) in order to guarantee the integrality solved, if there are identical switch chains between two variables, it is necessary to increase
One corresponding space encoder.Such as: if having common switch chain L between two variables of variable j and knj, then increased volume
The range of choice of the two variables, which is respectively as follows: in the selection switch chain of variable j, in code space removes Lnj, and the selection switch chain of k
It is set as Lnj, the selection switch chain of other variables and being consistent in (1).
The feasible solution in the disaggregation space of multiple feasible topological structures in network is found out in step 5) using following calculation formula
Number of combinations:
Wherein, h is the number of space encoder, and n is variable number, mhnFor the switch number that can choose in each variable.
Beneficial effects of the present invention:
(1) topological structure is simplified in the present invention, reduces network size, code length shortens；
(2) number of parameter is few, calculates simple；
(3) when obtaining the feasible topological Solution in network, the generation of invalid topological Solution is avoided, disaggregation scale is reduced；
The measure for taking each topological Solution feasibility to verify is not needed simultaneously, saves runing time；It only needs to analyze each volume
The combination of variable in code space can be quickly obtained feasible topological Solution all in network, be that the optimization of power distribution network is calculated
Method provides basic condition.
Detailed description of the invention
Fig. 1 is the flow chart of the coding method of radial topological structure in quick obtaining ring distribution system；
Fig. 2 is topology combination design flow diagram；
Fig. 3 is the original configuration of power network of 14 node, 16 branch；
Fig. 4 is by simplified 14 node, the 16 branch configuration of power network of looped network.
Specific embodiment
Referring to Fig.1, overall flow figure of the invention is by the acquisition of loop networks switch, the simplification of looped network, loop-switch matrix
Formation, the design of efficient coding scheme, the formation of space encoder are constituted, the acquisition composition of topological Solution.
The acquisition of loop networks switch is to retain the switch of forming circuit according to all switches being closed in initial power distribution network, is located
Coding is not involved in the switch outside circuit to be formed.
In the simplification of looped network, the angle value matrix of adjacency matrix and node between node is respectively as follows:
A=(αij)n×n (1)
Here, aijThere is no branch switch, α between=0 two nodes of expressionijBetween two nodes of=1 expression there are
Branch switch.Then retain Dvi>=3 T node, and the switch between two T nodes merges switch chain.
Referring to Fig. 3, the original configuration of power network of 14 node, 16 branch, available Fig. 4 institute after both the above step
The structure chart shown, and shown in the corresponding switch number of every switch chain such as formula (3).
Loop-switch matrix is the relationship illustrated between two circuits, is obtained on the basis of circuit is formed.Institute
The circuit number of acquirement is identical as interconnection switch chain number, and an interconnection switch chain is at least contained in each circuit；Contain in looped network
The number of some switch chains is minimum；If existing simultaneously the identical possible looped network of two or more switch chain numbers, take at this time wherein
Contain the most looped network of interconnection switch chain number.Loop label is as shown in figure 4, the switch chain label contained in each circuit is as follows
Table 1.
1 circuit switching chain of table constructs table
| Circuit number | Switch chain |
| ① | L1 L2 L4 |
| ② | L2 L3 L5 |
| ③ | L4 L5 L6 |
According between every two looped network whether the relationship containing common switch chain, loop-switch matrix L is obtained, such as formula
(4)。
On the basis of matrix (4), the topological Solution of network can be decomposed into multiple nonoverlapping space encoders, be terrible
To subspace, it is necessary to follow rule below:
(1) using looped network-switch chain matrix line number m as the number of initial looped network space encoder, columns is each coding
The variable number in space；
(2) appearance of isolated island in order to prevent can only have the switch of 1 disconnection in the same switch chain；
(3) formation of loop in order to prevent, in each space encoder, switch chain on diagonal line at least one be disconnected
It opens；And the element on diagonal line can only be primary by selection in all space encoders；
(4) it must at least open a switch chain in every a line of matrix and each column, otherwise be formed into a loop.
The switch chain that can choose by the available initial space encoder number of these coding rules and each variable,
As shown in table 2.
2 initial code space of table composition
| Space encoder label | The optional switching value of variable |
| 1 | [{L1} {L2L3L5} {L4L5L6}] |
| 2 | [{L2L4} {L3} {L4L5L6}] |
| 3 | [{L2L4} {L2L5} {L6}] |
The switch chain that can choose by the available initial space encoder number of these coding rules and each variable,
There may be duplicate switch chains between certain variables, will lead to the appearance of infeasible solution, are separated by space encoder to eliminate
These trivial solutions.Separation process is as follows:
(1) for each variable is determined when, in order to guarantee not generate trivial solution, if optional element in each variable with
The optional element of other fixed variables, which has, then removes this element when repetition, be consequently formed one and can guarantee and do not generate trivial solution
Space encoder.
(2) in order to guarantee solution integrality, if there are identical switch chains between two variables, it is necessary to increase by one with
Corresponding space encoder.
The selection of three variable of the space encoder marked as 1 can indicate such as in table 2 are as follows: [{ L1 } { L2 L3 L5 }
{ L4 L5 L6 }], there are duplicate switch chain L5 in variable 2 and variable 3, and first the L5 in variable 3 first should be eliminated, obtain one
Code space is edited, on this basis, increases a sub-spaces [{ L1 } { L2 L3 } { L5 }] using mentioned above principle (2).Therefore,
Space encoder in final network can be expressed as table 3, then return to formula (3), available each variable it is selectable
Switch number.
The combination of 3 space encoder of table
Topological Solution number is obtained according to formula below:
Wherein, h is the number of space encoder, and n is variable number, mhnFor the switch number that can choose in each variable.
The number that topological Solution is shared in table 3 is 190.
Topological Combination Design carries out specific implementation explanation referring to Fig. 2.
(1) initialization of network includes the number h of space encoder, in each space encoder variable number n and each of which
The optional switch number m of variablehn。
(2) line number of the matrix s matrix of final output is the number of topological Solution, and it is determining network that every a line is corresponding
Topological Solution.
The present invention provides a kind of coding method of radial topological structure in quick obtaining ring distribution system, solve existing
There is long the time required to searching out an optimal solution in technology in space encoder, the technical problem of required algorithm complexity, to topology knot
Structure is simplified, and is reduced network size, is shortened code length；The number for reducing parameter, making to calculate becomes simple；Only
It needs to analyze the combination of variable in each space encoder, feasible topological Solution all in network can be quickly obtained, be
The optimization algorithm of power distribution network provides basic condition.
The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this
The principle of invention, without departing from the spirit and scope of the present invention, various changes and improvements may be made to the invention, these changes
Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its
Equivalent thereof.
Claims (7)
1. the coding method of radial topological structure in a kind of quick obtaining ring distribution system, this method uses following steps:
1) loop networks switch is obtained, the loop networks switch is all switches being closed in looped network formed in power distribution network, includes
Block switch and interconnection switch, the feasible topological structure in power distribution network are indicated with disconnection switching variable；
2) simplify looped network, simplify looped network the specific steps are according to the degree of adjacency matrix and node in looped network between n node
Value matrix simplifies looped network, and the angle value matrix of adjacency matrix and node in looped network between n node is respectively as follows:
A=(αij)n×n
Wherein, aijThere is no branch switch, a between=0 two nodes of expressionijThere are branches between two nodes of=1 expression
Switch；Retain Dvi>=3 T node, and the switch between two T nodes merges switch chain；
3) loop-switch matrix is formed according to the determination principle of looped network, the determination principle of looped network is: the number of looped network is opened with contact
It is equal to close number；An interconnection switch chain has been included at least in each looped network；The number of the switch chain contained in looped network is minimum；
4) variable in space encoder is determined according to the variables choice principle for being designed with effect coding method；
5) diagonal element in fixed matrix obtains the disaggregation space of multiple feasible topological structures according to switch selection principle；
6) number of switches involved in each variable is analyzed, determines switch combination number in each disaggregation space.
2. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 1,
The determination principle for being characterized in that looped network further comprises: if it is determined that when the looped network of a certain interconnection switch, exist simultaneously two or
The identical possible looped network of multiple switch chain number, takes looped networks wherein most containing interconnection switch chain number at this time.
3. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 2,
It is characterized in that, in the case where taking the most looped network of wherein interconnection switch chain number, analyzes the relevance between every two looped network
Obtain corresponding looped network-branch matrix, looped network-switch chain matrix has the characteristics that symmetry, therefore every two association looped network it
Between have and only one common branch switch chain, then form looped network-branch matrix L=(lij)m×m；Wherein m indicates that contact is opened
Close the number of number alternatively looped network, lijIt indicates between two looped networks with the presence or absence of common switch chain, and if it exists, then i, j table
Show the label of public chain, there is no be then 0.
4. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 3,
The variables choice principle being characterized in that in the step 4) are as follows: (1) using looped network-switch chain matrix line number m as initial looped network
The number of space encoder, columns are the variable number of each space encoder；(2) appearance of isolated island in order to prevent, the same switch chain
In can only have 1 disconnection switch；(3) formation of loop in order to prevent, the switch chain in each space encoder, on diagonal line
At least one is to disconnect；(4) it must at least open a switch chain in every a line of matrix and each column, otherwise be formed
Circuit；Initial space encoder number is obtained by these coding rules and switch chain that each variable can choose.
5. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 4,
The variables choice principle being characterized in that in the step 4) includes: to judge that each coding is empty after initial space encoder is formed
Between in the optional branch chain of variable between whether there is repeat element, will lead to generation trivial solution if it exists, pass through space encoder
Separation is to eliminate these trivial solutions.
6. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 5,
Space encoder separation process are as follows: when (1) for each variable is determined, if the optional element in each variable has fixed change with other
The optional element of amount, which has, then removes this element when repetition, being consequently formed one can guarantee the space encoder for not generating trivial solution；
It (2) is the integrality for guaranteeing solution, if there are identical switch chains between two variables, it is necessary to increase a corresponding volume
Code space.
7. the coding method of radial topological structure in a kind of quick obtaining ring distribution system according to claim 6,
It is characterized in that obtaining the specific steps in the disaggregation space of feasible topological structure in the step 5) are as follows:
The number of combinations of the feasible solution in the disaggregation space of multiple feasible topological structures in network is found out using following calculation formula:
Wherein, h is the number of space encoder, and n is variable number, mhnFor the switch number that can choose in each variable.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610055451.4A CN105631768B (en) | 2016-01-27 | 2016-01-27 | The coding method of radial topological structure in a kind of quick obtaining ring distribution system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610055451.4A CN105631768B (en) | 2016-01-27 | 2016-01-27 | The coding method of radial topological structure in a kind of quick obtaining ring distribution system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105631768A CN105631768A (en) | 2016-06-01 |
| CN105631768B true CN105631768B (en) | 2019-07-12 |
Family
ID=56046659
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610055451.4A Expired - Fee Related CN105631768B (en) | 2016-01-27 | 2016-01-27 | The coding method of radial topological structure in a kind of quick obtaining ring distribution system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105631768B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106650025B (en) * | 2016-11-25 | 2020-06-09 | 南方电网科学研究院有限责任公司 | Multi-power-supply distribution network radial topology constraint judgment method and system |
| CN108988346B (en) * | 2018-09-19 | 2020-05-05 | 四川大学 | Network reconstruction preprocessing method and system for reducing invalid solutions in power grid |
| CN110361603B (en) * | 2019-07-19 | 2021-06-22 | 湘潭大学 | Electromagnetic radiation prediction method under highway scene with uniformly distributed scatterers |
| CN111725803B (en) * | 2020-06-04 | 2022-03-25 | 海仿(上海)科技有限公司 | Method and device for optimizing power grid switch combination |
| CN112564114B (en) * | 2020-12-15 | 2023-04-14 | 深圳供电局有限公司 | Power distribution network reconstruction optimization method and system based on limited radiation type constraint |
| CN113141009B (en) * | 2021-04-27 | 2022-07-12 | 广东电网有限责任公司江门供电局 | Decision-making method and device for switching open-loop power grid into power supply |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6857115B1 (en) * | 2002-08-08 | 2005-02-15 | Xilinx, Inc. | Placement of objects with partial shape restriction |
| CN104134104A (en) * | 2014-08-15 | 2014-11-05 | 国家电网公司 | Distribution network reconstruction optimization method based on multi-objective optimization |
| CN104332995A (en) * | 2014-11-14 | 2015-02-04 | 南京工程学院 | Improved particle swarm optimization based power distribution reconstruction optimization method |
| CN104734153A (en) * | 2014-12-18 | 2015-06-24 | 国家电网公司 | Method of reconstructing power distribution network containing distributed power supply |
-
2016
- 2016-01-27 CN CN201610055451.4A patent/CN105631768B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6857115B1 (en) * | 2002-08-08 | 2005-02-15 | Xilinx, Inc. | Placement of objects with partial shape restriction |
| CN104134104A (en) * | 2014-08-15 | 2014-11-05 | 国家电网公司 | Distribution network reconstruction optimization method based on multi-objective optimization |
| CN104332995A (en) * | 2014-11-14 | 2015-02-04 | 南京工程学院 | Improved particle swarm optimization based power distribution reconstruction optimization method |
| CN104734153A (en) * | 2014-12-18 | 2015-06-24 | 国家电网公司 | Method of reconstructing power distribution network containing distributed power supply |
Non-Patent Citations (1)
| Title |
|---|
| 《基于量子粒子群算法多目标优化的配电网动态重构》;文娟 等;《电力系统保护与控制》;20150816;第43卷(第16期);第73-78页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105631768A (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105631768B (en) | The coding method of radial topological structure in a kind of quick obtaining ring distribution system | |
| Aggarwal et al. | Reliability evaluation in computer-communication networks | |
| CN100367620C (en) | Power network topology error identification method based on mixed state estimation | |
| Wang et al. | The node degree distribution in power grid and its topology robustness under random and selective node removals | |
| CN103036234B (en) | Power distribution network anti-error optimization method | |
| CN111551825B (en) | Self-adaptive power distribution network fault positioning method based on fault current path | |
| CN106532689B (en) | Power distribution network topology structure optimization method and system | |
| CN105354675A (en) | AC/DC power grid cascading failure analysis method based on key power transmission section recognition | |
| CN104361413A (en) | Method for reconstructing power distribution network containing distributed power source | |
| Márquez et al. | Wind turbines maintenance management based on FTA and BDD | |
| CN104917293A (en) | Topological mapping method for secondary virtual and physical links of intelligent substation | |
| CN107846018A (en) | Distribution net capability appraisal procedure based on path search algorithm | |
| CN105870914A (en) | Electrical partition-based electromagnetic loop network-containing critical transmission section search method | |
| CN104881708A (en) | Method for reconstructing power distribution network based on topology correction | |
| CN103248041B (en) | Looped network detection method based on bus depth conflict calculation | |
| CN107808200A (en) | Short-time maintenance plan optimization method and device for power distribution network | |
| Khoa et al. | Ant colony search-based loss minimum for reconfiguration of distribution systems | |
| CN116777670A (en) | Hierarchical parallel calculation method, system and terminal for theoretical line loss of power distribution network | |
| Sičanica et al. | Resilience to cascading failures. a complex network approach for analysing the croatian power grid | |
| Luong et al. | Scalable and practical multi-objective distribution network expansion planning | |
| Barros et al. | An approach to the explicit consideration of unreliability costs in transmission expansion planning | |
| CN104505830A (en) | Time-lag power system stability analysis method and device | |
| CN115587459A (en) | Graph maximum density-based radial constraint modeling method and system for power distribution network | |
| CN104218546B (en) | A kind of self-healing recovery control method of intelligent distribution network | |
| Sepehry et al. | A new algorithm for reliability assessment of distribution system based on reliability network equivalent technique |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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: 20190712 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |