A method for power economic emission dispatch based on hybrid core search and slime mold optimization

Optimizing the economic emission scheduling of power through hybrid nuclear search and slime mold algorithms, the problem of multi-objective optimization in the power system is solved, and a more economical and environmentally friendly power scheduling solution is achieved, avoiding local optimal solutions.

CN114066282BActive Publication Date: 2024-12-03JILIN INST OF CHEM TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202111389397.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-23
Publication Date
2024-12-03
Estimated Expiration
2041-11-23

AI Technical Summary

Technical Problem

The existing technology is difficult to effectively solve the problem of multi-objective optimization in power systems, especially in the power economic emission scheduling, fuel costs and pollution emissions need to be optimized simultaneously, and the commonly used group intelligence algorithms are prone to fall into local optimization, and multiple hyperparameters need to be adjusted. .

Method used

The hybrid nuclear search and slime mold algorithm are used to convert it into a single-target optimization problem through the weight addition method, combined with the power system current equation constraint and the generator set active output constraint, and the generator set active output is updated using the Newton iteration method and slime mold optimization algorithm. Avoid local optimal solutions.

Benefits of technology

A more economical and less pollution power economic dispatching solution is achieved, local optimal solutions are avoided, and global search capabilities are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114066282B_ABST
    Figure CN114066282B_ABST
Patent Text Reader

Abstract

The invention relates to a hybrid core search and slime mold algorithm optimized power economic emission dispatching method, comprising the following steps: S1. using a weighted sum method to convert fuel cost and pollution emission into a single objective function, and establishing a power economic emission dispatching model; S2. randomly initializing a dispatching matrix of active output of a generator set; S3. according to the Newton iteration method, obtaining the active output of the last group of generators from a power flow equation; S4. calculating a penalty function value of the last group of generators exceeding a constraint; S5. calculating the sum of the fuel cost and pollution emission of the generator set in the dispatching scheme, and normalizing them together with the penalty function value; S6. executing a hybrid core search and slime mold optimization algorithm to update the active output of the generator set; S7. if the maximum number of iterations is reached, outputting the optimal output of the generator set; otherwise, turning to S3.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of economic emission dispatching of power systems, and in particular to a hybrid kernel search and slime mold algorithm optimized power economic emission dispatching method. Background Art

[0002] Against the backdrop of the booming global low-carbon economy, China has followed the trend of the times and put forward the ambitious goal of achieving "carbon neutrality" by 2060. As the main carbon emission industry, the power industry's annual carbon dioxide emissions account for 40% of the country's total emissions, and it shoulders the heavy responsibility of energy conservation and emission reduction. The economic emission dispatch problem has become one of the most practical tasks in power system management. The economic emission dispatch problem requires the reasonable arrangement of the active output of each power plant so that it can minimize fuel costs and pollution emissions while meeting user load requirements and power plant output restrictions. It is essentially a multi-objective optimization problem with two contradictory objectives, which is of great significance to the stable economic operation of the power system and reducing pollution to the environment.

[0003] Many studies have proposed using swarm intelligence optimization methods to solve economic emission scheduling problems. However, for multi-objective economic emission scheduling problems, it is first necessary to convert them into single-objective optimization problems through the weighted sum method, and then use swarm intelligence optimization algorithms to solve them. Commonly used swarm intelligence algorithms include genetic algorithms, particle swarm optimization algorithms, pollen pollination algorithms, differential evolution algorithms, etc. However, these algorithms require careful adjustment of a large number of hyperparameters and are prone to falling into local optimality. The searched scheduling solutions may not be the optimal ones.

[0004] Therefore, developing an electricity economic emission dispatching method that does not require setting any hyperparameters and has more comprehensive global and local search capabilities has always been a difficulty in power dispatching research. Summary of the invention

[0005] The purpose of the present invention is to provide an electric power economic emission dispatching method which can optimize fuel cost and pollution emission at the same time and has good global convergence and optimization ability.

[0006] To achieve the above invention objectives, an embodiment of the present invention provides a method for power economic emission scheduling based on a hybrid core search and slime mold algorithm, comprising the following steps:

