Distribution network dynamic reconstruction method and device based on heuristic rules

Abstract

The present application proposes a method and device for dynamic reconstruction of a distribution network based on heuristic rules, wherein the method includes: performing static reconstruction of the distribution network based on load data of each initial time period to obtain the switch state and network loss of each initial time period; merging adjacent initial time periods with the same switch state, and when the number of operations of each switch in each time period and the total number of switch operations do not meet the switch operation number constraint, for each time period, calculating the total switch operation number reduction before and after the assignment of the switch state of the time period to its adjacent time period, and the ratio of the network loss increase to the total switch operation number reduction; determining the target time period and the target adjacent time period based on the total switch operation number reduction before and after the assignment of each adjacent time period and the ratio of the network loss increase to the total switch operation number reduction of all time periods; and assigning the switch state of the target time period to the target adjacent time period, thereby improving the reliability of the dynamic reconstruction of the distribution network.

Description

Technical Field

[0001] The present application relates to the technical field of distribution network reconstruction, and in particular to a method and device for dynamic reconstruction of a distribution network based on heuristic rules. Background Art

[0002] Dynamic reconfiguration of a distribution network involves changing the opening and closing states of individual switches within the permitted range of switch actions under varying load conditions within a reconfiguration cycle, thereby altering the network structure to minimize network losses and improve the economic efficiency of distribution network operation. While static reconfiguration methods based on time slices are currently well established, dynamic reconfiguration, which is challenging due to the limited number of switch actions allocated to achieve the desired objective, remains an area of ​​ongoing research. Therefore, developing an efficient and reliable dynamic reconfiguration method based on static reconfiguration would be of great theoretical and practical significance.

[0003] In research on dynamic reconstruction based on static reconstruction results, existing methods only consider minimizing the incremental network loss after merging the switch state assignments of adjacent time periods when reducing the number of over-limit switch operations. After performing switch state assignments one after another, the switch operation periods are reduced to ultimately meet the switch constraints. The disadvantage of this method is that it only uses the minimum incremental network loss after merging the switch state assignments of adjacent time periods as the basis for dynamic coupling of switch states in each time period, which cannot ensure the optimal final result. Under the same conditions of reducing the number of switch operations, the incremental network loss will be large, that is, this method cannot ensure the optimal allocation of a limited number of switch operations. It is also possible that after the switch state assignments of adjacent time periods, the number of switch operations remains unchanged, resulting in low overall computational efficiency. Furthermore, it may result in low switch utilization. Summary of the Invention

[0004] The present application aims to solve one of the technical problems in the related art at least to a certain extent.

[0005] To this end, the first purpose of this application is to propose a distribution network dynamic reconstruction method based on heuristic rules to improve the reliability of the distribution network dynamic reconstruction.

[0006] The second objective of this application is to propose a distribution network dynamic reconstruction device based on heuristic rules.

[0007] The third objective of this application is to provide an electronic device.

[0008] The fourth object of this application is to provide a computer-readable storage medium.

[0009] A fifth object of this application is to provide a computer program product.

[0010] To achieve the above objectives, the first embodiment of the present application proposes a method for dynamic reconfiguration of a distribution network based on heuristic rules, comprising:

[0011] Based on the load data of each initial period, the distribution network is statically reconstructed to obtain the switch status and network loss of each initial period;

[0012] Merge adjacent initial time periods with the same switch state to obtain multiple time periods after the merger process and the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period;

[0013] If the number of switch operations in each time period and the total number of switch operations do not meet the switch operation number constraint, the following steps are executed cyclically until the loop end condition is met:

[0014] For each time period, after assigning the switch status of the time period to its adjacent time period, calculate the reduction in the total number of switching operations before and after the assignment of the adjacent time periods, and the ratio of the network loss increase to the reduction in the total number of switching operations;

[0015] Based on the obtained reduction in the total number of switch actions before and after the assignment of each adjacent time period of all time periods and the ratio of the network loss increase to the reduction in the total number of switch actions, the target time period and the target adjacent time period are determined; and the switch state of the target time period is assigned to the target adjacent time period to obtain the merged and updated time periods and the switch state of each time period, the number of actions of each switch, the total number of switch actions and network loss.

[0016] To achieve the above objectives, the second embodiment of the present application proposes a distribution network dynamic reconstruction device based on heuristic rules, including:

[0017] A static reconstruction module is used to perform static reconstruction of the distribution network based on the load data of each initial period to obtain the switch status and network loss of each initial period;

