Power distribution network dynamic reconstruction method and device based on heuristic rule

Abstract

The invention provides a power distribution network dynamic reconstruction method and device based on a heuristic rule, and the method comprises the steps: carrying out the static reconstruction of a power distribution network based on the load data of each initial time period, and obtaining the switching state and network loss of each initial time period; adjacent initial periods having the same switching state are merged, and when the number of operations of each switch and the number of operations of the total switch in each period do not satisfy a switching operation number constraint, for each period, the switching state of the period is calculated and assigned to an adjacent period thereof, and the number of operations of each switch is calculated. The ratio of the total switch action frequency reduction amount and the network loss increment to the total switch action frequency reduction amount before and after each adjacent time period is assigned; determining a target time period and a target adjacent time period based on the obtained total switching action frequency reduction amount before and after each adjacent time period of all the time periods is assigned and the ratio of the network loss increment to the total switching action frequency reduction amount; assigning the switching state of the target time period to a target adjacent time period; and the reliability of dynamic reconstruction of the power distribution network is improved.

Description

Technical Field

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

[0002] Dynamic reconfiguration of a distribution network is to change the opening and closing states of switches within the allowable range of switch actions under different load states during the reconfiguration period, so as to change the network structure of the distribution network to minimize network losses and improve the economic efficiency of the operation of the distribution network. At present, the static reconfiguration solution method based on each time section has been relatively mature, while the difficulty of dynamic reconfiguration lies in how to optimally allocate a limited number of switch actions to make the desired objective optimal, and it is still under extensive research. Therefore, if an efficient and reliable dynamic reconfiguration method can be developed based on static reconfiguration, it will have important theoretical and practical significance.

[0003] In the research on dynamic reconfiguration based on the static reconfiguration result, the existing methods only consider minimizing the network loss increment after merging the switch state assignments in adjacent time periods during the process of reducing the action times of out-of-limit switches. After successive switch state assignment operations, the time periods with reduced switch actions are finally satisfied to meet the switch constraints. The disadvantage of this method is that it only realizes the dynamic coupling of switch states in each time period based on minimizing the network loss increment after merging the switch state assignments in adjacent time periods, and cannot ensure that the final result is optimal. There may be a large network loss increment under the same switch action reduction conditions, that is, this method cannot ensure the optimal allocation of a limited number of switch actions; there may be a problem that the switch action times remain unchanged after the switch state assignment operation in adjacent time periods, resulting in low overall calculation efficiency; secondly, there may be a problem of low switch utilization rate. Summary of the Invention

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

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

[0006] The second object of the present application is to propose a device for dynamic reconfiguration of a distribution network based on heuristic rules.

[0007] The third object of the present application is to propose an electronic device.

[0008] The fourth object of the present application is to propose a computer-readable storage medium.

[0009] The fifth object of the present application is to propose a computer program product.

[0010] To achieve the above object, an embodiment of the first aspect of the present application provides a method for dynamic reconfiguration of a distribution network based on heuristic rules, including: Performing static reconfiguration of the distribution network based on the load data of each initial time period to obtain the switch states and network losses of each initial time period; Merging adjacent initial time periods with the same switch states to obtain multiple time periods after the merging process, as well as the switch states, network losses, the action times of each switch, and the total switch action times of each time period; When the action times of each switch and the total switch action times of each time period do not meet the switch action times constraint, loop through the following steps until the loop end condition is met: For each time period, calculate the reduction amount of the total switch action times before and after assignment, the network loss increment, and the ratio of the network loss increment to the reduction amount of the total switch action times for each adjacent time period after assigning the switch state of this time period to its adjacent time period; Based on the reduction amount of the total switch action times before and after assignment for each adjacent time period of all time periods obtained, as well as the ratio of the network loss increment to the reduction amount of the total switch action times, 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 time periods after the merged update, as well as the switch states, the action times of each switch, the total switch action times, and the network losses of each time period.

[0011] To achieve the above object, an embodiment of the second aspect of the present application provides a device for dynamic reconfiguration of a distribution network based on heuristic rules, including: A static reconfiguration module, configured to perform static reconfiguration of the distribution network based on the load data of each initial time period to obtain the switch states and network losses of each initial time period; An initial merging module, configured to merge adjacent initial time periods with the same switch states to obtain multiple time periods after the merging process, as well as the switch states, network losses, the action times of each switch, and the total switch action times of each time period; A loop control module, configured to, when the action times of each switch and the total switch action times of each time period do not meet the switch action times constraint, loop through the following steps until the loop end condition is met: when the action times of each switch and the total switch action times of each time period do not meet the switch action times constraint, for each time period, calculate the reduction amount of the total switch action times before and after assignment, the network loss increment, and the ratio of the network loss increment to the reduction amount of the total switch action times for each adjacent time period after assigning the switch state of this time period to its adjacent time period; based on the reduction amount of the total switch action times before and after assignment for each adjacent time period of all time periods obtained, as well as the ratio of the network loss increment to the reduction amount of the total switch action times, 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 time periods after the merged update, as well as the switch states, the action times of each switch, the total switch action times, and the network losses of each time period.

[0012] To achieve the above object, an embodiment of the third aspect of the present application provides an electronic device, including: 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.

[0013] To achieve the above object, an embodiment of the fourth aspect of the present application provides a computer-readable storage medium storing computer-executable instructions, which are used to implement the method described in the first aspect when executed by a processor.

[0014] To achieve the above object, an embodiment of the fifth aspect of the present application provides a computer program product including a computer program, which implements the method described in the first aspect when executed by a processor.

[0015] The method and device for dynamic reconfiguration of a distribution network based on heuristic rules provided by the present application calculate the network loss increment, 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 before and after assigning the switch states in adjacent time periods based on the static reconfiguration results in each time period. This ratio represents the network loss increment caused by each switch operation reduction. Based on the calculated ratio, the present solution merges the switch states in adjacent time periods, reduces the number of time periods of switch operations, and realizes the reduction of the number of switch operations, ensuring that the network loss increment caused by each switch operation reduction is optimal, and solving the problem that the existing methods cannot achieve optimal allocation under a limited number of switch operations.

[0016] Additional aspects and advantages of the present application will be given in part in the following description, become apparent in part from the following description, or be learned through the practice of the present application. Description of the Drawings

[0017] The above and / or additional aspects and advantages of the present application will become apparent and be readily understood from the following description of the embodiments in conjunction with the drawings, where: Figure 1 is a schematic flow chart of a method for dynamic reconfiguration of a distribution network based on heuristic rules provided by an embodiment of the present application; Figure 2 is a flow chart of a method for dynamic reconfiguration of a distribution network based on heuristic rules provided by an example of the present application; Figure 3 is a network diagram of a node distribution system provided by an example of the present application; Figure 4 is a block diagram of a device for dynamic reconfiguration of a distribution network based on heuristic rules provided by an embodiment of the present application; Figure 5A block diagram of an electronic device provided by an embodiment of the present application. Detailed implementation manners

[0018] The embodiments of the present application will be described in detail below. Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present application, and should not be construed as a limitation to the present application.

[0019] To solve the technical problems existing in the existing distribution network reconfiguration, the present application provides a distribution network dynamic reconfiguration method and device based on heuristic rules. Under the given constraint of the number of switch operations, the heuristic rules can reasonably allocate the limited switch operations, with higher calculation efficiency, and can improve the utilization rate of switches and have better optimization ability.

[0020] The distribution network dynamic reconfiguration method, device and equipment based on heuristic rules according to the embodiments of the present application will be described below with reference to the accompanying drawings.

[0021] Figure 1 A flowchart of a distribution network dynamic reconfiguration method based on heuristic rules provided by an embodiment of the present application.

[0022] It should be noted that the execution subject of the distribution network dynamic reconfiguration method based on heuristic rules according to the embodiments of the present application is the distribution network dynamic reconfiguration device based on heuristic rules according to the embodiments of the present application. The distribution network dynamic reconfiguration device based on heuristic rules can be configured in an electronic device so that the electronic device can execute the distribution network dynamic reconfiguration function based on heuristic rules.

[0023] As Figure 1 shown, the distribution network dynamic reconfiguration method based on heuristic rules includes the following steps: Step S101, perform distribution network static reconfiguration based on the load data of each initial time period to obtain the switch states and network losses of each initial time period.

[0024] As an implementation manner, based on the load data of each initial time period, perform distribution network static reconfiguration through the optimal power flow mode algorithm or intelligent optimization algorithm to obtain the switch states and network losses of each initial time period.

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

