Fireworks algorithm based adaptive configuration method for power distribution network protection device

CN115329268BActive Publication Date: 2026-06-19HUAINAN POWER SUPPLY CO OF STATE GRID ANHUI ELECTRIC POWER CORPORATIO +1
View PDF 3 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
HUAINAN POWER SUPPLY CO OF STATE GRID ANHUI ELECTRIC POWER CORPORATIO
Filing Date
2022-06-30
Publication Date
2026-06-19

Smart Images

  • Figure CN115329268B_ABST
    Figure CN115329268B_ABST
Patent Text Reader

Abstract

This invention provides an adaptive configuration method for distribution network protection devices based on the fireworks algorithm, belonging to the field of operation and maintenance technology for energized distribution networks. The method includes: acquiring the status of circuit breakers at the distribution network site; generating a protection topology matrix based on the circuit breaker status; and using the fireworks algorithm to generate an optimal protection configuration strategy based on the protection topology matrix. The adaptive configuration method for distribution network protection devices based on the fireworks algorithm provided by this invention improves upon the fireworks algorithm itself, combining its data processing characteristics to obtain the optimal configuration scheme for distribution network protection devices, and ultimately achieves efficient configuration of the on / off states of each circuit breaker at the distribution network site.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of operation and maintenance technology for energized distribution networks, and specifically to an adaptive configuration method for distribution network protection devices based on the fireworks algorithm. Background Technology

[0002] With the increasing maturity of distribution network construction, the quantity and quality of smart circuit breakers installed on distribution lines have significantly improved. In most regions, when formulating the calculation principles for distribution network relay protection settings, a graded coordination scheme has been adopted in light of this situation. That is, all circuit breakers that can be protected on the line are divided into 3-5 levels according to the proportion of the load they carry. This method is simple to calculate, but lacks verification methods. The tripping effect is greatly affected by the line structure, and the versatility is poor. It cannot guarantee good results when facing various types of lines. Summary of the Invention

[0003] The purpose of this invention is to provide an adaptive configuration method for distribution network protection devices based on the fireworks algorithm, which can improve the working efficiency of circuit breakers in live operation and maintenance of distribution networks.

[0004] To achieve the above objectives, embodiments of the present invention provide an adaptive configuration method for distribution network protection devices based on the fireworks algorithm, comprising:

[0005] Obtain the status of circuit breakers in the power distribution network;

[0006] Generate a protection topology matrix based on the circuit breaker status;

[0007] The Fireworks Algorithm is used to generate the optimal protection configuration strategy based on the protection topology matrix.

[0008] Optionally, generating a protection topology matrix based on the status of the lines and circuit breakers includes:

[0009] Traverse each line, take the circuit breaker in the open state as the break point, and do not include the line after the break point in the protection topology matrix. Take the circuit breaker in the closed state as the conductor with a length of 0.

[0010] When the circuit breaker includes only one downstream circuit breaker and there is no transformer within the protection range, the downstream circuit breaker is used as a conductor with a length of 0.

[0011] Traverse the topology in the positive direction from all the final-stage circuit breakers, recording the length of the lines passed through, the type of the lines, the rated capacity of the transformers, the number of transformers, the number of users of the transformers, and the load level of the transformers.

[0012] The lines between circuit breakers with hierarchical relationships are merged into a single branch. The equivalent fault factor and equivalent load of the branch are calculated, and the merged lower-level circuit breaker is used as the first circuit breaker of each branch.

[0013] Optionally, generating the protection topology matrix based on the circuit breaker status includes:

[0014] The circuit breaker is represented by the number 0, and the circuit breaker is represented by the number 1, which indicates the circuit breaker is in operation.

[0015] The protection level of the circuit breaker is used as the row of the protection topology matrix, and the branch of the circuit breaker is used as the column of the protection topology matrix.

[0016] Optionally, the firework algorithm is used to generate the optimal protection configuration strategy based on the protection topology matrix, including:

[0017] Multiple protective topology matrices are randomly generated as initial fireworks populations, wherein the fireworks populations include multiple sparks, and each spark corresponds to a protective topology matrix;

[0018] Calculate the objective function value for each spark at the present time;

[0019] The spark with the smallest objective function value is selected as the optimal solution;

[0020] Determine whether the preset termination condition is met;

[0021] If the termination condition is not met, a population of explosive fireworks is generated based on the explosion radius and the number of sparks.

[0022] Randomly select multiple sparks from the aforementioned fireworks population and perform Gaussian mutation operations to obtain a mutated fireworks population;

[0023] Select a new fireworks group from the fireworks group, explosive fireworks group, and mutated fireworks group, and return to the step of calculating the objective function value of each current spark;

[0024] If the termination condition is met, the spark with the smallest objective function value is selected as the optimal protection configuration strategy.

[0025] Optionally, multiple protection topology matrices are randomly generated to serve as the initial fireworks population, including:

[0026] Starting from the second row of the protection topology matrix, traverse each element and determine whether the element satisfies formula (1).

[0027] n pl =n pmax -npu >0, (1)

[0028] Where, n pl n represents the remaining protection level of the element. pmax To protect the upper limit of the level, n pu The number of protection levels already occupied by the parent element of the current element;

[0029] If the element satisfies formula (1), then determine whether the element satisfies formula (2).

[0030] f(B n )>n pl (2)

[0031] Where, f(B) n To protect element B in the topology matrix n The corresponding substructure matrix [B n ]′ number of lines;

[0032] If the element satisfies formula (2), the element is marked as an assignable element;

[0033] If the element does not satisfy formula (2), the substructure matrix [B] will be... n Each element in ]′ is assigned the value 1;

[0034] If the element does not satisfy formula (1), the substructure matrix [B] will be... n Each element in ]′ is assigned the value 0;

[0035] Each of the assignable elements is randomly assigned a value of 0 or 1 to generate multiple sparks, thus forming the fireworks population.

[0036] Optionally, calculating the objective function value for each spark includes:

[0037] Calculate the objective function value according to formulas (3) to (5).

[0038]

[0039] [C n ] = [K fn ][P n [W] ln ],(4)

[0040] x∈Ω,(5)

[0041] Where f(x) is the objective function, C i Let n be the fault loss load of the i-th branch, and n be the number of branches. n [C] represents the fault loss load.i The vector representation of [K] fn [P] is the equivalent fault coefficient matrix. n [W] represents the load loss state matrix. ln ] is the equivalent load vector, x is the protection topology matrix, and Ω is the variable space of the protection topology matrix.

[0042] Optionally, determining whether the preset termination condition is met includes:

[0043] Determine whether the objective function value of the optimal solution in this iteration is the same as the objective function value of the optimal solution in the previous iteration;

[0044] If the objective function value of the optimal solution in this iteration is the same as the objective function value of the optimal solution in the previous iteration, then the termination condition is determined to be met; and / or

[0045] Determine whether the current iteration count has reached a preset threshold;

[0046] If the current number of attempts reaches a preset threshold, the termination condition is determined to be met.

[0047] Optionally, a population of explosive fireworks can be generated based on the blast radius and the number of sparks, including:

[0048] The explosion radius is calculated according to formula (6).

[0049]

