Power dispatching method and system based on particle swarm optimization

By combining particle swarm algorithm, chaotic mapping model and clustering algorithm, the scheduling pressure of new energy scenarios in the power system is solved, more efficient power scheduling optimization is achieved, the adaptability and persuasiveness of the model are enhanced, and the existing technology is solved Problems of local search and iteration waste.

CN118941038APending Publication Date: 2024-11-12国网浙江省电力有限公司建德市供电公司
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411020577.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-29
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The existing technology is difficult to effectively solve the power system scheduling pressure in new energy scenarios such as integrated photovoltaic and wind power in dynamic economic scheduling of power systems, especially because the factors affecting the grid connection of new energy such as photovoltaic and wind power with uncertain output are not considered, resulting in The search area is not targeted, the iteration process is wasted, and it is easy to fall into local search.

Method used

Combining the particle swarm algorithm, chaos mapping model and clustering algorithm, by obtaining the installed capacity of wind turbines and photovoltaic generators, using the chaos mapping model to generate initial populations, calculate the particle fitness value and historical optimal value, and perform clustering analysis , filter particles with distances smaller than the threshold to form clusters, calculate the cluster mean as the new clustering center until the algorithm converges, optimize the system's total fuel cost and polluted gas emissions.

Benefits of technology

It improves the efficiency of power scheduling optimization, enhances the persuasiveness of the model, and can implement a general strategy under different loads and distributed power supply characteristics, significantly improving the scheduling performance of the power system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118941038A_ABST
    Figure CN118941038A_ABST
Patent Text Reader

Abstract

The invention discloses a power dispatching method and system based on a particle swarm optimization, the method is used for power equipment, the power equipment comprises a wind driven generator and a photovoltaic generator, and the method comprises the steps: obtaining the installed capacity of the wind driven generator and the photovoltaic generator in the power equipment; generating an initial population by using a chaotic mapping model, and inversely normalizing the installed capacity to a search space to obtain an initial position of a particle; calculating the fitness value of each particle, and updating the historical optimal values of each particle and the population; establishing each particle and the historical optimal value as a clustering data set, taking the historical optimal value as an initial clustering center, and calculating the distance between each particle and the clustering center; screening the particles of which the distance is smaller than a preset threshold value, and forming clusters by the particles; calculating a mean value of the clusters, and recording the mean value as a new clustering center; and if the new clustering center is the same as the old clustering center, the algorithm converges, and the process is ended. The optimization algorithm can greatly improve the efficiency of power dispatching.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of power economic dispatching, and specifically relates to a power dispatching method and system based on particle swarm algorithm. Background Art

[0002] In the dynamic economic dispatch of power systems, in order to avoid falling into local search, existing particle swarm algorithms generally use methods to adjust the particle positions, such as combining genetic algorithms to perform operations such as crossover and mutation on particles. However, these methods are prone to tens of millions of particles exceeding the limit, and are not very targeted at the search area in the later stages of iteration, which can easily waste tens of millions of iterations.

[0003] For example, the Chinese patent document CN106570579B discloses a method for economic dispatch of hydropower and thermal power based on an improved quantum particle swarm algorithm, which performs power dispatch by establishing a highly mathematical model of hydropower and thermal power economics and a quantum particle swarm algorithm. However, since this prior art solution only considers traditional energy sources such as hydropower and thermal power, and does not consider the grid-connected impact factors of new energy sources such as photovoltaic power and wind power with uncertain output, it cannot solve the pressure of power system dispatch in energy scenarios such as comprehensive photovoltaic and wind power. Summary of the invention

[0004] In view of the above-mentioned prior art, the purpose of the present invention is to combine the particle swarm algorithm, the chaos mapping model and the clustering algorithm to solve the influencing factors of the grid connection of new energy sources such as photovoltaic power and wind power with uncertain output, and to solve the problem of power system scheduling pressure in comprehensive photovoltaic, wind and other energy scenarios.

[0005] In order to solve the above technical problems, the present application provides a power dispatching method based on particle swarm algorithm, comprising:

[0006] The method is used for electric power equipment, which includes a wind turbine generator and a photovoltaic generator.

[0007] Obtaining the installed capacity of the wind turbine and photovoltaic generator inside the power equipment;

[0008] The initial population is generated using the chaotic mapping model, and the installed capacity is denormalized to the search space to obtain the initial position of the particles;

[0009] Calculate the fitness value of each particle and update the historical optimal value of each particle and population;