[0026] After the static reconfiguration calculation of the distribution network is completed in this embodiment, adjacent initial time periods with the same switch states are merged to obtain each time period after the merging process, as well as the switch states, network losses, the number of operations of each switch, and the total number of switch operations in each time period.

[0027] Step S103, when the number of operations of each switch and the total number of switch operations in each time period do not meet the switch operation number constraint, the following steps are repeatedly executed until the loop end condition is met.

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

[0029] This embodiment needs to perform multiple loops. After the loop end condition is met, the final dynamic reconfiguration calculation result of the distribution network is obtained.

[0030] Step S104, for each time period, calculate the reduction in the total number of switch operations, the network loss increment, and the ratio of the network loss increment to the reduction in the total number of switch operations after assigning the switch state of this time period to its adjacent time periods before and after the assignment.

[0031] It should be noted that if there are adjacent time periods before and after this time period, calculate the parameters after both the previous and subsequent adjacent time periods are assigned; if there is only one adjacent time period before and after this time period, only calculate the parameters after assigning this one adjacent time period. The reduction in the total number of switch operations is the total number of switch operations before the switch state assignment minus the total number of switch operations after the switch state assignment, and the network loss increment is the network loss before the switch state assignment minus the network loss after the switch state assignment; the ratio of the network loss increment to the reduction in the total number of switch operations is the network loss increment caused by each reduction in the number of switch operations.

[0032] Step S105, based on the reduction in the total number of switch operations before and after the assignment of each adjacent time period for all time periods obtained, as well as the ratio of the network loss increment to the reduction in the total number of switch operations, 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 each time period after the merged update, as well as the switch states, the number of operations of each switch, the total number of switch operations, and the network losses in each time period.

[0033] As an implementation method, a method for determining the target time period and the target adjacent time period based on the reduction in the total number of switch operations before and after the assignment of each adjacent time period for all time periods obtained, as well as the ratio of the network loss increment to the reduction in the total number of switch operations; includes: Obtain the first time period corresponding to the minimum value among all the ratios of the network loss increment to the reduction in the total number of switch operations and the first adjacent time period corresponding to this minimum value; Calculate the action times of each switch and the total switch action times of each time period after the switch states of the first time period are assigned to the first adjacent time period and the merged and updated time periods are obtained; Determine whether the action times of each switch and the total switch action times of each time period after the merged and updated time periods are obtained satisfy the switch action time constraint; In the case where the action times of each switch and the total switch action times of each time period after the merged and updated time periods do not satisfy the switch action time constraint, use the first time period as the target time period and the first adjacent time period as the target adjacent time period; In the case where the action times of each switch and the total switch action times of each time period after the merged and updated time periods satisfy the switch action time constraint, determine whether there is a first total switch action time reduction amount less than the total switch action time reduction amount of the first adjacent time period among the total switch action time reduction amounts before and after the assignment of each adjacent time period; In the case where there is no first total switch action time reduction amount less than the total switch action time reduction amount of the first adjacent time period among the total switch action time reduction amounts before and after the assignment of each adjacent time period, use the first time period as the target time period and the first adjacent time period as the target adjacent time period; In the case where the number of the first total switch action time reduction amounts is greater than 1, obtain the ratio of the network loss increment corresponding to each total switch action time reduction amount in the first total switch action time reduction amounts to the total switch action time reduction amount; Use the time period corresponding to the minimum value among the ratios of the network loss increment corresponding to each total switch action time reduction amount in the first total switch action time reduction amounts to the total switch action time reduction amount as the target time period, and use the adjacent time period corresponding to the minimum value among the ratios of the network loss increment corresponding to each total switch action time reduction amount in the first total switch action time reduction amounts to the total switch action time reduction amount as the target adjacent time period; In the case where the number of the first total switch action time reduction amounts is equal to 1, use the time period corresponding to the first total switch action time reduction amount as the target time period and the adjacent time period corresponding to the first total switch action time reduction amount as the target adjacent time period.