[0018] An initial merging module is used to merge adjacent initial time periods with the same switch state to obtain multiple time periods after merging, as well as the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period;

[0019] A loop control module is used to loop through the following steps when the number of actions of each switch in each time period and the total number of switch actions do not satisfy the switch action number constraint until the loop end condition is satisfied: when the number of actions of each switch in each time period and the total number of switch actions do not satisfy the switch action number constraint, for each time period, calculate the reduction in the total number of switch actions before and after the assignment of the switch state of the time period to its adjacent time period, and the ratio of the increase in network loss to the reduction in the total number of switch actions; based on the obtained reduction in the total number of switch actions before and after the assignment of each adjacent time period and the increase in network loss to the reduction in the total number of switch actions of all time periods, determine the target time period and the target adjacent time period; and assign the switch state of the target time period to the target adjacent time period to obtain the merged and updated time periods and the switch state, the number of actions of each switch, the total number of switch actions and the network loss of each time period.

[0020] To achieve the above-mentioned purpose, the third aspect embodiment of the present application proposes an electronic device, comprising: a processor, and a memory communicatively connected to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the method described in the first aspect.

[0021] To achieve the above-mentioned purpose, the fourth embodiment of the present application proposes a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the method described in the first aspect.

[0022] To achieve the above-mentioned purpose, the fifth embodiment of the present application proposes a computer program product, including a computer program, which implements the method described in the first aspect when executed by a processor.

[0023] The heuristic rule-based distribution network dynamic reconstruction method and device provided in the present application calculate the network loss increment before and after the switch state assignment of adjacent time periods, the reduction in the total number of switch operations, and the ratio of the network loss increment to the reduction in the total number of switch operations based on the static reconstruction results of each time period. The ratio represents the network loss increment caused by the reduction of a single switch operation. The present scheme merges the switch states of adjacent time periods based on the calculated ratio, reduces the number of time periods for switch operations, and realizes the reduction in the number of switch operations. This can ensure that the network loss increment caused by the reduction of a single switch operation is optimal, and solves the problem that the existing method cannot achieve optimal allocation under a limited number of switch operations.

[0024] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0026] Figure 1 A schematic diagram of a flow chart of a method for dynamic reconfiguration of a distribution network based on heuristic rules provided in an embodiment of the present application;

[0027] Figure 2 A flowchart of a method for dynamic reconfiguration of a distribution network based on heuristic rules provided in an example of this application;

[0028] Figure 3 A node distribution system network diagram provided for an example of this application;

[0029] Figure 4 A block diagram of a distribution network dynamic reconstruction device based on heuristic rules provided in an embodiment of the present application;

[0030] Figure 5 A block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0031] The following describes in detail embodiments of the present application, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.

[0032] In order to solve the technical problems existing in the existing distribution network reconstruction, the present application provides a distribution network dynamic reconstruction method and device based on heuristic rules. Under the given number of switch actions, the heuristic rule can reasonably allocate the limited switch actions, with higher calculation efficiency, and can improve the utilization rate of switches and have better optimization capabilities.

[0033] The following describes the method, device and equipment for dynamic reconstruction of a distribution network based on heuristic rules according to an embodiment of the present application with reference to the accompanying drawings.

[0034] Figure 1 A flowchart of a method for dynamic reconstruction of a distribution network based on heuristic rules provided in an embodiment of the present application.

[0035] It should be noted that the executor of the dynamic reconstruction method of the distribution network based on heuristic rules in the embodiment of the present application is the dynamic reconstruction device of the distribution network based on heuristic rules in the embodiment of the present application. The dynamic reconstruction device of the distribution network based on heuristic rules can be configured in an electronic device so that the electronic device can perform the dynamic reconstruction function of the distribution network based on heuristic rules.

[0036] like Figure 1 As shown, the dynamic reconstruction method of the distribution network based on heuristic rules includes the following steps:

[0037] Step S101 : performing static reconstruction of the distribution network based on the load data of each initial period, and obtaining the switch state and network loss of each initial period.

[0038] As an implementation method, based on the load data of each initial period, the distribution network is statically reconstructed through an optimal flow pattern algorithm or an intelligent optimization algorithm to obtain the switch status and network loss of each initial period.

[0039] Step S102 , merging adjacent initial time periods with the same switch state to obtain multiple time periods after merging and the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period.

[0040] After completing the static reconstruction calculation of the distribution network, this embodiment merges adjacent initial time periods with the same switch status to obtain each time period after the merger, as well as the switch status, network loss, number of operations of each switch, and total number of switch operations in each time period.

