CN112016207B - Economic load distribution optimization method for generator set - Google Patents
Economic load distribution optimization method for generator set Download PDFInfo
- Publication number
- CN112016207B CN112016207B CN202010882769.6A CN202010882769A CN112016207B CN 112016207 B CN112016207 B CN 112016207B CN 202010882769 A CN202010882769 A CN 202010882769A CN 112016207 B CN112016207 B CN 112016207B
- Authority
- CN
- China
- Prior art keywords
- generator
- individual
- generator set
- foraging
- ray
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 80
- 238000009826 distribution Methods 0.000 title claims abstract description 76
- 238000005457 optimization Methods 0.000 title claims abstract description 53
- 230000002431 foraging effect Effects 0.000 claims abstract description 113
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 88
- 241001471424 Manta birostris Species 0.000 claims abstract description 67
- 241001331491 Myliobatis californica Species 0.000 claims abstract description 66
- 238000010248 power generation Methods 0.000 claims abstract description 19
- 150000001875 compounds Chemical class 0.000 claims description 17
- 230000003044 adaptive effect Effects 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 9
- 230000014509 gene expression Effects 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 6
- 230000000694 effects Effects 0.000 claims description 6
- 230000035772 mutation Effects 0.000 claims description 6
- 230000006872 improvement Effects 0.000 claims description 5
- 239000000446 fuel Substances 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 4
- 238000012887 quadratic function Methods 0.000 claims description 4
- 230000032683 aging Effects 0.000 claims description 3
- 230000008859 change Effects 0.000 claims description 3
- 230000005611 electricity Effects 0.000 claims description 3
- 230000009467 reduction Effects 0.000 claims description 3
- 239000002699 waste material Substances 0.000 claims description 3
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 2
- ZZUFCTLCJUWOSV-UHFFFAOYSA-N furosemide Chemical compound C1=C(Cl)C(S(=O)(=O)N)=CC(C(O)=O)=C1NCC1=CC=CO1 ZZUFCTLCJUWOSV-UHFFFAOYSA-N 0.000 claims 1
- 230000009471 action Effects 0.000 abstract description 3
- 230000007547 defect Effects 0.000 abstract description 2
- 239000002245 particle Substances 0.000 description 9
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 230000001133 acceleration Effects 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- YBJHBAHKTGYVGT-ZKWXMUAHSA-N (+)-Biotin Chemical compound N1C(=O)N[C@@H]2[C@H](CCCCC(=O)O)SC[C@@H]21 YBJHBAHKTGYVGT-ZKWXMUAHSA-N 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 239000003245 coal Substances 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012067 mathematical method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- NFGXHKASABOEEW-LDRANXPESA-N methoprene Chemical class COC(C)(C)CCCC(C)C\C=C\C(\C)=C\C(=O)OC(C)C NFGXHKASABOEEW-LDRANXPESA-N 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 239000002994 raw material Substances 0.000 description 1
- FEPMHVLSLDOMQC-UHFFFAOYSA-N virginiamycin-S1 Natural products CC1OC(=O)C(C=2C=CC=CC=2)NC(=O)C2CC(=O)CCN2C(=O)C(CC=2C=CC=CC=2)N(C)C(=O)C2CCCN2C(=O)C(CC)NC(=O)C1NC(=O)C1=NC=CC=C1O FEPMHVLSLDOMQC-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E40/00—Technologies for an efficient electrical power generation, transmission or distribution
- Y02E40/70—Smart grids as climate change mitigation technology in the energy generation sector
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Computational Linguistics (AREA)
- Water Supply & Treatment (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Biophysics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Biomedical Technology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Public Health (AREA)
- Molecular Biology (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Computer Hardware Design (AREA)
- Geometry (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention aims to overcome the defects of the prior art and provides an economic load distribution optimization method of a generator set, wherein the constraint conditions in the economic load distribution problem of the generator set comprise the following steps: the method comprises the following steps of power balance constraint, generator set output power constraint, slope rate constraint, forbidden operation area constraint and the like, wherein under the combined action of the constraints, the problem of economic load distribution optimization of the generator set is changed into a complex multi-constraint problem, and the difficulty of economic load distribution of the generator set is increased; the method adopts the improved manta ray foraging algorithm to solve the problem of economic load distribution of a complex and high-dimensional generator set, is not limited by the dimension of a target function, and can solve the optimization problems of nonlinearity, non-convexity, discontinuity and infinitesimal property; the inertial weight w is introduced into the classic bat ray foraging algorithm, the sine and cosine self-adaptation and differential variation strategies are improved, and compared with other optimization methods, the optimization capability, the convergence speed and the quality of the optimal solution of the improved bat ray foraging algorithm are improved, the power generation cost is minimized, and the resource utilization rate is improved.
Description
Technical Field
The invention belongs to the technical field of power systems, and particularly relates to an economic load distribution optimization method for a generator set.
Background
The economic load distribution optimization method is a distribution optimization method which distributes power generation tasks to each power generator on the premise of meeting various constraint conditions so as to minimize the power generation cost.
With the rapid increase of world economy, the demand of various industries on electric energy is increasing day by day, the installed capacity of the generator set of the power system is increasing continuously, and the reasonable distribution of the economic load of the power system has important significance for improving the resource utilization rate, reducing the operation cost of the power system and protecting the environment. The reasonable load distribution and the unit power generation task arrangement in the power system can not only reduce the economic cost, but also improve the production efficiency, and the larger the system scale is, the more obvious the improvement degree is. In the early economic load distribution, a provincial dispatching mechanism transmits a power generation requirement to a generator set according to the available capacity of a power plant, the maintenance condition of the generator set, the preparation condition of power generation raw materials such as coal and the like, the economic performance of the generator set and other practical conditions. After the electric power production is marketized, the load distribution mode becomes more flexible, and meanwhile, the difficulty of reasonable load distribution is increased due to the problems of valve point effect, slope rate constraint, forbidden operation area constraint and the like involved in the load distribution. For this reason, economic load distribution can be regarded as a multi-constraint optimization problem whose optimization goal is to minimize the total generation cost of the electrical energy production unit.
The economic load distribution problem is a complex multidimensional problem, and is converted into a multidimensional, non-convex, discontinuous and non-differentiable multi-constraint problem due to the combined action of conditions such as a generator set valve point effect, slope rate limitation, operation forbidden areas and the like, so that the difficulty in solving the economic load distribution is increased. At present, two main ways for solving the economic load distribution are provided, one is a traditional optimization method, the traditional mathematical optimization method is used for solving by simplifying an economic load distribution objective function and constraint conditions, and the other is a method for solving the complex multidimensional economic load distribution problem by using a meta-heuristic algorithm. The traditional optimization method is to simplify the cost function of economic load distribution into a quadratic function and ignore the sinusoidal component in the cost function, so that the complex, non-convex and discontinuous cost function is converted into a smooth cost function, and the smooth cost function can be solved by using mathematical methods such as an iteration method, a gradient method, a quadratic programming method and the like. The metaheuristic algorithm has excellent optimization capability and is not limited by the dimension of the target function, and can solve the problems of non-linearity, non-convexity and non-differentiable optimization. These advantages of the meta-heuristic algorithm can make up for the disadvantages of the conventional optimization method, so that the meta-heuristic algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), etc. are gradually applied to the problem of economic load distribution. However, the meta-heuristic algorithm has a good or bad optimizing result when solving the economic load distribution problem with different constraints, so the algorithm needs to be improved, so that the algorithm can be suitable for the economic load distribution problem under various constraint conditions.
In summary, for the different types of economic load distribution problems, whether the optimization capability of the traditional optimization algorithm or the meta-heuristic algorithm is good or bad, it is very unfavorable for protecting the environment, improving the resource utilization rate and reducing the operation cost of the power system.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides an economic load distribution optimization method of a generator set, wherein the constraint conditions in the economic load distribution problem of the generator set comprise the following steps: the method comprises the following steps of power balance constraint, generator set output power constraint, slope rate constraint, forbidden operation area constraint and the like, wherein the economic load optimization problem is changed into a complex multi-constraint problem under the combined action of the constraints, so that the difficulty of economic load distribution is increased; the method adopts the improved manta ray foraging algorithm to solve the problem of complex and high-dimensional economic load distribution, is not limited by the dimension of a target function, and can solve the optimization problems of nonlinearity, non-convexity, discontinuity and infinitesimal property; the inertial weight w, sine and cosine adaptive factors and a differential variation strategy are introduced into the classic manta ray foraging algorithm to be improved, and compared with other optimization methods, the optimization capability, the convergence speed and the quality of the optimal solution of the improved manta ray foraging algorithm are improved, the power generation cost is minimized, and the resource utilization rate is improved.
The technical scheme adopted by the invention for solving the technical problem is as follows: an economic load distribution optimization method for a generator set comprises the following steps:
step one, establishing a normal operation constraint condition of a generator set according to the operation requirement of a power system
(1.1) establishing equality constraint of normal operation of the generator set
Wherein d is the number of generators in the generator set, PiThe output power of the ith generator is in the dimension of MW; pjThe output power of the jth generator is MW; pDThe dimension of the total load demand of the power system is MW; pLLine loss of power system is measured in MW, PLThe method is mainly determined by the output power of a generator set and a topological structure of a power transmission network; b isij、B0i、B00The system power transmission loss coefficient;
here, the total output power of the generator setShould correspond to the total load P of the power system in the distribution rangeDAnd line loss PLMatching, so the equation of equilibrium for power shown in equation (1) belongs to the equality constraint;
(1.2) establishing three inequality constraints of the generator set on the output power, the slope rate of the generator set and the forbidden operation area
An inequality constraint of the output power of the generator set is established, and the method comprises the following steps:
in the formula (I), the compound is shown in the specification,is the minimum output power, P, of the ith generatoriIs the output power of the ith generator,the maximum output power of the ith generator;
the generator set output power constraint shown in the formula (2) belongs to inequality constraint, because the output power of each generator in normal operation must be between the maximum value and the minimum value, and the aging of the generator is accelerated when the output power exceeds the maximum value, so that the service life of the generator is shortened; the generator with too low output power is not fully utilized, so that resource waste is caused;
establishing a slope rate constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, PiFor the output power of the ith generator at the current moment,is the output power of the ith generator at the last moment, d is the number of generators in the generator set, URiRepresents the upper limit of the increase of the generated power of the ith generator per unit time, DRiAn upper limit of the reduction amount of the generated power of the ith generator in unit time;
establishing the forbidden operation area constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, NPZiThe number of the operation forbidden areas of the ith generator in the generator set, d is the number of the generators in the generator set,for the lower bound of the jth forbidden operating zone for the ith generator in the genset,the upper boundary of the jth operation forbidden area of the ith generator in the generator set is set;
the constraint of the forbidden operation area of the output power of each generator in the generator set shown in the formula (4) belongs to inequality constraint, because the forbidden operation area is set for protecting bearings of the generator or relevant auxiliary equipment, and the like, the generator is prevented from running in the forbidden operation area in order to prolong the service life of the generator;
step two, establishing an economic load distribution model of the power system generator set
Selecting the power generation cost of a power system as a target function, considering a valve point effect caused when an air inlet valve of a generator is suddenly opened, and generating the power generation cost under the condition of nonlinear output of the generator as shown in the formula (5):
in the formula, FtRepresenting the cost function of the electricity generated by the generator set, PiRepresents the output power of the ith generator,represents the minimum output power of the ith generator, ai、bi、ci、eiAnd fiRepresenting the fuel cost coefficient of the ith generator, wherein the first three coefficients form a smooth unary quadratic function, and the last two coefficients form an irreducible and non-convex function related to sine;denotes fiAndthe multiplication of (1);
step three, improving the foraging algorithm of the classical manta ray
The classic manta ray foraging algorithm comprises three foraging operations of linkage foraging, whirlwind foraging and tendon-turning foraging, the classic manta ray foraging algorithm is improved, a nonlinear inertia weight w, a self-adaptive change and a differential variation strategy are introduced on the basis of the classic algorithm, and the improvement method comprises the following steps:
(3.1) in the chain foraging operation, the current position of the manta ray individual is jointly determined by the positions of the previous generation individual and the current optimal individual, and the expression is as follows:
in the formula (I), the compound is shown in the specification,andthe t generation and the t +1 generation of the individual bat ray xiA position parameter on d dimension, wherein the position of each individual bat ray is jointly determined by the d parameters; in the economic load distribution problem of the generating set, the position parameter of each individual manta ray represents an alternative solution of the problem, the dimension of each alternative solution is d, andandrepresenting the output power of d generators in the generator set in t times and t +1 times of iterative calculations when the problem adopts an improved manta ray foraging algorithm;the method is characterized in that the method is an optimal solution of an improved manta ray foraging algorithm in the position parameters of the t-th generation of the optimal manta ray individual, namely the t-th iterative calculation of the economic load distribution problem of a generator set; r is a real number interval [0, 1]]A random number of (c); n is the population scale of the improved manta ray foraging algorithm, namely the number of alternative solutions of the economic load distribution problem of the generator set; a isdFor chain foraging operationAndright of connectionA weight coefficient of which the formula is
(3.2) the cyclonic foraging operation comprises: pure whirlwind foraging operation and exploration search space operation
The pure whirlwind foraging operation is that the modern individual bat ray follows the last individual bat ray in the bat population and moves to the current optimal individual, and the expression is as follows:
in the formula, betadFor simple whirlwind foraging operationAndthe connection weight coefficient of (2) is calculated as:
wherein r is a random number in a real number interval [0, 1], T is the current iterative computation time of the improved manta ray foraging algorithm, and T is the maximum iterative computation time;
the method is characterized in that nonlinear inertia weight w is introduced to improve the search space exploration operation, and comprises the following steps:
in the formula (I), the compound is shown in the specification,to search for a random position in space, βdOperating to explore search spacesAndr is [0, 1]]W is a nonlinear inertial weight and is expressed as:
wherein T and T are the current iteration number and the maximum iteration number, wminAnd wmaxFor the lower and upper limits of the inertial weight, the invention sets wmin0.2 and wmaxWhen 0.7, formula (10) is embodied as:
introducing a nonlinear inertia weight w in the exploration search space operation, and improving the global search capability and convergence accuracy of the algorithm through continuous adjustment of the nonlinear inertia weight w;
(3.3) introducing sine and cosine adaptive factors in the clamshell foraging operation to enhance the adaptive capacity of the improved manta ray foraging algorithm;
wherein C is a cosine adaptive factor, S is a sine adaptive factor, r1、r2、r3And r*Is [0, 1]]A random number in between;
(3.4) introducing a differential variation strategy, and performing variation, difference and selection operations on the obtained individual manta ray in each iteration process to obtain a new individual manta ray for next iteration calculation, so as to enhance the global optimization capability of the algorithm;
for the t generation of the optimal individual bat rayUsing a mutation vectorMaking it generate variation for generating new individual bat ray x'i d(t) the method comprises:
in formula (II), x'i d(t) is a new individual bat ray generated by variation operation;andis a random individual in the t generation, r4And r5The random number is a maximum value of the population size N and a minimum value of 1;is the optimal individual of the bat ray in the t generation; f is the scaling factor, F is [0.2, 0.8 ]]A random number in between;
an individual x 'of fresh manta ray generated after the mutation operation'i d(t) and individualsPerforming binomial cross operation to increase the population diversity, wherein the method comprises the following steps:
in the formula, x ″)i d(t) is an individual bat ray obtained after binomial cross operation; CR is cross probability and has a value range of [0, 1]];r6Is [0, 1]]A random number in between; r is7Is a random number, the maximum value of which is the problem dimensionNumber d, minimum value 1;
constructing a fitness function, and converting the target function into the fitness function, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,the position parameter of each individual bat ray is an alternative solution of the economic load distribution of a generator set for the ith individual bat ray in the tth generation;the generating cost of the generating set is obtained by using the alternative solution corresponding to the ith individual bat ray in the tth generation;generating set power generation cost maximum value corresponding to alternative solutions for all the individual bat ray in the tth generation;
selecting the optimal individual to reserve according to the fitness function value, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,and f (x ″)i d(t)) is an individual bat ray calculated according to the formula (15)And x ″)i d(t) fitness value;
step four, optimizing the load distribution of the generator set by adopting an improved manta ray foraging algorithm
(4.1) initializing the population position of the improved manta ray foraging algorithm, and setting the population size N to be 100 and the maximumThe large iteration number T is 1000, the cross probability CR is 0.2, and the upper and lower limits w of the inertia weightmax=0.7、wmin=0.2;
(4.2) starting iteration, generating a random number between [0, 1] by the Rand, and if the Rand is more than 0.5, executing the chain foraging operation by the current population according to the formula (6); if Rand is less than 0.5, generating a random number between [0, 1] by Rand, if T/T is greater than Rand, executing pure cyclone foraging operation according to formula (7) by the current population, and if T/T is less than Rand, executing exploration search space operation according to formula (9) by the current population; after one of a chain foraging operation, a simple cyclone foraging operation or a search space searching operation is executed, calculating individual fitness values in the bat ray population according to a formula (15), and selecting an individual with the largest fitness value as a current optimal individual;
(4.3) executing a tendon-turning foraging operation on the bat ray population according to the formula (12), calculating individual fitness values in the bat ray population according to the formula (15), and selecting the individual with the largest fitness value as a global optimal individual;
(4.4) carrying out differential variation operation on the obtained optimal individuals according to the formulas (13), (14) and (16), then calculating the fitness value of the individual of the bat ray population according to the formula (15), and selecting the individual with the maximum fitness value as a global optimal individual;
(4.5) judging whether the iteration times meet the requirements, namely judging whether T is more than or equal to T, if not, adding 1 to the iteration times T, and returning to the step (4.2) to enter the next iteration; if T is more than or equal to T, exiting iteration and outputting an optimal solution of the economic load distribution of the generator set;
the method of inputting data into a computer in the above-described steps is a known method; the computers, displays and MATLAB computer software used were all commercially available.
The invention has the beneficial effects that:
(1) the economic load distribution optimization method for the generator set can solve the problem of economic load distribution under various constraint conditions such as power balance constraint, output power constraint, slope rate constraint, forbidden operation area constraint and the like, the adaptive capacity, the local optimization capacity and the global optimization capacity of the improved manta ray foraging algorithm are improved, and compared with the existing method, the method has the advantages of higher convergence speed and better optimal solution quality.
(2) The method models the economic load distribution of the generator set in reality, solves the optimization problems of high dimension, nonlinearity, non-convexity and infinitesimal by using the meta-heuristic intelligent algorithm, and provides an effective solution for the economic load distribution of the generator set.
(3) According to the method, sine and cosine adaptive factors, nonlinear inertia weight w and a differential variation strategy are introduced on the basis of a classic manta ray foraging algorithm, so that the method is more suitable for the optimization problem of economic load distribution of a generator set. The inertia weight is introduced to improve the exploration search space operation, so that the global search capability of the algorithm is improved, and the convergence precision is improved; sine self-adaptation and cosine self-adaptation enhancement algorithm adaptation capacity is added in the process of the tumbling foraging; and finally introducing a differential variation strategy to perform variation, intersection and selection on the bat ray group in each iteration, so that the diversity of the group is enhanced, and the global search capability of the algorithm is improved. The improvements enable the improved manta ray foraging algorithm to have higher convergence speed and higher accuracy of solving the optimal solution compared with other meta-heuristic algorithms, are beneficial to economic load distribution of a generator set, reduce power generation cost and improve resource utilization rate.
Drawings
The invention is further illustrated with reference to the following figures and examples.
FIG. 1 is a schematic flow chart of an economic load distribution optimization method for a generator set according to the present invention.
Fig. 2 is a comparison graph of convergence curves of an improved manta ray foraging algorithm (IMRFO), a classical manta ray foraging algorithm (MRFO) and a Particle Swarm Optimization (PSO) in example 1.
Detailed Description
Fig. 1 shows that the program flow of the method for optimizing the economic load distribution of the generator set of the present invention is as follows: starting → establishing a constraint expression according to actual requirements → establishing an economic load distribution objective function → inputting a modified manta ray foraging algorithm parameter, a generator set parameter → starting iteration → Rand < 0.5? → N, performing chain foraging operation on the bat ray population; y, T/T < rand? → N, carrying out simple whirlwind foraging operation on the manta ray population; y, after performing one of exploration search space operation → performing chain foraging operation, exploration search space operation and simple whirlwind foraging operation on the bat ray population, calculating the fitness of individuals in the bat ray population, updating the optimal individuals → performing tendon-turning and fighting foraging operation on the bat ray population → introducing a differential variation strategy, performing variation, intersection and selection operation on the optimal individuals and updating individual values of the bat ray → calculating the individual fitness of the bat ray population and updating a global optimal value → T is more than or equal to T? → N, the number of iterations t plus 1, and the next iteration starts; and Y, finishing and outputting an optimization result.
Example 1
Economic load distribution optimization problem of generator set of medium-sized power system containing 15 thermal power generators
Step one, establishing a normal operation constraint condition of a generator set according to the operation requirement of a power system
(1.1) establishing equality constraint of normal operation of the generator set
In the formula, PiIs the output power of the ith generator, PDThe value for the total load demand is 2630MW, PLIs the line loss, P, of the power systemLMainly determined by the output power of the generator set and the topological structure of the power transmission network, Bij、B0i、B00Represents the system power transmission loss coefficient, wherein BijIs a 15 x 15 dimensional matrix, B0iIs a 1 × 15 dimensional matrix, B00Is a constant;
(1.2) establishing three inequality constraints of the generator set on the output power, the slope rate of the generator set and the forbidden operation area
An inequality constraint of the output power of the generator set is established, and the method comprises the following steps:
in the formula (I), the compound is shown in the specification,is the minimum output power, P, of the ith generatoriIs the output power of the ith generator,the maximum output power of the ith generator; the output power of each generator in normal operation must be between the maximum value and the minimum value, and the aging of the generator is accelerated when the output power exceeds the maximum value, so that the service life of the generator is shortened; the generator with too low output power is not fully utilized, so that resource waste is caused;
establishing a slope rate constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, PiFor the output power of the ith generator at the current moment,output power of the i-th generator at the previous moment, URiRepresents the upper limit of the increase of the generated power of the ith generator per unit time, DRiAn upper limit of the reduction amount of the generated power of the ith generator in unit time;
establishing the forbidden operation area constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, NPZiThe number of forbidden operating regions for the ith generator in the generator set,for the lower bound of the jth forbidden operating zone for the ith generator in the genset,the upper boundary of the jth operation forbidden area of the ith generator in the generator set is set; the operation forbidden region is set for protecting a motor bearing or relevant auxiliary equipment and the like, and the generator is prevented from running in the operation forbidden region in order to prolong the service life of the generator;
step two, establishing an economic load distribution model of the power system generator set
The power generation cost of the power system is selected as an objective function, a valve point effect caused when an air inlet valve of the generator is suddenly opened is considered, and the power generation cost under the condition of nonlinear output of the generator can be expressed as follows:
in the formula, FtRepresenting the cost function of the electricity generated by the generator set, PiRepresents the output power of the ith generator,represents the minimum output power of the ith generator, ai、bi、ci、eiAnd fiRepresenting the fuel cost coefficient of the ith generator, wherein the first three coefficients form a smooth unary quadratic function, and the last two coefficients form an irreducible and non-convex function related to sine;denotes fiAndthe multiplication of (1);
step three, improving the foraging algorithm of the classical manta ray
The classic manta ray foraging algorithm comprises three foraging operations of linkage foraging, whirlwind foraging and tendon-turning foraging, the classic manta ray foraging algorithm is improved, a nonlinear inertia weight w, a self-adaptive change and a differential variation strategy are introduced on the basis of the classic algorithm, and the improvement method comprises the following steps:
(3.1) in the chain foraging operation, the current position of the manta ray individual is jointly determined by the positions of the previous generation individual and the current optimal individual, and the expression is as follows:
in the formula (I), the compound is shown in the specification,andthe t generation and the t +1 generation of the individual bat ray xiA position parameter in 15 dimensions, wherein the position of each individual bat ray is jointly determined by 15 parameters; the position parameter of each individual manta ray in the economic load distribution problem of the generating set represents an alternative solution of the problem, the dimension of each alternative solution is 15, andandrepresenting the output power of 15 generators in the generator set in t times and t +1 times of iterative calculations when the problem adopts an improved manta ray foraging algorithm;the method is characterized in that the method is an optimal solution of an improved manta ray foraging algorithm in the position parameters of the t-th generation of the optimal manta ray individual, namely the t-th iterative calculation of the economic load distribution problem of a generator set; r is a real number interval [0, 1]]A random number of (c); the population scale of the improved manta ray foraging algorithm is 100, namely the number of alternative solutions of the economic load distribution problem of the generator set; a is15For chain foraging operationAndis calculated as
(3.2) the cyclonic foraging operation comprises: pure whirlwind foraging operation and exploration search space operation
The pure whirlwind foraging operation is that the modern individual bat ray follows the last individual bat ray in the bat population and moves to the current optimal individual, and the expression is as follows:
in the formula, beta15For simple whirlwind foraging operationAndthe connection weight coefficient of (2) is calculated as:
wherein r is a random number in a real number interval [0, 1], and t is the current iterative computation times of the improved manta ray foraging algorithm;
the method is characterized in that nonlinear inertia weight w is introduced to improve the search space exploration operation, and comprises the following steps:
in the formula (I), the compound is shown in the specification,to search for a random position in space, β15Operating to explore search spacesAndr is [0, 1]]W is a nonlinear inertial weight and is expressed as:
where t is the current iteration number, wminAnd wmaxFor the lower and upper limits of the inertial weight, w is set in this embodimentmin0.2 and wmax0.7, the nonlinear inertial weight w expression is embodied as:
introducing a nonlinear inertia weight w in the exploration search space operation, and improving the global search capability and convergence accuracy of the algorithm through continuous adjustment of the nonlinear inertia weight w;
(3.3) introducing sine and cosine adaptive factors in the clamshell foraging operation to enhance the adaptive capacity of the improved manta ray foraging algorithm;
wherein C is a cosine adaptive factor, S is a sine adaptive factor, r1、r2、r3And r*Is [0, 1]]A random number in between;
(3.4) introducing a differential variation strategy, and performing variation, difference and selection operations on the obtained individual manta ray in each iteration process to obtain a new individual manta ray for next iteration calculation, so as to enhance the global optimization capability of the algorithm;
for the t generation of the optimal individual bat rayUsing a mutation vectorMaking it generate variation for generating new individual bat ray x'i 15(t) the method comprises:
in formula (II), x'i 15(t) is a new individual bat ray generated by variation operation;andis a random individual in the t generation, r4And r5The random number has the maximum value of 100 population numbers and the minimum value of 1;is the optimal individual of the bat ray in the t generation; f is the scaling factor, F is [0.2, 0.8 ]]A random number in between;
an individual x 'of fresh manta ray generated after the mutation operation'i 15(t) and individualsPerforming binomial cross operation to increase the population diversity, wherein the method comprises the following steps:
in the formula, x ″)i 15(t) is an individual bat ray obtained after binomial cross operation; r is6Is [0, 1]]A random number in between; r is7Is a random number, the maximum value of which is the problem dimension 15 and the minimum value of which is 1;
constructing a fitness function, and converting the target function into the fitness function, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,the position parameter of each individual bat ray is an alternative solution of the economic load distribution of a generator set for the ith individual bat ray in the tth generation;the generating cost of the generating set is obtained by using the alternative solution corresponding to the ith individual bat ray in the tth generation;generating set power generation cost maximum value corresponding to alternative solutions for all the individual bat ray in the tth generation;
selecting the optimal individual to reserve according to the fitness function value, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,and f (x ″)i 15(t)) is an individual bat rayAnd x ″)i 15(t) fitness value;
step four, optimizing the load distribution of the generator set by adopting an improved manta ray foraging algorithm
(4.1) initializing population position of improved manta ray foraging algorithm and settingThe population size N is 100, the maximum iteration number T is 1000, the cross probability CR is 0.2, and the upper and lower limits w of the inertia weightmax=0.7、wminInputting the parameters of the generator set which are 0.2, wherein the parameters of the generator set are shown in a table 1;
TABLE 1 Generator set parameters
(4.2) starting iteration, generating a random number between [0, 1] by the Rand, and if the Rand is more than 0.5, executing the chain foraging operation by the current population according to the formula (6); if Rand is less than 0.5, generating a random number between [0, 1] by Rand, if T/T is greater than Rand, executing pure cyclone foraging operation according to formula (7) by the current population, and if T/T is less than Rand, executing exploration search space operation according to formula (9) by the current population; after one of a chain foraging operation, a simple cyclone foraging operation or a search space searching operation is executed, calculating individual fitness values in the bat ray population according to a formula (15), and selecting an individual with the largest fitness value as a current optimal individual;
(4.3) executing a tendon-turning foraging operation on the bat ray population according to the formula (12), calculating individual fitness values in the bat ray population according to the formula (15), and selecting the individual with the largest fitness value as a global optimal individual;
(4.4) carrying out differential variation operation on the obtained optimal individuals according to the formulas (13), (14) and (16), then calculating the fitness value of the individual of the bat ray population according to the formula (15), and selecting the individual with the maximum fitness value as a global optimal individual;
(4.5) judging whether the iteration times meet the requirements, namely judging whether T is more than or equal to T, if not, adding 1 to the iteration times T, and returning to the step (4.2) to enter the next iteration; if T is more than or equal to T, exiting iteration, outputting an optimal solution of the economic load distribution of the generator set, and comparing the optimal solution with an optimized result of the economic load distribution of the generator set solved by adopting a Particle Swarm Optimization (PSO) and a classical bat ray foraging algorithm (MRFO), wherein the result comparison is shown in tables 2 and 3; wherein the parameter setting population size N of the particle swarm algorithm is 100, the maximum iteration number T is 1000, and the acceleration factor C11, acceleration factor C21.318, inertia weight w is 1; setting a population scale N of 100, a maximum iteration time T of 1000 and a tendon-turning factor S of 2 for the cray ray foraging operation according to the classic parameter setting; a convergence curve comparison graph of three algorithms of an improved manta ray foraging algorithm (IMRFO), a classical manta ray foraging algorithm (MRFO) and a Particle Swarm Optimization (PSO) is shown in FIG. 2;
TABLE 2 Particle Swarm Optimization (PSO), classical manta ray foraging algorithm (MRFO), and improved manta ray foraging algorithm (IMRFO) optimization results
The numbers in Table 2 represent the economic load distribution results, units (MW) of the generator set
TABLE 3 comparison of results optimized by three algorithms
It can be seen from table 3 that when the load is 2630MW and the power balance is satisfied, the fuel cost, i.e., the power generation cost, of the power generating set in the optimization result of the improved bat ray foraging algorithm is smaller than that of the particle swarm algorithm and the classic bat ray foraging algorithm, and the optimal power generation cost ratio of the particle swarm algorithm (PSO), the classic bat ray foraging algorithm (MRFO) and the improved bat ray foraging algorithm (IMRFO) is 1: 0.9953: 0.9951, which indicates that the optimal solution capability of the improved bat ray foraging optimization algorithm is stronger, and the effect of the improved bat ray foraging algorithm is more obvious when the improved bat ray foraging algorithm is applied to a larger-scale load distribution optimization problem, which is beneficial to protecting the environment and improving the energy utilization rate. Further illustrates that the invention is very effective in generating the economic load distribution of the generator set under the situation of containing complex equality constraint and inequality constraint.
Fig. 2 shows iterative convergence curve comparison graphs of the improved manta ray foraging algorithm (IMRFO), the classical manta ray foraging algorithm (MRFO) and the particle swarm algorithm (PSO) when solving the economic load distribution optimization problem of a medium-sized power system generator set including 15 thermoelectric generators, and it can be seen that the improved manta ray foraging algorithm (IMRFO) adopted in the economic load distribution optimization method of the generator set has a faster convergence speed, a better optimal solution and a smoother convergence curve, thereby proving that the economic load distribution optimization method of the generator set of the present invention has advantages when solving the economic load distribution problem of the generator set under the situations including complex equality constraints and inequality constraints.
In all the above embodiments, the method for inputting data into the computer is a known method; the computer, display and MATLAB computer software were all commercially available.
The above is only a preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered as the technical solutions and the inventive concepts of the present invention within the technical scope of the present invention.
Claims (2)
1. An economic load distribution optimization method of a generator set is characterized in that the economic load distribution optimization method of the generator set based on an improved manta ray foraging algorithm comprises the following steps:
step one, establishing a normal operation constraint condition of a generator set according to the operation requirement of a power system
(1.1) establishing equality constraint of normal operation of the generator set
Wherein d is the number of generators in the generator set, PiThe output power of the ith generator is in the dimension of MW; pjThe output power of the jth generator is MW; pDThe dimension of the total load demand of the power system is MW; pLLine loss of power system is measured in MW, PLThe method is mainly determined by the output power of a generator set and a topological structure of a power transmission network; b isij、B0i、B00The system power transmission loss coefficient;
here, the total output power of the generator setShould correspond to the total load P of the power system in the distribution rangeDAnd line loss PLMatching, so the equation of equilibrium for power shown in equation (1) belongs to the equality constraint;
(1.2) establishing three inequality constraints of the generator set on the output power, the slope rate of the generator set and the forbidden operation area
An inequality constraint of the output power of the generator set is established, and the method comprises the following steps:
in the formula (I), the compound is shown in the specification,is the minimum output power, P, of the ith generatoriIs the output power of the ith generator,the maximum output power of the ith generator;
the generator set output power constraint shown in the formula (2) belongs to inequality constraint, because the output power of each generator in normal operation must be between the maximum value and the minimum value, and the aging of the generator is accelerated when the output power exceeds the maximum value, so that the service life of the generator is shortened; the generator with too low output power is not fully utilized, so that resource waste is caused;
establishing a slope rate constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, PiFor the output power of the ith generator at the current moment,is the output power of the ith generator at the last moment, d is the number of generators in the generator set, URiAn upper limit of an increase amount of generated power of the ith generator per unit time, DRiAn upper limit of the reduction amount of the generated power of the ith generator in unit time;
establishing the forbidden operation area constraint of the output power of the generator set, wherein the method comprises the following steps:
in the formula, NPZiThe number of the operation forbidden areas of the ith generator in the generator set, d is the number of the generators in the generator set,for the lower bound of the jth forbidden operating zone for the ith generator in the genset,the upper boundary of the jth operation forbidden area of the ith generator in the generator set is set;
the constraint of the forbidden operation area of the output power of each generator in the generator set shown in the formula (4) belongs to inequality constraint, because the forbidden operation area is set for protecting bearings of the generator or relevant auxiliary equipment, and the like, the generator is prevented from running in the forbidden operation area in order to prolong the service life of the generator;
step two, establishing an economic load distribution model of the power system generator set
Selecting the power generation cost of a power system as a target function, considering a valve point effect caused when an air inlet valve of a generator is suddenly opened, and generating the power generation cost under the condition of nonlinear output of the generator as shown in the formula (5):
in the formula, FtRepresenting the cost function of the electricity generated by the generator set, PiRepresents the output power of the ith generator,represents the minimum output power of the ith generator, ai、bi、ci、eiAnd fiRepresenting the fuel cost coefficient of the ith generator, wherein the first three coefficients form a smooth unary quadratic function, and the last two coefficients form an irreducible and non-convex function related to sine;denotes fiAndthe multiplication of (1);
step three, improving the foraging algorithm of the classical manta ray
The classic manta ray foraging algorithm comprises three foraging operations of linkage foraging, whirlwind foraging and tendon-turning foraging, the classic manta ray foraging algorithm is improved, a nonlinear inertia weight w, a self-adaptive change and a differential variation strategy are introduced on the basis of the classic algorithm, and the improvement method comprises the following steps:
(3.1) in the chain foraging operation, the current position of the manta ray individual is jointly determined by the positions of the previous generation individual and the current optimal individual, and the expression is as follows:
in the formula (I), the compound is shown in the specification,andthe t generation and the t +1 generation of the individual bat ray xiA position parameter on d dimension, wherein the position of each individual bat ray is jointly determined by the d parameters; in the economic load distribution problem of the generating set, the position parameter of each individual manta ray represents an alternative solution of the problem, the dimension of each alternative solution is d, andandrepresenting the output power of d generators in the generator set in t times and t +1 times of iterative calculations when the problem adopts an improved manta ray foraging algorithm;the method is characterized in that the method is an optimal solution of an improved manta ray foraging algorithm in the position parameters of the t-th generation of the optimal manta ray individual, namely the t-th iterative calculation of the economic load distribution problem of a generator set; r is a real number interval [0, 1]]A random number of (c); n is the population scale of the improved manta ray foraging algorithm, namely the number of alternative solutions of the economic load distribution problem of the generator set; a isdFor chain foraging operationAndis calculated as
(3.2) the cyclonic foraging operation comprises: pure whirlwind foraging operation and exploration search space operation
The pure whirlwind foraging operation is that the modern individual bat ray follows the last individual bat ray in the bat population and moves to the current optimal individual, and the expression is as follows:
in the formula, betadFor simple whirlwind foraging operationAndthe connection weight coefficient of (2) is calculated as:
wherein r is a random number in a real number interval [0, 1], T is the current iterative computation time of the improved manta ray foraging algorithm, and T is the maximum iterative computation time;
the method is characterized in that nonlinear inertia weight w is introduced to improve the search space exploration operation, and comprises the following steps:
in the formula (I), the compound is shown in the specification,to search for a random position in space, βdOperating to explore search spacesAndr is [0, 1]]A random number in between, w is a nonlinear inertiaThe sex weights and their expressions are:
wherein T and T are the current iteration number and the maximum iteration number, wminAnd wmaxFor the lower and upper limits of the inertial weight, the invention sets wmin0.2 and wmaxWhen 0.7, formula (10) is embodied as:
introducing a nonlinear inertia weight w in the exploration search space operation, and improving the global search capability and convergence accuracy of the algorithm through continuous adjustment of the nonlinear inertia weight w;
(3.3) introducing sine and cosine adaptive factors in the clamshell foraging operation to enhance the adaptive capacity of the improved manta ray foraging algorithm;
wherein C is a cosine adaptive factor, S is a sine adaptive factor, r1、r2、r3And r*Is [0, 1]]A random number in between;
(3.4) introducing a differential variation strategy, and performing variation, difference and selection operations on the obtained individual manta ray in each iteration process to obtain a new individual manta ray for next iteration calculation, so as to enhance the global optimization capability of the algorithm;
for the t generation of the optimal individual bat rayUsing a mutation vectorTo make it generate variation for generating new individual bat rayThe method comprises the following steps:
in the formula (I), the compound is shown in the specification,a new manta ray individual generated by variation operation;andis a random individual in the t generation, r4And r5The random number is a maximum value of the population size N and a minimum value of 1;is the optimal individual of the bat ray in the t generation; f is the scaling factor, F is [0.2, 0.8 ]]A random number in between;
generating a new individual bat ray after the mutation operationWith individualsPerforming binomial cross operation to increase the population diversity, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,is an individual bat ray obtained after binomial cross operation; CR is cross probability and has a value range of [0, 1]];r6Is [0, 1]]A random number in between; r is7The problem dimension d is the maximum value of the random number, and the minimum value is 1;
constructing a fitness function, and converting the target function into the fitness function, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,the position parameter of each individual bat ray is an alternative solution of the economic load distribution of a generator set for the ith individual bat ray in the tth generation;the generating cost of the generating set is obtained by using the alternative solution corresponding to the ith individual bat ray in the tth generation;generating set power generation cost maximum value corresponding to alternative solutions for all the individual bat ray in the tth generation;
selecting the optimal individual to reserve according to the fitness function value, wherein the method comprises the following steps:
in the formula (I), the compound is shown in the specification,andthe bat ray individual calculated by the formula (15)Anda fitness value;
step four, optimizing the load distribution of the generator set by adopting an improved manta ray foraging algorithm
(4.1) initializing the population position of the improved manta ray foraging algorithm, and setting the population size N to 100, the maximum iteration time T to 1000, the cross probability CR to 0.2, and the upper and lower limits w of the inertia weightmax=0.7、wmin=0.2;
(4.2) starting iteration, generating a random number between [0, 1] by the Rand, and if the Rand is more than 0.5, executing the chain foraging operation by the current population according to the formula (6); if Rand is less than 0.5, generating a random number between [0, 1] by Rand, if T/T is greater than Rand, executing pure cyclone foraging operation according to formula (7) by the current population, and if T/T is less than Rand, executing exploration search space operation according to formula (9) by the current population; after one of a chain foraging operation, a simple cyclone foraging operation or a search space searching operation is executed, calculating individual fitness values in the bat ray population according to a formula (15), and selecting an individual with the largest fitness value as a current optimal individual;
(4.3) executing a tendon-turning foraging operation on the bat ray population according to the formula (12), calculating individual fitness values in the bat ray population according to the formula (15), and selecting the individual with the largest fitness value as a global optimal individual;
(4.4) carrying out differential variation operation on the obtained optimal individuals according to the formulas (13), (14) and (16), then calculating the fitness value of the individual of the bat ray population according to the formula (15), and selecting the individual with the maximum fitness value as a global optimal individual;
(4.5) judging whether the iteration times meet the requirements, namely judging whether T is more than or equal to T, if not, adding 1 to the iteration times T, and returning to the step (4.2) to enter the next iteration; if T is more than or equal to T, exiting iteration and outputting an optimal solution of the economic load distribution of the generator set;
the method of inputting data into a computer in the above-described steps is a known method; the computers, displays and MATLAB computer software used were all commercially available.
2. The economic load distribution optimization method of the generator set according to claim 1, characterized in that: the generator set operation parameters are obtained according to generator set power balance constraint, generator set output power constraint, ramp rate constraint, forbidden operation area constraint and the like in an actual power system.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010882769.6A CN112016207B (en) | 2020-08-28 | 2020-08-28 | Economic load distribution optimization method for generator set |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010882769.6A CN112016207B (en) | 2020-08-28 | 2020-08-28 | Economic load distribution optimization method for generator set |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112016207A CN112016207A (en) | 2020-12-01 |
CN112016207B true CN112016207B (en) | 2022-03-22 |
Family
ID=73502365
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010882769.6A Active CN112016207B (en) | 2020-08-28 | 2020-08-28 | Economic load distribution optimization method for generator set |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112016207B (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112670984A (en) * | 2020-12-16 | 2021-04-16 | 广州大学 | Power system economic load distribution method based on improved whale algorithm |
CN113255871A (en) * | 2021-05-11 | 2021-08-13 | 合肥宏晶微电子科技股份有限公司 | Path planning method, electronic device and computer readable storage medium |
CN113240067A (en) * | 2021-05-14 | 2021-08-10 | 江苏科技大学 | RBF neural network optimization method based on improved manta ray foraging optimization algorithm |
CN113435625B (en) * | 2021-05-25 | 2022-03-25 | 国网河北省电力有限公司衡水供电分公司 | Dynamic economic dispatching optimization method and device for power system |
CN113255138B (en) * | 2021-05-31 | 2023-05-23 | 河北工业大学 | Load distribution optimization method for power system |
CN115238505B (en) * | 2022-07-27 | 2024-02-13 | 国网山东省电力公司枣庄供电公司 | Thermoelectric hydrogen combined supply type system optimal configuration method and system based on wind-solar field station |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106130008A (en) * | 2016-06-30 | 2016-11-16 | 大连大学 | Based on the Power System Economic Load Dispatch method improving symbiosis particle cluster algorithm |
-
2020
- 2020-08-28 CN CN202010882769.6A patent/CN112016207B/en active Active
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106130008A (en) * | 2016-06-30 | 2016-11-16 | 大连大学 | Based on the Power System Economic Load Dispatch method improving symbiosis particle cluster algorithm |
Non-Patent Citations (2)
Title |
---|
Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications;Zhao W等;《Engineering Applications of Artificial Intelligence》;20200131;全文 * |
改进的人工蜂群算法及其在经济负荷分配中的应用;胡欣;《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅱ辑》;20180115;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN112016207A (en) | 2020-12-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112016207B (en) | Economic load distribution optimization method for generator set | |
CN107769237B (en) | Multi-energy system coordinated dispatching method and device based on electric car access | |
CN110070292B (en) | Micro-grid economic dispatching method based on cross variation whale optimization algorithm | |
CN106058855A (en) | Active power distribution network multi-target optimization scheduling method of coordinating stored energy and flexible load | |
CN108471143A (en) | Micro-grid multi-energy method for optimizing scheduling based on positive and negative feedback particle cluster algorithm | |
CN109167347B (en) | Cloud-adaptive-particle-swarm-based multi-target electric vehicle charge-discharge optimization scheduling method | |
CN113783224A (en) | Power distribution network double-layer optimization planning method considering operation of various distributed energy sources | |
CN111614110B (en) | Receiving-end power grid energy storage optimization configuration method based on improved multi-target particle swarm optimization | |
CN112926185A (en) | Power economy emission scheduling method based on improved kernel search optimization | |
Chen et al. | A Novel Approach Based on Modified and Hybrid Flower Pollination Algorithm to Solve Multi-objective Optimal Power Flow. | |
CN113255138A (en) | Load distribution optimization method for power system | |
Chen et al. | Modified antipredatory particle swarm optimization for dynamic economic dispatch with wind power | |
CN115719113A (en) | Intelligent power grid economic dispatching distributed accelerated optimization method based on directed imbalance topology | |
Mohamed et al. | Optimal parameters of interline power flow controller using particle swarm optimization | |
Zhao et al. | A novel binary social learning particle swarm optimizer for power system unit commitment | |
Qian et al. | Improved gravitational search algorithm and novel power flow prediction network for multi-objective optimal active dispatching problems | |
Niu et al. | A novel social-environmental-economic dispatch model for thermal/wind power generation and application | |
CN114066282A (en) | Power economic emission scheduling method based on hybrid nuclear search and slime bacteria optimization | |
CN113341705A (en) | Power battery system control method and device based on fuzzy control algorithm | |
CN114066280A (en) | Electric power economic emission scheduling method based on improved optimization of badgers | |
CN106684914A (en) | Adaptive PI control method for improving electric power spring pressure regulating performance | |
CN113139682A (en) | Micro-grid energy management method based on deep reinforcement learning | |
CN112003279A (en) | Method for evaluating new energy consumption capability of hierarchical micro-grid | |
Sun et al. | A Novel Cluster Division Method of Resource Aggregates in Active Distribution Networks Based on Adaptive Firefly Algorithm | |
Ye et al. | Active and reactive power joint optimization dispatch of islanded microgrid based on SCCSA algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |