A microgrid multi-objective optimization scheduling method and device
Through the improved Harris Hawk algorithm, using Henon chaotic mapping and gold sine strategy, the problem of local optimal solutions in microgrid optimization scheduling is solved, the operation efficiency and global optimization capabilities are improved, and more accurate power scheduling is achieved.
Patent Information
- Application Number
- CN202410957242.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2044-07-17
AI Technical Summary
The existing microgrid optimization scheduling methods are prone to falling into local optimal solutions, resulting in reduced operating efficiency and inability to achieve optimal energy allocation and utilization.
The improved Harris Eagle algorithm is used to initialize the population through Henon chaos mapping, and the global exploration is carried out in combination with the golden sine strategy to avoid local optimal solutions and improve the global optimization capability and computing efficiency of the algorithm.
It effectively avoids the algorithm from falling into local optimal solutions, improves the operating efficiency of the microgrid, obtains a more accurate power scheduling solution, and enhances global optimization capabilities and computing efficiency.
Smart Images

Figure CN118508436B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of power grid control, and in particular to a multi-objective optimization scheduling method and device for a microgrid. Background Art
[0002] Microgrids are a key component of smart grids and have dual advantages. First, microgrids act as an effective carrier between distributed power sources, loads, energy storage devices, and control units, giving full play to the economy, environmental protection, and flexibility of distributed power generation, providing users with high-quality electricity, and ensuring that users receive safe and reliable power supply. Second, the operation mode of microgrids is very flexible. It can operate in parallel with the large power grid, or it can be disconnected from the large power grid and operate in an island when the power grid system fails to ensure the power supply of important loads.
[0003] Microgrid optimization scheduling is to ensure that the microgrid can reasonably arrange distributed generation and transmission power under various constraints to achieve multiple goals such as low operating costs, low emissions, high reliability and high power generation efficiency. Microgrid optimization scheduling can effectively reduce the user's electricity costs on the demand side; on the power supply side, it can improve the stability of the power grid and reduce energy loss and environmental pollution in power production. Therefore, optimizing the scheduling of microgrids is of great practical significance.
[0004] Existing microgrid optimization scheduling methods usually construct a microgrid economic scheduling model and then obtain the optimal solution of the model. However, in the process of solving the model, the algorithm is prone to fall into a local optimal solution, resulting in reduced operating efficiency of the microgrid system and failure to achieve optimal energy allocation and utilization. Summary of the invention
[0005] To this end, the technical problem to be solved by the present invention is to overcome the problem in the prior art that the microgrid cannot achieve optimal energy distribution because the model falls into a local optimal solution.
[0006] In order to solve the above technical problems, the present invention provides a microgrid multi-objective optimization scheduling method, comprising:
[0007] Construct a microgrid economic dispatch model and define the objective function and constraints of the microgrid economic dispatch model;
[0008] The objective function of the microgrid economic dispatch model is solved by using the improved Harris Eagle algorithm to obtain the power output scheme of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period; the improved Harris Eagle algorithm includes: initializing the population of the Harris Eagle algorithm using Henon chaotic mapping, calculating the optimal particle of the current population based on the first three particles with the smallest fitness value, and updating the position of each particle in the current population using the golden sine strategy in the global exploration stage.
[0009] Preferably, the formula of the objective function of the microgrid economic dispatch model is:
[0010] Z=f1+f2
[0011] Among them, Z is the total cost of the microgrid, f1 is the operating cost of the microgrid, and f2 is the environmental protection cost of the microgrid.
[0012] Preferably, the constraints of the microgrid economic dispatch model include system power balance constraints, micro gas turbine output constraints, diesel generator output constraints, microgrid line transmission power constraints, and battery operation constraints.
[0013] Preferably, the objective function of the microgrid economic dispatch model is solved using the improved Harris Eagle algorithm, including:
[0014] The population of the Harris Eagle algorithm is initialized by using Henon chaotic mapping; the population includes a plurality of particles, each particle represents a power output scheme of a generator set and an energy storage device;
[0015] Calculate the fitness value of each particle in the population, select the first three particles with the smallest fitness value, and calculate the optimal particle of the current population; take the optimal particle of the current population as the prey, and calculate the escape energy and escape probability of the prey;
[0016] When the absolute value of the prey's escape energy is greater than or equal to 1, the global exploration phase begins, and the golden sine strategy is used to update the position of each particle in the current population. When the absolute value of the prey's escape energy is less than 1, the local development phase begins, and the position of each particle in the current population is updated.
[0017] Determine whether the current number of iterations is greater than or equal to the maximum number of iterations. If so, output the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, which is used as the power output plan of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period; if not, return to recalculate the fitness value of each particle in the current population and update the particle position.
[0018] Preferably, the population of the Harris Hawk algorithm is initialized using a Henon chaotic map, including:
[0019] Set the initial coordinate point (X0, Y0) in the Henon chaotic map;
[0020] Based on the current coordinate point, the next coordinate point is updated and calculated until all the coordinate points in the Henon chaotic map are calculated. The formula is:
[0021]
[0022] Among them, A and B are the control parameters of Henon chaotic mapping; (X n , Y n ) represents the nth coordinate point, (X n+1 , Y n+1 ) represents the n+1th coordinate point; the total number of coordinate points in the Henon chaotic map is the same as the preset Harris hawk population size;
[0023] After calculating all the coordinate points of the Henon chaotic map, the position of the particle in the Harris Hawk population corresponding to each coordinate point in the Henon chaotic map is calculated, including:
[0024] Normalize each coordinate point in the Henon chaotic map, the formula is:
[0025]
[0026] Among them, (X norm,n , Y norm,n ) is the coordinate point (X n , Y n ) The normalized coordinates, Y represents the Y value set of all coordinate points in the Henon chaotic map, which is used for normalization calculation;
[0027] The normalized coordinates (X norm,n , Y norm,n ) is mapped to the search space, the formula is:
[0028]
[0029] Among them, (x n ,y n ) is the normalized coordinate (X norm,n , Y norm,n ) is mapped to the search space, x min Represents the minimum value of the x-axis in the search space, x max Indicates the maximum value of the x-axis in the search space, y min Represents the minimum value of the y-axis in the search space, y max Indicates the maximum value of the y-axis in the search space;
[0030] Search space for all coordinate points x n and n Composition of chaotic sequences Get Chaos Sequence Maximum value and minimum value Then the position of particles in the Harris Hawk population in the search space is calculated using the formula:
[0031]
[0032] in, is the position of the nth particle in the Harris Hawk population in the search space.
[0033] Preferably, the fitness value of each particle in the population is calculated, the first three particles with the smallest fitness value are selected, and the optimal particle of the current population is calculated. The formula is:
[0034]
[0035] Among them, X best (t′) represents the optimal particle of the population in the t′th iteration; a, b, and c represent the weight coefficients of the first three particles with the smallest fitness values in the t′th iteration, respectively. ibest (t′) and X jbest (t′) represent the first three particles with the smallest fitness value in the t′th iteration; f(·) represents the fitness.
[0036] Preferably, the golden sine strategy is used to update the position of each particle in the current population, and the formula is:
[0037]
[0038] x1=-π+(1-δ)·2π
[0039] x2=-π+δ·2π
[0040]
[0041] Among them, Z n (t′+1) is the position of the nth particle after the t′th iteration update, Z n (t′) is the position of the particle selected in the t′th iteration, R1 is a random number between [0, 2π], R2 is a random number between [0, π], x1 and x2 are the golden section coefficients; Xb est (t′) represents the optimal particle of the population in the t′th iteration.
[0042] Preferably, when the absolute value of the prey's escape energy is less than 1, the local development phase is entered, and the position of each particle in the current population is updated, including:
[0043] When the absolute value of the prey's escape energy is less than 1 and greater than 0.5, the prey's escape probability is judged; when the prey's escape probability is greater than or equal to 0.5, the soft encirclement strategy is executed; otherwise, the progressive rapid dive soft encirclement strategy is executed;
[0044] When the absolute value of the prey's escape energy is less than or equal to 0.5, the prey's escape probability is judged; when the prey's escape probability is greater than or equal to 0.5, the hard encirclement strategy is executed; otherwise, the progressive rapid dive hard encirclement strategy is executed.
[0045] Preferably, before outputting the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, the optimal particle is normalized by weight, and the formula is:
[0046]
[0047] in, is the normalized weight of the optimal particle, w best is the original weight of the optimal particle, N is the total number of particles in the population, and w n is the original weight of the nth particle.
[0048] The present invention also provides a microgrid multi-objective optimization scheduling device, comprising:
[0049] Model building module, used to build a microgrid economic dispatch model and define the objective function and constraints of the microgrid economic dispatch model;
[0050] The scheduling solution module is used to solve the objective function of the microgrid economic scheduling model using the improved Harris Eagle algorithm to obtain the power output of each distributed power source and energy storage device in different time periods when the total cost of the microgrid is the lowest; the improved Harris Eagle algorithm includes: using Henon chaotic mapping to initialize the population of the Harris Eagle algorithm, and using the golden sine strategy to update the position of each particle in the current population in the global exploration stage.
[0051] The above technical solution of the present invention has the following beneficial effects compared with the prior art:
[0052] A multi-objective optimization scheduling method for a microgrid described in the present invention improves the Harris Eagle algorithm, uses Henon chaotic mapping to initialize the population of the Harris Eagle algorithm, generates uniformly distributed initialization particles, improves the diversity of the initialization population, and provides better ergodicity and consistency for the Harris Eagle algorithm. In addition, the optimal particle of the current population is calculated based on the first three particles with the smallest fitness value, the diversity of the population in the iteration process is increased, the convergence speed is improved, and the algorithm is effectively prevented from falling into the local optimal solution. Further, the Levy flight strategy in the global search phase of the algorithm is replaced by the golden sine strategy, and the convergence of the algorithm is accelerated by quickly searching for feasible solutions in the unit circle near the optimal particle solution, which can effectively jump out of the local optimal solution and increase the probability of finding the global optimal solution. The improved Harris Eagle algorithm improves the global optimization capability and calculation efficiency on the basis of the original algorithm, and the obtained results are more stable. Therefore, by using the improved Harris Eagle algorithm to solve the objective function of the microgrid economic scheduling model, a more accurate power scheduling scheme can be obtained, and the operation efficiency of the microgrid is improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0053] In order to make the content of the present invention more clearly understood, the present invention is further described in detail below according to specific embodiments of the present invention in conjunction with the accompanying drawings, wherein:
[0054] Figure 1 is a flow chart of the present invention using the improved Harris Eagle algorithm to solve;
[0055] Figure 2 It is a distribution diagram of actual photovoltaic power consumption and predicted photovoltaic power consumption;
[0056] Figure 3 It is a distribution diagram of actual wind power consumption and predicted wind power consumption;
[0057] Figure 4 It is a distribution diagram of predicted photovoltaic power consumption, predicted wind power consumption and microgrid load;
[0058] Figure 5 This is a comparison chart of the optimal values solved by the traditional particle swarm algorithm and the improved Harris Eagle algorithm;
[0059] Figure 6 is the compromise solution distribution diagram of power scheduling;
[0060] Figure 7 It is the power dispatch distribution diagram with the lowest total cost of the microgrid;
[0061] Figure 8 It is the power distribution diagram with the lowest operating cost for the microgrid;
[0062] Fig. 9It is the power distribution diagram with the lowest environmental protection cost for the microgrid. DETAILED DESCRIPTION
[0063] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments so that those skilled in the art can better understand the present invention and implement it, but the embodiments are not intended to limit the present invention.
[0064] Embodiment 1
[0065] Reference Figure 1 As shown, the present invention provides a multi-objective optimization scheduling method for a microgrid, constructs a microgrid economic scheduling model, and uses the optimized Harris Eagle algorithm to solve the objective function of the microgrid economic scheduling model to obtain the power output scheme of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period. The specific steps of the present invention are introduced below.
[0066] Construct a microgrid economic dispatch model. The formula of the objective function of the microgrid economic dispatch model is:
[0067] Z=f1+f2
[0068] Among them, Z is the total cost of the microgrid, f1 is the operating cost of the microgrid, and f2 is the environmental protection cost of the microgrid.
[0069] The formula for the microgrid operating cost f1 is:
[0070]
[0071] Where T represents the dispatch cycle length of the microgrid economic dispatch model, t represents the time, and C g (t) represents the total cost of interaction between the microgrid and the large grid, C MT (t) represents the total operating cost of the gas turbine, C DE (t) represents the total operating cost of the diesel generator; C b (t) represents the cost of the microgrid purchasing electricity from the large grid, C sl (t) represents the cost of selling electricity from the microgrid to the large grid; c b (t) represents the unit cost of the microgrid purchasing electricity from the large grid, P b (t) represents the power purchased by the microgrid from the large grid, c sl (t) represents the unit price of electricity sold by the microgrid to the large grid, P sl (t) represents the power sold by the microgrid to the large grid; C MT.OM (t) represents the operation and maintenance cost of the gas turbine, C MT.F (t) represents the fuel cost of the gas turbine; C DE.OM (t) represents the operation and maintenance cost of the diesel generator, CDE.F (t) represents the fuel cost of the diesel generator.
[0072] The formula for microgrid environmental protection cost f2 is:
[0073]
[0074] Among them, C G.EN (t) represents the pollutant treatment cost of the large power grid, C MT.EN (t) represents the pollutant treatment cost of the gas turbine, C DE.EN (t) represents the pollutant treatment cost of diesel generators; N C Indicates the total number of pollutant types, C i is the cost coefficient for treating the i-th type of pollutant, γ g,i It represents the emission of the i-th type of pollutant generated by the operation of the large power grid.
[0075] The constraints of the microgrid economic dispatch model include system power balance constraints, micro gas turbine output constraints, diesel generator output constraints, microgrid line transmission power constraints, and battery operation constraints.
[0076] The formula for the system power balance constraint is:
[0077] P load (t) = P WT (t)+P PV (t)+P MT (t)+P bs (t)+P DE (t)+P g (t)
[0078] Among them, P load (t) represents the load power demand at time t, P WT (t) represents the output power of the wind turbine at time t, P PV (t) represents the output power of the photovoltaic cell at time t, P MT (t) represents the active output power of the micro gas turbine at time t, P bs (t) represents the charging and discharging power of the battery at time t, P DE (t) represents the diesel generator power at time t, P g (t) represents the transmission power of the microgrid line at time t.
[0079] The formula for the micro gas turbine output constraint includes:
[0080]
[0081] Among them, P MT,min (t) and PMT,max (t) represent the minimum and maximum power of the micro gas turbine, P MT (t-1) represents the active output power of the micro gas turbine at time t-1, r MT represents the ramp power constraint of the micro gas turbine, Q MT (t) represents the heat output of the micro gas turbine at time t, Q MT,min (t) and Q MT,max (t) represent the lower and upper limits of the heat output of the micro gas turbine respectively; represents the cooling output of the micro gas turbine at time t, and Indicates the lower and upper limits of the cooling output of the micro gas turbine; represents the heat output of the micro gas turbine at time t; and Indicates the lower and upper limits of the cooling output of the micro gas turbine at time t.
[0082] The formula for the diesel generator output constraint includes:
[0083]
[0084] Among them, P DE,min (t) and P DE,max (t) represent the minimum and maximum power of the diesel generator, P DE (t-1) represents the diesel generator power at time t-1, r DE Represents the ramp power constraint of the diesel generator.
[0085] The formula for the microgrid line transmission power constraint includes:
[0086] P g,min (t)≤P g (t)≤P g,max (t)
[0087] Among them, P g,min (t) and P g,max (t) represent the lower and upper limits of the transmission power of the microgrid line, respectively.
[0088] The formula for the battery operation constraint includes:
[0089]
[0090] Among them, P bs,min (t) and P bs,max (t) represents the lower and upper limits of the battery’s charge and discharge power, E bs (t) represents the energy storage capacity of the battery, E bs,min (t) and Ebs,max (t) represents the lower and upper limits of the energy storage capacity of the battery.
[0091] The present invention uses the improved Harris Eagle algorithm to solve the objective function of the microgrid economic dispatch model, and obtains the power output scheme of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period, that is, P WT (t), P PV (t), P MT (t), P bs (t), P DE (t) and P g (t). Specifically, it includes the following steps:
[0092] S10. In order to improve the diversity of the population, the population of the Harris Eagle algorithm is initialized using Henon chaotic mapping. The population includes a number of particles, each of which represents a power output scheme of a generator set and an energy storage device.
[0093] The two-dimensional trajectory generated by the Henon chaotic map has a complex structure and can be used to initialize the population of multidimensional optimization problems. By controlling the values of parameters A and B, the initial population distribution of different shapes can be obtained, thereby effectively improving the global search capability of the Harris Eagle algorithm. The specific steps include:
[0094] S101, setting the initial coordinate point (X0, Y0) in the Henon chaotic map;
[0095] S102, based on the current coordinate point, update and calculate the next coordinate point until all coordinate points in the Henon chaotic map are calculated. The formula is:
[0096]
[0097] Among them, A and B are the control parameters of Henon chaotic mapping, which are used to adjust the shape and behavior of the trajectory generated by the mapping; (X n , Y n ) represents the nth coordinate point, (X n+1 , Y n+1 ) represents the n+1th coordinate point; the total number of coordinate points in the Henon chaotic map is the same as the preset Harris hawk population size;
[0098] S103, after all coordinate points of the Henon chaotic map are calculated, the position of the particle in the Harris Hawk population corresponding to each coordinate point in the Henon chaotic map is calculated, including:
[0099] Normalize each coordinate point in the Henon chaotic map, the formula is:
[0100]
[0101] Among them, (X norm,n , Y norm,n ) is the coordinate point (X n , Y n ) The normalized coordinates, Y represents the Y value set of all coordinate points in the Henon chaotic map, which is used for normalization calculation;
[0102] The normalized coordinates (X norm,n , Y norm,n ) is mapped to the search space, the formula is:
[0103]
[0104] Among them, (x n ,y n ) is the normalized coordinate (X norm,n , Y norm,n ) is mapped to the search space, x min Represents the minimum value of the x-axis in the search space, x max Indicates the maximum value of the x-axis in the search space, y min Represents the minimum value of the y-axis in the search space, y max Indicates the maximum value of the y-axis in the search space;
[0105] Search space for all coordinate points x n and n Composition of chaotic sequences Get Chaos Sequence Maximum value and minimum value Then the position of particles in the Harris Hawk population in the search space is calculated using the formula:
[0106]
[0107] in, is the position of the nth particle in the Harris Hawk population in the search space.
[0108] After using Henon chaotic mapping, the particles of the initial population are evenly distributed in the search space. However, when Henon chaotic mapping is not used for optimization, there is a phenomenon of particle aggregation. Therefore, using Henon mapping to initialize the population distribution of Harris hawks can improve population diversity to a certain extent.
[0109] S20, calculating the fitness value of each particle in the population, selecting the first three particles with the smallest fitness value, and calculating the optimal particle of the current population; taking the optimal particle of the current population as the prey, and calculating the escape energy E of the prey and the prey escape probability β.
[0110] As the number of iterations increases, the Harris Hawk algorithm often falls into a local optimum, resulting in a slow convergence speed. The reason is that the Harris Hawk algorithm is too dependent on the optimal particle in the population, resulting in a decrease in population diversity. Therefore, in order to improve the effectiveness of other particles in the population and increase the diversity of the population, the present invention introduces an elite group strategy, which selects the first three particles with the smallest fitness value to calculate the optimal particle of the current population. The formula is:
[0111]
[0112] Among them, X best (t′) represents the optimal particle of the population in the t′th iteration; a, b, and c represent the weight coefficients of the first three particles with the smallest fitness values in the t′th iteration, respectively. ibest (t′) and X jbest (t′) represent the first three particles with the smallest fitness value in the t′th iteration; f(·) represents the fitness.
[0113] S30, when the absolute value of the prey's escape energy is greater than or equal to 1, the global exploration phase is entered, and the position of each particle in the current population is updated;
[0114] When the absolute value of the prey's escape energy is less than 1, the local development phase begins, and the positions of each particle in the current population are updated, including:
[0115] When the absolute value of the prey's escape energy is less than 1 and greater than 0.5, the prey's escape probability is judged; when the prey's escape probability is greater than or equal to 0.5, the soft encirclement strategy is executed; otherwise, the progressive rapid dive soft encirclement strategy is executed;
[0116] When the absolute value of the prey's escape energy is less than or equal to 0.5, the prey's escape probability is judged; when the prey's escape probability is greater than or equal to 0.5, the hard encirclement strategy is executed; otherwise, the progressive rapid dive hard encirclement strategy is executed.
[0117] Preferably, in the global exploration stage, the present invention replaces the Levy flight strategy in the original Harris Hawk algorithm with the golden sine strategy to update the position of each particle in the current population. In the standard Harris Hawk algorithm, the Levy flight strategy is mainly used in the global exploration stage to help the eagle group explore a wider search space. Specifically, when the Harris Hawk determines that there is no better solution around the current optimal solution, they will randomly jump to a new position by executing the Levy flight strategy, which can effectively jump out of the local optimal solution and increase the probability of finding the global optimal solution. The golden sine strategy used in the present invention can quickly traverse the search space, has better traversal and search efficiency than the Levy flight strategy, and can quickly search for feasible solutions within the unit circle near the optimal particle to accelerate the convergence of the algorithm.
[0118] The golden sine strategy is used to update the position of each particle in the current population. The formula includes:
[0119]
[0120] x1=-π+(1-δ)·2π
[0121] x2=-π+δ·2π
[0122]
[0123] Among them, Z n (t′+1) is the position of the nth particle after the t′th iteration update, Z n (t′) is the position of the particle selected in the t′th iteration, R1 is a random number between [0, 2π], R2 is a random number between [0, π], x1 and x2 are the golden section coefficients; X best (t′) represents the optimal particle of the population in the t′th iteration.
[0124] The golden sine strategy is mainly used to enhance the Harris Eagle algorithm's ability to explore the solution space during the iteration process, especially when the algorithm needs to jump out of the local optimal solution to find the global optimal solution.
[0125] S40, determine whether the current number of iterations is greater than or equal to the maximum number of iterations. If so, output the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, which is used as the power output of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period; if not, return to S20 to recalculate the fitness value of each particle in the current population and update the particle position.
[0126] Preferably, before outputting the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, the optimal particle is normalized in weight to adjust the influence of each particle to ensure that the contribution of each particle is balanced in the final result and to avoid some particles having too much or too little influence on the final result. The specific formula is:
[0127]
[0128] in, is the normalized weight of the optimal particle, w best is the original weight of the optimal particle, N is the total number of particles in the population, and w n is the original weight of the nth particle.
[0129] In summary, the multi-objective optimization scheduling method of a microgrid described in the present invention improves the Harris Eagle algorithm, uses Henon chaotic mapping to initialize the population of the Harris Eagle algorithm, generates uniformly distributed initialization particles, improves the diversity of the initialization population, and provides better ergodicity and consistency for the Harris Eagle algorithm. In addition, the optimal particle of the current population is calculated based on the first three particles with the smallest fitness value, the diversity of the population in the iteration process is increased, the convergence speed is improved, and the algorithm is effectively prevented from falling into the local optimal solution. Further, the Levy flight strategy in the global search phase of the algorithm is replaced by the golden sine strategy, and the convergence of the algorithm is accelerated by quickly searching for feasible solutions in the unit circle near the optimal particle solution, which can effectively jump out of the local optimal solution and increase the probability of finding the global optimal solution. The improved Harris Eagle algorithm improves the global optimization capability and computational efficiency on the basis of the original algorithm, and the results obtained are more stable. Therefore, the objective function of the microgrid economic scheduling model is solved by using the improved Harris Eagle algorithm, and a more accurate power scheduling scheme can be obtained, which improves the operation efficiency of the microgrid.
[0130] Embodiment 2
[0131] Based on a microgrid multi-objective optimization scheduling method proposed in Example 1, this embodiment uses matlab programming simulation to verify the effect of the above method. The microgrid uses multiple distributed power sources, such as photovoltaic (PV), wind turbine (WT), micro gas turbine (MT), and diesel engine (DE). The operation-related parameters and costs are shown in Table 1. At the same time, considering the cost of environmental protection, the pollution emission coefficient and cost parameters in the objective function of the microgrid economic scheduling model are shown in Table 2. The battery energy storage parameters are shown in Table 3.
[0132] Table 1. Microgrid unit parameters
[0133]
[0134] Table 2. Pollutant emission coefficients and costs
[0135]
[0136] Table 3. Battery parameters
[0137]
[0138] The results of the simulation analysis can be found in Figure 2 , Figure 3 and Figure 4 . Figure 2 It is a distribution diagram of actual photovoltaic power consumption and predicted photovoltaic power consumption. Figure 3 It is a distribution diagram of actual wind power consumption and predicted wind power consumption. Figure 4It is a distribution diagram of predicted photovoltaic power consumption, predicted wind power consumption and microgrid load.
[0139] In the process of solving the objective function of the microgrid economic dispatch model, this embodiment compares the traditional particle swarm algorithm with the improved Harris Eagle algorithm of the present invention. The comparison results are shown in Table 4.
[0140] Table 4. Algorithm comparison results
[0141]
[0142] As shown in Table 4, under the same 100 iterations, the iteration time of the improved Harris Eagle algorithm of the present invention is improved by 10.7% compared with the traditional particle swarm algorithm; the optimal value and average value are obviously better than those obtained by the traditional particle swarm algorithm. Ten experiments were conducted to compare the optimal values obtained by the two algorithms. The results are shown in Figure 4. Figure 5 As shown, it can be seen that the result calculated by the improved Harris Eagle algorithm of the present invention is better.
[0143] The multi-objective optimization scheduling method for microgrids proposed in the present invention aims to minimize the total cost of the microgrid, namely the operating cost and environmental cost of the microgrid. In order to evaluate the impact of the objective function on the scheduling results, this embodiment discusses the scheduling results when different objective functions are used. Figure 6 , Figure 7 , Figure 8 as well as Fig. 9 shown. Figure 6 It is the compromise solution distribution diagram of power scheduling. Figure 7 It is the power dispatch distribution diagram with the lowest total cost of the microgrid. Figure 8 It is the power distribution diagram with the lowest operating cost for the microgrid. Fig. 9 This is the power distribution diagram with the lowest environmental protection cost for the microgrid. Among them, BESS represents the battery, DE represents the diesel generator, Grid represents the main grid, and MT represents the micro gas turbine.
[0144] Depend on Figure 6 , Figure 7 , Figure 8 as well as Fig. 9It can be seen that energy storage plays an auxiliary regulatory role, and its charging and discharging strategies are adjusted according to the changes in electricity prices. It charges when the electricity price is low and discharges when the electricity price is high, thereby reducing the economic and environmental costs of the microgrid. Since the power generation of photovoltaic and wind power cannot fully meet the load demand, the microgrid must purchase electricity from the main grid and rely on distributed power sources to output electricity to meet the load demand. When the operating cost is used as the objective function, the microgrid preferentially uses gas turbines to generate electricity to meet the load demand, because the power generation cost of gas turbines is lower than other power generation methods. When the environmental protection cost is used as the objective function, the output power of the gas turbine is much higher than other power generation methods and purchased power. According to Table 2, the sulfur dioxide and nitrogen oxide emissions of gas turbines are small, and the governance cost is much lower than the governance cost of carbon dioxide. Therefore, the environmental protection cost of gas turbines is low. When the total cost is used as the objective function, after comprehensively considering the operating cost and environmental protection cost, gas turbines and distributed power sources basically meet the load demand, because the comprehensive benefits of gas turbines and distributed power sources are higher than the comprehensive benefits of purchasing electricity from the main grid.
[0145] Based on the microgrid multi-objective optimization scheduling method proposed in the first embodiment, this embodiment further provides a microgrid multi-objective optimization scheduling device, including:
[0146] Model building module, used to build a microgrid economic dispatch model and define the objective function and constraints of the microgrid economic dispatch model;
[0147] The scheduling solution module is used to solve the objective function of the microgrid economic scheduling model using the improved Harris Eagle algorithm to obtain the power output of each distributed power source and energy storage device in different time periods when the total cost of the microgrid is the lowest; the improved Harris Eagle algorithm includes: using Henon chaotic mapping to initialize the population of the Harris Eagle algorithm, and using the golden sine strategy to update the position of each particle in the current population in the global exploration stage.
[0148] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0149] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0150] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0151] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0152] Obviously, the above embodiments are merely examples for the purpose of clear explanation and are not intended to limit the implementation methods. 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 implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the present invention.
Claims
1. A multi-objective optimization scheduling method for a microgrid, characterized in that: include: Construct a microgrid economic dispatch model and define the objective function and constraints of the microgrid economic dispatch model; The improved Harris Eagle algorithm is used to solve the objective function of the microgrid economic dispatch model, and the power output scheme of each generator set and energy storage device is obtained when the total cost of the microgrid is the lowest in the current time period; including: The population of the Harris Eagle algorithm is initialized by using Henon chaotic mapping; the population includes a number of particles, each particle represents a power output scheme of a generator set and an energy storage device; specifically, it includes: Set the initial coordinate point (X0, Y0) in the Henon chaotic map; Based on the current coordinate point, the next coordinate point is updated and calculated until all the coordinate points in the Henon chaotic map are calculated. The formula is: Among them, A and B are the control parameters of Henon chaotic mapping; (X n ,Y n ) represents the nth coordinate point, (X n+1 ,Y n+1 ) represents the n+1th coordinate point; the total number of coordinate points in the Henon chaotic map is the same as the preset Harris hawk population size; After calculating all the coordinate points of the Henon chaotic map, the position of the particle in the Harris Hawk population corresponding to each coordinate point in the Henon chaotic map is calculated, including: Normalize each coordinate point in the Henon chaotic map, the formula is: Among them, (X norm,n ,Y norm,n ) is the coordinate point (X n ,Y n ) The normalized coordinates, Y represents the Y value set of all coordinate points in the Henon chaotic map, which is used for normalization calculation; The normalized coordinates (X norm,n ,Y norm,n ) is mapped to the search space, the formula is: Among them, (x n ,y n ) is the normalized coordinate (X norm,n ,Y norm,n ) is mapped to the search space, x min Represents the minimum value of the x-axis in the search space, x max Indicates the maximum value of the x-axis in the search space, y min Represents the minimum value of the y-axis in the search space, y max Represents the maximum value of the y-axis in the search space; the x-axis of all coordinate points in the search space n and n Composition of chaotic sequences Get Chaos Sequence Maximum value and minimum value Then the position of particles in the Harris Hawk population in the search space is calculated using the formula: in, is the position of the nth particle in the Harris Hawk population in the search space; Calculate the fitness value of each particle in the population, select the first three particles with the smallest fitness value, and calculate the optimal particle of the current population. The formula is: Among them, X best (t') represents the optimal particle of the population in the t'th iteration; a, b and c represent the weight coefficients of the first three particles with the smallest fitness value in the t'th iteration, respectively. ibest (t') and X jbest (t') respectively represent the first three particles with the smallest fitness value in the t'th iteration; f(·) represents the fitness; The optimal particle of the current population is taken as the prey, and the escape energy and escape probability of the prey are calculated; when the absolute value of the escape energy of the prey is greater than or equal to 1, the global exploration phase is entered, and the position of each particle in the current population is updated using the golden sine strategy. The formula is: Z n (t'+1)=Z n (t')|sin(R1)|+R2sin(R1)|x1X best (t')-x2Z n (t')| x1=-π+(1-δ)·2π x2=-π+δ·2π Among them, Z n (t'+1) is the position of the nth particle after the t'th iteration update, Z n (t') is the position of the particle selected in the t'th iteration, R1 is a random number between [0,2π], R2 is a random number between [0,π], x1 and x2 are the golden section coefficients; X best (t') represents the optimal particle of the population in the t'th iteration; when the absolute value of the prey's escape energy is less than 1, it enters the local development stage and updates the position of each particle in the current population; Determine whether the current number of iterations is greater than or equal to the maximum number of iterations. If so, output the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, which is used as the power output plan of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period; if not, return to recalculate the fitness value of each particle in the current population and update the particle position.
2. A microgrid multi-objective optimization scheduling method according to claim 1, characterized in that: The formula of the objective function of the microgrid economic dispatch model is: Z=f1+f2 Among them, Z is the total cost of the microgrid, f1 is the operating cost of the microgrid, and f2 is the environmental protection cost of the microgrid.
3. A microgrid multi-objective optimization scheduling method according to claim 1, characterized in that: The constraints of the microgrid economic dispatch model include system power balance constraints, micro gas turbine output constraints, diesel generator output constraints, microgrid line transmission power constraints and battery operation constraints.
4. A microgrid multi-objective optimization scheduling method according to claim 1, characterized in that: When the absolute value of the prey's escape energy is less than 1, the local development phase begins, and the positions of each particle in the current population are updated, including: When the absolute value of the prey's escape energy is less than 1 and greater than 0.5, the prey's escape probability is judged; when the prey's escape probability is greater than or equal to 0.5, the soft encirclement strategy is executed; otherwise, the progressive rapid dive soft encirclement strategy is executed; When the absolute value of the prey's escape energy is less than or equal to 0.5, the prey's escape probability is judged; When the probability of prey escape is greater than or equal to 0.5, the hard encirclement strategy is executed; otherwise, the progressive rapid dive hard encirclement strategy is executed.
5. A microgrid multi-objective optimization scheduling method according to claim 1, characterized in that: Before outputting the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, the optimal particle is normalized by weight, and the formula is: in, is the normalized weight of the optimal particle, w best is the original weight of the optimal particle, N is the total number of particles in the population, and w n is the original weight of the nth particle.
6. A microgrid multi-objective optimization dispatching device, characterized in that: include: Model building module, used to build a microgrid economic dispatch model and define the objective function and constraints of the microgrid economic dispatch model; The dispatch solution module is used to solve the objective function of the microgrid economic dispatch model using the improved Harris Eagle algorithm to obtain the power output of each distributed power source and energy storage device in different time periods when the total cost of the microgrid is the lowest, including: The population of the Harris Eagle algorithm is initialized by using Henon chaotic mapping; the population includes a number of particles, each particle represents a power output scheme of a generator set and an energy storage device; specifically, it includes: Set the initial coordinate point (X0, Y0) in the Henon chaotic map; Based on the current coordinate point, the next coordinate point is updated and calculated until all the coordinate points in the Henon chaotic map are calculated. The formula is: Among them, A and B are the control parameters of Henon chaotic mapping; (X n ,Y n ) represents the nth coordinate point, (X n+1 ,Y n+1 ) represents the n+1th coordinate point; the total number of coordinate points in the Henon chaotic map is the same as the preset Harris hawk population size; After calculating all the coordinate points of the Henon chaotic map, the position of the particle in the Harris Hawk population corresponding to each coordinate point in the Henon chaotic map is calculated, including: Normalize each coordinate point in the Henon chaotic map, the formula is: Among them, (X norm,n ,X norm,n ) is the coordinate point (X n ,Y n ) The normalized coordinates, Y represents the Y value set of all coordinate points in the Henon chaotic map, which is used for normalization calculation; The normalized coordinates (X norm,n ,Y norm,n ) is mapped to the search space, the formula is: Among them, (x n ,y n ) is the normalized coordinate (X norm,n ,Y norm,n ) is mapped to the search space, x min Represents the minimum value of the x-axis in the search space, x max Indicates the maximum value of the x-axis in the search space, y min Represents the minimum value of the y-axis in the search space, y max Represents the maximum value of the y-axis in the search space; the x-axis of all coordinate points in the search space n and n Composition of chaotic sequences Get Chaos Sequence Maximum value and minimum value Then the position of particles in the Harris Hawk population in the search space is calculated using the formula: in, is the position of the nth particle in the Harris Hawk population in the search space; Calculate the fitness value of each particle in the population, select the first three particles with the smallest fitness value, and calculate the optimal particle of the current population. The formula is: Among them, X best (t') represents the optimal particle of the population in the t'th iteration; a, b and c represent the weight coefficients of the first three particles with the smallest fitness value in the t'th iteration, respectively. ibest (t') and X jbest (t') respectively represent the first three particles with the smallest fitness value in the t'th iteration; f(·) represents the fitness; Take the optimal particle of the current population as the prey, and calculate the prey's escape energy and prey escape probability; When the absolute value of the prey's escape energy is greater than or equal to 1, the global exploration phase begins, and the golden sine strategy is used to update the position of each particle in the current population. The formula is: Z n (t'+1)=Z n (t')|sin(R1)|+R2sin(R1)|x1X best (t')-x2Z n (t')| x1=-π+(1-δ)·2π x2=-π+δ·2π Among them, Z n (t'+1) is the position of the nth particle after the t'th iteration update, Z n (t') is the position of the particle selected in the t'th iteration, R1 is a random number between [0,2π], R2 is a random number between [0,π], x1 and x2 are the golden section coefficients; X best (t') represents the optimal particle of the population in the t'th iteration; When the absolute value of the prey's escape energy is less than 1, the local development phase begins, and the position of each particle in the current population is updated; Determine whether the current number of iterations is greater than or equal to the maximum number of iterations. If so, output the optimal particle of the current population as the optimal solution of the objective function of the microgrid economic dispatch model, which is used as the power output plan of each generator set and energy storage device when the total cost of the microgrid is the lowest in the current time period; if not, return to recalculate the fitness value of each particle in the current population and update the particle position.