[0010] Establish each particle and the historical optimal value as a clustering data set, use the historical optimal value as the initial cluster center, and calculate the distance between each particle and the cluster center;

[0011] Filter particles whose distance is less than a preset threshold and form clusters of these particles;

[0012] Calculate the mean of the cluster and record the mean as the new cluster center;

[0013] If the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends.

[0014] As a preferred method, a quadratic function is used to represent the total fuel cost of the system F(P G )’s objective function:

[0015]

[0016] Where: N is the total number of generator sets; a i , b i 、c i is the fuel cost coefficient of generator set i; P Gi is the active power output of thermal power unit i; P G is the active output vector of the system generator set, which can be expressed as:

[0017] P G =[P G1 , P G2 ,…,P GN ];

[0018] Establish the objective function of the total pollutant gas emissions of the system:

[0019]

[0020] Where α i , β i , γ i , i ,λ i is the pollutant gas emission coefficient of generator set i;

[0021] The formula for the generator set output constraint is:

[0022] P Gi min ≤P Gi ≤P Gi max Where P Gimin , P Gimax are the minimum active output and maximum active output of generator set i respectively;

[0023] The power balance constraint formula is:

[0024]

[0025] In the formula, PD is the total load demand of the system, P1 is the total transmission network loss of the system, and the solution calculation formula of P1 is:

[0026]

[0027] Where T represents transpose, B is an N*N dimensional matrix, B0 is an N dimensional row vector, and B00 is a scalar;

[0028] Integrate the above objective function and constraint formulas together to establish a mathematical model:

[0029]

[0030] Where X=PG is the solution vector of the optimization problem, h and g are the equality constraints and inequality constraints of the model, respectively, and L and K are the total number of equality constraints and inequality constraints, respectively.

[0031] Preferably, the method further comprises: if the new cluster center is different from the old cluster center, or the preset number of iterations is not reached, or the members of the cluster continue to change, the algorithm does not converge, and continues to return to calculating the fitness value of each particle, and updating the historical optimal value of each particle and population, and repeats the steps.

[0032] In order to solve the above technical problems, the present application also provides a power dispatching system based on particle swarm algorithm, comprising:

[0033] Acquisition module: acquiring the installed capacity of the wind turbine generator and the photovoltaic generator inside the power equipment;

[0034] Model generation module: Generate the initial population using the chaos mapping model, and denormalize the installed capacity to the search space to obtain the initial position of the particles;

[0035] The first calculation module: calculates the fitness value of each particle and updates the historical optimal value of each particle and population;

[0036] Clustering module: establish each particle and the historical optimal value as a clustering data set, use the historical optimal value as the initial clustering center, and calculate the distance between each particle and the clustering center;

[0037] Screening module: Screen particles whose distance is less than a preset threshold and form clusters of these particles;

[0038] The second calculation module calculates the mean of the cluster and records the mean as a new cluster center;

[0039] Convergence judgment module: If the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends.

[0040] In order to solve the above technical problems, the present application also provides a power dispatching device based on a particle swarm algorithm, comprising:

[0041] Memory for storing computer programs;

[0042] The processor is used to point to a computer program to implement the steps of a power dispatch processing method based on a particle swarm algorithm.

[0043] In order to solve the above technical problems, the present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, all the steps of the above-mentioned power dispatching method based on particle swarm algorithm are implemented.

[0044] The beneficial effects of this application are as follows:

[0045] In the process of studying the optimal dispatching model of the power system, due to the randomness and uncertainty of daily load and distributed power output, many results may be optimized. However, the economic dispatching model attempts to achieve a universal strategy, and the same strategy can be applied to different loads and distributed power characteristics. In order to achieve this, random optimization, robust optimization and other methods have emerged. Cluster analysis is performed on particle swarms, and the common particle swarm characteristics obtained by induction are combined with optimal dispatching analysis. The persuasiveness of the model will be greatly enhanced, and the optimization efficiency of power dispatching can be greatly improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0047] Figure 1 Flowchart provided for this application;

[0048] Figure 2 System structure diagram provided for this application;

[0049] Figure 3 Illustration of the equipment provided for this application. DETAILED DESCRIPTION

[0050] As required, detailed embodiments of the present invention are disclosed herein, but it should be understood that the disclosed embodiments are merely exemplary of the present invention, and the present invention may be implemented in different and alternative forms. The accompanying drawings may not be drawn to scale, and certain features may be exaggerated or reduced to show the details of specific components. Therefore, the specific structural and functional details disclosed herein should not be understood as having a limiting meaning, but only as a representative basis to teach those skilled in the art to adopt the present invention differently. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present invention.