[0007] S1. The weighted sum method is used to transform the two objective functions of fuel cost and pollution emission into a single objective optimization function, and the economic emission dispatch model of the power system is established by combining the power system flow equation constraint and the active output constraint of the generator set;

[0008] S2. Suppose that N groups of generators have active output that needs to be dispatched, randomly initialize M dispatching schemes, and calculate the active output P of N-1 groups according to formula (1): i , i=1,2,…N-1, together constitute the active output scheme matrix A of the generator set;

[0009]

[0010] Where P imin and P imax are the upper and lower limits of the active output of the i-th generator set, respectively, and rand is a random number in [0,1];

[0011] S3. According to the Newton iteration method, the active output PN of the Nth group of generators in A is obtained from the power flow equation constraints;

[0012] S4. Calculate the penalty function value of the Nth group of generator active output PN exceeding the generator group constraint range;

[0013] S5. Calculate the sum of fuel costs and pollution emissions of N groups of generators in the scheduling scheme A, and together with the penalty function value, form the fitness function value yi, which is then normalized to [0,1];

[0014] S6. Execute the hybrid core search and slime mold optimization algorithm to update the active output Pi of the generator set; the specific steps are:

[0015] Step S6.1: Sort the fitness values ​​yi from small to large to form a new fitness sequence y, whose minimum fitness value is ybest and the maximum fitness value is yworst;

[0016] Step S6.2: Calculate the position update speed vb, as shown in formula (2);

[0017]

[0018] Among them, t is the current iteration number, M is the total iteration number;

[0019] Step S6.3: Calculate the weight W of the slime mold optimization algorithm, as shown in formula (3);

[0020]

[0021] Among them, rand represents a random number [0,1], and median(y) represents the median of fitness y;

[0022] Step S6.4: Calculate the active output P of group N-1 i ′, as shown in formula (4);

[0023] P i ′=P gbest+vb*(W*P A -P B ) (4)

[0024] Among them, P gbest is the optimal active power output of the generator set, P A and P B are two individuals selected at random;

[0025] Step S6.5: Substitute the active output P'i of the generator set corresponding to each dispatching scheme in A in turn with the active output P'i of the generator set to form a new M*(N-1) dispatching scheme matrix A', as shown in formula (5);

[0026]

[0027] Step S6.6: According to the Newton iteration method, the active output P'N of the Nth group of generators in A' is obtained from the power flow equation constraint;

[0028] Step S6.7: Calculate the penalty function value of the Nth group of generator active output P'N exceeding the generator group constraint range;

[0029] Step S6.8: Calculate the sum of fuel costs and pollution emissions of N groups of generators in the scheduling scheme A', and together with the penalty function value, form the fitness function value y'i;

[0030] Step S6.9: Calculate the kernel vector a, the specific formula is shown in (6);

[0031]

[0032] Step S6.10: Calculate the approximate optimal scheduling solution Pbest, the specific formula is shown in (7);

[0033]

[0034] Step S6.11: Calculate the new active output Pnew of the generator set. The specific formula is shown in (8);

[0035]

[0036] Among them, rand is a random number in [0,1];

[0037] S7. If the maximum number of iterations is reached, the optimal generator output Pgbest is output; otherwise, go to S3.

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

[0039] The present invention uses a hybrid core search and slime mold optimization algorithm to improve the original core search optimization algorithm, avoids falling into a local optimal solution, and can solve a more economical and less polluting power economic dispatching plan. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 . Schematic diagram of the method framework flow chart; DETAILED DESCRIPTION

[0041] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0042] like Figure 1 As shown in the embodiment of the present invention, a method for power economic emission scheduling based on a hybrid core search and slime mold optimization algorithm is proposed, comprising the steps of:

[0043] S1. The weighted sum method is used to transform the two objective functions of fuel cost and pollution emission into a single objective optimization function, and the economic emission dispatch model of the power system is established by combining the power system flow equation constraint and the active output constraint of the generator set. The specific form is:

[0044] The specific form of fuel cost is:

[0045]

[0046] Where N is the number of generator sets in the system; P i is the active output of the i-th generator set; a i , b i and c i is the fuel cost coefficient of the i-th group of generators; e i and f i is the valve point effect coefficient.