[0034] It can be understood that if there are currently time periods, then when calculating the parameters after each round of switch state assignment operation, a ratio. First, it is judged whether the assignment according to the smallest value among all ratios satisfies the switching operation times constraint. If the assignment according to the smallest value among all ratios does not satisfy the switching operation times constraint, then the assignment is made according to the smallest value among the ratios of the network loss increment corresponding to each total switching operation times reduction amount to the total switching operation times reduction amount in all the first total switching operation times reduction amounts, the switch state is updated, and the next round of calculation is entered. To avoid excessive reduction of the switching operation times and resulting in a low utilization rate of the switch, when the total switching operation times reduction amount corresponding to the current minimum ratio is large, if both the single-switch operation and the total switching operation times are less than the constraint limit in the switching operation times constraint, then it is necessary to find one or more minimum ratios corresponding to the total switching operation times reduction amounts that are smaller than the total switching operation times reduction amount corresponding to the current minimum ratio among the

[0035] ratios, and perform the assignment operation with the switch state corresponding to this ratio. Its significance lies in that under the given switching operation times constraint, each switch operates as much as possible to maximize the reduction of network loss and improve the economic efficiency of system operation.

[0036] The dynamic reconfiguration method of the distribution network based on heuristic rules in the embodiments of the present application calculates the network loss increment, 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 before and after the switch state assignment for adjacent time periods based on the static reconfiguration results of each time period. This ratio represents the network loss increment caused by each reduction in switch operation. This solution merges the switch states of adjacent time periods based on the calculated ratio, reduces the number of time periods of switch operations, and realizes the reduction of the number of switch operations, which can ensure that the network loss increment caused by each reduction in switch operation is optimal, and solves the problem that the existing methods cannot achieve optimal allocation under a limited number of switch operations; this solution merges the switch states of adjacent time periods based on the smallest calculated ratio, reduces the number of time periods of switch operations, and realizes the reduction of the number of switch operations, which can ensure that the network loss increment caused by each reduction in switch operation is the smallest, and solves the problem that the existing methods cannot achieve optimal allocation under a limited number of switch operations; when this solution merges the switch states of adjacent time periods based on the smallest ratio, if the reduction in the total number of switch operations is too large, that is, the number of switch operations is too small, resulting in the number of switch operations being less than the given allowable value, find the smallest ratio corresponding to a smaller reduction in the total number of switch operations, and perform the corresponding switch state assignment operation according to this ratio, which solves the problem that the existing methods may over-reduce the number of switch operations of the switch, resulting in low switch utilization; through case verification, compared with the existing dynamic reconfiguration heuristic methods, under the condition of the same constraint on the number of switch operations, the number of switch operations in the reconfiguration period of this solution is more reasonably distributed, the total network loss is the smallest, which is of great significance to the economic operation of the power system.

[0037] To clearly illustrate the above embodiments, specific examples are used for illustration below.

[0038] Figure 2 The flowchart of a dynamic reconfiguration method of a distribution network based on heuristic rules provided by the embodiments of the present application is as follows. Figure 2 As shown, the dynamic reconfiguration method of the distribution network based on heuristic rules is implemented through the following steps: Step S1, perform static reconfiguration on each initial time period to obtain the switch states and network losses of each time period .

[0039] In this example, Figure 3 taking the IEEE-33 node system shown as an example, based on the load data and network parameters, the optimal power flow pattern algorithm is used for static reconfiguration calculation. After static reconfiguration, the total network loss is 943.389 kW.

[0040] Step S2, according to the switch states of each time period obtained in step S1, if the adjacent time periods have the same opening and closing states, then merge the two time periods, and the merged time period is represented by as , is the total number of merged time periods. According to the network loss in step S1, the network loss of each time period can be calculated. The network loss of is ; The switch is , is the number of switches. Count the number of operations of the switch , and the total number of switch operations . The given switch operation count constraint includes the maximum allowable number of operations for a single switch and the maximum allowable total number of switch operations .

[0041] Table 1: Each time period after merging in this example, as well as the opened switches (also known as disconnected switches) and network losses in each time period

[0042] The maximum allowable number of operations for a single switch given in this example is 3, and the maximum allowable total number of switch operations is 16. The statistics of the number of operations of each switch after static reconstruction and merging in Table 1 are shown in Table 2. It can be seen that the number of operations of multiple switches exceeds the limit, and the total number of switch operations is 60 times, seriously exceeding the given limit of the maximum allowable total number of switch operations.

[0043] Table 2: Statistics of the number of operations of each switch after static reconstruction and merging

[0044] Step S3, for , if and , then output the opened switch, and the entire process ends; otherwise, go to step S4.