[0051] Figure 1 A flowchart of a power dispatching method based on a particle swarm algorithm provided in an embodiment of the present application, the method is used for power equipment, the power equipment includes a wind turbine and a photovoltaic generator, including:

[0052] S1. Obtaining the installed capacity of the wind turbine and photovoltaic generator inside the power equipment;

[0053] S2, using the chaos mapping model to generate the initial population, and denormalizing the installed capacity to the search space to obtain the initial position of the particles;

[0054] The chaotic mapping model has the characteristics of ergodicity, randomness and regularity. It can traverse all states without repetition within a certain range. Compared with the random number generator, the chaotic mapping model can improve the diversity of the initial population and effectively avoid the premature problem in the particle swarm algorithm.

[0055] S3, calculate the fitness value of each particle and update the historical optimal value of each particle and population;

[0056] Single-objective optimization problem, that is, how to solve the model to maximize economic benefits. For this problem, the particle swarm algorithm is used to solve the economic scheduling model. In the quantum particle swarm algorithm: the update of particles is to obtain a new individual through observation, that is, given a probability to observe a particle, then its position will be obtained. For each particle, multiple probabilities will be randomly generated, and the Monte Carlo idea will be used for observation to obtain multiple individuals, and then the optimal individual will be selected to finally obtain the next generation of individuals. This method is used to continuously search.

[0057] S4, establishing each particle and the historical optimal value as a clustering data set, taking the historical optimal value as the initial clustering center, and calculating the distance between each particle and the clustering center;

[0058] The particle swarm optimization algorithm shows good performance in multi-objective, multi-constrained and nonlinear optimization problems, and has been widely used in power optimization dispatching operation with the advantages of less fitness function constraints, simple structure, easy coding and fast convergence speed. However, due to the premature problem, the particle swarm algorithm is prone to fall into the local optimal solution. In the particle swarm algorithm, the search space and convergence of the particle swarm in the later stage are affected by the initial population position, which is usually generated by a random number generator. However, in high-dimensional space, the initial population position generated by the random number generator will be unevenly distributed, thus affecting the performance of the particle swarm algorithm. In addition, during the iterative search process of the particle swarm, at least one particle is in a fixed state, and other particles gradually move towards the fixed particle. When the particle is close enough to the fixed particle, the particle can only search the space near the fixed particle, causing the algorithm to fall into premature. In order to improve the particle search performance, in the early optimization process of the particle swarm, the distance between any particle and the best particle is calculated. When the distance between the two is less than the set value, the chaotic mapping is used to update the position of the particle. By clustering the particle swarm and combining the summarized common particle swarm characteristics with the optimization scheduling analysis, the persuasiveness of the model will be greatly enhanced, and the optimization efficiency of power scheduling can also be greatly improved.

[0059] S5, screening particles whose distance is less than a preset threshold, and clustering these particles;

[0060] S6, calculating the mean of the cluster, and recording the mean as a new cluster center;

[0061] S7, if the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends;

[0062] S8: If the new cluster center is different from the old cluster center, or the preset number of iterations is not reached, or the members of the cluster continue to change, return to S3 and continue iterating until the algorithm converges.

[0063] The power dispatching method based on particle swarm algorithm has the total operating cost as its objective function, including the total fuel cost of the system, the total pollutant emission of the system, the total load demand of the system, and the total transmission network loss of the system. The particle swarm algorithm uses chaos mapping to initialize the population and clustering algorithm. Economic dispatch takes the lowest fuel cost as the dispatching goal. The fuel cost curve of each generator set is usually represented by a quadratic function. The total fuel cost of the system F(P G ) can be expressed as

[0064]

[0065] Where: N is the total number of generator sets; a i , b i 、c iis the fuel cost coefficient of generator set i; P Gi is the active power output of thermal power unit i; P G is the active output vector of the system generator set, which can be expressed as:

[0066] P G =[P G1 , P G2 ,…,P GN ];

[0067] Environmental dispatch takes the minimum emission of polluting gases as the dispatching target. Generators emit a variety of polluting gases during the power generation process. Each polluting gas emission can establish a functional relationship with the active output of the generator set. However, for the convenience of calculation, a comprehensive polluting gas emission model is used, and the total polluting gas emission of the system can be expressed as:

[0068]

