Power distribution network flexible reconstruction method based on improved Chebyshev chaotic mapping black wing plinary algorithm

By improving the Chebyshev Chaos Mapping Black-winged Kite algorithm, the optimization algorithm has solved the problem of slow convergence speed and difficult parameter adjustment in the distribution network grid loss optimization, and efficient global optimization of flexible reconstruction of distribution network is achieved.

CN119070394APending Publication Date: 2024-12-03XIAN UNIV OF TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411099072.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

Existing optimization algorithms such as the Black-winged Kitchen Optimization algorithm have slow convergence speed and are prone to local optimality in the grid loss optimization of distribution networks, making it difficult to effectively solve the problem of parameter adjustment in flexible reconstruction of distribution networks.

Method used

The improved Chebyshev Chaos Mapping Black-winged Kite algorithm is adopted to build a flexible reconstruction model of the distribution network, and the Chebyshev Chaos Mapping is used to generate initial populations and random numbers for iterative optimization, and the introduction of chaotic sequences is improved to improve the algorithm's global search ability and convergence performance.

Benefits of technology

The efficiency and stability of the algorithm are improved, population diversity and search space randomness are ensured, and the global optimal solution is quickly converged to avoid falling into local optimal solution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119070394A_ABST
    Figure CN119070394A_ABST
Patent Text Reader

Abstract

The invention discloses a power distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping black wing plinary algorithm, and the method comprises the following steps: 1, constructing a power distribution network flexible reconstruction model, generating an initial black wing plinary population, and initializing the initial state of Chebyshev chaotic mapping; 2, performing iterative operation to form an initial population solution set; 3, performing behavior screening on the initial population solution set to form a new population solution set; 4, carrying out iteration operation on the population which does not meet the constraint condition again, and 5, judging whether the iteration operation number meets an iteration termination condition or not, and if yes, outputting an optimal black-wing control population scheme to complete the reconstruction of the power distribution network. According to the power distribution network flexible reconstruction method based on the improved Chebyshev chaotic mapping black-wing supporting algorithm, the problems that an original black-wing supporting algorithm is slow in convergence speed and difficult in parameter adjustment in power distribution network flexible reconstruction of network loss optimization are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of distribution network reconstruction, and relates to a distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping black kite algorithm. Background Art

[0002] In recent years, distributed power sources such as photovoltaic power generation and wind power generation have developed rapidly, and the access of distributed power sources to distribution networks has become a new trend in the development of distribution networks. However, the intermittent and random characteristics of their output easily cause large fluctuations in the power of distribution network feeders, power imbalance between feeders, voltage fluctuations beyond the limit, and increased line network losses. In order to solve the above problems, the existing distribution network flexible reconstruction methods mostly use the on-off and power continuous adjustment functions of flexible switches to perform flexible reconstruction of distribution networks, thereby flexibly adjusting the topological structure and operating state of the distribution network to achieve the optimization of power flow and network losses. For the flexible reconstruction of distribution networks containing distributed power sources, mathematical models are mainly established and solved by using optimization algorithms. However, existing optimization algorithms such as genetic algorithms, particle swarm optimization, and simulated annealing have problems such as slow convergence speed, difficult parameter adjustment, and easy to fall into local optimality in the flexible reconstruction of distribution network network loss optimization. Therefore, there is still a lot of room for improvement in the problem of flexible reconstruction for distribution network network loss optimization.

[0003] The Black Kite Optimization Algorithm (BKA) in the optimization algorithm has certain advantages in dealing with the multi-objective reconstruction optimization problem of distribution network, but the original BKA algorithm has a slow convergence speed and is prone to fall into local optimality. Chaotic mapping has a wide range of applications in improving optimization algorithms. It provides a deterministic randomness that can enhance the global search ability and convergence performance of the algorithm. Summary of the invention

[0004] The purpose of the present invention is to provide a distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping Black Kite algorithm, so as to solve the problems of slow convergence speed and difficult parameter adjustment faced by the original Black Kite optimization algorithm in the flexible reconstruction of distribution networks with network loss optimization in the prior art.

[0005] The technical solution adopted by the present invention is a distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping black kite algorithm, comprising the following steps:

[0006] Step 1: construct a flexible reconstruction model of the distribution network containing distributed power sources, generate an initial black kite population, and initialize the initial state of the Chebyshev chaotic map;

[0007] Step 2, performing iterative operations on the initial black-winged kite population to form an initial population solution set;

[0008] Step 3, the initial population solution set is screened for attack behavior and migration behavior, random numbers are generated using Chebyshev chaotic mapping, the initial population solution set is optimized, and a new population solution set is formed;

[0009] Step 4, compare the initial population solution set and the new population solution set to see if they can satisfy the constraints, return the population that does not satisfy the constraints to step 1 to reinitialize, and perform the next round of iterative operations;

[0010] Step 5, determine whether the number of iterative operations meets the iteration termination condition. If not, return to step 1. If so, output the optimal black kite population solution to complete the distribution network reconstruction.