[0045] Step S4, let the time period .

[0046] Step S5, calculate if the switch states of the th time period are assigned to the adjacent time periods and respectively, then the network losses and of the adjacent time periods under the switch state of the th time period, and calculate the network loss increment and .

[0047]

[0048] Step S6, calculate the reduction in the total number of switch operations for the adjacent time periods if they are assigned respectively and 。

[0049]

[0050] Step S7: Calculate the ratio of the network loss increment obtained in Step S5 and the reduction in the total number of switch operations obtained in Step S6 to the network loss increment and the reduction in the total number of switch operations after the switch state assignment for the th time period (i.e., the network loss increment caused by a single switch operation reduction) and assign it to and time periods. and 。

[0051]

[0052] Based on the proposed heuristic rules, Steps S5 - S7 calculate the network loss increment, 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 after the switch state assignment for adjacent time periods in this round. 、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 。Due to space limitations, Table 3 and Table 4 respectively give the 、 and obtained in the first round of iteration. The calculation process for other iterations is similar.

[0053] Table 3: Network loss increment and reduction in the total number of switch operations after the switch state assignment for adjacent time periods in the first round of iteration

[0054] Table 4: Ratio after the switch state assignment for adjacent time periods in the first round of iteration

[0055] Step S8: If , let and go to Step S5.

[0056] Step S9: For , select the minimum value among all the obtained and . That is, if the time period corresponding to the minimum value is and it is assigned to the time period, then preliminarily determine to assign the switch state of to the time period; if the time period corresponding to the minimum value is and it is assigned to the time period, then preliminarily determine to assign the switch state of to the time period.

[0057] Step S10, update and If and , go to Step S11; if or , then perform the assignment operation for this round according to the assignment scheme preliminarily determined in Step S9, update each time period and the switch state, network loss, etc. after the assignment, and go to Step S12.

[0058] Step S11, according to the calculation result of Step S6, obtain all smaller than the corresponding corresponding to the switch state assignment scheme preliminarily determined in the current Step S9 , and select the smallest as the final assignment scheme for this round, perform the assignment operation and update the switch state, etc. according to this final assignment scheme for this round, and return to Step S10; if there is no , then output the disconnect switch and the entire process ends.

[0059] Step S12, let the number of time periods , go to Step S5 to recalculate the network loss of each time period , etc.

[0060] The calculation results of multiple rounds of loops in this example are shown in Table 5, the finally obtained dynamic reconstruction scheme is shown in Table 6, and the statistics of the number of actions of each switch are shown in Table 7.

[0061] Table 5: Calculation Results of Multiple Rounds of Loops

[0062] Table 6: Finally Obtained Dynamic Reconstruction Scheme

[0063] Table 7: Statistics of the Number of Actions of Each Switch

[0064] To demonstrate the dynamic optimization ability of the method of this application, the following gives the calculation process considering only the minimum network loss increment for action reduction, as shown in Table 8, the obtained dynamic reconstruction scheme is shown in Table 9, and the statistics of the number of actions of each switch are shown in Table 10.

[0065] Table 8: Calculation Process Considering Only the Minimum Network Loss Increment for Action Reduction

[0066] Table 9: Dynamic Reconstruction Scheme Obtained by Considering Only the Minimum Network Loss Increment for Action Reduction

[0067] Table 10: Statistics of the number of operations of each switch

[0068] Compare the distribution network dynamic reconfiguration method that only considers minimizing the increment of network loss for action reduction with the method of this application. The statistical distribution of the operations of each switch for the two methods is shown in Table 11.

[0069] Table 11: Statistical distribution of the operations of each switch for the two methods

[0070] As can be seen from Table 5 and Table 8, for the method proposed in this application, during the process of reducing the number of switch operations, both the reduction amount of the total number of switch operations and the ratio of the network loss increment to the reduction amount of the total number of switch operations are considered. The smallest ratio is used as the criterion for assigning the switch states in adjacent time periods. A total of 11 cycles are carried out in the entire dynamic process, while only considering the network loss increment, 13 cycles are carried out. This is because when reducing the number of switch operations with the smallest ratio of the network loss increment to the reduction amount of the total number of switch operations, the reduction speed of the number of switch operations is faster and the efficiency is higher. In the process of dealing with the over-limit of the number of switch operations, this method is based on the criterion of minimizing the network loss increment caused by a single switch operation reduction. Finally, under the condition of reducing the same number of switch operations, the total network loss of the dynamic reconfiguration scheme obtained by this method is 960.968 kW, which is 1.3% lower than the total network loss of 973.504 kW obtained by the method that does not consider the reduction amount of the total number of switch operations. Therefore, the optimization effect of the method of this application is better.