[0041] Step S103: When the number of operations of each switch in each time period and the total number of switch operations do not satisfy the switch operation number constraint, the following steps are executed in a loop until a loop end condition is satisfied.

[0042] In this embodiment, when the number of operations of each switch in each time period and the total number of switch operations meet the switch operation number constraint, each time period and the disconnected switches and network losses corresponding to each time period are output.

[0043] This embodiment requires performing multiple cycles, and after the cycle end conditions are met, the final distribution network dynamic reconstruction calculation result is obtained.

[0044] Step S104 , for each time period, after the switch state of the time period is assigned to its adjacent time period, the total reduction in the number of switching operations before and after the assignment of each adjacent time period, and the ratio of the network loss increase to the total reduction in the number of switching operations are calculated.

[0045] It should be noted that if there are adjacent periods before and after the period, the parameters of the adjacent periods before and after are calculated; if there is only one adjacent period before and after the period, only the parameters after the adjacent period is calculated. The network loss increment is the network loss before the switch state is assigned minus the network loss after the switch state is assigned. The ratio of the network loss increment to the reduction in the total number of switch operations is the network loss increment caused by the reduction of a single switch operation.

[0046] Step S105: Determine the target period and target adjacent period based on the obtained reduction in the total number of switch actions before and after the assignment of each adjacent period of all time periods and the ratio of the network loss increase to the reduction in the total number of switch actions; and assign the switch status of the target period to the target adjacent period to obtain the merged and updated time periods and the switch status of each period, the number of actions of each switch, the total number of switch actions and network loss.

[0047] As an implementation method, a method for determining a target time period and a target adjacent time period based on the obtained total reduction in the number of switching operations before and after the assignment of values ​​to each adjacent time period of all time periods, as well as the network loss increase and the total reduction in the number of switching operations, includes:

[0048] Obtain the first time period corresponding to the minimum ratio of all network loss increments to total switch operation reductions and the first adjacent time period corresponding to the minimum ratio;

[0049] Calculate the number of times each switch is actuated in each time period and the total number of times each switch is actuated after the switch state of the first time period is assigned to the first adjacent time period;

[0050] Determine whether the combined and updated number of operations of each switch in each time period and the total number of switch operations meet the switch operation number constraint;

[0051] If the number of operations of each switch in each time period after merging and updating and the total number of switch operations do not meet the switch operation number constraint, the first time period is used as the target time period and the first adjacent time period is used as the target adjacent time period;

[0052] When the number of operations of each switch in each time period after the merged update and the total number of switch operations satisfy the switch operation number constraint, determine whether there is a first total switch operation number reduction amount that is smaller than the total switch operation number reduction amount in the first adjacent time period among the total switch operation number reduction amounts before and after the assignment of values ​​in each adjacent time period;

[0053] If there is no first total switching operation number reduction amount smaller than the total switching operation number reduction amount of the first adjacent period in the total switching operation number reduction amounts before and after the assignment of values ​​to each adjacent period, the first period is taken as the target period, and the first adjacent period is taken as the target adjacent period;

[0054] When the number of the first total switch operation times reduction is greater than 1, obtaining a ratio of a network loss increment corresponding to each total switch operation times reduction in the first total switch operation times reduction to the total switch operation times reduction;

[0055] The time period corresponding to the minimum ratio of the network loss increment corresponding to each of the total switch operation number reductions in the first total switch operation number reduction to the total switch operation number reduction is used as the target time period, and the adjacent time period corresponding to the minimum ratio of the network loss increment corresponding to each of the total switch operation number reductions in the first total switch operation number reduction to the total switch operation number reduction is used as the target adjacent time period;

[0056] When the number of the first total switch operation number reduction is equal to 1, the time period corresponding to the first total switch operation number reduction is used as the target time period and the adjacent time period corresponding to the first total switch operation number reduction is used as the target adjacent time period.

[0057] It can be understood that if there is period, each round of calculation of the parameters after the switch state assignment operation will produce Ratios. First determine whether the constraint on the number of switch actions is satisfied by assigning a value according to the minimum of all ratios. If the constraint on the number of switch actions is not satisfied by assigning a value according to the minimum of all ratios, then assign a value according to the minimum of the ratios of the network loss increment corresponding to each total switch action reduction in all first total switch action reductions to the total switch action reduction, update the switch state, and proceed to the next round of calculation. In order to avoid excessive reduction in the number of switch actions, resulting in a low utilization rate of the switch, when the total switch action reduction corresponding to the current minimum ratio is large, if both the single switch action and the total switch action are less than the constraint limit in the switch action restriction, then it is necessary to The algorithm then searches for one or more minimum ratios corresponding to a smaller total reduction in the number of switching operations than the current minimum ratio, and uses these ratios to assign switch states. The key is to maximize the number of switching operations within a given constraint, minimizing network losses and improving system economics.