[0047] The specific forms of pollution emissions are:

[0048]

[0049] where α i , β i , γ i , η i and δ i is the pollution emission coefficient.

[0050] The weighted sum method is used to transform fuel cost and pollution emission into a single objective function:

[0051] F=wC+γ(1-w)E

[0052] Where w is the summing weight factor and γ is the scaling factor.

[0053] The power system flow equation constraint is

[0054]

[0055] Among them, P D is the user load demand, P L is the transmission network loss, B ij is the network loss coefficient.

[0056] The active output constraint of the generator set is:

[0057] P i min ≤P i ≤P i max

[0058] Where P i max and P i min are the upper and lower limits of the active output of the i-th generator set.

[0059] S2. Suppose that N groups of generators have active output that needs to be dispatched, randomly initialize M dispatching schemes, and calculate the active output P of N-1 groups according to formula (1) i , i=1,2,…N-1, together constitute the active output scheme matrix A of the generator set;

[0060]

[0061] Where P imin and P imax are the upper and lower limits of the active output of the i-th generator set, respectively, and rand is a random number in [0,1];

[0062] S3. According to the Newton iteration method, the active output P of the Nth group of generators in A is obtained from the power flow equation constraints. N . Here are the iterative solution steps:

[0063] S3.1 Based on the active output P of N-1 generator sets i , find the initial active output of the Nth generator set:

[0064]

[0065] in is the initial active output of the Nth generator set.

[0066] S3.2 Based on the active output P of N generator sets i, find the active power loss of the system:

[0067] in

[0068] S3.3 Based on user load P D , N-1 generator sets have active output P i , the system active power loss Find the new active output of the Nth generator set

[0069]

[0070] S3.4 Calculation error If ε> allowable error, return to step S4.2; otherwise save and exit.

[0071] S4. Calculate the active output P of the Nth group of generators N The penalty function value for exceeding the constraints of the generator set. The specific form of the penalty function is as follows:

[0072]

[0073] Where λ is the penalty factor.

[0074] S5. Calculate the sum of fuel costs and pollution emissions of N groups of generators in the scheduling plan A, and together with the penalty function value, form the fitness function value y i , and then normalized to [0,1];

[0075] The specific process is

[0076]

[0077] S6. Execute the hybrid core search and slime mold optimization algorithm to update the active output P of the generator set i

[0078] Step S6.1: Sort the fitness values ​​yi from small to large to form a new fitness sequence y, whose minimum fitness value is ybest and the maximum fitness value is yworst;

[0079] Step S6.2: Calculate the range of the position update speed vb, as shown in formula (2);

[0080]

[0081] Among them, t is the current iteration number, M is the total iteration number;

[0082] Step S6.3: Calculate the weight W of the slime mold optimization algorithm, as shown in formula (3);

[0083]

[0084] where y best is the optimal fitness value, median(y) represents the median of fitness y;

[0085] Step S6.4: Calculate the active output P of group N-1 i ′, as shown in formula (4);

[0086] P i ′=P best +vb*(W*P A -P B ) (4)

[0087] P best is the position of the individual with the highest fitness value currently found, P A and P B For two randomly selected

[0088] Step S6.5: From N-1 groups of active output P i ′, and obtain the new scheduling matrix A′, as shown in formula (5);

[0089]

[0090] S6.6. According to the Newton iteration method, the active output P of the Nth group of generators in A' is obtained from the power flow equation constraints. N . Here are the iterative solution steps:

[0091] S6.7 Based on the active output P of N-1 generator sets i ′, find the initial active output of the Nth generator set:

[0092]

[0093] in is the initial active output of the Nth generator set.

[0094] S6.8 Based on the active output P of N generator sets i ′, calculate the active power loss of the system:

[0095] in

[0096] S6.9 Based on user load P D , N-1 generator sets have active output P i ′, the active power loss of the system Find the new active output of the Nth generator set

[0097]

[0098] S6.10 Calculation error If ε> allowable error, return to step S4.2; otherwise save and exit.

[0099] S6.11 Calculate the active output P of the Nth group of generators N The penalty function value for exceeding the constraints of the generator set. The specific form of the penalty function is as follows:

[0100]

[0101] Where λ is the penalty factor.

[0102] S6.12 Calculate the sum of fuel costs and pollution emissions of N groups of generators in scheduling schemes A and A', and together with the penalty function value, form the fitness function value y i and y' i , and then normalized to [0,1];

[0103] The specific process is

[0104]

[0105] Step S6.13: Calculate the kernel vector a, the specific formula is shown in (6);

[0106]

[0107] Step S6.14: Calculate the approximate optimal scheduling solution Pbest, the specific formula is shown in (7);

[0108]

[0109] Step S6.15: Calculate the new active output Pnew of the generator set. The specific formula is shown in (8);

[0110]

[0111] S7. If the maximum number of iterations is reached, the optimal generator output P is output gbest ; Otherwise, go to S3;

[0112] Here, rand is a random number in the range [0,1].

[0113] Optimal generator output P gbest That is the optimal electricity economic emission dispatch plan.

[0114] Obviously, the above embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the embodiments here. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the claims of the present invention.

Claims

1. A method for power economic emission dispatching based on hybrid core search and slime mold optimization, characterized in that: The following steps are involved: S1. The weighted sum method is used to transform the two objective functions of fuel cost and pollution emission into a single objective optimization function, and the economic emission dispatch model of the power system is established by combining the power system flow equation constraint and the active output constraint of the generator set; S2. Suppose that N groups of generators have active output that needs to be dispatched, randomly initialize M dispatching schemes, and calculate the active output P of N-1 groups according to formula (1): i , i=1,2,…N-1, together constitute the active output scheme matrix A of the generator set; Where P min and P max are the upper and lower limits of the active output of the i-th generator set, respectively, and rand is a random number in [0,1]; S3. According to the Newton iteration method, the active output P of the Nth group of generators in A is obtained from the power flow equation constraints. N ; S4. Calculate the active output P of the Nth group of generators N The penalty function value for exceeding the constraints of the generator set; S5. Calculate the sum of fuel costs and pollution emissions of N groups of generators in the scheduling plan A, and together with the penalty function value, form the fitness function value y i , and then normalized to [0,1]; S6. Execute the hybrid core search and slime mold optimization method to update the active output P of the generator set i , the specific steps are as follows: Step S6.1: Set the fitness y i Sort from small to large to form a new fitness sequence y, whose minimum fitness value is ybest and the maximum fitness value is yworst; Step S6.2: Calculate the position update speed vb, as shown in formula (2); Among them, t is the current iteration number, M is the total iteration number; Step S6.3: Calculate the weight W of the slime mold optimization algorithm, as shown in formula (3); Among them, rand represents a random number [0,1], and median(y) represents the median of fitness y; Step S6.4: Calculate the active output P of group N-1 i ′, as shown in formula (4); P i ′=P gbest +vb*(W*P A -P B ) (4) Among them, P gbest is the optimal active power output of the generator set, P A and P B are two individuals selected at random; Step S6.5: sequentially convert the active output P' of the generator set i Replace the active output P of the corresponding generator set in each dispatching scheme in A i , forming a new M*(N-1) scheduling matrix A', as shown in formula (5); Step S6.6: According to the Newton iteration method, the active output P' of the Nth group of generators in A' is obtained from the power flow equation constraints. N ; Step S6.7: Calculate the active output P' of the Nth group of generators N The penalty function value that exceeds the constraint range of the generator set; Step S6.8: Calculate the sum of the fuel cost and pollution emission of the N generator sets in the scheduling scheme A', and together with the penalty function value, form the fitness function value y' i ; Step S6.9: Calculate the kernel vector a, the specific formula is shown in (6); Step S6.10: Calculate the approximate optimal scheduling solution P best , the specific formula is shown in (7); Step S6.11: Calculate the new active output of the generator set P new , the specific formula is shown in (8); Among them, rand is a random number in [0,1]; S7. If the maximum number of iterations is reached, the optimal generator output P is output gbest ; Otherwise, go to S3.

Citation Information

Cited By

  • Enhanced transient search optimization method for electric power economic emission scheduling

    CN120672067A