[0071] As can be seen from Table 6 and Table 9, for the reconfiguration scheme obtained by using the method of this application, the switch operations are distributed at 4 time points, which is more dispersed than the switch distribution at 3 time periods obtained by only considering the network loss increment, and is more in line with the load change characteristics. Therefore, the total network loss obtained by the method of this application is finally smaller. As can be seen from Table 11, the switch numbers of the operations obtained by the two methods are the same, but the operation times and the number of operations of each switch are different. Finally, the total network loss of the former is the smallest because the switch operation distribution of the former is more reasonable.

[0072] In summary, the present application uses heuristic rules and the static reconfiguration results of the distribution network to reduce the number of switch operations. The ratio of the network loss increment after assigning the switch states in adjacent time periods to the reduction in the total number of switch operations is used as the criterion to merge the switch states in adjacent time periods. In the judgment of switch state merging, both the network loss increment and the change in the number of switch operations are considered, which improves the efficiency of reducing the number of switch operations. When reducing a certain number of switch operations, the switch operation distribution of the obtained solution is more reasonable. When the reduction in the number of switch operations is excessive, that is, the switch utilization rate is low, the present solution obtains a reduction in the total number of switch operations that is smaller than the current reduction in the total number of switch operations. Similarly, the switch states in adjacent time periods are merged with the criterion of minimizing the increase in network loss under the current reduction in the number of switch operations, which improves the switch utilization rate and reduces the total network loss.

[0073] To implement the above embodiments, the present application also proposes a distribution network dynamic reconfiguration device based on heuristic rules. Figure 4 The block diagram of a distribution network dynamic reconfiguration device based on heuristic rules provided by an embodiment of the present application is as follows. Figure 4 As shown, the distribution network dynamic reconfiguration device based on heuristic rules may include: a static reconfiguration module 401, an initial merging module 402, and a loop control module 403.

[0074] Among them, the static reconfiguration module 401 is configured to perform static reconfiguration of the distribution network based on the load data of each initial time period to obtain the switch states and network losses of each initial time period. The initial merging module 402 is configured to merge adjacent initial time periods with the same switch states to obtain multiple time periods after merging processing, as well as the switch states, network losses, the number of operations of each switch, and the total number of switch operations of each time period. The loop control module 403 is configured to, when the number of operations of each switch and the total number of switch operations in each time period do not meet the switch operation number constraint, loop through the following steps until the loop end condition is met: when the number of operations of each switch and the total number of switch operations in each time period do not meet the switch operation number constraint, for each time period, calculate the reduction in the total number of switch operations before and after assignment, the network loss increment, and the ratio of the network loss increment to the reduction in the total number of switch operations after assigning the switch state of this time period to its adjacent time periods; based on the reduction in the total number of switch operations before and after assignment of each adjacent time period and the ratio of the network loss increment to the reduction in the total number of switch operations obtained for 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, as well as the switch states, the number of operations of each switch, the total number of switch operations, and the network losses of each time period.

[0075] Further, in a possible implementation manner of the embodiment of the present application, the loop control module 403 is specifically configured to: Obtain the first time period corresponding to the minimum value among the ratios of all network loss increments to the reduction in the total number of switch operations, and the first adjacent time period corresponding to this minimum value; Calculate the number of operations of each switch and the total number of switch operations after merging and updating for each time period obtained by assigning the switch state of the first time period to the first adjacent time period; Determine whether the number of operations of each switch and the total number of switch operations after merging and updating for each time period satisfy the switch operation count constraint; In the case where the number of operations of each switch and the total number of switch operations after merging and updating for each time period do not satisfy the switch operation count constraint, take the first time period as the target time period and the first adjacent time period as the target adjacent time period.