[0069] Where α i , β i , γ i , i ,λ i is the pollutant gas emission coefficient of generator set i;

[0070] The formula for the generator set output constraint is:

[0071] P Gimin ≤P Gi ≤P Gimax Where P Gimin , P Gimax are the minimum active output and maximum active output of generator set i respectively;

[0072] The power balance constraint formula is:

[0073]

[0074] In the formula, PD is the total load demand of the system, P1 is the total transmission network loss of the system, and the solution calculation formula of P1 is:

[0075]

[0076] Where T represents transpose, B is an N*N dimensional matrix, B0 is an N dimensional row vector, and B00 is a scalar;

[0077] Integrate the above objective function and constraint formulas together to establish a mathematical model:

[0078]

[0079] Where X=PG is the solution vector of the optimization problem, h and g are the equality constraints and inequality constraints of the model, respectively, and L and K are the total number of equality constraints and inequality constraints, respectively.

[0080] In specific applications, a specific dispatching plan can be made based on the parameter data of the unit, the wind and solar forecast data received by the dispatching platform, and the system demand load, so as to reasonably dispatch the unit operation at a certain stage or time to obtain the best economic benefits.

[0081] The goal of the present invention is to minimize the operating cost of wind turbines by solving the objective function through particle swarm algorithm. The particle swarm algorithm needs to initialize certain parameters, such as population size, maximum number of iterations, etc. The setting of these parameters needs to be determined based on historical experience and actual conditions.

[0082] like Figure 2 As shown, a power dispatching system based on particle swarm algorithm includes:

[0083] Acquisition module 20: Acquisition of installed capacity of wind turbines and photovoltaic generators inside the power equipment;

[0084] Model generation module 21: Generate an initial population using a chaotic mapping model, and denormalize the installed capacity to the search space to obtain the initial position of the particle;

[0085] The first calculation module 22: calculates the fitness value of each particle and updates the historical optimal value of each particle and population;

[0086] Clustering module 23: establishing each particle and the historical optimal value as a clustering data set, taking the historical optimal value as the initial clustering center, and calculating the distance between each particle and the clustering center;

[0087] Screening module 24: Screening particles whose distance is less than a preset threshold and clustering these particles;

[0088] The second calculation module 25: calculates the mean of the cluster and records the mean as a new cluster center;

[0089] Convergence judgment module 26: If the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends.

[0090] like Figure 3 As shown, a power dispatching device based on particle swarm algorithm includes:

[0091] A memory 30, for storing computer programs;

[0092] The processor 31 is used to implement the steps of the power dispatching method based on the particle swarm algorithm mentioned in the above embodiment when executing the computer program.

[0093] The power dispatching device based on the particle swarm algorithm provided in this embodiment may include but is not limited to a smart phone, a tablet computer, a laptop computer or a desktop computer.

[0094] Among them, the processor 31 may include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 31 can be implemented in at least one hardware form of digital signal processing (DSP), field-programmable gate array (FPGA), and programmable logic array (PLA). The processor 31 may also include a main processor and a coprocessor. The main processor is a processor for processing data in the awake state, also known as a central processing unit (CPU); the coprocessor is a low-power processor for processing data in the standby state. In some embodiments, the processor 31 may be integrated with a graphics processing unit (GPU), which is responsible for rendering and drawing the content to be displayed on the display screen. In some embodiments, the processor 31 may also include an artificial intelligence (AI) processor, which is used to process computing operations related to machine learning.

[0095] The memory 30 may include one or more computer-readable storage media, which may be non-transitory. The memory 30 may also include a high-speed random access memory, and a non-volatile memory, such as one or more disk storage devices, flash memory storage devices. In this embodiment, the memory 30 is at least used to store the following computer program, wherein, after the computer program is loaded and executed by the processor 31, it can implement the relevant steps of the power dispatching method based on the particle swarm algorithm disclosed in any of the aforementioned embodiments. In addition, the resources stored in the memory 30 may also include an operating system and data, etc., and the storage method may be temporary storage or permanent storage. Among them, the operating system may include Windows, Unix, Linux, etc. The data may include but is not limited to the power dispatching method based on the particle swarm algorithm, etc.

[0096] In some embodiments, the power dispatching device based on the particle swarm algorithm may also include a display screen, an input and output interface, a communication interface, a power supply, and a communication bus.

[0097] Those skilled in the art will understand that Figure 3 The structure shown in the figure does not constitute a limitation on the power dispatching device based on the particle swarm algorithm, and may include more or fewer components than those shown in the figure.