[0011] The present invention is also characterized in that:

[0012] The specific formula for constructing the distribution network flexible reconstruction model in step 1 is:

[0013]

[0014] Where: F LOSS is the distribution network loss cost, I ij,t is the current flowing through branch ij at time t, r ij is the resistance of branch ij, ΔT is the length of each time period, B LOSS is the unit price of network loss cost;

[0015]

[0016] Where: is the operating loss cost of the flexible switch, is the active power loss of the SOP connected to node i at time t, B SOP The unit price of the flexible switch operation loss cost;

[0017]

[0018] Where: is the switching operation cost, is the set of all branches including tie lines in the distribution system, S ij.1 and are 0-1 variables, representing the disconnection status of branch ij in the initial state of the network and the disconnection status of branch ij after the distribution network is reconfigured. If S ij.1 and S ij.0 If the value is 1, the branch ij is closed, and if the value is 0, the branch ij is open;

[0019]

[0020] Where: F DG is the distributed generation cost, F p and Fp They are the penalty for abandoning wind and the penalty for abandoning light. are the actual active power of WT and PV when node i is connected to the distribution network at time t, are the upper limits of active output of WT and PV of node i at time t, B wind and B pv They are the costs of curtailing wind and solar power respectively.

[0021] Step 1 The specific steps of generating the initial black-winged kite population and initializing the initial state of the Chebyshev chaotic map are:

[0022] The steps to generate the initial black kite population are as follows: set the population size to pop, the variable dimension to dim, rand to a randomly selected value between [0,1], BK lb and BK ub are the lower and upper bounds of the j-th dimension black-winged kite, corresponding to the upper and lower limits of the SOP configuration capacity. The SOP and tie switch configuration capacity of the node in black-winged kite i are randomly generated using formula (5), and the initial black-winged kite population BK is generated by formula (6), where i corresponds to pop and is a vector, and j corresponds to dim;

[0023] Initialize the initial state of the Chebyshev chaotic map: the chaotic orbit state value range is (-1, 1), and generate an initial state value X in the interval (-1, 1) by equation (7): 0 , use the Chebyshev mapping formula (8) to iteratively generate chaotic sequences, and map the generated chaotic sequences from [-1,1] to the search space [BK lb ,BK ub ], and use the mapped chaotic sequence as the initial position of the population:

[0024] X i =BK lb +rand(BK ub -BK lb ) (5);

[0025]

[0026] x 0 =2×rand()-1 (7);

[0027] x(n+1)=cos(acos -1 (x(n))),a=4 (8).

[0028] Step 2 is as follows:

[0029] The initial black kite population BK generated in step 1 is brought into the iterative calculation equation. The power flow calculation equation automatically adjusts the calculation model according to the initial black kite population parameters. The Newton-Raphson iteration method is used for iterative calculation. The fitness value Obj(F(BK)) of each black kite is calculated according to formula (9), where α and β are weight coefficients, F V and F PL is the evaluation index of the fitness value, and the set of solutions is denoted as NI;

[0030] Obj(F(BK))=αF V +βF PL (9).

[0031] Step 3 is as follows:

[0032] Step 3.1: The black-winged kite population BK is arranged from small to large according to the fitness value obtained in step 2 to form a new black-winged kite population after arrangement. The improved Chebyshev chaotic map BKA selects the individual with the best fitness value as the leader X in the initial group. L , formula (10) and formula (11) are the initial leader X L The mathematical representation of , formula (10) means that the individual with the smallest fitness value, that is, the best fitness, is taken as the optimal individual, and formula (11) means that by searching for the optimal individual, the optimal individual is taken as the leader of the initial group.