[0058] Therefore, only one assignment scheme is determined in each cycle, and two time periods are merged. When the minimum ratio is determined to be selected for the switch state assignment operation, the time period with the smallest increase in network loss caused by the reduction of a single switch action is selected for the switch state assignment operation. If the smallest ratio is finally determined to be selected for the switch state assignment operation, it means that when the number of single switch actions and the total number of switch actions after reduction are both less than the given switch action number constraint, it is necessary to find a switch state assignment operation with a slightly smaller reduction in the number of switch actions but the smallest ratio, so as to reduce network loss and improve switch utilization.

[0059] The method for dynamic reconstruction of distribution network based on heuristic rules in the embodiment of the present application calculates the network loss increment before and after the switch state assignment of adjacent time periods, the reduction in the total number of switch actions, and the ratio of the network loss increment to the reduction in the total number of switch actions based on the static reconstruction results of each time period. The ratio represents the network loss increment caused by the reduction of a single switch action. The scheme uses the calculated ratio as a basis to merge the switch states of adjacent time periods, reduce the number of time periods for switch actions, and achieve a reduction in the number of switch actions, which can ensure that the network loss increment caused by the reduction of a single switch action is optimal, and solves the problem that the existing method cannot achieve optimal allocation under a limited number of switch actions; the scheme uses the minimum calculated ratio as a basis to merge the switch states of adjacent time periods, reduce the number of time periods for switch actions, and achieve a reduction in the number of switch actions, which can ensure that the reduction of a single switch action is optimal. The network loss increment caused by the reduction is minimized, which solves the problem that the existing method cannot achieve optimal allocation under a limited number of switch operations; when the switch states of adjacent time periods are merged based on the minimum ratio, if the total number of switch operations is reduced too much, that is, the number of switch operations is too small, resulting in the number of switch operations being less than a given allowable value, the minimum ratio corresponding to the smaller total number of switch operations is found, and the corresponding switch state assignment operation is performed according to the ratio, which solves the problem that the existing method may excessively reduce the number of switch operations, resulting in low switch utilization; through example verification, compared with the existing dynamic reconstruction heuristic method, under the condition of the same number of switch operations constraints, the switch operation number distribution of this scheme within the reconstruction cycle is more reasonable, the total network loss is minimized, and it is of great significance to the economic operation of the power system.

[0060] In order to clearly illustrate the above embodiment, specific examples are now provided for illustration.

[0061] Figure 2 This is a flow chart of a method for dynamic reconfiguration of a distribution network based on heuristic rules provided in an embodiment of the present application. Figure 2 As shown in FIG, the dynamic reconstruction method of the distribution network based on heuristic rules is implemented through the following steps:

[0062] Step S1: for each initial period Perform static reconstruction to obtain the switch status and network loss of each period .

[0063] This example uses Figure 3 Taking the IEEE-33 node system shown in the figure as an example, the optimal flow mode algorithm is used to perform static reconstruction calculation based on load data and network parameters. The total network loss after static reconstruction is 943.389kW.

[0064] Step S2: Based on the switch status of each time period obtained in step S1, if adjacent time periods have the same open and close status, the two time periods are merged and the merged time period is used as Expressed as , is the total number of time periods after merging. According to the network loss in step S1, the total number of time periods can be calculated. The network loss is ; The switch is , is the number of switches, counting switches Number of actions , total number of switching operations , given the switch operation number constraint, including the maximum number of operations allowed for a single switch And the maximum allowable total number of switching operations .

[0065] Table 1: The combined time periods and the disconnected switches (also called open switches) and network losses for this example

[0066]

[0067] The maximum number of operations allowed for a single switch given in this example The maximum number of total switch operations allowed is 3 The statistics of the number of switch actions after the static reconstruction and merging of Table 1 are shown in Table 2. It can be seen that the number of switch actions exceeds the limit, and the total number of switch actions is 60, which seriously exceeds the given maximum allowable total number of switch actions.

[0068] Table 2: Statistics of the number of switch actions after static reconstruction and merging

[0069]

[0070] Step S3, for ,like and , the output disconnects the switch and the entire process ends; otherwise, go to step S4.

