CN115603330A - Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm - Google Patents

Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm Download PDF

Info

Publication number
CN115603330A
CN115603330A CN202211270838.3A CN202211270838A CN115603330A CN 115603330 A CN115603330 A CN 115603330A CN 202211270838 A CN202211270838 A CN 202211270838A CN 115603330 A CN115603330 A CN 115603330A
Authority
CN
China
Prior art keywords
particle
reactive
distribution network
power distribution
power
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.)
Pending
Application number
CN202211270838.3A
Other languages
Chinese (zh)
Inventor
胡筱曼
崔益国
陈浩河
董芝春
冷必喜
郭鸿毅
吴乾江
吴奕泓
吴毅江
彭勇刚
苗洛源
莫浩杰
胡丹尔
孙静
翁楚迪
韦巍
蔡田田
邓清唐
陈波
李肖博
杨英杰
朱明增
周培
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Zhongshan Power Supply Bureau of Guangdong Power Grid Co Ltd
Southern Power Grid Digital Grid Research Institute Co Ltd
Original Assignee
Zhejiang University ZJU
Zhongshan Power Supply Bureau of Guangdong Power Grid Co Ltd
Southern Power Grid Digital Grid Research Institute Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU, Zhongshan Power Supply Bureau of Guangdong Power Grid Co Ltd, Southern Power Grid Digital Grid Research Institute Co Ltd filed Critical Zhejiang University ZJU
Priority to CN202211270838.3A priority Critical patent/CN115603330A/en
Publication of CN115603330A publication Critical patent/CN115603330A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/18Arrangements for adjusting, eliminating or compensating reactive power in networks
    • H02J3/1821Arrangements for adjusting, eliminating or compensating reactive power in networks using shunt compensators
    • H02J3/1835Arrangements for adjusting, eliminating or compensating reactive power in networks using shunt compensators with stepless control
    • H02J3/1842Arrangements for adjusting, eliminating or compensating reactive power in networks using shunt compensators with stepless control wherein at least one reactive element is actively controlled by a bridge converter, e.g. active filters
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/004Artificial life, i.e. computing arrangements simulating life
    • G06N3/006Artificial 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]
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/12Circuit arrangements for ac mains or ac distribution networks for adjusting voltage in ac networks by changing a characteristic of the network load
    • H02J3/16Circuit arrangements for ac mains or ac distribution networks for adjusting voltage in ac networks by changing a characteristic of the network load by adjustment of reactive power
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/38Arrangements for parallely feeding a single network by two or more generators, converters or transformers
    • H02J3/381Dispersed generators
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2300/00Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
    • H02J2300/20The dispersed energy generation being of renewable origin
    • H02J2300/22The renewable source being solar energy
    • H02J2300/24The renewable source being solar energy of photovoltaic origin
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2300/00Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
    • H02J2300/20The dispersed energy generation being of renewable origin
    • H02J2300/28The renewable source being wind energy
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02EREDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
    • Y02E40/00Technologies for an efficient electrical power generation, transmission or distribution
    • Y02E40/30Reactive power compensation

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Control Of Electrical Variables (AREA)

Abstract

The invention relates to a digital power grid intelligent operation and control technology, and aims to provide a power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm. The optimization method is used for adjusting the optimal output values of reactive compensation equipment in the power distribution network under different load levels and power generation levels, so that the sum of the overall network loss of the power distribution network and the voltage deviation of each node is comprehensively minimized; after a particle position matrix is constructed on the basis of reactive output power or adjustment gears of reactive compensation equipment, network loss and voltage deviation of a power distribution network at different particle positions are calculated by using a self-adaptive discrete particle swarm algorithm, a global optimal particle position matrix is obtained through calculation after multiple iterations, and reactive power values or adjustment gears to be output by each reactive compensation equipment are obtained and used for achieving reactive power adjustment. The invention can optimize continuous variables and discrete variables simultaneously, can greatly improve the efficiency of algorithm solution, enhances the capability of particle swarm algorithm to search global optimal solution, and is more suitable for actual power distribution network scenes.

