Load-side resource optimization decision-making methods, systems, equipment, and media
By employing a hierarchical and time-segmented scheduling method and an improved tabu-Harris Eagle algorithm, a load-side resource optimization scheduling model is established. This model solves the power balance uncertainty problem in load-side resource balance analysis, enabling rapid and accurate optimization scheduling of the power grid and efficient utilization of resources.
Patent Information
- Application Number
- CN202211700500.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-12-28
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2042-12-28
AI Technical Summary
Existing technologies fail to effectively account for the multi-timescale coupling characteristics of users' production and residential electricity demand in load-side resource balance analysis, resulting in insufficient analysis of power balance uncertainty and making it difficult to achieve rapid and accurate optimized scheduling of the power grid.
By adopting a hierarchical and time-segmented scheduling method, the potential for regulating various loads is explored, and an optimized scheduling model based on priority load-side resources participating in power grid balance is established. The improved tabu-Harris Eagle algorithm is then used to solve the problem, thereby optimizing peak shaving and valley filling.
It enables refined scheduling of load-side resources, makes rational use of various load resources, reduces costs, improves the speed and accuracy of power grid balancing, and avoids the local optimum problem of traditional algorithms.
Smart Images

Figure CN115776115B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of power grid peak shaving, and specifically relates to a load-side resource optimization decision-making method, system, equipment and medium. Background Technology
[0002] In terms of load-side resource balancing capacity analysis, current research is mostly based on physical modeling methods, which cannot account for the impact of multi-timescale coupling characteristics caused by users' production and living electricity demand on power balance. In addition, with the construction of local power generation, grid, load and storage platforms in North China, Jiangsu, Zhejiang, Beijing and other regions, a certain amount of historical operation data of load-side resources has been accumulated. It is necessary to conduct further analysis on the uncertainty and other characteristics of load-side resources participating in power balance based on data mining methods. Summary of the Invention
[0003] The purpose of this invention is to provide a load-side resource optimization decision-making method, system, device, and medium to solve the problems existing in the prior art. This invention can quickly and accurately find the optimal solution and achieve power grid balance.
[0004] To achieve the above objectives, the present invention adopts the following technical solution:
[0005] Load-side resource optimization decision-making methods include:
[0006] By employing tiered and time-segmented scheduling methods, we can tap into the potential for adjusting various loads.
[0007] An optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling is established based on the regulation potential of various loads.
[0008] The optimal scheduling model is solved to obtain the adjustment amounts for various types of loads.
[0009] Furthermore, the method of hierarchical and time-segmented scheduling is used to tap into the potential for various load adjustments, specifically as follows:
[0010] For peak load periods, within a specified time period, a preset percentage is set for each peak reduction. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential has reached its maximum value for that period. The objective function is as follows:
[0011]
[0012]
[0013] ΔP'=P' car +P' tem +P' storage +P' industry
[0014] Among them, P' max P is the setpoint for the peak load after peak shaving. max P represents the maximum load before peak shaving, and P represents the average load before peak shaving. These are the start and end times of the load adjustment zone corresponding to the single preset percentage value for peak shaving. These are the start and end times of the load adjustment zone corresponding to double the preset percentage for peak shaving. P' represents the start and end times of the load regulation zone corresponding to a peak shaving of three times the preset percentage, P' represents the load curve function after peak shaving, P represents the load curve function before peak shaving, and ΔP' represents the total regulation power of various loads. car To regulate the power of electric vehicles, P' tem For temperature-controlled load regulation power, P' storage To regulate the power of energy storage load, P' industry Power regulation for industrial loads.
[0015] Furthermore, the optimization scheduling model for prioritizing load-side resources to participate in grid balancing and achieve peak shaving and valley filling, based on various load regulation potentials, specifically includes:
[0016] Establish load-side resource priority assessment indicators;
[0017] Based on load-side resource priority assessment indicators, an optimized scheduling model is established with the goal of maximizing peak shaving or valley filling and minimizing operating costs.
[0018] Furthermore, the establishment of load-side resource priority assessment indicators specifically involves: determining the comprehensive weight of each influencing factor indicator from both subjective and objective perspectives based on the analytic hierarchy process (AHP) entropy weight method, as expressed below:
[0019]
[0020] Where, λ cm,q λ AHP,q λ EM,q These are the comprehensive weight, AHP weight, and entropy weight of the q-th influencing factor indicator, respectively.
[0021] The scheduling priority of dispatchable loads is evaluated based on the comprehensive weight and value of various influencing factors. Then, the scheduling priority of each dispatchable load is determined based on the magnitude of the comprehensive index value. The comprehensive index value of dispatchable load b at time t is expressed as:
[0022]
[0023] Where B is the quantity of a certain dispatchable load; n is the total number of influencing factor indicators; Db,q Let q be the value of the schedulable load b.
[0024] Furthermore, the optimization scheduling model established with the objectives of maximizing peak shaving or valley filling and minimizing operating costs specifically includes:
[0025] First, the goal is to maximize peak shaving or valley filling during peak or off-peak periods:
[0026]
[0027] Where F is the objective function, P'(t) is the total load before adjustment, P(t) is the total load after adjustment, and t is the total load after adjustment. c ,t n These are the start and end times of peak or trough loads, respectively.
[0028] Second, the goal is to minimize the load adjustment cost at all times:
[0029]
[0030] Where k1, k2, k3, and k4 are the unit load adjustment cost coefficients for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively. These represent the peak reduction amounts at time t for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively.
[0031] Third, set constraints for electric vehicles, temperature-controlled loads, industrial loads, energy storage loads, and peak shaving.
[0032] The constraints on the electric vehicle are expressed as follows:
[0033]
[0034]
[0035] in, This represents the maximum peak reduction of electric vehicle load at time t, calculated by the electric vehicle load reduction potential model based on the load curve. This represents the actual peak reduction of the electric vehicle at time t. To ensure the minimum charge factor for the normal operation of electric vehicles, The maximum charge coefficient affected by the performance of the electric vehicle battery itself;
[0036] The temperature control load constraint is expressed as follows:
[0037] T min ≤T≤T max
[0038]
[0039] Among them, T min T max The minimum and maximum set temperatures are used to ensure the comfort of the temperature-controlled load. T represents the actual operating temperature of the temperature-controlled load. This represents the maximum peak reduction of the temperature-controlled load at time t, calculated from the load curve by the temperature-controlled load reduction potential model. This represents the actual peak reduction of the temperature-controlled load at time t.
[0040] The industrial load constraint is expressed as follows:
[0041]
[0042] in, This represents the maximum peak reduction of the industrial load at time t, calculated from the load curve by the industrial load reduction potential model. This represents the actual peak reduction of the industrial load at time t.
[0043] The energy storage load constraint is expressed as follows:
[0044]
[0045]
[0046]
[0047] E start =E end
[0048] in, The minimum and maximum charge factors of the energy storage load, SOC storage This represents the actual charge factor of the energy storage load. This represents the maximum charging power of the energy storage load. E represents the maximum peak reduction of the energy storage load at time t, calculated by the energy storage load reduction potential model based on the load curve. start E end These represent the remaining electricity of the energy storage load at midnight and midnight, respectively.
[0049] The peak reduction constraint is expressed as follows:
[0050] ΔP i,min ≤ΔP i (t)≤ΔP i,max
[0051] Where, ΔP i (t) represents the actual peak reduction of the adjustable load at time t during the i-th adjustment, ΔP i,max ΔP i,minThese are the upper and lower limits of the adjustable load peak shaving amount in the i-th adjustment, respectively.
[0052] Furthermore, the optimization scheduling model is solved to obtain the adjustment amounts for various loads, specifically as follows:
[0053] An improved tabu-Harris Hawk algorithm is used to solve the optimal scheduling model, including:
[0054] Population initialization: Obtain the adjustment ranges of air conditioning load adjustment, electric vehicle adjustment, industrial load adjustment, and energy storage load adjustment, and initialize each individual according to the adjustment range;
[0055] Prey selection: Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt.
[0056] Update Harris Hawk location: Determine whether Harris Hawk is in search or development status, and update Harris Hawk location based on Harris Hawk status type;
[0057] Calculate fitness: Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey and select the position with the highest fitness as the new prey.
[0058] Iterative loop: Repeatedly update the Harris Eagle's position and calculate fitness until the maximum number of iterations is reached, and output the position of the prey, which represents the adjustment amount of various loads.
[0059] Furthermore, updating the Harris Hawk's position based on its state type specifically involves:
[0060] If the Harris Hawk is in search mode, update its position according to the following formula:
[0061]
[0062] Among them, D hawk (h+1) represents the position of the Harris Eagle after h+1 iterations; D rand (h) represents the location of the Harris Eagle randomly distributed within the specified range in the h-th iteration; D hawk (h) represents the position of the Harris Eagle before the h-th iteration; D rabbit (h) represents the position of the prey in the h-th iteration; D ave (h) represents the average position of the Harris Eagle before the h-th iteration; D down Indicates the lower boundary of the specified position; D up Indicates the upper boundary of the specified position; q h ρ1, ρ2, ρ3, and ρ4 represent random numbers, where q hThis indicates the basis for selecting different strategies;
[0063] If the Harris Eagle is in a developmental stage, its developmental strategy is selected based on the prey's escape energy and escape probability, and can be categorized as follows:
[0064] (1) When the escape energy E of the prey in the h-th iteration rabbit (h)∈(0.5,1], escape probability c rabbit When (h)∈[0,0.5], the Harris Eagle chooses a soft encirclement method to capture its prey, as shown in the following expression:
[0065] D hawk (h+1)=ΔD hawk (h)-E rabbit (h)JD rabbit (h)-D hawk (h)
[0066] In this context, J is a random number, and ΔD is a random number. hawk (h) represents the difference between the Harris Eagle's current position and the prey's position in the h-th iteration, as shown in the following expression:
[0067] ΔD hawk (h)=D rabbit (h)-D hawk (h)
[0068] (2) When the escape energy E of the prey in the h-th iteration rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈[0,0.5], the Harris Eagle chooses a hard-hitting approach to capture its prey, as shown in the following expression:
[0069] D hawk (h+1)=D rabbit (h)-E rabbit (h)ΔD hawk (h)
[0070] (3) When the escape energy E of the prey in the h-th iteration rabbit (h)∈(0.5,1], escape probability c rabbit When (h)∈(0.5,1], the Harris Eagle employs two strategies to hunt its prey: one is to use Levy's random flight; the other is to launch a soft attack on the prey. The specific expressions are as follows:
[0071]
[0072] Where f(x) represents the fitness function; and D is the position of the first Harris Hawk in h+1 iterations. hawk,1 (h+1) and the position of the second Harris Hawk Dhawk,2 The specific expression for (h+1) is as follows:
[0073] D hawk,1 (h+1)=D rabbit (h)-E rabbit (h)JD rabbit (h)-D hawk (h)
[0074] D hawk,2 (h+1)=D hawk,1 (h+1)+S·D leve (d)
[0075] In the above formula, d represents the dimension of the data; S represents a d-dimensional random variable; D leve (d) represents the flight of d-Villevee, expressed as follows:
[0076]
[0077]
[0078] In the above formula, ξ is the flight coefficient, β is a default constant, and r a and r b These are normally distributed random numbers;
[0079] 4) When the prey's escape energy E rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈(0.5,1], in addition to flying over Levi, the Harris Eagle also launches a hard attack on its prey, as shown in the following expression:
[0080]
[0081] D hawk,3 (h+1)=D rabbit (h)-E rabbit (h)|JD rabbit (h)-D ave (h)|
[0082] Among them, D hawk,3 (h+1) represents the position of the third Harris Hawk in the h+1th iteration.
[0083] The load-side resource optimization decision system includes:
[0084] Mining Module: Used to explore the adjustment potential of various loads through hierarchical and time-segmented scheduling methods;
[0085] Model building module: used to build an optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling based on the regulation potential of various loads;
[0086] Solver module: Used to solve the optimization scheduling model and obtain the adjustment amount of various loads.
[0087] Furthermore, the mining module utilizes a layered and time-segmented scheduling method to explore the potential for various load adjustments, specifically as follows:
[0088] For peak load periods, within a specified time period, a preset percentage is set for each peak reduction. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential has reached its maximum value for that period. The objective function is as follows:
[0089]
[0090] P = P + ΔP'
[0091] ΔP'=P' car +P' tem +P' storage +P' industry
[0092] Among them, P' max P is the setpoint for the peak load after peak shaving. max This represents the maximum load before peak shaving. This represents the average load before peak shaving. These are the start and end times of the load adjustment zone corresponding to the single preset percentage value for peak shaving. These are the start and end times of the load adjustment zone corresponding to double the preset percentage for peak shaving. P' represents the start and end times of the load regulation zone corresponding to a peak shaving of three times the preset percentage, P' represents the load curve function after peak shaving, P represents the load curve function before peak shaving, and ΔP' represents the total regulation power of various loads. car To regulate the power of electric vehicles, P' tem For temperature-controlled load regulation power, P' storage To regulate the power of energy storage load, P' industry Power regulation for industrial loads.
[0093] Furthermore, in the model building module, an optimized scheduling model based on priority is established for load-side resources to participate in grid balancing and achieve peak shaving and valley filling, based on various load regulation potentials. Specifically:
[0094] Establish load-side resource priority assessment indicators;
[0095] Based on load-side resource priority assessment indicators, an optimized scheduling model is established with the goal of maximizing peak shaving or valley filling and minimizing operating costs.
[0096] Furthermore, in the solution module, the optimized scheduling model is solved to obtain the adjustment amounts for various loads, specifically:
[0097] An improved tabu-Harris Hawk algorithm is used to solve the optimal scheduling model, including:
[0098] Population initialization: Obtain the adjustment ranges of air conditioning load adjustment, electric vehicle adjustment, industrial load adjustment, and energy storage load adjustment, and initialize each individual according to the adjustment range;
[0099] Prey selection: Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt.
[0100] Update Harris Hawk location: Determine whether Harris Hawk is in search or development status, and update Harris Hawk location based on Harris Hawk status type;
[0101] Calculate fitness: Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey and select the position with the highest fitness as the new prey.
[0102] Iterative loop: Repeatedly update the Harris Eagle's position and calculate fitness until the maximum number of iterations is reached, and output the position of the prey, which represents the adjustment amount of various loads.
[0103] A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the load-side resource optimization decision method.
[0104] A computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the load-side resource optimization decision-making method.
[0105] Compared with the prior art, the present invention has the following beneficial technical effects:
[0106] This invention utilizes a hierarchical and time-segmented control method to fully leverage the adjustment potential of various loads, achieving refined peak shaving and valley filling scheduling. Subsequently, it establishes a priority-based load-side resource participation grid balance optimization scheduling model, rationally utilizing load-side resources, ensuring orderly electricity use, reducing costs, and achieving better overall benefits.
[0107] Furthermore, by combining the tabu algorithm with the Harris Eagle algorithm, the problem of the traditional Harris Eagle algorithm easily getting trapped in local optima is effectively avoided, and the speed and accuracy of the solution are improved. Attached Figure Description
[0108] The accompanying drawings are provided to further understand the invention and constitute a part of this invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.
[0109] Figure 1 This is a schematic diagram of the load-side resource optimization decision-making method of the present invention;
[0110] Figure 2 This is a schematic diagram of the load-side resource optimization decision system of the present invention. Detailed Implementation
[0111] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.
[0112] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0113] Example 1
[0114] This invention provides a load-side resource optimization decision-making method, such as... Figure 1 This includes the following steps:
[0115] Step 1: Explore the potential for load regulation by using tiered and time-segmented scheduling methods.
[0116] To fully tap the regulation potential of various loads, a hierarchical and time-segmented model for load-side resource participation in power grid dispatch is established. This model employs a trial-and-error method. Taking peak load periods as an example, within a specified time period, peak reduction is performed by 1% each time. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential for that period has reached its maximum value. The objective function is as follows:
[0117]
[0118] P'=P+ΔP'
[0119] ΔP'=P' car +P' tem +P' storage +P' industry
[0120] Among them, P' max P is the setpoint for the peak load after peak shaving. max This represents the maximum load before peak shaving. This represents the average load before peak shaving. These represent the start and end times of the load adjustment zone corresponding to a 1% peak reduction. These represent the start and end times of the load adjustment zone corresponding to a 2% peak reduction. P' represents the start and end times of the load regulation zone corresponding to a 3% peak reduction, P' is the load curve function after peak reduction, P is the load curve function before peak reduction, and ΔP' is the total regulation power of various loads. car To regulate the power of electric vehicles, P' tem For temperature-controlled load regulation power, P' storage To regulate the power of energy storage load, P' industry Power regulation for industrial loads.
[0121] Step 2: Establish an optimized scheduling model based on priority for load-side resources to participate in grid balancing and achieve peak shaving and valley filling.
[0122] Step 2.1: Establish load-side resource priority assessment indicators
[0123] This invention prioritizes load-side resources within each scheduling period of a scheduling cycle and allocates scheduling resources rationally based on the priority assessment results. Based on the analytic hierarchy process (AHP) entropy weighting method, this invention determines the comprehensive weight of various influencing factors from both subjective and objective perspectives, expressed as:
[0124]
[0125] In the formula, λ cm,q λ AHP,q λ EM,q These are the comprehensive weight, AHP weight, and entropy weight of the q-th influencing factor indicator, respectively.
[0126] The scheduling priority of dispatchable loads is evaluated based on the comprehensive weight and value of various influencing factors. Then, the scheduling priority of each dispatchable load is determined based on the magnitude of the comprehensive index value. The comprehensive index value of dispatchable load b at time t is expressed as:
[0127]
[0128] In the formula, B represents the quantity of a certain dispatchable load (e.g., B EVs); n represents the total number of influencing factor indicators; D b,q Let q be the value of the schedulable load b.
[0129] Step 2.2: Establish an optimal scheduling model with the objectives of maximizing peak shaving (valley filling) and minimizing operating costs.
[0130] (1) The goal is to maximize the peak shaving (valley filling) during peak (valley) periods:
[0131]
[0132] Where F is the objective function, P'(t) is the total load before adjustment, P(t) is the total load after adjustment, and t is the total load after adjustment. c ,t n These represent the start and end times of peak (or trough) load periods, respectively.
[0133] (2) The goal is to minimize the load adjustment cost at each time point.
[0134]
[0135] Where k1, k2, k3, and k4 are the unit load adjustment cost coefficients for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively. These represent the peak reduction amounts at time t for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively.
[0136] (3) Constraints:
[0137] ① Electric vehicle load constraints
[0138]
[0139]
[0140] in, This represents the maximum peak reduction of electric vehicle load at time t, calculated by the electric vehicle load reduction potential model based on the load curve. Let be the actual adjustment amount of the electric vehicle at time t. To ensure the minimum charge factor for the normal operation of electric vehicles, This represents the maximum charge coefficient affected by the performance of the electric vehicle battery itself.
[0141] ②Temperature control load constraints
[0142] T min ≤T≤Tmax
[0143]
[0144] Among them, T min T max The minimum and maximum set temperatures are used to ensure the comfort of the temperature-controlled load. T represents the actual operating temperature of the temperature-controlled load. This represents the maximum peak reduction of the temperature-controlled load at time t, calculated from the load curve by the temperature-controlled load reduction potential model. This represents the actual peak reduction of the temperature-controlled load at time t.
[0145] ③ Industrial load constraints
[0146]
[0147] in, This represents the maximum peak reduction of the industrial load at time t, calculated from the load curve by the industrial load reduction potential model. This represents the actual peak reduction of the industrial load at time t.
[0148] ④ Energy storage load constraints
[0149]
[0150]
[0151]
[0152] E start =E end
[0153] in, The minimum and maximum charge factors of the energy storage load, SOC storage This represents the actual charge factor of the energy storage load. This represents the maximum charging power of the energy storage load. E represents the maximum peak reduction of the energy storage load at time t, calculated by the energy storage load reduction potential model based on the load curve. start E end These represent the remaining electricity of the energy storage load at midnight and midnight, respectively.
[0154] ⑤ Peak reduction constraint
[0155] ΔP i,min ≤ΔP i (t)≤ΔP i,max
[0156] Where, ΔP i(t) represents the actual peak reduction of the adjustable load at time t during the i-th adjustment, ΔP i,max ΔP i,min These are the upper and lower limits of the adjustable load peak shaving amount in the i-th adjustment, respectively.
[0157] Step 3: Solve using the improved tabu-Harris Hawk algorithm.
[0158] Step 3.1: Population Initialization
[0159] Obtain the adjustment ranges for air conditioning load adjustment, electric vehicle pump adjustment, industrial load adjustment, and energy storage load adjustment, and then initialize each individual based on these adjustment ranges.
[0160] Step 3.2: Select the prey location
[0161] Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt.
[0162] Step 3.3: Update Harris Hawk location:
[0163] First, determine the status of the Harris Hawk (search, exploration). If the Harris Hawk is in the search state, update its position according to the following formula:
[0164]
[0165] In the above formula, D hawk (h+1) represents the position of the Harris Eagle after h+1 iterations; D rand (h) represents the location of the Harris Eagle randomly distributed within the specified range in the h-th iteration; D hawk (h) represents the position of the Harris Eagle before the h-th iteration; D rabbit (h) represents the position of the prey in the h-th iteration; D ave (h) represents the average position of the Harris Eagle before the h-th iteration; D down Indicates the lower boundary of the specified position; D up Indicates the upper boundary of the specified position; q h ρ1, ρ2, ρ3, and ρ4 represent random numbers, ranging from [0,1], where q h This indicates the basis for selecting different strategies.
[0166] If the Harris Eagle is in a developmental stage, its developmental strategy is selected based on the prey's escape energy and escape probability, and can be categorized as follows:
[0167] (1) When the escape energy E of the prey in the h-th iteration rabbit (h)∈(0.5,1], escape probability c rabbitWhen (h)∈[0,0.5], it means that although the prey has the ability to escape, it cannot get rid of the Harris Eagle's predator. At this time, the Harris Eagle will rotate and surround the prey, that is, it will choose a soft encirclement method to capture the prey. The specific expression is as follows:
[0168] D hawk (h+1)=ΔD hawk (h)-E rabbit (h)|JD rabbit (h)-D hawk (h)|
[0169] In the above formula, J is a random number in the range [0,2], and ΔD hawk (h) represents the difference between the Harris Eagle's current position and the prey's position in the h-th iteration, as shown in the following expression:
[0170] ΔD hawk (h)=D rabbit (h)-D hawk (h)
[0171] (2) When the escape energy E of the prey in the h-th iteration rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈[0,0.5], it means that the prey no longer has the energy to escape and cannot get rid of the Harris Eagle's prey. At this time, the Harris Eagle will directly capture the prey, that is, choose to capture the prey by means of a hard attack. The specific expression is as follows:
[0172] D hawk (h+1)=D rabbit (h)-E rabbit (h)ΔD hawk (h)
[0173] (3) When the escape energy E of the prey in the h-th iteration rabbit (h)∈(0.5,1], escape probability c rabbit When (h)∈(0.5,1], it means that the prey still has the energy to escape and may be able to escape the Harris Eagle's pursuit. At this time, the Harris Eagle can adopt two strategies to surround and kill the prey: one is to use Levy's random flight to reduce the prey's vigilance; the other is to carry out a soft encirclement attack on the prey. The specific expression is as follows:
[0174]
[0175] In the above formula, f(x) represents the fitness function; D is the position of the first Harris Hawk in h+1 iterations. hawk,1 (h+1) and the position of the second Harris Hawk D hawk,2 The specific expression for (h+1) is as follows:
[0176] D hawk,1 (h+1)=D rabbit (h)-E rabbit (h)|JD rabbit (h)-D hawk (h)|
[0177] D hawk,2 (h+1)=D hawk,1 (h+1)+S·D leve (d)
[0178] In the above formula, d represents the dimension of the data; S represents a d-dimensional random variable, ranging from [0,1]; D leve (d) represents the flight of d-Villevee, expressed as follows:
[0179]
[0180]
[0181] In the above formula, ξ is the flight coefficient, β is a default constant, which is taken as 0.5 in this paper, and r a and r b It is a normally distributed random number between [0,1].
[0182] (4) When the prey's escape energy E rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈(0.5,1], it indicates that the prey's escape energy is insufficient, but it may still escape the Harris Eagle's pursuit. In this case, in addition to flying over the prey, the Harris Eagle will also launch a hard attack on the prey. The specific expression is as follows:
[0183]
[0184] D hawk,3 (h+1)=D rabbit (h)-E rabbit (h)JD rabbit (h)-D ave (h)
[0185] Among them, D hawk,3 (h+1) represents the position of the third Harris Hawk in the h+1th iteration.
[0186] Step 3.4: Calculate fitness
[0187] Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey's position and select the position with the highest fitness as the new prey.
[0188] Step 3.5: Iterative Loop
[0189] Repeat steps 3.3 and 3.4 until the maximum number of iterations is reached, and output the prey's position, i.e., the adjustment amount of each load, as the optimal solution of the objective function described in step 2.3.
[0190] Example 2
[0191] This invention provides a load-side resource optimization decision system, such as... Figure 2 ,include:
[0192] Mining Module: Used to explore the adjustment potential of various loads through hierarchical and time-segmented scheduling methods;
[0193] Specifically:
[0194] For peak load periods, within a specified time period, a preset percentage is set for each peak reduction. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential has reached its maximum value for that period. The objective function is as follows:
[0195]
[0196] P'=P+ΔP'
[0197] ΔP'=P' car +P' tem +P' storage +P' industry
[0198] Among them, P' max P is the setpoint for the peak load after peak shaving. max P represents the maximum load before peak shaving, and P represents the average load before peak shaving. These are the start and end times of the load adjustment zone corresponding to the single preset percentage value for peak shaving. These are the start and end times of the load adjustment zone corresponding to double the preset percentage for peak shaving. P' represents the start and end times of the load regulation zone corresponding to a peak shaving of three times the preset percentage, P' represents the load curve function after peak shaving, P represents the load curve function before peak shaving, and ΔP' represents the total regulation power of various loads. car To regulate the power of electric vehicles, P' tem For temperature-controlled load regulation power, P' storage To regulate the power of energy storage load, P' industry Power regulation for industrial loads.
[0199] Model building module: used to build an optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling based on the regulation potential of various loads;
[0200] Specifically:
[0201] Establish load-side resource priority assessment indicators: Based on the analytic hierarchy process (AHP) entropy weight method, determine the comprehensive weight of each influencing factor indicator from both subjective and objective perspectives, as shown in the following expression:
[0202]
[0203] Where, λ cm,q λ AHP,q λ EM,q These are the comprehensive weight, AHP weight, and entropy weight of the q-th influencing factor indicator, respectively.
[0204] The scheduling priority of dispatchable loads is evaluated based on the comprehensive weight and value of various influencing factors. Then, the scheduling priority of each dispatchable load is determined based on the magnitude of the comprehensive index value. The comprehensive index value of dispatchable load b at time t is expressed as:
[0205]
[0206] Where B represents the quantity of a certain schedulable load; n D represents the total number of influencing factor indicators. b,q Let q be the value of the schedulable load b;
[0207] Based on load-side resource priority evaluation indicators, an optimal scheduling model is established with the goal of maximizing peak shaving or valley filling and minimizing operating costs.
[0208] First, the goal is to maximize peak shaving or valley filling during peak or off-peak periods:
[0209]
[0210] Where F is the objective function, P'(t) is the total load before adjustment, P(t) is the total load after adjustment, and t is the total load after adjustment. c ,t n These are the start and end times of peak or trough loads, respectively.
[0211] Second, the goal is to minimize the load adjustment cost at all times:
[0212]
[0213] Where k1, k2, k3, and k4 are the unit load adjustment cost coefficients for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively. These represent the peak reduction amounts at time t for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively.
[0214] Third, set constraints for electric vehicles, temperature-controlled loads, industrial loads, energy storage loads, and peak shaving.
[0215] The constraints on the electric vehicle are expressed as follows:
[0216]
[0217]
[0218] in, This represents the maximum peak reduction of electric vehicle load at time t, calculated by the electric vehicle load reduction potential model based on the load curve. This represents the actual peak reduction of the electric vehicle at time t. To ensure the minimum charge factor for the normal operation of electric vehicles, The maximum charge coefficient affected by the performance of the electric vehicle battery itself;
[0219] The temperature control load constraint is expressed as follows:
[0220] T min ≤T≤T max
[0221]
[0222] Among them, T min T max The minimum and maximum set temperatures are used to ensure the comfort of the temperature-controlled load. T represents the actual operating temperature of the temperature-controlled load. This represents the maximum peak reduction of the temperature-controlled load at time t, calculated from the load curve by the temperature-controlled load reduction potential model. This represents the actual peak reduction of the temperature-controlled load at time t.
[0223] The industrial load constraint is expressed as follows:
[0224]
[0225] in, This represents the maximum peak reduction of the industrial load at time t, calculated from the load curve by the industrial load reduction potential model. This represents the actual peak reduction of the industrial load at time t.
[0226] The energy storage load constraint is expressed as follows:
[0227]
[0228]
[0229]
[0230] E start =E end
[0231] in, The minimum and maximum charge factors of the energy storage load, SOC storage This represents the actual charge factor of the energy storage load. This represents the maximum charging power of the energy storage load. E represents the maximum peak reduction of the energy storage load at time t, calculated by the energy storage load reduction potential model based on the load curve. start E end These represent the remaining electricity of the energy storage load at midnight and midnight, respectively.
[0232] The peak reduction constraint is expressed as follows:
[0233] ΔP i,min ≤ΔP i (t)≤ΔP i,max
[0234] Where, ΔP i (t) represents the actual peak reduction of the adjustable load at time t during the i-th adjustment, ΔP i,max ΔP i,min These are the upper and lower limits of the adjustable load peak shaving amount in the i-th adjustment, respectively.
[0235] The solution module is used to solve the optimal scheduling model using the improved tabu-Harris Eagle algorithm to obtain the adjustment amounts for various loads.
[0236] include:
[0237] Population initialization: Obtain the adjustment ranges of air conditioning load adjustment, electric vehicle adjustment, industrial load adjustment, and energy storage load adjustment, and initialize each individual according to the adjustment range;
[0238] Prey selection: Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt.
[0239] Update Harris Hawk location: Determine whether Harris Hawk is in search or development status, and update Harris Hawk location based on Harris Hawk status type;
[0240] If the Harris Hawk is in search mode, update its position according to the following formula:
[0241]
[0242] Among them, D hawk (h+1) represents the position of the Harris Eagle after h+1 iterations; D rand(h) represents the location of the Harris Eagle randomly distributed within the specified range in the h-th iteration; D hawk (h) represents the position of the Harris Eagle before the h-th iteration; D rabbit (h) represents the position of the prey in the h-th iteration; D ave (h) represents the average position of the Harris Eagle before the h-th iteration; D down Indicates the lower boundary of the specified position; D up Indicates the upper boundary of the specified position; q h ρ1, ρ2, ρ3, and ρ4 represent random numbers, where q h This indicates the basis for selecting different strategies;
[0243] If the Harris Eagle is in a developmental stage, its developmental strategy is selected based on the prey's escape energy and escape probability, and can be categorized as follows:
[0244] (1) When the escape energy E of the prey in the h-th iteration rabbit (h)∈(0.5,1], escape probability c rabbit When (h)∈[0,0.5], the Harris Eagle chooses a soft encirclement method to capture its prey, as shown in the following expression:
[0245] D hawk (h+1)=ΔD hawk (h)-E rabbit (h)JD rabbit (h)-D hawk (h)
[0246] In this context, J is a random number, and ΔD is a random number. hawk (h) represents the difference between the Harris Eagle's current position and the prey's position in the h-th iteration, as shown in the following expression:
[0247] ΔD hawk (h)=D rabbit (h)-D hawk (h)
[0248] (2) When the escape energy E of the prey in the h-th iteration rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈[0,0.5], the Harris Eagle chooses a hard-hitting approach to capture its prey, as shown in the following expression:
[0249] D hawk (h+1)=D rabbit (h)-E rabbit (h)ΔD hawk (h)
[0250] (3) When the escape energy E of the prey in the h-th iterationrabbit (h)∈(0.5,1], escape probability c rabbit When (h)∈(0.5,1], the Harris Eagle employs two strategies to hunt its prey: one is to use Levy's random flight; the other is to launch a soft attack on the prey. The specific expressions are as follows:
[0251]
[0252] Where f(x) represents the fitness function; and D is the position of the first Harris Hawk in h+1 iterations. hawk,1 (h+1) and the position of the second Harris Hawk D hawk,2 The specific expression for (h+1) is as follows:
[0253] D hawk,1 (h+1)=D rabbit (h)-E rabbit (h)JD rabbit (h)-D hawk (h)
[0254] D hawk,2 (h+1)=D hawk,1 (h+1)+S·D leve (d)
[0255] In the above formula, d represents the dimension of the data; S represents a d-dimensional random variable; D leve (d) represents the flight of d-Villevee, expressed as follows:
[0256]
[0257]
[0258] In the above formula, ξ is the flight coefficient, β is a default constant, and r a and r b These are normally distributed random numbers;
[0259] 4) When the prey's escape energy E rabbit (h)∈[0, 0.5], escape probability c rabbit When (h)∈(0.5,1], in addition to flying over Levi, the Harris Eagle also launches a hard attack on its prey, as shown in the following expression:
[0260]
[0261] D hawk,3 (h+1)=D rabbit (h)-E rabbit (h)JD rabbit (h)-D ave (h)
[0262] Among them, D hawk,3 (h+1) represents the position of the third Harris Hawk in the h+1th iteration;
[0263] Calculate fitness: Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey and select the position with the highest fitness as the new prey.
[0264] Iterative loop: Repeatedly update the Harris Eagle's position and calculate fitness until the maximum number of iterations is reached, and output the position of the prey, which represents the adjustment amount of various loads.
[0265] Example 3
[0266] The present invention provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the load-side resource optimization decision method.
[0267] Example 4
[0268] The present invention provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the load-side resource optimization decision method.
[0269] Explanation of related terms
[0270] Peak shaving and valley filling: Peak shaving refers to reducing users' electricity demand during peak load periods of the power grid, valley filling refers to increasing users' electricity demand during off-peak periods of the power grid, and peak shifting and valley filling refers to shifting users' demand from peak load periods to off-peak load periods.
[0271] Trial and error method: Search forward according to the selection criteria to reach the goal. However, when the exploration reaches a certain step, it is found that the original choice is not optimal or cannot reach the goal, so backtrack one step and choose again.
[0272] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0273] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.
[0274] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0275] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.
[0276] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit its scope of protection. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that after reading the present invention, they can still make various changes, modifications or equivalent substitutions to the specific implementation of the invention, but these changes, modifications or equivalent substitutions are all within the scope of protection of the pending claims of the invention.
Claims
1. A load-side resource optimization decision-making method, characterized in that, include: By employing a tiered and time-segmented scheduling approach, the potential for load regulation is explored, specifically as follows: For peak load periods, within a specified time period, a preset percentage is set for each peak reduction. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential has reached its maximum value for that period. The objective function is as follows: in, This is the set value for the highest load after peak shaving. This represents the maximum load before peak shaving. This represents the average load before peak shaving. These are the start and end times of the load adjustment zone corresponding to the single preset percentage value for peak shaving. These are the start and end times of the load adjustment zone corresponding to double the preset percentage for peak shaving. These are the start and end times of the load adjustment zone corresponding to a peak shaving rate of three times the preset percentage. This is the load curve function after peak shaving. This is the load curve function before peak shaving. Total regulating power for all types of loads, Adjusting power for electric vehicles To regulate power for temperature-controlled loads, To regulate power for energy storage loads, Regulate power for industrial loads; An optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling is established based on the regulation potential of various loads. The optimal scheduling model is solved to obtain the adjustment amounts for various types of loads.
2. The load-side resource optimization decision-making method according to claim 1, characterized in that, The aforementioned optimized scheduling model, which establishes priority-based load-side resources to participate in grid balancing and achieve peak shaving and valley filling based on various load regulation potentials, specifically includes: Establish load-side resource priority assessment indicators; Based on load-side resource priority assessment indicators, an optimized scheduling model is established with the goal of maximizing peak shaving or valley filling and minimizing operating costs.
3. The load-side resource optimization decision-making method according to claim 2, characterized in that, The establishment of load-side resource priority assessment indicators specifically involves determining the comprehensive weights of various influencing factors from both subjective and objective perspectives based on the analytic hierarchy process (AHP) entropy weight method. The expression is as follows: in, These are the comprehensive weight, AHP weight, and entropy weight of the q-th influencing factor indicator, respectively. The scheduling priority of dispatchable loads is evaluated based on the comprehensive weight and value of various influencing factors. Then, the scheduling priority of each dispatchable load is determined based on the magnitude of the comprehensive index value. The comprehensive index value of dispatchable load b at time t is expressed as: Where B represents the quantity of a certain schedulable load; This represents the total number of influencing factor indicators; Let q be the value of the schedulable load b.
4. The load-side resource optimization decision-making method according to claim 2, characterized in that, The optimization scheduling model, which aims to maximize peak shaving or valley filling while minimizing operating costs, specifically includes: First, the goal is to maximize peak shaving or valley filling during peak or off-peak periods: in, Let be the objective function. The total load before adjustment, The adjusted total load, These are the start and end times of peak or trough loads, respectively. Second, the goal is to minimize the load adjustment cost at all times: in, , , , These are the unit load adjustment cost coefficients for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively. , , , These represent the peak reduction amounts at time t for electric vehicles, temperature-controlled loads, industrial loads, and energy storage loads, respectively. Third, set constraints for electric vehicles, temperature-controlled loads, industrial loads, energy storage loads, and peak shaving. The constraints on the electric vehicle are expressed as follows: in, This represents the maximum peak reduction of electric vehicle load at time t, calculated by the electric vehicle load reduction potential model based on the load curve. This represents the actual peak reduction of the electric vehicle at time t. To ensure the minimum charge factor for the normal operation of electric vehicles, The maximum charge coefficient affected by the performance of the electric vehicle battery itself; The temperature control load constraint is expressed as follows: in, , To ensure the comfort of the temperature-controlled load, the minimum and maximum set temperatures are... The actual operating temperature of the temperature-controlled load. This represents the maximum peak reduction of the temperature-controlled load at time t, calculated from the load curve by the temperature-controlled load reduction potential model. This represents the actual peak reduction of the temperature-controlled load at time t. The industrial load constraint is expressed as follows: in, This represents the maximum peak reduction of the industrial load at time t, calculated from the load curve by the industrial load reduction potential model. This represents the actual peak reduction of the industrial load at time t. The energy storage load constraint is expressed as follows: in, , The minimum and maximum charge factors for the energy storage load are given. This represents the actual charge factor of the energy storage load. This represents the maximum charging power of the energy storage load. This represents the maximum peak reduction of the energy storage load at time t, calculated from the load curve by the energy storage load reduction potential model. , These represent the remaining electricity of the energy storage load at midnight and midnight, respectively. The peak reduction constraint is expressed as follows: in, Let be the actual peak reduction amount of the adjustable load at time t during the i-th adjustment. , These are the upper and lower limits of the adjustable load peak shaving amount in the i-th adjustment, respectively.
5. The load-side resource optimization decision-making method according to claim 1, characterized in that, The optimization scheduling model is solved to obtain the adjustment amounts for various types of loads, specifically: An improved tabu-Harris Hawk algorithm is used to solve the optimal scheduling model, including: Population initialization: Obtain the adjustment ranges of temperature control load adjustment, electric vehicle adjustment, industrial load adjustment, and energy storage load adjustment, and initialize each individual according to the adjustment range; Prey selection: Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt. Update Harris Hawk location: Determine whether Harris Hawk is in search or development status, and update Harris Hawk location based on Harris Hawk status type; Calculate fitness: Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey and select the position with the highest fitness as the new prey. Iterative loop: Repeatedly update the Harris Eagle's position and calculate fitness until the maximum number of iterations is reached, and output the position of the prey, which represents the adjustment amount of various loads.
6. The load-side resource optimization decision-making method according to claim 5, characterized in that, The process of updating the Harris Hawk's position based on its state type is as follows: If the Harris Hawk is in search mode, update its position according to the following formula: in, This indicates the position of the Harris Hawk after h+1 iterations; This represents the position of the Harris Eagle randomly distributed within a specified range in the h-th iteration; This indicates the position of the Harris Eagle before the h-th iteration; This indicates the position of the prey in the h-th iteration; This represents the average position of the Harris Eagle before the h-th iteration; Indicates the lower boundary of the specified position; Indicates the upper boundary of the specified position; , , , and Represents a random number, where This indicates the basis for selecting different strategies; If the Harris Eagle is in a developmental stage, its developmental strategy is selected based on the prey's escape energy and escape probability, and can be categorized as follows: (1) The escape energy of the prey in the h-th iteration Escape probability At this time, the Harris Eagle employs a soft encirclement method to capture its prey, as shown in the following expression: middle, It is a random number. The difference between the Harris Eagle's current position and the prey's position in the h-th iteration is expressed as follows: (2) The escape energy of the prey in the h-th iteration Escape probability At this time, the Harris Eagle uses a hard-hitting approach to capture its prey, as shown in the following expression: (3) The escape energy of the prey in the h-th iteration Escape probability At this time, the Harris Eagle employs two strategies to hunt its prey: one is to use random flight patterns; the other is to launch a soft attack on the prey. The specific expressions are as follows: in, Represents the fitness function; the position of the first Harris Hawk in h+1 iterations. And the position of the second Harris Hawk The specific expression is as follows: In the above formula, Indicates the dimension of the data; express 3D random variable; express Villefleur flight, expressed as follows: In the above formula, For flight coefficient, This is the default constant. and These are normally distributed random numbers; 4) The energy of the prey's escape Escape probability In addition to flying, the Harris Hawk also launches a hard attack on its prey, as detailed below: in, This represents the position of the third Harris Hawk in the h+1th iteration.
7. A load-side resource optimization decision-making system, characterized in that, include: The data mining module is used to explore the potential for various load adjustments through hierarchical and time-segmented scheduling methods. Specifically: For peak load periods, within a specified time period, a preset percentage is set for each peak reduction. After multiple peak reductions, when the regulation potential of all loads drops to 0 and the peak load after peak reduction fails to reach the set value, it indicates that the regulation potential has reached its maximum value for that period. The objective function is as follows: in, This is the set value for the highest load after peak shaving. This represents the maximum load before peak shaving. This represents the average load before peak shaving. These are the start and end times of the load adjustment zone corresponding to the single preset percentage value for peak shaving. These are the start and end times of the load adjustment zone corresponding to double the preset percentage for peak shaving. These are the start and end times of the load adjustment zone corresponding to a peak shaving rate of three times the preset percentage. This is the load curve function after peak shaving. This is the load curve function before peak shaving. Total regulating power for all types of loads, Adjusting power for electric vehicles To regulate power for temperature-controlled loads, To regulate power for energy storage loads, Regulate power for industrial loads; Model building module: used to build an optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling based on the regulation potential of various loads; Solver module: Used to solve the optimization scheduling model and obtain the adjustment amount of various loads.
8. The load-side resource optimization decision-making system according to claim 7, characterized in that, The mining module is used to establish an optimized scheduling model based on priority of load-side resources to participate in grid balancing and achieve peak shaving and valley filling, based on various load regulation potentials. Specifically: Establish load-side resource priority assessment indicators; Based on load-side resource priority assessment indicators, an optimized scheduling model is established with the goal of maximizing peak shaving or valley filling and minimizing operating costs.
9. The load-side resource optimization decision-making system according to claim 7, characterized in that, In the solution module, the optimal scheduling model is solved to obtain the adjustment amounts for various types of loads, specifically: An improved tabu-Harris Hawk algorithm is used to solve the optimal scheduling model, including: Population initialization: Obtain the adjustment ranges of temperature control load adjustment, electric vehicle adjustment, industrial load adjustment, and energy storage load adjustment, and initialize each individual according to the adjustment range; Prey selection: Calculate the initial fitness of all individuals, select the individual with the highest fitness as prey, and use the remaining individuals as Harris Eagles to hunt. Update Harris Hawk location: Determine whether Harris Hawk is in search or development status, and update Harris Hawk location based on Harris Hawk status type; Calculate fitness: Calculate the fitness of the updated position of the Harris Eagle. If the fitness is greater than that of the prey's position, then update the prey and select the position with the highest fitness as the new prey. Iterative loop: Repeatedly update the Harris Eagle's position and calculate fitness until the maximum number of iterations is reached, and output the position of the prey, which represents the adjustment amount of various loads.
10. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the load-side resource optimization decision-making method as described in any one of claims 1 to 6.
11. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the load-side resource optimization decision-making method as described in any one of claims 1 to 6.
Citation Information
Patent Citations
Response characteristic-considered demand side load resource peak regulation scheduling response method
CN115063022A