[0071] Step S4, set the time period .

[0072] Step S5, calculate if the The switch status of each time period is assigned to the adjacent time period and After that, the adjacent period Network loss under switching state in each period and , and calculate the network loss increment and .

[0073]

[0074] Step S6, respectively calculate the total number of switch actions reduced after the adjacent time periods are assigned and .

[0075]

[0076] Step S7, calculate the network loss increment obtained in step S5 and the total number of switch operations decreased in step S6. The switch status of each period is assigned to and The ratio of the increase in network loss after the period to the reduction in the total number of switching operations (i.e. the increase in network loss caused by the reduction in a single switching operation) and .

[0077]

[0078] Steps S5-S7 calculate the network loss increment after the switch status of adjacent time periods in each time period of this round is assigned based on the proposed heuristic rules. , Reduction in total number of switch operations And the ratio of the increase in network loss to the reduction in the total number of switching operations Due to space limitations, Tables 3 and 4 give the results from the first round of cycles. 、 as well as , the calculation process of other cycles is similar.

[0079] Table 3: Increase in network loss and reduction in total number of switching operations after the switch status is assigned in adjacent periods of the first cycle

[0080]

[0081] Table 4: Ratio of switch status assignments in adjacent time periods in the first cycle

[0082]

[0083] Step S8, if ,make , go to step S5.

[0084] Step S9, for , in all the obtained and Select the minimum value, that is, if the period corresponding to the minimum value is And the corresponding assignment to period, it will be preliminarily determined The switch state is assigned to Time period; if the time period corresponding to the minimum value is And the corresponding assignment to period, it will be preliminarily determined The switch state is assigned to Time period.

[0085] Step S10, update and ,like and , go to step S11; if or , then perform the assignment operation of this round according to the assignment scheme preliminarily determined in step S9 and update each time period after the assignment as well as the switch status, network loss, etc. of each time period, and go to step S12.

[0086] Step S11, based on the calculation result of step S6, obtain the switch state assignment scheme corresponding to the current step S9 Small all Corresponding , and select smallest Determine the final assignment scheme for this round, perform assignment operations and update switch status according to the final assignment scheme for this round, and return to step S10; if there is no , the output disconnects the switch and the entire process ends.

[0087] Step S12, set the time period , turn to step S5 to recalculate the network loss of each period ,wait.

[0088] The calculation results of multiple cycles in this example are shown in Table 5, the final dynamic reconstruction scheme is shown in Table 6, and the statistics of the number of switch operations are shown in Table 7.

[0089] Table 5: Calculation results of multiple cycles

[0090]

[0091] Table 6: Final dynamic reconstruction solution

[0092]

[0093] Table 7: Statistics of the number of times each switch operates

[0094]

[0095] In order to demonstrate the dynamic optimization capability of the method of this application, the calculation process of reducing actions by only considering the minimum network loss increment is given below, see Table 8, the resulting dynamic reconstruction scheme is shown in Table 9, and the statistics of the number of actions of each switch are shown in Table 10.

[0096] Table 8: Calculation process for action reduction considering only the minimum increase in network loss

[0097]

[0098] Table 9: Dynamic reconstruction scheme obtained by taking only the smallest increment of network loss into consideration

[0099]

[0100] Table 10: Statistics of the number of times each switch operates

[0101]

[0102] The dynamic reconstruction method of the distribution network that only considers the minimum network loss increment for action reduction is compared with the method of this application. The distribution statistics of the switch actions of the two methods are shown in Table 11.

[0103] Table 11: Distribution statistics of switch actions for the two methods

[0104]

[0105] As can be seen from Tables 5 and 8, the method proposed in this application considers both the total reduction in the number of switching operations and the ratio of the network loss increment to the total reduction in the number of switching operations during the process of reducing the number of switching operations, and uses the minimum ratio as the criterion for performing the switch state assignment operation in adjacent time periods. The entire dynamic process is repeated 11 times, while 13 times are repeated when only the network loss increment is considered. This is because the number of switching operations is reduced by minimizing the ratio of the network loss increment to the total reduction in the number of switching operations, which makes the reduction of the number of switching operations faster and more efficient. In the processing of the number of switching operations exceeding the limit, this method uses the minimum network loss increment caused by the reduction of a single switching operation as the criterion. Ultimately, under the condition of reducing the same number of switching operations, the total network loss of the dynamic reconstruction solution obtained by this method is 960.968kW, which is 1.3% lower than the total network loss of 973.504kW obtained by the method that does not consider the reduction in the total number of switching operations. Therefore, the optimization effect of the method of this application is better.