Description

Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm
Technical Field
The invention relates to a power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm, and belongs to the digital power grid intelligent operation and control technology.
Background
The new energy represented by photovoltaic power generation and wind power generation has rapid power development and wide prospect, but due to the inherent characteristics of illumination and wind energy, the photovoltaic power generation and the wind power generation have strong randomness and volatility, and great challenge is brought to the economic and safe operation of a power distribution network under the high penetration of new energy.
With the acceleration of the digital transformation pace of the power grid and the rapid upgrade of the communication technology, the information interaction between different nodes in the power distribution network has stronger instantaneity and stability, which lays a solid foundation for the appearance of a new method and a new technology. The heuristic optimization algorithm is widely applied to operation optimization of the power distribution network, the existing power distribution network optimization method mainly comprises a basic particle swarm algorithm, a genetic algorithm, a simulated annealing algorithm and the like, but the methods have the problems that a global optimal solution cannot be found accurately, the calculation time is too long and the like, cannot meet the requirements of the power distribution network on real-time performance, reliability, safety and the like, and have very limited application value.
Disclosure of Invention
The invention aims to solve the technical problem of overcoming the defects in the prior art and provides a power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm.
In order to solve the technical problem, the solution of the invention is as follows:
the method is characterized in that the optimal output values of reactive compensation equipment in the power distribution network under different load levels and power generation levels are adjusted, so that the sum of the overall network loss of the power distribution network and the voltage deviation of each node is comprehensively minimized; the optimization method specifically comprises the following steps:
(1) Acquiring parameters and operation data of reactive compensation equipment participating in reactive power optimization of the power distribution network, and constructing a particle position matrix by using reactive output power or adjustment gears of the reactive compensation equipment;
(2) Randomly initializing to form a plurality of particle position matrixes and a plurality of particle speed matrixes, and updating the particle positions and setting a fitness function; calculating the network loss and voltage deviation of the power distribution network at different particle positions by using a self-adaptive discrete particle swarm algorithm, and calculating after multiple iterations to obtain a global optimal particle position matrix g;
(3) Calculating by using the global optimal particle position matrix g to obtain a reactive power value or an adjustment gear which each reactive compensation device should output; and the local controller of each reactive compensation device adjusts respective reactive power output according to the instruction issued by the control center, so that reactive adjustment on the whole situation of the power distribution network is realized to stabilize the node voltage of the power distribution network and reduce the network loss.
Compared with the prior art, the invention has the beneficial effects that:
1. the method is characterized in that a continuous updating method and a discrete updating method are respectively used for the continuously changing particle positions and the discretely changing particle positions, the basic particle swarm algorithm and the discrete particle swarm algorithm are integrated, the continuous variable and the discrete variable can be simultaneously optimized, and the method is more suitable for actual power distribution network scenes.
2. According to the invention, the key coefficients in the algorithm are dynamically adjusted based on the current state of the particles, so that the algorithm solving efficiency is greatly improved, and the capability of the particle swarm algorithm for searching the global optimal solution is enhanced.
3. The invention can carry out comprehensive calculation aiming at different types and quantities of reactive compensation equipment in the power distribution network, and solve the optimal reactive compensation strategy of the power distribution network under different operating conditions, thereby reducing the network loss and voltage deviation of the power distribution network, and improving the power quality and the power supply reliability.
Drawings
FIG. 1 is a schematic diagram of a 33-node power distribution network;
FIG. 2 is a flow chart of an adaptive discrete particle swarm algorithm.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and not by way of limitation with respect to the scope of the invention.
The invention provides a power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm, which is used for adjusting optimal output values of reactive compensation equipment in a power distribution network under different load levels and power generation levels so as to minimize the comprehensive sum of the overall network loss of the power distribution network and the voltage deviation of each node; the optimization method specifically comprises the following steps:
(1) Acquiring parameters and operation data of reactive compensation equipment participating in reactive power optimization of the power distribution network, and constructing a particle position matrix by using reactive output power or adjustment gears of the reactive compensation equipment;
the reactive compensation equipment comprises two types of compensation equipment for continuously adjusting reactive output and equipment for adjusting reactive output by stepping. The former can be selected as a static var generator or a photovoltaic inverter, and the position of the particle is the reactive power value which the particle should output; the latter can be selected as an on-load tap changer or a capacitor, and the particle position is the gear to be selected.
(2) Randomly initializing to form a plurality of particle position matrixes and a plurality of particle speed matrixes, and updating the particle positions and setting a fitness function; calculating the network loss and voltage deviation of the power distribution network at different particle positions by using a self-adaptive discrete particle swarm algorithm, and calculating after multiple iterations to obtain a global optimal particle position matrix g;
the specific calculation steps of the self-adaptive discrete particle swarm algorithm are as follows:
(2.1) counting the number m of devices participating in reactive power regulation in the power distribution network, and randomly initializing to form an initial particle swarm position matrix X = [ X ] 1 ,x 2 ,…,x m ]Initial velocity matrix V = [ V ] corresponding to particle 1 ,v 2 ,…,v m ](ii) a Wherein x is m 、v m Are column vectors of size n × 1, n representing the number of particles;
(2.2) initializing to form an individual optimal particle position matrix P = [ P ] 1 ,p 2 ,…,p m ](ii) a Wherein p is m Is a column vector of size n × 1; initializing to form an individual fitness extreme value pbest which is a column vector with the size of n multiplied by 1; initializing to form a global fitness extreme value gbest;
(2.3) calculating the fitness f (X (i)) of each particle, wherein f is a fitness function, and X (i) is the ith particle;
if f (X (i)) > pbest (i), let pbest (i) = f (X (i)) and P (i) = X (i); when all the particles in the particle swarm are calculated, let gbest = max (pbest); wherein max represents a function of taking a maximum value, and assigns the particle position with the fitness of gbest to a global optimal particle position matrix g;
the fitness function f is specifically represented by the following formula:
Figure BDA0003893121080000031
in the formula, ω p 、ω u Is a weight coefficient; p loss 、P′ loss Are respectively provided withThe network loss of the power distribution network before and after optimization; du, du' are the voltage deviation before and after optimizing respectively, calculate according to following formula and obtain:
Figure BDA0003893121080000032
in the formula, m is the total number of the node voltages; u. of N Is the rated voltage value of the node; u. of i Is the actual voltage value of the ith node.
The inertia coefficient w is dynamically adjusted according to the fitness of the current particle, which is specifically as follows:
Figure BDA0003893121080000033
in the formula, w max 、w min The maximum value and the minimum value of the inertia coefficient are obtained; f i The fitness of the ith particle is f (X (i)); f av′ Is an average individual fitness limit value of
Figure BDA0003893121080000041
F av Is the average fitness of individuals, and has a value of
Figure BDA0003893121080000042
F m The maximum fitness is max (F) i );k 1 、k 2 To adjust the coefficients.
(2-4) updating the velocity matrix of the particle population according to:
v k+1( i,j)=w*v k (i,j)+c 1 *rand()*(p k (i,j)-x k (i,j))+c 2 *rand()*(g-x k (i,j)) (1.1)
in the formula, v k+1 (i,j)、v k (i, j) are values corresponding to the ith row and the jth column of the velocity matrix V in the (k + 1) th iteration and the kth iteration respectively; x is the number of k (i, j) is a particle swarm location matrix X, p at the kth iteration k (i, j) is the particle individual optimal position matrix P ith row jth column correspondingA value of (d); w is the coefficient of inertia; c. C 1 、c 2 Is an acceleration factor; rand () is a random number generating function for generating random numbers in the range of 0 to 1;
(2.5) according to whether the reactive compensation equipment can continuously perform reactive power regulation, respectively adopting different methods to update the positions of the particle swarms:
for continuously adjustable devices, the position matrix of the population of particles is updated according to:
x k+1 (i,j)=x k (i,j)+v k+1 (i,j) (1.2)
for equipment which cannot continuously perform reactive power regulation, updating the position matrix of the particle swarm according to the following formula:
Figure BDA0003893121080000043
in the formula, x k+1 (i, j) is a value corresponding to the ith row and the jth column of the particle swarm location matrix X in the (k + 1) th iteration; tanh () is a hyperbolic tangent function; else means that rand () < tan h (v) is removed k+1 (i, j)) and-rand () > tanh (v) k+1 (i, j)) other than the case;
(2.6) repeating the steps (2.3) to (2.5) until the maximum iteration number, wherein the global optimal particle position matrix g is the optimal output value of the reactive power compensation equipment and is a column vector with the size of n multiplied by 1, and each reactive power compensation device correspondingly adjusts and outputs reactive power or gears according to the value in the global optimal particle position matrix g.
(3) Calculating by using the global optimal particle position matrix g to obtain a reactive power value or an adjustment gear which each reactive compensation device should output; and the local controller of each reactive compensation device adjusts respective reactive power output according to the instruction issued by the control center, so that reactive adjustment on the whole situation of the power distribution network is realized to stabilize the node voltage of the power distribution network and reduce the network loss.
The implementation process of the present invention is further explained by specific application examples as follows:
the embodiment provides a power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm, which can comprehensively calculate different types and numbers of reactive compensation equipment in a power distribution network and solve the optimal reactive compensation strategy of the power distribution network under different operation conditions, thereby reducing the network loss and voltage deviation of the power distribution network and improving the power quality and the power supply reliability.
The 33-node power distribution network and the node numbers optimized in this embodiment are shown in fig. 1, where node 1 is a balance node, the other nodes are PQ nodes, and an on-load tap changer is installed between node 1 and node 2. Photovoltaic power is connected to the node 7 and the node 25, wind power generators are connected to the node 22 and the node 33, static var generators are connected to the node 9 and the node 29, and capacitors are connected to the node 16 and the node 31.
The equipment participating in reactive power regulation is as follows: the static var generators SVC1 and SVC2 of the node 9 and the node 29 have the adjusting range of-0.5 Mvar to 0.5Mvar; the adjustment ranges of the capacitors SC1 and SC2 at the node 16 and the node 31 are both 5 multiplied by 0.1Mvar; the on-load tap changer (OLTC) has an adjustment range of-4 multiplied by 1.25% to 4 multiplied by 1.25%.
The flow of the adaptive discrete particle swarm algorithm is shown in fig. 2, in this embodiment, the number of devices participating in reactive power regulation is 5, the particle swarm size is 100, and the maximum iteration number is 100.
Firstly, randomly initializing to generate a particle swarm position matrix X = [ X ] 1 ,x 2 ,…,x 5 ]Sum velocity matrix V = [ V ] 1 ,v 2 ,…,v 5 ]Wherein x is 1 ~x 5 A column vector of 100 × 1, representing the output reactive power of SVC1 and SVC2 and the gear of SC1, SC2 and OLTC, x 1 、x 2 Is a continuous variable, x 3 、x 4 、x 5 Are discrete variables. v. of 1 ~v 5 The column vector, 100 x 1, represents the velocity of the corresponding particle position, and is a continuous variable.
Forming a particle individual optimal position matrix P = [ P ] through initialization 1 ,p 2 ,…,p 5 ]Wherein p is 1 ~p 5 Column vectors of size 100 × 1; initializing to form an individual fitness extreme value pbest, wherein the size of the column vector is 100 multiplied by 1; and initializing to form a global fitness extreme value gbest.
Calculating the fitness f (X (i)) of each particle, wherein f is a fitness function and is defined as the following formula:
Figure BDA0003893121080000051
in the formula, ω p 、ω u In this embodiment, ω is taken as a weight coefficient p =ω u =1;P loss 、P′ loss Respectively performing network loss before and after optimization; du and du' are voltage deviation before and after optimization respectively, and du is defined as the following formula:
Figure BDA0003893121080000052
in the formula, v N Is a rated voltage value; u. of i Is the actual voltage value of the ith node.
For the ith particle X (i), if f (X (i)) > pbest (i), let pbest (i) = f (X (i)) and P (i) = X (i), when all particles in the particle population are calculated, let gbest = max (pbest), where max represents taking the maximum function, and assign the particle position with fitness gbest to the global optimal particle position matrix g.
Updating the velocity matrix for the particle swarm according to:
v k+1 (i,j)=w*v k (i,j)+2*rand()*(p(i,j)-x k (i,j))+2*rand()*(g-x k (i,j))
in the formula, v k+1 (i,j)、v k (i, j) are respectively the values corresponding to the ith row and the jth column of the velocity matrix V in the (k + 1) th iteration and the kth iteration; x is the number of k (i,j)、p k (i, j) are values corresponding to a particle swarm position matrix X and an ith row and a jth column of the particle individual optimal position matrix P in the kth iteration respectively; w is the coefficient of inertia; and rand () is a random number generating function, which generates random numbers in the range of 0 to 1.
And w is dynamically adjusted according to the fitness of the current particle, and the adjustment strategy is shown as the following formula:
Figure BDA0003893121080000061
in the formula, F i The fitness of the ith particle is f (X (i)); f av′ Is an average individual fitness limit value of
Figure BDA0003893121080000062
F av Is the average individual fitness of a value of
Figure BDA0003893121080000063
F m The maximum fitness is max (F) i ).
For continuous variable x 1 、x 2 The position is updated according to:
x k+1 (i,j)=x k (i,j)+v k+1 (i,j) (j=1,2)
for discrete variable x 3 、x 4 、x 5 The position is updated according to:
Figure BDA0003893121080000064
in the formula, x k+1 (i, j) is a value corresponding to the ith row and the jth column of the particle swarm location matrix X in the (k + 1) th iteration; tanh () is a hyperbolic tangent function.
Repeating the steps until the maximum iteration number is reached, wherein the global optimal particle position matrix g = [ x ] g1 ,x g2 ,x g3 ,x g4 ,x g5 ]I.e. the optimal output value of the reactive power compensation equipment, wherein x g1 、x g2 Is the optimal reactive power output value, x, of SVC1, SVC2 g3 、x g4 Is the optimal gear position of SC1, SC2, x g5 Is the optimal gear of the OLTC.
In conclusion, the power distribution network optimization method based on the self-adaptive discrete particle swarm algorithm can optimize continuous variables and discrete variables simultaneously. And the inertia coefficient in the algorithm can be dynamically adjusted based on the current state of the particles, the inertia coefficient is reduced for the particles with higher fitness, the inertia coefficient is increased for the particles with better fitness, the algorithm solving efficiency is greatly improved, the capability of the particle swarm algorithm for searching the global optimal solution is enhanced, and the method is more suitable for actual power distribution network scenes.