[0033] f best =min(f(X i ) (10);

[0034] X L =X(find(f best = = f(X i ))) (11);

[0035] Step 3.2, use Chebyshev chaotic map to generate random number X(n+1), formula (12) is the expression of a-order Chebyshev chaotic map, where a is usually 4, and the chaotic orbit state value range is (-1,1). According to the random number generated by the chaotic map, attack behavior screening is performed on each individual. Formula (13) and formula (14) show that this strategy includes attack behavior screening for global browsing and searching. and Respectively represent the position of the i-th black-winged kite in the j-th dimension at the t and (t+1)th iteration steps; r is a random number between 0 and 1, and p is a constant of 0.9; T is the total number of iterations, and t is the number of iterations completed so far. Finally, the individual position is updated according to the generated random number, a boundary check is performed, and the fitness is calculated to update the individual position and fitness;

[0036] In the attack behavior, the random number X(n+1) generated by the Chebyshev chaotic map is used to perturb the individual position, introducing randomness in each iteration.

[0037] x(n+1)=cos(acos -1 (x(n))),a=4 (12);

[0038]

[0039] Step 3.3, formula (15) uses Chebyshev chaotic map to generate random number X(n+1), and performs migration behavior screening on each individual according to the random number generated by chaotic map. Formula (16) and formula (17) show that this strategy includes migration behaviors for global browsing and searching, where, denotes the leading scorer of the j-th dimension black-winged kite at the t-th iteration so far; and represents the position of the i-th black-winged kite in the j-th dimension in the t-th and (t+1)-th iteration steps respectively; F i represents the current position of any black-winged kite in the tth iteration; F ri represents the fitness value of any black-winged kite at the random position in the jth dimension in the tth iteration; C(0,1) represents the Cauchy mutation, and finally updates the individual position according to the generated random number, performs a boundary check, calculates the fitness, and updates the individual position and fitness;

[0040] In the migration behavior, the random number X(n+1) generated by Chebyshev chaotic map is also used to update the individual position, improving the ability to jump out of the local optimal solution and find the global optimal solution;

[0041] x(n+1)=cos(acos -1 (x(n))),a=4 (15);

[0042]

[0043] m = 2 × sin (r + π / 2) (17).

[0044] The constraints in step 4 are as follows:

[0045] g∈G(18);

[0046]

[0047]

[0048] Formula (18) is the network topology constraint, g is the reconstructed network topology, G is the distribution network topology set, this constraint ensures that after the distribution network is reconstructed, the load nodes and power nodes should be located in a connected graph, and radial operation is guaranteed, all loads are powered and the network is connected without islands, and branches have no loops; Formula (19) and Formula (20) are power balance constraints, where P i , Q i are the active and reactive power injected into node i, U i , U j are the voltage amplitudes of nodes i and j respectively, G ij , B ij are the real and imaginary parts of the admittance matrix, θ ij is the voltage phase angle difference between nodes i and j, N is the number of nodes; Equation (21) is the node voltage constraint, and U i,t are the upper and lower limits of the voltage allowed at node i at time t; Equations (22) and (23) are the active output constraints of distributed generation, where are the upper and lower limits of the photovoltaic active output of node i at time t, is the upper and lower limits of wind power active output at node i at time t; Equations (24) and (25) are the reactive output constraints of distributed generation, is the wind power reactive output at node i at time t, is the photovoltaic reactive power output of node i at time t, are the wind power capacity and photovoltaic capacity of node i.

[0049] Compared with the prior art, the present invention has the following beneficial effects:

[0050] (1) The distribution network flexible reconstruction method based on the improved Chebyshev chaotic mapping Black Kite algorithm proposed in the present invention uses Chebyshev chaotic mapping to generate the initial population compared to the original BKA algorithm. The traditional random initialization method may lead to insufficient population diversity and easily fall into the local optimum. The Chebyshev chaotic mapping generates a more dispersed and random initial population by introducing a chaotic sequence, thereby ensuring the diversity of the population and the randomness of the search space. The initial population generated by the chaotic mapping has good distribution characteristics, which helps the BKA algorithm to quickly converge to the global optimal solution during the iteration process, thereby improving the efficiency and stability of the algorithm.

[0051] (2) Compared with the original BKA algorithm, the flexible reconstruction method of distribution network based on improved Chebyshev chaotic mapping Black Kite algorithm proposed in the present invention uses Chebyshev chaotic mapping for attack behavior and migration behavior screening. In the attack behavior, the random numbers generated by Chebyshev chaotic mapping are used to perturb the individual positions so that randomness is introduced in each iteration to prevent the individual from falling into the local optimal solution; in the migration behavior, the random numbers generated by Chebyshev chaotic mapping are also used to update the individual positions to ensure the diversity of the search. By introducing chaotic perturbations in two different steps, the randomness and diversity in the search process can be effectively enhanced, thereby improving the ability to jump out of the local optimal solution and find the global optimal solution. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 It is a flow chart of the flexible reconstruction method of the distribution network based on the improved Chebyshev chaotic mapping black kite algorithm of the present invention. DETAILED DESCRIPTION

[0053] The present invention will be further explained below in conjunction with the accompanying drawings and specific embodiments.

[0054] The present invention provides a distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping black kite algorithm, such as Figure 1 As shown, Figure 1 As shown, the present invention provides a distribution network flexible reconstruction method based on an improved Chebyshev chaotic mapping black kite optimization algorithm, comprising the following steps:

[0055] Step 1: Construct a flexible reconstruction model of the distribution network containing distributed generation;

[0056] Step 2: Based on the flexible reconstruction model of the distribution network containing distributed power sources, an initial black kite population is randomly generated, and the initial state of the Chebyshev chaotic map is initialized;

[0057] Step 3, performing power flow calculation on the initial black-winged kite population to form an initial population solution set;

[0058] Step 4: Perform attack behavior screening and migration behavior screening, use Chebyshev chaotic mapping to generate random numbers, thereby optimizing the initial population solution set, and retaining the leader of this generation to form a new population solution set;

[0059] Step 5: Compare the new population solution set obtained in step 4 with the initial population solution set obtained in step 3 to see whether they can meet the constraints of the actual problem, reinitialize the population that cannot meet the constraints, and perform the next round of iterative calculation;

[0060] Step 6: Determine whether the maximum number of iterations has been reached. If so, the iteration is terminated and the optimal black kite population configuration scheme, i.e., the flexible switch and tie switch configuration scheme, is output.

[0061] Step 1 specifically includes the following steps:

[0062] A flexible reconstruction model of the distribution network containing distributed generation is constructed. The actual objective function of the flexible reconstruction model of the distribution network for network loss optimization can be expressed as follows:

[0063]

[0064] Where: F LOSS is the distribution network loss cost, I ij,t is the current flowing through branch ij at time t, r ij is the resistance of branch ij, ΔT is the length of each time period, B LOSS The unit price of network loss cost.

[0065]

[0066] Where: is the operating loss cost of the flexible switch, is the active power loss of the SOP connected to node i at time t, B SOP The unit price for the operating loss of the flexible switch.

[0067]

[0068] Where: is the switching operation cost, is the set of all branches including tie lines in the distribution system, S ij.1 and S ij.0 is a 0-1 variable, which represents the disconnection status of branch ij in the initial state of the network and the disconnection status of branch ij after the distribution network is reconfigured. If S ij.1 and S ij.0 If the value is 1, the branch ij is closed, and if the value is 0, the branch ij is open.

[0069]

[0070] Where: F DG is the distributed generation cost, F p and F w They are the penalty for abandoning wind and the penalty for abandoning light. are the actual active power of WT and PV when node i is connected to the distribution network at time t, are the upper limits of active output of WT and PV of node i at time t, B wind and B pv They are the costs of curtailing wind and solar power respectively.

[0071] Step 2 specifically includes the following steps:

[0072] A series of initialization preparations need to be performed, setting the population size to pop, the variable dimension to dim, rand to a randomly selected value between [0,1], BK lb and BK ub are the lower and upper bounds of the j-th dimension black-winged kite, corresponding to the upper and lower limits of the SOP configuration capacity. The SOP and tie switch configuration capacity of the node in black-winged kite i are randomly generated using formula (5), and the initial black-winged kite population BK is generated by formula (6), where i corresponds to pop and is a vector, and j corresponds to dim;

[0073] The chaotic orbit state value range is (-1, 1). Equation (7) generates an initial state value X in the interval (-1, 1). 0 , use the Chebyshev mapping formula (8) to iteratively generate chaotic sequences, and map the generated chaotic sequences from [-1,1] to the search space [BK lb ,BK ub ], and the mapped chaotic sequence is used as the initial position of the population;

[0074] X i =BK lb +rand(BK ub -BK lb ) (5);

[0075]

[0076] x 0 =2×rand()-1 (7);

[0077] x(n+1)=cos(acos -1 (x(n))),a=4 (8).

[0078] Step 3 specifically includes the following steps:

[0079] The initial black kite population BK generated in step 2 is introduced into the power flow calculation equation. The power flow calculation equation automatically adjusts the calculation model according to the initial black kite population parameters. The Newton-Raphson iteration method is used for iterative calculation. The fitness value Obj(F(BK)) of each black kite is calculated according to formula (9), where α and β are weight coefficients, and F V and F PL is the evaluation index of the fitness value. The set of solution sets is denoted as NI.

[0080] Obj(F(BK))=αF V +βF PL (9);

[0081] Step 4 specifically includes the following steps:

[0082] Step 4.1: The black-winged kite population BK is arranged from small to large according to the fitness value obtained in step 2 to form a new black-winged kite population after arrangement. The improved Chebyshev chaotic map BKA selects the individual with the best fitness value as the leader X in the initial group. L , formula (10) and formula (11) are the initial leader X L Mathematical representation of . Formula (10) means that the individual with the smallest fitness value, that is, the best fitness, is taken as the optimal individual. Formula (11) means that by searching for the optimal individual, the optimal individual is taken as the leader of the initial group.

[0083] f best =min(f(X i ) (10);

[0084] X L =X(find(f best = = f(X i ))) (11);

[0085] Step 4.2, use Chebyshev chaotic map to generate random number X(n+1), formula (12) is the expression of a-order Chebyshev chaotic map, where a is usually 4, and the chaotic orbit state value range is (-1,1). According to the random number generated by the chaotic map, attack behavior screening is performed on each individual. Formulas (13) and (14) show that this strategy includes attack behavior screening for global browsing and searching. and Respectively represent the position of the i-th black-winged kite in the j-th dimension at the t and (t+1)th iteration steps; r is a random number between 0 and 1, and p is a constant of 0.9; T is the total number of iterations, and t is the number of iterations completed so far. Finally, the individual position is updated according to the generated random number, a boundary check is performed, and the fitness is calculated to update the individual position and fitness;

[0086] In the attack behavior, the random number X(n+1) generated by the Chebyshev chaotic map is used to perturb the individual position, introducing randomness in each iteration.

[0087] x(n+1)=cos(acos -1 (x(n))),a=4 (12);

[0088]

[0089] Step 4.3, formula (15) uses Chebyshev chaotic map to generate random number X(n+1), and performs migration behavior screening on each individual according to the random number generated by chaotic map. Formula (16) and formula (17) show that this strategy includes migration behaviors for global browsing and searching, where, denotes the leading scorer of the j-th dimension black-winged kite at the t-th iteration so far; and represents the position of the i-th black-winged kite in the j-th dimension in the t-th and (t+1)-th iteration steps respectively; F i represents the current position of any black-winged kite in the tth iteration; F ri represents the fitness value of any black-winged kite at the random position in the jth dimension in the tth iteration; C(0,1) represents the Cauchy mutation, and finally updates the individual position according to the generated random number, performs a boundary check, calculates the fitness, and updates the individual position and fitness;

[0090] In the migration behavior, the random number X(n+1) generated by the Chebyshev chaotic map is also used to update the individual position, improving the ability to jump out of the local optimal solution and find the global optimal solution.

[0091] x(n+1)=cos(acos -1 (x(n))),a=4 (15);

[0092]

[0093] m = 2 × sin (r + π / 2) (17).

[0094] The constraints in step 5 are:

[0095] g∈G(18);

[0096]

[0097] Formula (18) is the network topology constraint, g is the reconstructed network topology, and G is the distribution network topology set. This constraint ensures that after the distribution network is reconstructed, the load nodes and power nodes should be located in a connected graph, and radial operation is guaranteed, all loads are powered, the network is connected without islands, and branches have no loops; Formula (19) and Formula (20) are power balance constraints, where P i , Q i are the active and reactive power injected into node i, U i , U j are the voltage amplitudes of nodes i and j respectively, G ij , B ij are the real and imaginary parts of the admittance matrix, θ ijis the voltage phase angle difference between nodes i and j, N is the number of nodes; Equation (21) is the node voltage constraint, and U i,t are the upper and lower limits of the voltage allowed at node i at time t; Equations (22) and (23) are the active output constraints of distributed generation, where are the upper and lower limits of the photovoltaic active output of node i at time t, is the upper and lower limits of wind power active output at node i at time t; Equations (24) and (25) are the reactive output constraints of distributed generation, is the wind power reactive output at node i at time t, is the photovoltaic reactive power output of node i at time t. are the wind power capacity and photovoltaic capacity of node i.

[0098] Step 6 is as follows:

[0099] Determine whether the maximum number of iterations has been reached. If so, output the optimal black kite population solution; otherwise, return to step 2.

[0100] Example 1

[0101] The flexible reconstruction method of the distribution network based on the improved Chebyshev chaotic mapping black kite algorithm provided in this embodiment is as follows: Figure 1 As shown, the following steps are included:

[0102] Step 1: construct a flexible reconstruction model of the distribution network containing distributed power sources, generate an initial black kite population, and initialize the initial state of the Chebyshev chaotic map;

[0103] Step 2, performing iterative operations on the initial black-winged kite population to form an initial population solution set;

[0104] Step 3, the initial population solution set is screened for attack behavior and migration behavior, random numbers are generated using Chebyshev chaotic mapping, the initial population solution set is optimized, and a new population solution set is formed;

[0105] Step 4, compare the initial population solution set and the new population solution set to see if they can satisfy the constraints, return the population that does not satisfy the constraints to step 1 to reinitialize, and perform the next round of iterative operations;

[0106] Step 5, determine whether the number of iterative operations meets the iteration termination condition. If not, return to step 1. If so, output the optimal black kite population solution to complete the distribution network reconstruction.

[0107] Example 2

[0108] On the basis of Example 1, Figure 1 As shown,

[0109] The specific formula for constructing the distribution network flexible reconstruction model in step 1 is:

[0110]

[0111] Where: F LOSS is the distribution network loss cost, I ij,t is the current flowing through branch ij at time t, r ij is the resistance of branch ij, ΔT is the length of each time period, B LOSS is the unit price of network loss cost;

[0112]

[0113] Where: is the operating loss cost of the flexible switch, is the active power loss of the SOP connected to node i at time t, B SOP The unit price of the flexible switch operation loss cost;

[0114]

[0115] Where: is the switching operation cost, is the set of all branches including tie lines in the distribution system, S ij.1 and are 0-1 variables, representing the disconnection status of branch ij in the initial state of the network and the disconnection status of branch ij after the distribution network is reconfigured. If S ij.1 and S ij.0 If the value is 1, the branch ij is closed, and if the value is 0, the branch ij is open.

[0116]

[0117] Where: F DG is the distributed generation cost, F p and F p They are the penalty for abandoning wind and the penalty for abandoning light. are the actual active power of WT and PV when node i is connected to the distribution network at time t, are the upper limits of active output of WT and PV of node i at time t, B wind and B pv They are the costs of curtailing wind and solar power respectively.

[0118] Step 1 The specific steps of generating the initial black-winged kite population and initializing the initial state of the Chebyshev chaotic map are:

[0119] The steps to generate the initial black kite population are as follows: set the population size to pop, the variable dimension to dim, rand to a randomly selected value between [0,1], BK lband BK ub are the lower and upper bounds of the j-th dimension black-winged kite, corresponding to the upper and lower limits of the SOP configuration capacity. The SOP and tie switch configuration capacity of the node in black-winged kite i are randomly generated using formula (5), and the initial black-winged kite population BK is generated by formula (6), where i corresponds to pop and is a vector, and j corresponds to dim;

[0120] Initialize the initial state of the Chebyshev chaotic map: the chaotic orbit state value range is (-1, 1), and generate an initial state value X in the interval (-1, 1) by equation (7): 0 , use the Chebyshev mapping formula (8) to iteratively generate chaotic sequences, and map the generated chaotic sequences from [-1,1] to the search space [BK lb ,BK ub ], and use the mapped chaotic sequence as the initial position of the population:

[0121] X i =BK lb +rand(BK ub -BK lb ) (5);

[0122]

[0123] x 0 =2×rand()-1 (7);

[0124] x(n+1)=cos(acos -1 (x(n))),a=4 (8).

[0125] Example 3

[0126] On the basis of Example 2, Figure 1 As shown, step 2 is specifically as follows:

[0127] The initial black kite population BK generated in step 1 is brought into the iterative calculation equation. The power flow calculation equation automatically adjusts the calculation model according to the initial black kite population parameters. The Newton-Raphson iteration method is used for iterative calculation. The fitness value Obj(F(BK)) of each black kite is calculated according to formula (9), where α and β are weight coefficients, F V and F PL is the evaluation index of fitness value.

[0128] The set of solution sets is denoted as NI;

[0129] Obj(F(BK))=αF V +βF PL (9);

[0130] Step 3 is as follows:

[0131] Step 3.1: The black-winged kite population BK is arranged from small to large according to the fitness value obtained in step 2 to form a new black-winged kite population after arrangement. The improved Chebyshev chaotic map BKA selects the individual with the best fitness value as the leader X in the initial group. L , formula (10) and formula (11) are the initial leader X L Mathematical representation of . Formula (10) means that the individual with the smallest fitness value, that is, the best fitness, is taken as the optimal individual. Formula (11) means that by searching for the optimal individual, the optimal individual is taken as the leader of the initial group.

[0132] f best =min(f(X i ) (10);

[0133] X L =X(find(f best = = f(X i ))) (11);

[0134] Step 3.2, use Chebyshev chaotic map to generate random number X(n+1), formula (12) is the expression of a-order Chebyshev chaotic map, where a is usually 4, and the chaotic orbit state value range is (-1,1). According to the random number generated by the chaotic map, attack behavior screening is performed on each individual. Formula (13) and formula (14) show that this strategy includes attack behavior screening for global browsing and searching. and Respectively represent the position of the i-th black-winged kite in the j-th dimension at the t and (t+1)th iteration steps; r is a random number between 0 and 1, and p is a constant of 0.9; T is the total number of iterations, and t is the number of iterations completed so far. Finally, the individual position is updated according to the generated random number, a boundary check is performed, and the fitness is calculated to update the individual position and fitness;

[0135] In the attack behavior, the random number X(n+1) generated by the Chebyshev chaotic map is used to perturb the individual position, introducing randomness in each iteration.

[0136] x(n+1)=cos(acos -1 (x(n))),a=4 (12);

[0137]

[0138] Step 3.3, formula (15) uses Chebyshev chaotic map to generate random number X(n+1), and performs migration behavior screening on each individual according to the random number generated by chaotic map. Formula (16) and formula (17) show that this strategy includes migration behaviors for global browsing and searching, where, denotes the leading scorer of the j-th dimension black-winged kite at the t-th iteration so far; and represents the position of the i-th black-winged kite in the j-th dimension in the t-th and (t+1)-th iteration steps respectively; F i represents the current position of any black-winged kite in the tth iteration; F ri represents the fitness value of any black-winged kite at the random position in the jth dimension in the tth iteration; C(0,1) represents the Cauchy mutation, and finally updates the individual position according to the generated random number, performs a boundary check, calculates the fitness, and updates the individual position and fitness;

[0139] In the migration behavior, the random number X(n+1) generated by Chebyshev chaotic map is also used to update the individual position, improving the ability to jump out of the local optimal solution and find the global optimal solution;

[0140] x(n+1)=cos(acos -1 (x(n))),a=4 (15);

[0141]

[0142] m = 2 × sin (r + π / 2) (17).

[0143] The constraints in step 4 are as follows:

[0144] g∈G(18);

[0145]

[0146]

[0147] Formula (18) is the network topology constraint, g is the reconstructed network topology, and G is the distribution network topology set. This constraint ensures that after the distribution network is reconstructed, the load nodes and power nodes should be located in a connected graph, and radial operation is guaranteed, all loads are powered, the network is connected without islands, and branches have no loops; Formula (19) and Formula (20) are power balance constraints, where P i , Q i are the active and reactive power injected into node i, U i , U j are the voltage amplitudes of nodes i and j respectively, G ij , B ijare the real and imaginary parts of the admittance matrix, θ ij is the voltage phase angle difference between nodes i and j, N is the number of nodes; Equation (21) is the node voltage constraint, and U i,t are the upper and lower limits of the voltage allowed at node i at time t; Equations (22) and (23) are the active output constraints of distributed generation, where are the upper and lower limits of the photovoltaic active output of node i at time t, is the upper and lower limits of wind power active output at node i at time t; Equations (24) and (25) are the reactive output constraints of distributed generation, is the wind power reactive output at node i at time t, is the photovoltaic reactive power output of node i at time t. are the wind power capacity and photovoltaic capacity of node i.

[0148] The invention provides a distribution network flexible reconstruction method based on the improved Chebyshev chaotic mapping black kite algorithm, which uses Chebyshev chaotic mapping to generate an initial population. The Chebyshev chaotic mapping generates a more dispersed and random initial population by introducing a chaotic sequence, thereby ensuring the diversity of the population and the randomness of the search space. The initial population generated by the chaotic mapping has good distribution characteristics, which helps the BKA algorithm to quickly converge to the global optimal solution during the iteration process, thereby improving the efficiency and stability of the algorithm.

Claims

1. A flexible reconstruction method for distribution network based on improved Chebyshev chaos mapping black kite algorithm. It is characterized in that The following steps are involved: Step 1: construct a flexible reconstruction model of the distribution network containing distributed power sources, generate an initial black kite population, and initialize the initial state of the Chebyshev chaotic map; Step 2, performing iterative operations on the initial black-winged kite population to form an initial population solution set; Step 3, the initial population solution set is screened for attack behavior and migration behavior, random numbers are generated using Chebyshev chaotic mapping, the initial population solution set is optimized, and a new population solution set is formed; Step 4, compare the initial population solution set and the new population solution set to see if they can satisfy the constraints, return the population that does not satisfy the constraints to step 1 to reinitialize, and perform the next round of iterative operations; Step 5, determine whether the number of iterative operations meets the iteration termination condition. If not, return to step 1. If so, output the optimal black kite population solution to complete the distribution network reconstruction.

2. According to the distribution network flexible reconstruction method based on the improved Chebyshev chaos mapping black kite algorithm according to claim 1, It is characterized in that The specific formula for constructing the distribution network flexible reconstruction model in step 1 is: Where: F LOSS is the distribution network loss cost, I ij,t is the current flowing through branch ij at time t, r ij is the resistance of branch ij, ΔT is the length of each time period, B LOSS is the unit price of network loss cost; Where: is the operating loss cost of the flexible switch, is the active power loss of the SOP connected to node i at time t, B SOP The unit price of the flexible switch operation loss cost; Where: is the switching operation cost, is the set of all branches including tie lines in the distribution system, S ij.1 and are 0-1 variables, representing the disconnection status of branch ij in the initial state of the network and the disconnection status of branch ij after the distribution network is reconfigured. If S ij.1 and S ij.0 If the value is 1, the branch ij is closed, and if the value is 0, the branch ij is open; Where: F DG is the distributed generation cost, F p and F p They are the penalty for abandoning wind and the penalty for abandoning light. and are the actual active power of WT and PV when node i is connected to the distribution network at time t, and are the upper limits of active output of WT and PV of node i at time t, B wind and B pv They are the costs of curtailing wind and solar power respectively.

3. According to the distribution network flexible reconstruction method based on the improved Chebyshev chaos mapping black kite algorithm according to claim 2, It is characterized in that The specific steps of step 1 to generate the initial black kite population and initialize the initial state of the Chebyshev chaotic map are: The steps of generating the initial black kite population are as follows: setting the population number to pop, the variable dimension to dim, rand to a value randomly selected between [0, 1], BK lb and BK ub are the lower and upper bounds of the j-th dimension black-winged kite, corresponding to the upper and lower limits of the SOP configuration capacity. The SOP and tie switch configuration capacity of the node in black-winged kite i are randomly generated using formula (5), and the initial black-winged kite population BK is generated by formula (6), where i corresponds to pop and is a vector, and j corresponds to dim; The initial state of the Chebyshev chaotic map is: the chaotic orbit state value range is (-1, 1), and an initial state value X in the interval (-1, 1) is generated by formula (7): 0 , use the Chebyshev mapping formula (8) to iteratively generate chaotic sequences, and map the generated chaotic sequences from [-1,1] to the search space [BK lb ,BK ub ], and use the mapped chaotic sequence as the initial position of the population: X i =BK lb +rand(UK ub -BK lb ) (5); x 0 =2×rand()-1 (7); x(n+1)=cos(acos -1 (x(n))),a=4(8)。 4. According to claim 3, the distribution network flexible reconstruction method based on the improved Chebyshev chaos mapping black kite algorithm, It is characterized in that The step 2 is specifically as follows: The initial black kite population BK generated in step 1 is brought into the iterative calculation equation. The power flow calculation equation automatically adjusts the calculation model according to the initial black kite population parameters. The Newton-Raphson iteration method is used for iterative calculation. The fitness value Obj(F(BK)) of each black kite is calculated according to formula (9), where α and β are weight coefficients, F V and F PL is the evaluation index of the fitness value, and the set of solutions is denoted as NI; Obj(F(BK))=αF V +βF PL (9)。 5. According to claim 4, the distribution network flexible reconstruction method based on the improved Chebyshev chaos mapping black kite algorithm, It is characterized in that The step 3 is specifically as follows: Step 3.1: The black-winged kite population BK is arranged from small to large according to the fitness value obtained in step 2 to form a new black-winged kite population after arrangement. The improved Chebyshev chaotic map BKA selects the individual with the best fitness value as the leader X in the initial group. L , formula (10) and formula (11) are the initial leader X L The mathematical representation of , formula (10) means that the individual with the smallest fitness value, that is, the best fitness, is taken as the optimal individual, and formula (11) means that by searching for the optimal individual, the optimal individual is taken as the leader of the initial group. f best =min(f(X i ) (10); X L =X(find(f best ==f(X i ))) (11); Step 3.2, use Chebyshev chaotic map to generate random number X(n+1), formula (12) is the expression of a-order Chebyshev chaotic map, where a is usually 4, and the chaotic orbit state value range is (-1,1). According to the random number generated by the chaotic map, attack behavior screening is performed on each individual. Formula (13) and formula (14) show that this strategy includes attack behavior screening for global browsing and searching. and They represent the positions of the ith black-winged kite in the jth dimension at the t and (t+1)th iteration steps respectively; r is a random number between 0 and 1, and p is a constant of 0.9; T is the total number of iterations, t is the number of iterations completed so far, and finally the individual position is updated according to the generated random number, a boundary check is performed, and the fitness is calculated to update the individual position and fitness; In the attack behavior, the random number X(n+1) generated by the Chebyshev chaotic map is used to perturb the individual position, introducing randomness in each iteration. x(n+1)=cos(acos -1 (x(n))),a=4 (12); Step 3.3, formula (15) uses Chebyshev chaotic map to generate random number X(n+1), and performs migration behavior screening on each individual according to the random number generated by chaotic map. Formula (16) and formula (17) show that this strategy includes migration behaviors for global browsing and searching, where, denotes the leading scorer of the j-th dimension black-winged kite at the t-th iteration so far; and represents the position of the i-th black-winged kite in the j-th dimension in the t-th and (t+1)-th iteration steps respectively; F i represents the current position of any black-winged kite in the tth iteration; F ri represents the fitness value of any black-winged kite at a random position in the jth dimension in the tth iteration; C(0,1) represents the Cauchy mutation. Finally, the individual position is updated according to the generated random number, the boundary check is performed, the fitness is calculated, and the individual position and fitness are updated; In the migration behavior, the random number X(n+1) generated by Chebyshev chaotic map is also used to update the individual position, improving the ability to jump out of the local optimal solution and find the global optimal solution; x(n+1)=cos(acos -1 (x(n))),a=4 (15); m = 2 × sin (r + π / 2) (17).

6. According to claim 5, the distribution network flexible reconstruction method based on the improved Chebyshev chaos map black kite algorithm, It is characterized in that The constraints in step 4 are specifically: g∈G(18); Formula (18) is the network topology constraint, g is the reconstructed network topology, G is the distribution network topology set, this constraint ensures that after the distribution network is reconstructed, the load nodes and power nodes should be located in a connected graph, and radial operation is guaranteed, all loads are powered and the network is connected without islands, and branches have no loops; Formula (19) and Formula (20) are power balance constraints, where P i , Q i are the active and reactive power injected into node i, U i , U j are the voltage amplitudes of nodes i and j respectively, G ij , B ij are the real and imaginary parts of the admittance matrix, θ ij is the voltage phase angle difference between nodes i and j, N is the number of nodes; Equation (21) is the node voltage constraint, and U i,t are the upper and lower limits of the voltage allowed at node i at time t; Equations (22) and (23) are the active output constraints of distributed generation, where and are the upper and lower limits of the photovoltaic active output of node i at time t, and is the upper and lower limits of wind power active output at node i at time t; Equations (24) and (25) are the reactive output constraints of distributed generation, is the wind power reactive output at node i at time t, is the photovoltaic reactive power output of node i at time t, and are the wind power capacity and photovoltaic capacity of node i.

Citation Information

Cited By

  • Power distribution network optimal scheduling recovery method considering in-ring distributed resources

    CN121618445A