[0076] Further, in a possible implementation manner of the embodiment of the present application, the loop control module 403 is further configured to: In the case where the number of operations of each switch and the total number of switch operations after merging and updating for each time period satisfy the switch operation count constraint, determine whether there is a first total reduction in the number of switch operations that is less than the total reduction in the number of switch operations of the first adjacent time period among the total reductions in the number of switch operations before and after assignment for each adjacent time period; In the case where there is no first total reduction in the number of switch operations that is less than the total reduction in the number of switch operations of the first adjacent time period among the total reductions in the number of switch operations before and after assignment for each adjacent time period, take the first time period as the target time period and the first adjacent time period as the target adjacent time period.

[0077] Further, in a possible implementation manner of the embodiment of the present application, the loop control module 403 is further configured to: In the case where the number of the first total reductions in the number of switch operations is greater than 1, obtain the ratios of the network loss increments corresponding to each total reduction in the number of switch operations in the first total reductions in the number of switch operations to the total reduction in the number of switch operations; Take the time period corresponding to the minimum value among the ratios of the network loss increments corresponding to each total reduction in the number of switch operations in the first total reductions in the number of switch operations to the total reduction in the number of switch operations as the target time period, and take the adjacent time period corresponding to the minimum value among the ratios of the network loss increments corresponding to each total reduction in the number of switch operations in the first total reductions in the number of switch operations to the total reduction in the number of switch operations as the target adjacent time period.

[0078] Further, in a possible implementation manner of the embodiment of the present application, the loop control module 403 is further configured to: In the case where the number of the first total reductions in the number of switch operations is equal to 1, take the time period corresponding to the first total reduction in the number of switch operations as the target time period and the adjacent time period corresponding to the first total reduction in the number of switch operations as the target adjacent time period.

[0079] Further, in a possible implementation manner of the embodiment of the present application, the static reconstruction module 401 is specifically configured to: Based on the load data of each initial time period, perform static reconstruction of the distribution network through the optimal flow pattern algorithm or the intelligent optimization algorithm to obtain the switch states and network losses of each initial time period.

[0080] Further, in a possible implementation manner of the embodiment of the present application, the loop control module 403 is further configured to: When the number of actions of each switch in each time period and the total number of switch actions meet the switch action number constraint or meet the loop end condition, output each time period and the corresponding opened switches and network losses.

[0081] It should be noted that the foregoing explanation of the embodiment of the distribution network dynamic reconstruction method based on heuristic rules is also applicable to the distribution network dynamic reconstruction device based on heuristic rules of this embodiment, and will not be elaborated here.

[0082] To implement the foregoing embodiments, the present application also proposes an electronic device. Please refer to Figure 5 , Figure 5 which is a block diagram of the electronic device provided by the embodiment of the present application. As Figure 5 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 by the foregoing embodiments.

[0083] To implement the foregoing embodiments, the present application also proposes a computer-readable storage medium storing computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the method provided by the foregoing embodiments.

[0084] To implement the foregoing embodiments, the present application also proposes a computer program product including a computer program, and when the computer program is executed by a processor, it implements the method provided by the foregoing embodiments.

[0085] In the description of the foregoing embodiments, the descriptions referring to terms such as "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations 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, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0086] In addition, the terms "first" and "second" are used for descriptive purposes only and cannot be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include at least one of the features. In the description of the present application, "a plurality" means at least two, such as two, three, etc., unless otherwise specifically defined.

[0087] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present application. Those of ordinary skill in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of the present application.

Claims

1. A dynamic reconfiguration method for distribution networks based on heuristic rules, characterized in that, Including the following steps: Based on the load data of each initial time period, perform static reconfiguration of the distribution network to obtain the switch states and network losses of each initial time period; Merge adjacent initial time periods with the same switch states to obtain multiple time periods after the merging process, as well as the switch states, network losses, the action times of each switch, and the total switch action times of each time period; In the case where the action times of each switch and the total switch action times of each time period do not meet the switch action time constraints, loop and execute the following steps until the loop end condition is met: For each time period, calculate the reduction in the total switch action times before and after assignment, the network loss increment, and the ratio of the network loss increment to the reduction in the total switch action times after assigning the switch state of this time period to its adjacent time periods; Based on the reduction in the total switch action times before and after assignment of each adjacent time period of all the obtained time periods, as well as the ratio of the network loss increment to the reduction in the total switch action times, 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 each time period after the merged update, as well as the switch states, the action times of each switch, the total switch action times, and the network losses of each time period.