Claims (7)

1. A power distribution network optimization method based on a self-adaptive discrete particle swarm algorithm is characterized in that the optimal output values of reactive compensation equipment in a power distribution network under different load levels and power generation levels are adjusted, so that the sum of the overall network loss of the power distribution network and the voltage deviation of each node is comprehensively minimized; the optimization method specifically comprises the following steps:
(1) Acquiring parameters and operation data of reactive compensation equipment participating in reactive power optimization of the power distribution network, and constructing a particle position matrix by using reactive output power or adjustment gears of the reactive compensation equipment;
(2) Randomly initializing to form a plurality of particle position matrixes and a plurality of particle speed matrixes, and updating the particle positions and setting a fitness function; calculating the network loss and voltage deviation of the power distribution network at different particle positions by using a self-adaptive discrete particle swarm algorithm, and calculating after multiple iterations to obtain a global optimal particle position matrix g;
(3) Calculating by using the global optimal particle position matrix g to obtain a reactive power value or an adjustment gear which each reactive compensation device should output; and the local controller of each reactive compensation device adjusts respective reactive power output according to the instruction issued by the control center, so that reactive adjustment on the whole situation of the power distribution network is realized to stabilize the node voltage of the power distribution network and reduce the network loss.
2. The method according to claim 1, wherein in step (1), the reactive compensation equipment comprises two types: compensation equipment for continuously adjusting reactive output and equipment for adjusting reactive output by stepping; for the compensation equipment for continuously adjusting reactive output, the position of the particle is the value of the reactive power to be output; and for the equipment which participates in reactive output regulation in the stepping position, the particle position is the gear to be selected.
3. The method according to claim 2, characterized in that the compensation device for continuously regulating reactive power output is a static var generator or a photovoltaic inverter; the equipment which is used for regulating the reactive output by the gear positions is an on-load tap changing transformer or a capacitor.
4. The method according to claim 1, wherein in the step (2), the specific calculation steps of the adaptive discrete particle swarm algorithm are as follows:
(2.1) counting the number m of devices participating in reactive power regulation in the power distribution network, and randomly initializing to form an initial particle swarm position matrix X = [ X ] 1 ,x 2 ,…,x m ]Initial velocity matrix V = [ V ] corresponding to particle 1 ,v 2 ,…,v m ](ii) a Wherein x is m 、v m Are column vectors of size n × 1, n representing the number of particles;
(2.2) initializing to form an individual optimal particle position matrix P = [ P ] 1 ,p 2 ,…,p m ](ii) a Wherein p is m Is a column vector of size n × 1; initializing to form an individual fitness extreme value pbesi which is a column vector with the size of n multiplied by 1; initializing to form a global fitness extreme value gbest;
(2.3) calculating the fitness f (X (i)) of each particle, wherein f is a fitness function, and X (i) is the ith particle;
let pbest (i) = f (X (i)) and P (i) = X (i) if f (X (i)) > pbest (i); let gbest = max (pbest) when all particles in the particle swarm have been calculated; wherein max represents a function of taking a maximum value, and assigns the particle position with the fitness of gbest to a global optimal particle position matrix g;
(2.4) updating the velocity matrix of the population of particles according to:
v k+1 (i,j)=w*v k (i,j)+c 1 *rand()*(p k (i,j)-x k (i,j))+c 2 *rand()*(g-x k (i,j)) (1.1)
in the formula, v k+1 (i,j)、v k (i, j) are values corresponding to the ith row and the jth column of the velocity matrix V in the (k + 1) th iteration and the kth iteration respectively; x is the number of k (i, j) is a particle swarm location matrix X, p at the kth iteration k (i, j) is the value corresponding to the ith row and the jth column of the particle individual optimal position matrix P; w is the coefficient of inertia; c. C 1 、c 2 Is an acceleration factor; rand () is a random number generating function for generating random numbers in the range of 0 to 1;
(2.5) according to whether the reactive compensation equipment can continuously perform reactive power regulation, respectively adopting different methods to update the positions of the particle swarms:
for continuously adjustable devices, the position matrix of the population of particles is updated according to:
x k+1 (i,j)=x k (i,j)+v k+1 (i,j) (1.2)
for equipment which cannot continuously perform reactive power regulation, updating the position matrix of the particle swarm according to the following formula:
Figure FDA0003893121070000021
in the formula, x k+1 (i, j) is a value corresponding to the ith row and the jth column of the particle swarm location matrix X in the (k + 1) th iteration; tanh () is a hyperbolic tangent function; else means that rand () < tan h (v) is removed k+1 (i, j)) and-rand () > tanh (v) k+1 (i, j)) other than the above cases;
(2.6) repeating the steps (2.3) to (2.5) until the maximum iteration number, wherein the global optimal particle position matrix g is the optimal output value of the reactive power compensation equipment and is a column vector with the size of n multiplied by 1, and each reactive power compensation device correspondingly adjusts and outputs reactive power or gears according to the value in the global optimal particle position matrix g.
5. The method according to claim 4, characterized in that in step (2.3), the fitness function f is specifically represented by the following formula:
Figure FDA0003893121070000022
in the formula, omega p 、ω u Is a weight coefficient; p loss 、P′ loss Respectively optimizing the network loss of the power distribution network before and after optimization; du, du' are the voltage deviations before and after optimization respectively.
6. The method of claim 5, wherein the voltage offset is calculated according to the following equation:
Figure FDA0003893121070000023
in the formula, m is the total number of the node voltages; u. u N Is the rated voltage value of the node; u. of i Is the actual voltage value of the ith node.
7. The method according to claim 4, wherein in step (2.4), the inertia coefficient w is dynamically adjusted according to the fitness of the current particle, as follows:
Figure FDA0003893121070000031
in the formula, w max 、w min The maximum value and the minimum value of the inertia coefficient are obtained; f i The fitness of the ith particle is f (X (i)); f av′ Is an average individual fitness limit value of
Figure FDA0003893121070000032
F av Is the average fitness of individuals, and has a value of
Figure FDA0003893121070000033
F m The maximum fitness is max (F) i );k 1 、k 2 To adjust the coefficients.
CN202211270838.3A 2022-10-17 2022-10-17 Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm Pending CN115603330A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211270838.3A CN115603330A (en) 2022-10-17 2022-10-17 Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211270838.3A CN115603330A (en) 2022-10-17 2022-10-17 Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm

Publications (1)

Publication Number Publication Date
CN115603330A true CN115603330A (en) 2023-01-13

Family

ID=84847842

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211270838.3A Pending CN115603330A (en) 2022-10-17 2022-10-17 Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm

Country Status (1)

Country Link
CN (1) CN115603330A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116683471A (en) * 2023-04-28 2023-09-01 国网河北省电力有限公司电力科学研究院 Configuration method, device and equipment of reactive power compensation resource

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116683471A (en) * 2023-04-28 2023-09-01 国网河北省电力有限公司电力科学研究院 Configuration method, device and equipment of reactive power compensation resource
CN116683471B (en) * 2023-04-28 2024-06-11 国网河北省电力有限公司电力科学研究院 Configuration method, device and equipment of reactive power compensation resource

Similar Documents

Publication Publication Date Title
CN114362267B (en) Distributed coordination optimization method for AC/DC hybrid power distribution network considering multi-objective optimization
CN110401197B (en) Multi-target reactive power optimization method for power distribution network considering random output of distributed power supply
CN111277004B (en) Power distribution network source-network-load two-stage multi-target control method and system
CN113471989B (en) Intelligent micro-grid secondary frequency control method based on wolf optimization method
CN114928057B (en) Multi-target power flow optimization method suitable for new energy multi-terminal flexible direct system
CN106229995B (en) Based on the backup power source shunt reactor parameter optimization method under the Anti-Typhoon operational mode of wind power plant
CN114362196A (en) Multi-time-scale active power distribution network voltage control method
CN106712044A (en) Multi-objective optimization method of reactive voltage in wind power plant
CN113224769B (en) Multi-time-scale power distribution network voltage optimization method considering photovoltaic multi-state adjustment
CN115603330A (en) Power distribution network optimization method based on self-adaptive discrete particle swarm algorithm
CN111614110B (en) Receiving-end power grid energy storage optimization configuration method based on improved multi-target particle swarm optimization
CN116388262A (en) Reactive power optimization method and system for distributed photovoltaic distribution network based on multi-objective optimization
CN113255138A (en) Load distribution optimization method for power system
CN115313403A (en) Real-time voltage regulation and control method based on deep reinforcement learning algorithm
CN111245032A (en) Voltage prediction control method considering loss reduction optimization of wind power plant current collection line
CN113629715B (en) UPFC multi-objective optimization configuration method considering power transmission capability
CN108110769A (en) Active distribution network voltage coordination control strategy based on grey wolf algorithm
CN109494750B (en) Hierarchical distributed voltage optimization control method for high and medium voltage distribution network
CN112152268B (en) AC/DC sub-microgrid control method and inter-sub-microgrid group control method
CN112751371A (en) Reactive power optimization method for near-area power grid containing wind power cluster based on second-order cone algorithm
CN113162096A (en) Parameter optimization design method for wind power grid-connected flexible and direct system controller
CN116995749A (en) Micro-grid power optimization method based on electric energy quality regulator
CN115967078A (en) Rural power distribution network voltage distributed optimization control method containing distributed photovoltaic
CN113762622B (en) Virtual power plant access point and capacity optimization planning method
CN112018808B (en) Photovoltaic voltage cooperative control method based on multi-inverter communication

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