[0098] The power dispatching device based on the particle swarm algorithm provided in the embodiment of the present application includes a memory 30 and a processor 31. When the processor 31 executes the program stored in the memory 30, it can implement the power dispatching method based on the particle swarm algorithm.

[0099] Finally, the present application also provides an embodiment corresponding to a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps recorded in the above method embodiment are implemented.

[0100] It is understandable that if the method in the above embodiment is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory), ROM, random access memory (Random Access Memory, RAM), disk or optical disk and other media that can store program code.

[0101] The above is a detailed introduction to a power dispatching method, device, equipment and medium based on a particle swarm algorithm provided by the present application. The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same and similar parts between the embodiments can refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can refer to the method part description. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.

[0102] It should also be noted that, in this specification, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the statement "comprises a ..." does not exclude the presence of other identical elements in the process, method, article or device including the element.

Claims

1. A power dispatching method based on particle swarm algorithm, characterized in that: The method is used for electric power equipment, which includes a wind turbine generator and a photovoltaic generator, and comprises: Obtaining the installed capacity of the wind turbine and photovoltaic generator inside the power equipment; The initial population is generated using the chaotic mapping model, and the installed capacity is denormalized to the search space to obtain the initial position of the particles; Calculate the fitness value of each particle and update the historical optimal value of each particle and population; Establish each particle and the historical optimal value as a clustering data set, use the historical optimal value as the initial cluster center, and calculate the distance between each particle and the cluster center; Filter particles whose distance is less than a preset threshold and form clusters of these particles; Calculate the mean of the cluster and record the mean as the new cluster center; If the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends.

2. The power dispatching method based on particle swarm algorithm according to claim 1 is characterized in that: The total fuel cost of the system is expressed as a quadratic function F(P G )’s objective function: ; Where: N is the total number of generator sets; a i , b i 、c i is the fuel cost coefficient of generator set i; P Gi is the active power output of thermal power unit i; P G is the active output vector of the system generator set, which can be expressed as: ; Establish the objective function of the total pollutant gas emissions of the system: ; In the formula is the pollutant gas emission coefficient of generator set i; The formula for the generator set output constraint is: In the formula , are the minimum active output and maximum active output of generator set i respectively; The power balance constraint formula is: ; In the formula, PD is the total load demand of the system, P1 is the total transmission network loss of the system, and the solution calculation formula of P1 is: ; Where T represents transpose, B is an N*N dimensional matrix, B0 is an N dimensional row vector, and B00 is a scalar; Integrate the above objective function and constraint formulas together to establish a mathematical model: ; Where X = PG is the solution vector of the optimization problem, h and g are the equality constraints and inequality constraints of the model, respectively, and L and K are the total number of equality constraints and inequality constraints, respectively.

3. The power dispatching method based on particle swarm algorithm according to claim 1, characterized in that: The method then includes: if the new cluster center is different from the old cluster center, or the preset number of iterations is not reached, or the members of the cluster continue to change, the algorithm does not converge, and continues to return to calculating the fitness value of each particle and updating the historical optimal value of each particle and population, and the steps are repeated.

4. A power dispatching system based on particle swarm algorithm, comprising Acquisition module: acquiring the installed capacity of the wind turbine generator and the photovoltaic generator inside the power equipment; Model generation module: Generate the initial population using the chaos mapping model, and denormalize the installed capacity to the search space to obtain the initial position of the particles; The first calculation module: calculates the fitness value of each particle and updates the historical optimal value of each particle and population; Clustering module: establish each particle and the historical optimal value as a clustering data set, use the historical optimal value as the initial cluster center, and calculate the distance between each particle and the cluster center; Screening module: Screen particles whose distance is less than a preset threshold and form clusters of these particles; The second calculation module calculates the mean of the cluster and records the mean as a new cluster center; Convergence judgment module: If the new cluster center is the same as the old cluster center, or the preset number of iterations is reached, or the members of the cluster no longer change, the algorithm converges and the process ends.

5. A power dispatching device based on particle swarm algorithm, characterized in that: include: Memory for storing computer programs; A processor is used to implement the steps of the power dispatching method based on particle swarm algorithm as described in any one of claims 1 to 3 when executing the computer program.

6. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the power dispatching method based on the particle swarm algorithm as described in any one of claims 1 to 3 are implemented.

Citation Information

Cited By

  • Interaction control method and system of intelligent robot based on Internet of Things

    CN120791795A