[0050] Among them, R i For the i-th spark x i The explosion radius, R` is the adjustment coefficient of the explosion radius, f(x) i (for spark x) i The objective function value, Y min Let N be the minimum value of the objective function in the fireworks population, and N be the number of sparks contained in the fireworks population.

[0051] The number of sparks is calculated according to formula (7).

[0052]

[0053] Among them, S i For the i-th spark x i The number of sparks produced by the explosion, S' is an adjustment coefficient for the number of sparks, Y max This represents the maximum value of the objective function in the aforementioned fireworks population.

[0054] Optionally, multiple sparks are randomly selected from the fireworks population to perform a Gaussian mutation operation to obtain a mutated fireworks population, including:

[0055] Select the plurality of sparks according to formulas (8) to (10).

[0056]

[0057]

[0058] d(x i -x j )=∑((ir-jr) 2 +(ic-jc) 2 (10)

[0059] Where p(x) i To select spark x i The probability, R(x) i (for spark x) i The sum of distances to the remaining sparks in spark population K, R(x) j (for spark x) j The sum of distances to the remaining sparks in spark population K, where ir and ic represent the distances to spark x. i The row and column indices of the corresponding all-one matrix, where jr and jc are the spark x. j The row and column number of the r-th row and c-th column in the corresponding all-one matrix;

[0060] A random variation factor is generated, wherein the variation factor represents the mean value. The Gaussian distribution with variance of 1 and length of 0 is the number of columns of the spark;

[0061] Randomly select one row of elements from the spark, and randomly select probability ρ from the mutation factors. i and the value of the independent variable ε i ε is randomly selected from the elements in the chosen row. i Each assignable element is determined by probability ρ. i The probability is reversed.

[0062] Optionally, selecting a new fireworks group from the aforementioned fireworks groups, explosive fireworks groups, and mutated fireworks groups includes:

[0063] The spark with the smallest objective function value among the aforementioned fireworks group, explosive fireworks group, and mutated fireworks group is added to a new fireworks group;

[0064] Using a roulette wheel method, sparks are selected from the firework population, explosive firework population, and mutated firework population to be added to a new firework population, until the number of sparks in the new firework population is the same as the number of sparks in the firework population of the previous iteration.

[0065] Through the above technical solution, the adaptive configuration method for distribution network protection devices based on the fireworks algorithm provided by the present invention improves the fireworks algorithm itself and combines the data processing characteristics of the fireworks algorithm to obtain the optimal configuration scheme for distribution network protection devices, and finally completes the efficient configuration of the on / off status of each circuit breaker in the distribution network.

[0066] Other features and advantages of the embodiments of the present invention will be described in detail in the following detailed description section. Attached Figure Description

[0067] The accompanying drawings are provided to further illustrate embodiments of the present invention and form part of the specification. They are used together with the following detailed description to explain the embodiments of the present invention, but do not constitute a limitation thereof. In the drawings:

[0068] Figure 1 This is a flowchart of an adaptive configuration method for distribution network protection devices based on the fireworks algorithm according to an embodiment of the present invention;

[0069] Figure 2 This is an example diagram of the circuit breaker distribution in a power distribution network according to an embodiment of the present invention.

[0070] Figure 3 This is a flowchart illustrating a simplified process for operating circuit breakers in a power distribution network according to one embodiment of the present invention.

[0071] Figure 4 This is a simplified example diagram of the hierarchical relationship of circuit breakers in a power distribution network according to one embodiment of the present invention;

[0072] Figure 5 This is a simplified example diagram of the hierarchical relationship of circuit breakers in a power distribution network according to one embodiment of the present invention;

[0073] Figure 6 This is a flowchart of a method for generating a protected topology matrix according to an embodiment of the present invention;

[0074] Figure 7 This is a flowchart of a fireworks algorithm according to one embodiment of the present invention;

[0075] Figure 8 This is a flowchart of a method for generating a fireworks population according to one embodiment of the present invention;

[0076] Figure 9 This is a flowchart of a Gaussian mutation operation performed on multiple sparks randomly selected from a fireworks population according to an embodiment of the present invention. Detailed Implementation

[0077] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for illustration and explanation only and are not intended to limit the scope of the present invention.

[0078] like Figure 1 The diagram shows a flowchart of an adaptive configuration method for distribution network protection devices based on a fireworks algorithm, according to an embodiment of the present invention. Figure 1 In this context, the method may include:

[0079] In step S10, the status of circuit breakers at the distribution network site is obtained;

[0080] In step S11, a protection topology matrix is ​​generated based on the circuit breaker status;

[0081] In step S12, the Fireworks Algorithm is used to generate the optimal protection configuration strategy based on the protection topology matrix.

[0082] In Figure 1 In this process, step S10 can be used to obtain the status of circuit breakers at the distribution network site. The distribution of circuit breakers at the distribution network site can be as follows: Figure 2 As shown. In this Figure 2 In this context, the closer the circuit breaker is to the main line, the higher its protection level; conversely, the further away it is, the lower its protection level. Step S11 can be used to generate a protection topology matrix based on the circuit breaker status. Before generating this protection topology matrix, it is necessary to simplify each circuit breaker in the distribution network. Specifically, this simplification process may include, for example: Figure 3 The steps shown are described. Figure 3 In this process, the simplification process may include:

[0083] In step S20, each line is traversed, and the circuit breaker in the open state is taken as the break point. The lines after the break point are not included in the protection topology matrix, and the circuit breaker in the closed state is taken as the conductor with a length of 0.

[0084] In step S21, when the circuit breaker includes only one downstream circuit breaker and there is no transformer within the protection range, the downstream circuit breaker is treated as a conductor with a length of 0.

[0085] In step S22, the topology is traversed from all the final circuit breakers in the positive direction, and the length of the lines passed through, the type of the lines, the rated capacity of the transformers, the number of transformers, the number of users of the transformers, and the load level of the transformers are recorded.

[0086] In step S23, the lines between circuit breakers with hierarchical relationships are merged into a branch, the equivalent fault factor and equivalent load of the branch are calculated, and the merged lower-level circuit breaker is used as the first circuit breaker of each branch.

[0087] Step S20 can be used to remove circuit breakers in the distribution network that will not affect the configuration scheme. For example, for a circuit breaker in the open state, all subsequent circuit breakers, regardless of their on / off status, will not affect the overall load since the preceding circuit breaker is in the open state. Therefore, circuit breakers in the open state (including but not limited to non-intelligent circuit breakers, disconnectors, load switches, fuses, etc.) can be used as breakpoints, and the lines after the breakpoints are not included in the protection topology matrix. Conversely, if this circuit breaker is in the closed state, the on / off status of subsequent circuit breakers will affect the overall configuration scheme, so this circuit breaker needs to be used as a conductor with a length of 0. Similarly, in step S21, if the circuit breaker includes only one downstream circuit breaker and there is no transformer within the protection range, the downstream circuit breaker can also be used as a conductor with a length of 0. Steps S22 and S23 are mainly used to calculate the fault loss load of the branch. After steps 20 to S23, the generated simplified circuit diagram can be as follows: Figure 4 or Figure 5 As shown.

[0088] While there are various ways known to those skilled in the art to generate the specific form of the protective topology matrix, in a preferred embodiment of the present invention, the method for generating the protective topology may include, for example: Figure 6 The steps shown are described. Figure 6 In this context, the method may include:

[0089] In step S30, the number 0 is used to represent the circuit breaker's deactivated state, and the number 1 is used to represent the circuit breaker's activated state.

[0090] In step S31, the protection level of the circuit breaker is used as the row of the protection topology matrix, and the branch of the circuit breaker is used as the column of the protection topology matrix.

[0091] In addition, to ensure that the number of elements in each row and column of the protection topology matrix is ​​the same, a fixed element needs to be added to the matrix. This fixed element has an unchanged value and can be represented by 0.

[0092] In passing through this Figure 6 The protection topology matrix constructed by the method shown in the figure has the following structure: the elements in the first column and first row can represent circuit breakers 13; circuit breakers D10977 and 10496 can be inserted sequentially from left to right in the second column; and the child circuit breakers of circuit breakers D10977 and 10496 can be inserted sequentially from left to right in the third column, prioritizing child circuit breakers without grandchild circuit breakers, and so on until all rows have been traversed.

[0093] In this protection topology matrix, elements whose values ​​can change are marked as elements with values. Based on this, taking any element in the protection topology matrix as an example, searching left from the position in the same column above the row containing the circuit breaker corresponding to that element, the first circuit breaker corresponding to the first "element with value" is the parent circuit breaker (the one above the current circuit breaker). Let a certain circuit breaker B... n Let row number 'a' and column number 'b'. Starting from row 'a' and column 'b', search to the right, recording the column number 'c' of the first "element with value". The elements from row 'a' to the last row, and from column 'b' to column 'c', form the structure matrix [B]. n ]′, denoted as B n The "substructure matrix" of a circuit breaker.

[0094] Step S12 may involve using a fireworks algorithm to generate an optimal protection configuration strategy based on the protection topology matrix. While the specific steps of this fireworks algorithm can be varied and known to those skilled in the art, it is difficult to obtain the optimal protection configuration strategy using traditional fireworks algorithms without modifications to the constructed protection topology matrix. Therefore, in a preferred embodiment of this invention, the fireworks algorithm may include, for example... Figure 7 The steps shown are described. Figure 7 In this context, the fireworks algorithm may include:

[0095] In step S40, multiple protection topology matrices are randomly generated as the initial fireworks population. Each fireworks population includes multiple sparks, and each spark corresponds to a protection topology matrix.

[0096] In step S41, the objective function value for each spark is calculated.

[0097] In step S42, the spark with the smallest objective function value is selected as the optimal solution;

[0098] In step S43, it is determined whether the preset termination condition is met.

[0099] In step S44, if the termination condition is not met, a population of explosive fireworks is generated based on the explosion radius and the number of sparks.

[0100] In step S45, multiple sparks are randomly selected from the fireworks population and subjected to Gaussian mutation to obtain a mutated fireworks population.

[0101] In step S46, a new fireworks group is selected from the fireworks group, the explosive fireworks group, and the mutated fireworks group, and the process returns to the step of calculating the objective function value of each spark.

[0102] In step S47, if the termination condition is met, the spark with the smallest objective function value is adopted as the optimal protection configuration strategy.

[0103] In such Figure 7 In the method shown, step S40 can be used to generate an initial fireworks population. This fireworks population can include multiple sparks, each of which can represent a protective topology matrix. While the specific method for generating this fireworks population can take many forms known to those skilled in the art, considering the element characteristics of the protective topology matrix constructed in this invention, the method for generating the fireworks population can include, for example... Figure 8 The steps shown are described. Figure 8 In this context, the method may include:

[0104] In step S50, starting from the second row of the protected topology matrix, each element is traversed to determine whether the element satisfies formula (1).

[0105] n pl =n pmax -n pu >0, (1)

[0106] Where, n pl Let n be the number of remaining protection levels for the element. pmax To protect the upper limit of the level, n pu The number of protection levels already occupied by the parent element of the current element;

[0107] In step S51, if the element satisfies formula (1), then it is determined whether the element satisfies formula (2).

[0108] f(B n )>n pl (2)

[0109] Where, f(B) n To protect element B in the topology matrix n The corresponding substructure matrix [B n ]′ number of lines;

[0110] In step S52, if an element satisfies formula (2), the element is marked as an assignable element;

[0111] In step S53, if the element does not satisfy formula (2), the substructure matrix [B] is... n Each element in ]′ is assigned the value 1;

[0112] In step S54, if the element does not satisfy formula (1), the substructure matrix [B] is... n Each element in ]′ is assigned the value 0;

[0113] In step S55, each assignable element is randomly assigned a value of 0 or 1 to generate multiple sparks to form a fireworks population.

[0114] In addition, in Figure 8 Since the generated protection topology matrix requires corresponding circuit breakers in the actual power distribution site, all elements mentioned therein should be elements with values.

[0115] Step S41 can be used to evaluate each protection topology matrix, thereby determining the merits of each protection topology matrix. Specifically, in this... Figure 7 In this context, the evaluation can be performed by calculating the value of the objective function. While the specific form of this objective function can be varied and known to those skilled in the art, considering that the ultimate goal of optimizing the distribution network is to reduce the load loss due to faults along the entire line, in a preferred embodiment of this invention, the objective function can be one of the following formulas (3) to (5).

[0116]

[0117] [C n ] = [K fn ][P n [W] ln ],(4)

[0118] x∈Ω,(5)

[0119] Where f(x) is the objective function, C i Let n be the fault loss load of the i-th branch, and n be the number of branches. n [C] represents the fault loss load. i The vector representation of [K] fn [P] is the equivalent fault coefficient matrix. n [W] represents the load loss state matrix. ln ] is the equivalent load vector, x is the protection topology matrix, and Ω is the variable space of the protection topology matrix.

[0120] Furthermore, for ease of calculation, the equivalent fault coefficient matrix [K] fn It can be in the form of formula (6),

[0121]

[0122] Furthermore, the equivalent fault coefficient matrix [K] fn The value of ] can be calculated using formula (7).

[0123] K fn =∑k gtl k gelk gml l l +∑k gtj k gej k gm jl j +∑k gtd k ged k gmd l d (7)

[0124] Among them, K fn k is the equivalent fault coefficient. gtl k gtj k gtd These are the influence coefficients for the service life of overhead bare conductors, overhead insulated wires, and cable lines on each branch; k gel k gej k ged These represent the environmental impact coefficients for bare overhead conductors, insulated overhead conductors, and cable lines on each branch; k gml k gmj k gmd The annual fault rate per kilometer for each branch line, including bare overhead conductors, insulated overhead wires, and cable lines; l l j l d These refer to the lengths of each section of overhead bare conductors, overhead insulated conductors, and cable lines on each branch.

[0125] The equivalent load vector [W] ln This can be expressed as formulas (8) and (9).

[0126] [W ln ] = [W l1 W l2 W l3 …W l27 ],(8)

[0127]

[0128] Among them, W ln S represents the equivalent load on each branch; N k tr k ts These are the rated capacity, load level coefficient, and load simultaneity rate of each transformer on the current branch.

[0129] Load loss state matrix [P] n The generation and method of ] can be represented as follows: First, when calculating the value of each row, find the circuit breaker corresponding to this row in the protection topology matrix [B n The value in ] is used. When the value is 1, the circuit breaker "substructure matrix" [B nAssign the value 1 to all elements in ]′ and the value 0 to all other elements, and fill these values ​​into [P]. n The corresponding position in this row. Conversely, when the value is 0, find the "parent circuit breaker" of the circuit breaker. If the value is 0, continue searching in the parent circuit breaker until a parent circuit breaker with a value of 1 is found. Then, the substructure matrix of the parent circuit breaker [B] is set. n All elements in ]′ are assigned the value 1, and all other elements are assigned the value 0. Finally, these values ​​are filled into [P]. n [This is the corresponding position in this line.]

[0130] Step S42 can be used to determine the optimal solution for the current spark (i.e., the protection topology matrix). If step S43 determines that the termination condition is met, the spark with the smallest objective function value can be directly used as the optimal protection configuration strategy output. However, if step S43 determines that the termination condition is not met, it means that the optimal solution has not yet been obtained or the obtained optimal solution cannot meet the control requirements. Therefore, the spark can be updated through steps S44 to S46.

[0131] While there are various methods known to those skilled in the art for determining whether the termination condition is met in step S43, considering the characteristic that the optimal solution changes with the number of iterations during the iteration process, in one example of the present invention, step S43 may, for example, first determine whether the objective function value of the optimal solution in the current iteration is the same as the objective function value of the optimal solution in the previous iteration; then, if the objective function value of the optimal solution in the current iteration is the same as the objective function value of the optimal solution in the previous iteration, determine that the termination condition is met. Otherwise, it indicates that the termination condition is not met. In another example of the present invention, step S43 may also be to determine whether the current number of iterations has reached a preset threshold; if the current number of iterations has reached the preset threshold, determine that the termination condition is met. Otherwise, it indicates that the termination condition is not met. In yet another example of the present invention, the termination condition may first determine whether the objective function value of the optimal solution in the current iteration is the same as the objective function value of the optimal solution in the previous iteration; then, if the objective function value of the optimal solution in the current iteration is the same as the objective function value of the optimal solution in the previous iteration, further determine whether the current number of iterations has reached a preset threshold; finally, if the current number of iterations has reached the preset threshold, determine that the termination condition is met. If either of the two judgments fails to meet the condition, it means that the termination condition is not met.

[0132] Steps S44 to S46 can be used to update the sparks. While the specific method of this update process can be varied and known to those skilled in the art, in a preferred embodiment of the invention, step S44 can involve calculating the explosion radius according to formula (10) and simultaneously calculating the number of sparks according to formula (11).

[0133]

[0134] Among them, R i For the i-th spark x i The explosion radius, R' is the adjustment coefficient for the explosion radius, f(x) i (for spark x) i The objective function value, Y min Let N be the minimum value of the objective function in the fireworks population, and N be the number of sparks contained in the fireworks population.

[0135]

[0136] Among them, S i For the i-th spark x i The number of sparks produced by the explosion, S' is the adjustment coefficient for the number of sparks, Y max This represents the maximum value of the objective function in the fireworks population.

[0137] Step S45 may include, for example: Figure 9 The steps shown are described. Figure 9 In this context, step S45 may include:

[0138] In step S60, multiple sparks are selected according to formulas (12) to (14).

[0139]

[0140]

[0141] d(x i -x j )=∑((ir-jr) 2 +(ic-jc) 2 (14)

[0142] Where p(x) i To select spark x i The probability, R(x) i (for spark x) i The sum of distances to the remaining sparks in spark population K, R(x) j (for spark x) j The sum of distances to the remaining sparks in spark population K, where ir and ic represent the distances to spark x. i The row and column indices of the corresponding all-one matrix, where jr and jc are the spark x. j The row and column index of the r-th row and c-th column in the corresponding all-one matrix. This all-one matrix can be obtained by using Spark x. iThe corresponding protection topology matrix is ​​obtained by removing element 0, retaining element 1 and its corresponding row and column numbers, and then rearranging them in order.

[0143] In step S61, a variation factor is randomly generated. Here, the variation factor represents the mean value. A Gaussian distribution with variance of 1 and length 0 is the number of columns of sparks, i.e.: e ~ N(n l / 2,1),N(1,1);

[0144] In step S62, a row of elements is randomly selected from the spark, and a probability ρ is randomly selected from the mutation factors. i and the value of the independent variable ε i ε is randomly selected from the elements in the chosen row. i Each assignable element is determined by probability ρ. i The probability is reversed.

[0145] Step S46 can be used to update the fireworks population. Specifically, the fireworks population can be updated by first adding the spark with the smallest objective function value from the fireworks population, explosive fireworks population, and mutated fireworks population to the new fireworks population, thereby ensuring that the new fireworks population includes at least the optimal solution and reducing the number of iterations. At the same time, in order to ensure that the number of fireworks in the new fireworks population is consistent with the number of fireworks in the old fireworks population, a roulette wheel method can be further used to select sparks from the fireworks population, explosive fireworks population, and mutated fireworks population to add to the new fireworks population until the number of sparks in the new fireworks population is the same as the number of sparks in the fireworks population of the previous iteration.

[0146] Through the above technical solution, the adaptive configuration method for distribution network protection devices based on the fireworks algorithm provided by the present invention improves the fireworks algorithm itself and combines the data processing characteristics of the fireworks algorithm to obtain the optimal configuration scheme for distribution network protection devices, and finally completes the efficient configuration of the on / off status of each circuit breaker in the distribution network.

[0147] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0148] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0149] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0150] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0151] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0152] Memory may include non-persistent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0153] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0154] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0155] The above are merely embodiments of this application and are not intended to limit the scope of this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of the claims of this application.

Claims

1. A power distribution network protection device adaptive configuration method based on the fireworks algorithm, characterized in that, The method includes: Obtain the status of circuit breakers in the power distribution network; Generate a protection topology matrix based on the circuit breaker status; The firework algorithm is used to generate the optimal protection configuration strategy based on the protection topology matrix; The firework algorithm generates the optimal protection configuration strategy based on the protection topology matrix, including: Multiple protective topology matrices are randomly generated as initial fireworks populations, wherein the fireworks populations include multiple sparks, and each spark corresponds to a protective topology matrix; Calculate the objective function value for each spark at the present time; The spark with the smallest objective function value is selected as the optimal solution; Determine whether the preset termination condition is met; If the termination condition is not met, a population of explosive fireworks is generated based on the explosion radius and the number of sparks. Randomly select multiple sparks from the aforementioned fireworks population and perform Gaussian mutation operations to obtain a mutated fireworks population; Select a new fireworks group from the fireworks group, explosive fireworks group, and mutated fireworks group, and return to the step of calculating the objective function value of each current spark; If the termination condition is met, the spark with the minimum objective function value is adopted as the optimal protection configuration strategy. Calculating the objective function value for each spark includes: Calculate the objective function value according to formulas (3) to (5). ,(3) ,(4) ,(5) in, Let be the objective function. For the first The fault loss load of each branch, For the number of branch roads, For fault loss load The vector representation of , This is the equivalent fault coefficient matrix. This is the load loss state matrix. For the equivalent load vector, To protect the topological structure matrix, This is the variable space of the protected topology matrix.

2. The method according to claim 1, characterized in that, Generating a protection topology matrix based on the circuit breaker status includes: Traverse each line, take the circuit breaker in the open state as the break point, and do not include the line after the break point in the protection topology matrix. Take the circuit breaker in the closed state as the conductor with a length of 0. When the circuit breaker includes only one downstream circuit breaker and there is no transformer within the protection range, the downstream circuit breaker is used as a conductor with a length of 0. Traverse the topology in the positive direction from all the final circuit breakers, recording the length of the lines passed through, the type of the lines, the rated capacity of the transformers, the number of transformers, the number of users of the transformers, and the load level of the transformers. The lines between circuit breakers with hierarchical relationships are merged into a single branch. The equivalent fault factor and equivalent load of the branch are calculated, and the merged lower-level circuit breaker is used as the first circuit breaker of each branch.

3. The method of claim 2, wherein, Generating a protection topology matrix based on the circuit breaker status includes: The circuit breaker is represented by the number 0, and the circuit breaker is represented by the number 1, which indicates the circuit breaker is in operation. The protection level of the circuit breaker is used as the row of the protection topology matrix, and the branch of the circuit breaker is used as the column of the protection topology matrix.

4. The method according to claim 1, characterized in that, Multiple protection topology matrices are randomly generated to serve as the initial fireworks population, including: Starting from the second row of the protection topology matrix, traverse each element and determine whether the element satisfies formula (1). ,(1) in, The remaining protection level for the element is [number]. To protect the upper limit of the level, The number of protection levels already occupied by the parent element of the current element; If the element satisfies formula (1), then determine whether the element satisfies formula (2). ,(2) in, To protect the elements in the topology matrix Corresponding substructure matrix number of rows; If the element satisfies formula (2), the element is marked as an assignable element; If the element does not satisfy formula (2), the substructure matrix will be... Each element in the file is assigned the value 1; If the element does not satisfy formula (1), the substructure matrix will be... Each element in the file is assigned the value 0; Each of the assignable elements is randomly assigned a value of 0 or 1 to generate multiple sparks, thus forming the fireworks population.

5. The method of claim 1, wherein, Determining whether the preset termination conditions are met includes: Determine whether the objective function value of the optimal solution in this iteration is the same as the objective function value of the optimal solution in the previous iteration; If the objective function value of the optimal solution in this iteration is the same as the objective function value of the optimal solution in the previous iteration, then the termination condition is determined to be met; and / or Determine whether the current iteration count has reached a preset threshold; If the current number of attempts reaches a preset threshold, the termination condition is determined to be met.

6. The method according to claim 1, characterized in that, Based on the blast radius and the number of sparks, the following types of explosive fireworks are generated: The explosion radius is calculated according to formula (6). ,(6) in, For the first A spark Explosion radius, This is the adjustment coefficient for the explosion radius. For sparks The objective function value, The minimum value of the objective function in the aforementioned fireworks population. The number of sparks contained in the aforementioned fireworks species; The number of sparks is calculated according to formula (7). ,(7) in, For the first A spark The number of sparks produced by the explosion. This is the adjustment coefficient for the number of sparks. This represents the maximum value of the objective function in the aforementioned fireworks population.

7. The method of claim 1, wherein, Randomly select multiple sparks from the aforementioned fireworks population and perform Gaussian mutation operations to obtain a mutated fireworks population, including: Select the plurality of sparks according to formulas (8) to (10). ,(8) ,(9) ,(10) in, To select spark The probability, For sparks To the fireworks group The sum of the distances of the remaining sparks, For sparks To the fireworks group The sum of the distances of the remaining sparks, , For sparks The first one in the corresponding all-one matrix Line number The row and column numbers of the column. , For sparks The first one in the corresponding all-one matrix Line number The row and column number of the column; A random variation factor is generated, wherein the variation factor represents the mean value. The distribution is a Gaussian distribution with a variance of 1 and a length of 0, which is the number of columns of the spark. Randomly select one row of elements from the spark, and randomly select a probability from the mutation factors. and independent variable values Randomly select elements from the chosen row. Each assignable element is determined by probability. The probability is reversed.

8. The method according to claim 1, characterized in that, Selecting new fireworks groups from the aforementioned fireworks groups, explosive fireworks groups, and mutated fireworks groups includes: The spark with the smallest objective function value among the aforementioned fireworks group, explosive fireworks group, and mutated fireworks group is added to a new fireworks group; Using a roulette wheel method, sparks are selected from the firework population, explosive firework population, and mutated firework population to be added to a new firework population, until the number of sparks in the new firework population is the same as the number of sparks in the firework population of the previous iteration.

Citation Information

Patent Citations

  • Regional protection correlation domain online calculation system and method for power distribution network

    CN105977932A

  • Simulation method of disconnecting knife in power grid topology

    CN110233481A

  • Optimization method for improving elasticity of scale-free network

    CN111523636A