[0106] Tables 6 and 9 show that the reconstruction scheme using the proposed method distributes switch actions across four time points. This is more dispersed than the switch distribution across three time periods obtained by only considering network loss increments, better matching the load variation characteristics. Consequently, the proposed method achieves lower total network loss. Table 11 shows that the switch numbers for the actions obtained by the two methods are the same, but the action times and number of actions differ. Ultimately, the former method achieves the lowest total network loss because it more rationally distributes switch actions.

[0107] In summary, the present application utilizes heuristic rules and the results of static reconstruction of the distribution network to reduce the number of switch actions, and merges the switch states of adjacent time periods based on the minimum ratio of the network loss increment after the switch state assignment in adjacent time periods to the total reduction in the number of switch actions; in the judgment of the switch state merging, the network loss increment and the change in the number of switch actions are considered at the same time, thereby improving the efficiency of reducing the number of switch actions; when a certain number of switch actions are reduced, the switch action distribution of the obtained scheme is more reasonable; when the number of switch actions is reduced too much, that is, the switch utilization rate is low, this scheme obtains a total reduction in the number of switch actions that is smaller than the current reduction in the number of total switch actions, and similarly merges the switch states of adjacent time periods based on the minimum increase in network loss under the current reduction in the number of switch actions, thereby improving the switch utilization rate and reducing the total network loss.

[0108] In order to implement the above embodiments, the present application also proposes a distribution network dynamic reconstruction device based on heuristic rules. Figure 4 This is a block diagram of a device for dynamic reconfiguration of a distribution network based on heuristic rules provided in an embodiment of the present application. Figure 4 As shown, the heuristic rule-based distribution network dynamic reconstruction device may include: a static reconstruction module 401 , an initial merging module 402 and a cycle control module 403 .

[0109] The static reconstruction module 401 is used to perform static reconstruction of the distribution network based on the load data of each initial period, and obtain the switch state and network loss of each initial period;

[0110] Initial merging module 402, configured to merge adjacent initial time periods with the same switch state to obtain multiple time periods after merging, as well as the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period;

[0111] The loop control module 403 is used to loop through the following steps when the number of actions of each switch in each time period and the total number of switch actions do not satisfy the switch action number constraint until the loop end condition is satisfied: when the number of actions of each switch in each time period and the total number of switch actions do not satisfy the switch action number constraint, for each time period, calculate the reduction in the total number of switch actions before and after the assignment of the switch state of the time period to its adjacent time period, and the ratio of the increase in network loss to the reduction in the total number of switch actions; based on the obtained reduction in the total number of switch actions before and after the assignment of each adjacent time period and the ratio of the increase in network loss to the reduction in the total number of switch actions of all time periods, determine the target time period and the target adjacent time period; and assign the switch state of the target time period to the target adjacent time period to obtain the merged and updated time periods and the switch state, the number of actions of each switch, the total number of switch actions, and the network loss of each time period.

[0112] Furthermore, in a possible implementation of the embodiment of the present application, the loop control module 403 is specifically configured to:

[0113] Obtain the first time period corresponding to the minimum ratio of all network loss increments to total switch operation reductions and the first adjacent time period corresponding to the minimum ratio;

[0114] Calculate the number of times each switch is actuated in each time period and the total number of times each switch is actuated after the switch state of the first time period is assigned to the first adjacent time period;

[0115] Determine whether the combined and updated number of operations of each switch in each time period and the total number of switch operations meet the switch operation number constraint;

[0116] When the number of operations of each switch in each time period after merging and updating and the total number of switch operations do not meet the switch operation number constraint, the first time period is used as the target time period and the first adjacent time period is used as the target adjacent time period.

[0117] Furthermore, in a possible implementation of the embodiment of the present application, the loop control module 403 is further configured to:

[0118] When the number of operations of each switch in each time period after the merged update and the total number of switch operations satisfy the switch operation number constraint, determine whether there is a first total switch operation number reduction amount that is smaller than the total switch operation number reduction amount in the first adjacent time period among the total switch operation number reduction amounts before and after the assignment of values ​​in each adjacent time period;

[0119] When there is no first total switching action reduction amount smaller than the total switching action reduction amount of the first adjacent time period in the total switching action reduction amount before and after the assignment of values ​​to each adjacent time period, the first time period is taken as the target time period and the first adjacent time period is taken as the target adjacent time period.

[0120] Furthermore, in a possible implementation of the embodiment of the present application, the loop control module 403 is further configured to:

[0121] When the number of the first total switch operation times reduction is greater than 1, obtaining a ratio of a network loss increment corresponding to each total switch operation times reduction in the first total switch operation times reduction to the total switch operation times reduction;

[0122] The time period corresponding to the smallest ratio of the network loss increment corresponding to each reduction in the number of total switch operations in the first reduction in the number of total switch operations to the reduction in the number of total switch operations is taken as the target time period, and the adjacent time period corresponding to the smallest ratio of the network loss increment corresponding to each reduction in the number of total switch operations in the first reduction in the number of total switch operations to the reduction in the number of total switch operations is taken as the target adjacent time period.

[0123] Furthermore, in a possible implementation of the embodiment of the present application, the loop control module 403 is further configured to:

[0124] When the number of the first total switch operation number reduction is equal to 1, the time period corresponding to the first total switch operation number reduction is used as the target time period and the adjacent time period corresponding to the first total switch operation number reduction is used as the target adjacent time period.

[0125] Furthermore, in a possible implementation of the embodiment of the present application, the static reconstruction module 401 is specifically configured to:

[0126] Based on the load data of each initial period, the distribution network is statically reconstructed through the optimal flow mode algorithm or the intelligent optimization algorithm to obtain the switch status and network loss of each initial period.

[0127] Furthermore, in a possible implementation of the embodiment of the present application, the loop control module 403 is further configured to:

[0128] When the number of operations of each switch in each time period and the total number of switch operations meet the switch operation number constraint or the cycle end condition, each time period and the corresponding disconnected switches and network losses are output.

[0129] It should be noted that the above explanation of the embodiment of the method for dynamic reconstruction of a distribution network based on heuristic rules is also applicable to the device for dynamic reconstruction of a distribution network based on heuristic rules in this embodiment, and will not be repeated here.

[0130] In order to implement the above embodiment, the present application also proposes an electronic device. Figure 5 , Figure 5 is a block diagram of an electronic device provided in an embodiment of the present application. Figure 5 As shown, the electronic device 500 includes: a processor 501, and a memory 502 communicatively connected to the processor 501; the memory 502 stores computer-executable instructions; the processor 501 executes the computer-executable instructions stored in the memory to implement the method provided in the aforementioned embodiment.

[0131] In order to implement the above embodiments, the present application also proposes a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the methods provided by the above embodiments.

[0132] In order to implement the above embodiments, the present application also proposes a computer program product, including a computer program, which implements the methods provided by the above embodiments when executed by a processor.

[0133] In the descriptions of the foregoing embodiments, the reference terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic expressions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification and features of different embodiments or examples, unless they are mutually inconsistent.

[0134] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of the technical features being referred to. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of such features. Throughout the description of this application, "plurality" means at least two, for example, two, three, etc., unless otherwise specifically defined.

[0135] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations on the present application. Ordinary technicians in this field can change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A method for dynamic reconstruction of distribution network based on heuristic rules, characterized in that: The following steps are involved: Based on the load data of each initial period, the distribution network is statically reconstructed to obtain the switch status and network loss of each initial period; Merge adjacent initial time periods with the same switch state to obtain multiple time periods after merging, as well as the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period; If the number of switch operations in each time period and the total number of switch operations do not meet the switch operation number constraint, the following steps are executed cyclically until the loop end condition is met: For each time period, after assigning the switch status of the time period to its adjacent time period, calculate the reduction in the total number of switching operations before and after the assignment of the adjacent time periods, and the ratio of the network loss increase to the reduction in the total number of switching operations; Determine the target time period and target adjacent time period based on the obtained total switch operation reduction before and after the assignment of each adjacent time period of all time periods and the ratio of the network loss increase to the total switch operation reduction; And the switch state of the target time period is assigned to the target adjacent time period to obtain the merged and updated time periods and the switch state of each switch, the number of operations of each switch, the total number of switch operations and network loss of each time period, wherein the target time period and the target adjacent time period are determined based on the sum of the total number of switch operations reduced before and after the assignment of each adjacent time period of all the obtained time periods and the ratio of the network loss increase to the total number of switch operations reduced; including: obtaining the first time period corresponding to the minimum of all the ratios of the network loss increase to the total number of switch operations reduced and the first adjacent time period corresponding to the minimum; calculating the number of operations of each switch and the total number of switch operations of each time period after the merge and update after assigning the switch state of the first time period to the first adjacent time period; judging whether the number of operations of each switch and the total number of switch operations of each time period after the merge and update meet the switch operation number constraint; if the number of operations of each switch and the total number of switch operations of each time period after the merge and update do not meet the switch operation number constraint, the first time period is used as the target time period and the first adjacent time period is used as the target adjacent time period.