2. The method according to claim 1, characterized in that The determining the target time period and the target adjacent time period based on the reduction in the total switch action times before and after assignment of each adjacent time period of all the obtained time periods, as well as the ratio of the network loss increment to the reduction in the total switch action times; includes: Obtain the first time period corresponding to the minimum value among all the ratios of the network loss increment to the reduction in the total switch action times, and the first adjacent time period corresponding to this minimum value; Calculate the action times of each switch and the total switch action times of each time period after the merged update obtained by assigning the switch state of the first time period to the first adjacent time period; Determine whether the action times of each switch and the total switch action times of each time period after the merged update meet the switch action time constraints; In the case where the action times of each switch and the total switch action times of each time period after the merged update do not meet the switch action time constraints, take the first time period as the target time period and the first adjacent time period as the target adjacent time period.

3. The method according to claim 2, wherein The method further includes: In the case where the action times of each switch and the total switch action times of each time period after the merged update meet the switch action time constraints, determine whether there is a first reduction in the total switch action times that is less than the reduction in the total switch action times of the first adjacent time period among the reductions in the total switch action times before and after assignment of each adjacent time period; In the case where there is no first reduction in the total switch action times that is less than the reduction in the total switch action times of the first adjacent time period among the reductions in the total switch action times before and after assignment of each adjacent time period, take the first time period as the target time period and the first adjacent time period as the target adjacent time period.

4. The method according to claim 3, wherein The method further includes: In the case where the number of the first reductions in the total switch action times is greater than 1, obtain the ratios of the network loss increment to the reduction in the total switch action times corresponding to each reduction in the total switch action times among the first reductions in the total switch action times; Taking the time period corresponding to the minimum value among the ratios of the network loss increments corresponding to the total switch operation number reduction amounts in the first total switch operation number reduction amount to the total switch operation number reduction amount as the target time period, and taking the adjacent time period corresponding to the minimum value among the ratios of the network loss increments corresponding to the total switch operation number reduction amounts in the first total switch operation number reduction amount to the total switch operation number reduction amount as the target adjacent time period.

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

6. The method according to claim 1, characterized in that, Performing static reconfiguration of the distribution network based on the load data of each initial time period to obtain the switch states and network losses of each initial time period; including: Based on the load data of each initial time period, performing static reconfiguration of the distribution network through the optimal power flow pattern algorithm or the intelligent optimization algorithm to obtain the switch states and network losses of each initial time period.

7. The method according to claim 1, characterized in that, The method further includes: When the operation numbers of each switch and the total switch operation number in each time period satisfy the switch operation number constraint or satisfy the loop end condition, outputting each time period and the opened switches and network losses corresponding to each time period.

8. A distribution network dynamic reconstruction device based on heuristic rules, characterized in that, including: A static reconfiguration module for performing static reconfiguration of the distribution network based on the load data of each initial time period to obtain the switch states and network losses of each initial time period; An initial merging module for merging adjacent initial time periods with the same switch states to obtain multiple time periods after the merging process and the switch states, network losses, the operation numbers of each switch, and the total switch operation number of each time period; A loop control module for, when the operation numbers of each switch and the total switch operation number in each time period do not satisfy the switch operation number constraint, looping to execute the following steps until the loop end condition is satisfied: when the operation numbers of each switch and the total switch operation number in each time period do not satisfy the switch operation number constraint, for each time period, calculating the reduction amount of the total switch operation number, the network loss increment, and the ratio of the network loss increment to the reduction amount of the total switch operation number before and after assignment for each adjacent time period after assigning the switch state of this time period to its adjacent time period; Based on the reduction amounts of the total switch operation number before and after assignment for each adjacent time period of all the obtained time periods and the ratio of the network loss increment to the reduction amount of the total switch operation number, determining the target time period and the target adjacent time period; And assigning the switch state of the target time period to the target adjacent time period to obtain each time period after the merged update and the switch states, the operation numbers of each switch, the total switch operation number, and the network loss of each time period.

9. An electronic device, characterized in that, including: A processor, and a memory communicatively connected to the processor; The memory stores computer execution instructions; The processor executes the computer execution instructions stored in the memory to implement the method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer execution instructions, and when the computer execution instructions are executed by the processor, they are used to implement the method according to any one of claims 1-7.

Images