2. The method according to claim 1, characterized in that The method further comprises: When the number of operations of each switch in each time period after the merged update and the total number of switch operations satisfy the switch operation number constraint, determining whether there is a first total switch operation number reduction amount that is smaller than the total switch operation number reduction amount in the first adjacent time period among the total switch operation number reduction amounts before and after the assignment of the values ​​of the adjacent time periods; When there is no first total switching action reduction amount smaller than the total switching action reduction amount of the first adjacent time period in the total switching action reduction amount before and after the assignment of the adjacent time periods, the first time period is taken as the target time period and the first adjacent time period is taken as the target adjacent time period.

3. The method according to claim 2, characterized in that The method further comprises: When the number of the first total switch operation times reduction is greater than 1, obtaining a ratio of a network loss increment corresponding to each total switch operation times reduction in the first total switch operation times reduction to the total switch operation times reduction; The time period corresponding to the minimum ratio of the network loss increment corresponding to each reduction in the number of total switch operations in the first reduction in the number of total switch operations to the reduction in the number of total switch operations is taken as the target time period, and the adjacent time period corresponding to the minimum ratio of the network loss increment corresponding to each reduction in the number of total switch operations in the first reduction in the number of total switch operations to the reduction in the number of total switch operations is taken as the target adjacent time period.

4. The method according to claim 2, characterized in that The method further comprises: When the number of the first total switch operation reduction amounts is equal to 1, the time period corresponding to the first total switch operation reduction amount is used as the target time period and the adjacent time period corresponding to the first total switch operation reduction amount is used as the target adjacent time period.

5. The method according to claim 1, characterized in that The distribution network is statically reconstructed based on the load data of each initial period to obtain the switch state and network loss of each initial period; include: Based on the load data of each initial period, the distribution network is statically reconstructed through the optimal flow mode algorithm or the intelligent optimization algorithm to obtain the switch status and network loss of each initial period.

6. The method according to claim 1, characterized in that The method further comprises: When the number of operations of each switch in each time period and the total number of switch operations meet the switch operation number constraint or the cycle end condition, each time period and the corresponding disconnected switches and network losses are output.

7. A dynamic reconfiguration device for a distribution network based on heuristic rules, characterized in that: include: A static reconstruction module is used to perform static reconstruction of the distribution network based on the load data of each initial period to obtain the switch status and network loss of each initial period; An initial merging module is used to merge adjacent initial time periods with the same switch state to obtain multiple time periods after merging, as well as the switch state, network loss, number of operations of each switch, and total number of switch operations of each time period; A loop control module is configured to, if the number of operations of each switch in each time period and the total number of switch operations do not satisfy the switch operation number constraint, cyclically execute the following steps until a loop termination condition is satisfied: if the number of operations of each switch in each time period and the total number of switch operations do not satisfy the switch operation number constraint, calculate, for each time period, a reduction in the total number of switch operations before and after the assignment of the switch state of the time period to its adjacent time period, and a ratio of the network loss increase to the reduction in the total number of switch operations; Determine the target time period and target adjacent time period based on the obtained total switch operation reduction before and after the assignment of each adjacent time period of all time periods and the ratio of the network loss increase to the total switch operation reduction; And the switch state of the target time period is assigned to the target adjacent time period to obtain the merged and updated time periods and the switch state of each switch, the number of operations of each switch, the total number of switch operations and network loss of each time period; wherein, the target time period and the target adjacent time period are determined based on the sum of the total number of switch operations reduced before and after the assignment of each adjacent time period of all time periods and the ratio of the network loss increase to the total number of switch operations reduced; including: obtaining the first time period corresponding to the minimum of all the ratios of the network loss increase to the total number of switch operations reduced and the first adjacent time period corresponding to the minimum; calculating the number of operations of each switch and the total number of switch operations of each time period after the merge and update after assigning the switch state of the first time period to the first adjacent time period; judging whether the number of operations of each switch and the total number of switch operations of each time period after the merge and update meet the switch operation number constraint; if the number of operations of each switch and the total number of switch operations of each time period after the merge and update do not meet the switch operation number constraint, the first time period is used as the target time period and the first adjacent time period is used as the target adjacent time period.

8. An electronic device, characterized in that: include: a processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 6 when executed by a processor.

Images