CN111490552B - A reactive power optimization method for distribution network - Google Patents

A reactive power optimization method for distribution network Download PDF

Info

Publication number
CN111490552B
CN111490552B CN202010431382.9A CN202010431382A CN111490552B CN 111490552 B CN111490552 B CN 111490552B CN 202010431382 A CN202010431382 A CN 202010431382A CN 111490552 B CN111490552 B CN 111490552B
Authority
CN
China
Prior art keywords
reactive power
particle
power
snop
gear
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
Application number
CN202010431382.9A
Other languages
Chinese (zh)
Other versions
CN111490552A (en
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.)
Shanghai University of Electric Power
State Grid Shanghai Electric Power Co Ltd
Original Assignee
Shanghai University of Electric Power
State Grid Shanghai Electric Power 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 Shanghai University of Electric Power, State Grid Shanghai Electric Power Co Ltd filed Critical Shanghai University of Electric Power
Priority to CN202010431382.9A priority Critical patent/CN111490552B/en
Publication of CN111490552A publication Critical patent/CN111490552A/en
Application granted granted Critical
Publication of CN111490552B publication Critical patent/CN111490552B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • H02J3/1857Arrangements 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 wherein such bridge converter is a multilevel converter
    • 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
    • H02J2203/00Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/20Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
    • 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)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

A reactive power optimization method of a power distribution network aims at a power distribution network comprising SNOP and DG, a reactive power optimization model taking the minimum system active network loss and reactive power exchange with an upper power network as objective functions is established, the gear of an OLTC is optimized in a first stage, the action frequency constraint condition of the OLTC is ignored, the gear of an on-load voltage-regulating transformer OLTC in each period is solved by utilizing a mixed integer particle swarm algorithm, the gear of the on-load voltage-regulating transformer OLTC in each period in one day is obtained by adopting a clustering algorithm, the active network loss and the reactive power are optimized in a second stage, the gear of the on-load voltage-regulating transformer OLTC in each period in one day is used as a known value, and the active power of a first converter VSC1, the reactive power of a second converter VSC2 and the reactive power of a distributed power source DG in an intelligent soft switch SNOP are solved by adopting a standard particle swarm algorithm. The invention can optimize reactive power distribution of the power distribution network and reduce network loss, and has better convergence and optimizing capability.

Description

一种配电网无功优化方法A Reactive Power Optimization Method for Distribution Network

技术领域technical field

本发明涉及一种计及SNOP与DG调节能力的配电网两阶段无功优化方法。The invention relates to a two-stage reactive power optimization method for a distribution network considering the adjustment capabilities of SNOP and DG.

背景技术Background technique

随着分布式电源(Distributed Generation,DG)接入传统配电网,改变了辐射型配电网电压沿着电源点向支路终端节点方向下降的现状,使无功电压控制变量成倍增加。近几年,安装于配电网联络线上的智能软开关(Soft Normally Open Point,SNOP)使配电网无功优化问题的求解难度加大,其原因是SNOP不仅可以改变联络线两端的有功潮流方向,而且其两个变流器VSC可以灵活输出或吸收无功功率。随着DG渗透率的不断提高和SNOP装置的广泛应用,开展计及SNOP与DG无功调节能力的配电网无功优化研究具有一定的现实意义。With the access of distributed generation (DG) to the traditional distribution network, the current situation that the voltage of the radial distribution network drops along the power point to the branch terminal node is changed, and the control variable of reactive power voltage is doubled. In recent years, the intelligent soft switch (Soft Normally Open Point, SNOP) installed on the tie line of the distribution network has made it more difficult to solve the reactive power optimization problem of the distribution network. With the continuous improvement of DG penetration rate and the wide application of SNOP devices, it is of practical significance to carry out research on reactive power optimization of distribution network considering the reactive power adjustment capabilities of SNOP and DG.

发明内容Contents of the invention

本发明提供一种配电网无功优化方法,针对包含SNOP和DG的配电网进行两阶段无功优化,能够优化配电网的无功分布和减小网损,具有较好收敛性和寻优能力。The invention provides a distribution network reactive power optimization method, which performs two-stage reactive power optimization for a distribution network including SNOP and DG, can optimize the reactive power distribution of the distribution network and reduce network loss, and has better convergence and optimization capabilities.

为了达到上述目的,本发明提供一种配电网无功优化方法,针对包含智能软开关SNOP和分布式电源DG的配电网,建立以系统有功网损和与上级电网无功交换功率最小为目标函数的无功优化模型,对无功优化模型进行两阶段优化,第一阶段优化有载调压变压器OLTC的档位,忽略有载调压变压器OLTC一天内动作次数限制的约束条件,利用混合整数粒子群算法求解各个时段有载调压变压器OLTC的档位,采用聚类算法得到有载调压变压器OLTC一天中各个时段的档位,第二阶段优化有功网损与无功功率,将有载调压变压器OLTC一天中各个时段的档位作为已知值,采用标准粒子群算法求解智能软开关SNOP中第一变流器VSC1的有功功率、第一变流器VSC1的无功功率、第二变流器VSC2的无功功率、以及分布式电源DG的无功功率。In order to achieve the above object, the present invention provides a distribution network reactive power optimization method. Aiming at the distribution network including intelligent soft switch SNOP and distributed power supply DG, a reactive power optimization model with the system active network loss and the minimum reactive power exchange power with the upper power grid as the objective function is established, and the reactive power optimization model is optimized in two stages. The first stage optimizes the gear position of the on-load tap changer OLTC, ignoring the constraints of the limit of the number of operations of the on-load tap changer OLTC within a day. In the second stage, the active network loss and reactive power are optimized, and the gear position of the on-load tap changer OLTC in each period of the day is taken as a known value, and the standard particle swarm optimization algorithm is used to solve the active power of the first converter VSC1, the reactive power of the first converter VSC1, the reactive power of the second converter VSC2, and the reactive power of the distributed power supply DG in the intelligent soft switch SNOP.

所述的目标函数为:The stated objective function is:

式中,f为适应度值,Pt,loss为t时刻的有功网损,P0,loss为系统在高峰负荷时初始有功网损,Pt,ref和Qt,ref分别为t时刻上级电网提供的有功功率和无功功率;n为研究时间段;ΩDG为分布式电源DG的无功功率组合、ΩSOP为智能软开关SNOP的有功和无功功率组合;In the formula, f is the fitness value, P t,loss is the active network loss at time t, P 0,loss is the initial active network loss of the system at peak load, P t,ref and Q t,ref are the active power and reactive power provided by the upper grid at time t, respectively; n is the research time period; Ω DG is the reactive power combination of distributed power supply DG, and Ω SOP is the active and reactive power combination of intelligent soft switch SNOP;

约束条件为:The constraints are:

系统潮流约束:f(Pi,Qi,Ui)=0System power flow constraints: f(P i ,Q i ,U i )=0

节点电压约束:Ui,min≤Ui≤Ui,max Node voltage constraints: U i,min ≤U i ≤U i,max

支路潮流约束: Branch flow constraints:

智能软开关SNOP的功率约束:The power constraints of the smart soft-switching SNOP:

P1(t)+P2(t)=0P 1 (t)+P 2 (t)=0

式中,P1(t)和Q1(t)为t时段智能软开关SNOP中第一变流器VSC1的有功功率和无功功率;P2(t)和Q2(t)为t时段智能软开关SNOP中第二变流器VSC2的有功功率和无功功率;S1max和S2max为智能软开关SNOP中两个变流器的容量;In the formula, P 1 (t) and Q 1 (t) are the active power and reactive power of the first converter VSC1 in the intelligent soft switching SNOP in the period t; P 2 (t) and Q 2 (t) are the active power and reactive power of the second converter VSC2 in the intelligent soft switching SNOP in the period t; S 1max and S 2max are the capacities of the two converters in the intelligent soft switching SNOP;

分布式电源DG的功率约束:Power constraints of distributed power generation DG:

式中,分别为第i个分布式电源DG的实际有功功率和无功功率,其中的值取决于分布式电源DG所对应的风机和光伏资源情况;θmin为分布式电源DG允许最小功率因数所对应的角度;/>是分布式电源DG的容量;In the formula, are the actual active power and reactive power of the i-th distributed power generation DG, respectively, where The value of depends on the fan and photovoltaic resources corresponding to the distributed power generation DG; θ min is the angle corresponding to the minimum power factor of the distributed power generation DG;/> is the capacity of the distributed power supply DG;

有载调压变压器OLTC的档位调节限制约束:The gear adjustment limit constraints of the on-load tap changer OLTC:

TCmin≤TCt≤TCmax∩TC∈ZTC min ≤TC t ≤TC max ∩TC∈Z

NTC≤NTCmax N TC ≤ N TCmax

式中,Pi、Qi为节点i注入的总有功功率和无功功率,Ui为节点i的电压,Ui,min和Ui,max为节点i的最小和最大允许电压,Iij和Iij,max为节点i和节点j之间支路的电流幅值和电流幅值上限,TCt为t时刻的有载调压变压器OLTC的档位,TCmin和TCmax为有载调压变压器OLTC的最小档位和最大档位,Z为整数集,NTC和NTCmax分别为有载调压变压器OLTC一天的实际动作次数和最大允许动作次数。In the formula, P i and Q i are the total active power and reactive power injected by node i, U i is the voltage of node i, U i,min and U i,max are the minimum and maximum allowable voltages of node i, I ij and I ij, max are the current amplitude and the upper limit of the current amplitude of the branch between node i and node j, TC t is the gear position of the on-load tap changer OLTC at time t, TC min and TC max are the minimum gear and the maximum gear of the on-load tap changer OLTC, Z is An integer set, N TC and N TCmax are the actual number of actions and the maximum allowable number of actions of the on-load tap changer OLTC in one day, respectively.

所述的第一阶段优化有载调压变压器OLTC档位的方法包含以下步骤:The method for optimizing the OLTC gear of the on-load tap changing transformer in the first stage includes the following steps:

步骤S2.1、初始化种群规模、迭代次数、粒子初始位置和速度、粒子位置限值和速度限值,对有载调压变压器OLTC的档位、智能软开关SNOP的第一变流器VSC1的有功功率P1、第一变流器VSC1和第二变流器VSC2的无功功率Q1和Q2、分布式电源DG的无功功率进行编码;Step S2.1, initialize population size, number of iterations, initial position and speed of particles, limit value of particle position and speed limit, encode the gear position of the on-load tap changer OLTC, the active power P 1 of the first converter VSC1 of the intelligent soft switch SNOP, the reactive power Q 1 and Q 2 of the first converter VSC1 and the second converter VSC2, and the reactive power of the distributed power supply DG;

设置粒子位置限值:Set particle position limits:

表示有载调压变压器OLTC档位TC的粒子位置最大值和最小值分别设置为TCmax和TCmin,表示智能软开关SNOP有功功率P1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示智能软开关SNOP无功功率Q1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示智能软开关SNOP无功功率Q2(t)的粒子位置最大值和最小值分别为S2max和-S2max,表示分布式电源DG的无功功率QDG的粒子位置最大值和最小值分别为和/> The maximum and minimum particle positions representing the OLTC gear position of the on-load tap changer are set to TC max and TC min respectively, the maximum and minimum particle positions representing the active power P 1 (t) of the intelligent soft switch SNOP are S 1max and -S 1max respectively, the maximum and minimum particle positions representing the reactive power Q 1 (t) of the intelligent soft switch SNOP are respectively S 1max and -S 1max , representing the maximum particle position of the intelligent soft switch SNOP reactive power Q 2 (t) and the minimum values are S 2max and -S 2max respectively, indicating that the maximum and minimum particle positions of the reactive power Q DG of the distributed power generation DG are respectively and />

设置粒子速度限值范围:[-0.2×(位置最大值-位置最小值),0.2×(位置最大值-位置最小值)];Set particle velocity limit range: [-0.2×(maximum position-minimum position), 0.2×(maximum position-minimum position)];

步骤S2.2、将粒子的位置解码为有载调压变压器OLTC的档位和智能软开关SNOP的第一变流器VSC1的有功功率P1、第一变流器VSC1和第二变流器VSC2的无功功率Q1和Q2、分布式电源DG的无功功率,并进行潮流计算,使其满足系统潮流约束、节点电压约束和支路潮流约束,根据目标函数计算各个粒子的适应度值;Step S2.2, decode the position of the particle into the gear position of the on-load tap changer OLTC and the active power P 1 of the first converter VSC1 of the intelligent soft switch SNOP, the reactive power Q 1 and Q 2 of the first converter VSC1 and the second converter VSC2, and the reactive power of the distributed power supply DG, and perform power flow calculation to make it meet the system power flow constraints, node voltage constraints and branch power flow constraints, and calculate the fitness value of each particle according to the objective function;

步骤S2.3、统计粒子个体的极值和群体极值,粒子个体的极值就是粒子的适应度值的历史最小值,群体极值就是所有粒子的历史最小值;Step S2.3, counting the extreme value of the individual particle and the extreme value of the group, the extreme value of the individual particle is the historical minimum value of the fitness value of the particle, and the group extreme value is the historical minimum value of all particles;

步骤S2.4、更新粒子群的位置和速度,根据整数约束、粒子位置限值和粒子速度限值修正更新后的位置和速度;Step S2.4, update the position and velocity of the particle swarm, and correct the updated position and velocity according to the integer constraint, particle position limit and particle velocity limit;

位置更新和速度更新公式如下:The position update and velocity update formulas are as follows:

式中,c1、c2为局部寻优方向和全局寻优方向的权重;r1、r2为两个[0-1]之间的随机数;和/>为第n次迭代第id个粒子的位置和速度,/>为第n次迭代第id个粒子的个体极值,pngd为第n次迭代种群极值;In the formula, c 1 and c 2 are the weights of the local optimization direction and the global optimization direction; r 1 and r 2 are random numbers between two [0-1]; and /> The position and velocity of the id particle for the nth iteration, /> is the individual extremum of the id particle in the nth iteration, and p ngd is the population extremum in the nth iteration;

步骤S2.5、判断是否达到迭代次数,若不满足则跳转到步骤S2.2,若满足则进行步骤S2.6;Step S2.5, judging whether the number of iterations has been reached, if not, jump to step S2.2, if satisfied, go to step S2.6;

步骤S2.6、统计各个时段有载调压变压器OLTC的档位,每个档位初始化为一个聚类,将相邻相同档位的聚类合并为一个聚类,统计合并后的聚类数为NTCStep S2.6, counting the stalls of the on-load tap changer OLTC in each time period, each stall is initialized as a cluster, and the adjacent clusters of the same stall are merged into one cluster, and the number of clusters after the merging is N TC ;

步骤S2.7、计算各个相邻两聚类合并后的评价函数值,选取评价函数最小的方案进行合并;Step S2.7, calculating the value of the evaluation function of each adjacent two clusters after merging, and selecting the scheme with the smallest evaluation function for merging;

聚类的评价函数fcluster定义如下:The clustering evaluation function f cluster is defined as follows:

式中,K为聚类数,取值为有载调压变压器OLTC最大允许动作次数NTCmax,Ji为第i个聚类,TCt为聚类Ji中t时刻的档位,TCi为第i个聚类的档位,其值等于该聚类中所有档位的均值并就近取整;In the formula, K is the number of clusters, and its value is the maximum allowable number of operations of the on-load tap changer OLTC N TCmax , J i is the i-th cluster, TC t is the gear position of the cluster J i at time t, and TC i is the gear position of the i-th cluster, and its value is equal to the average value of all gears in the cluster and rounded up to the nearest integer;

步骤S2.8、合并后若聚类数NTC≤NTCmax,则转跳转到步骤S2.9,否则继续进行步骤S2.7;Step S2.8, if the number of clusters N TC ≤ N TCmax after merging, go to step S2.9, otherwise continue to step S2.7;

步骤S2.9、计算各个聚类中档位的平均值,四舍五入对应的整数为相应时间段内的有载调压变压器OLTC的档位,计算聚类评价函数值。Step S2.9, calculate the average value of the gears in each cluster, round the corresponding integer to be the gear of the on-load tap changer OLTC in the corresponding time period, and calculate the value of the clustering evaluation function.

所述的第二阶段优化有功网损与无功功率的方法包含以下步骤:The method for optimizing active network loss and reactive power in the second stage includes the following steps:

步骤S3.1、初始化种群规模、迭代次数、粒子初始位置和速度、粒子位置限值和速度限值,对智能软开关SNOP的第一变流器VSC1的有功功率P1、第一变流器VSC1和第二变流器VSC2的无功功率Q1和Q2、分布式电源DG的无功功率进行编码;Step S3.1, initialize the population size, number of iterations, initial particle position and velocity, particle position limit and velocity limit, and encode the active power P 1 of the first converter VSC1 of the smart soft switch SNOP, the reactive power Q 1 and Q 2 of the first converter VSC1 and the second converter VSC2, and the reactive power of the distributed power supply DG;

设置粒子位置限值:Set particle position limits:

表示有载调压变压器OLTC档位TC的粒子位置最大值和最小值分别设置为TCmax和TCmin,表示智能软开关SNOP有功功率P1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示智能软开关SNOP无功功率Q1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示智能软开关SNOP无功功率Q2(t)的粒子位置最大值和最小值分别为S2max和-S2max,表示分布式电源DG的无功功率QDG的粒子位置最大值和最小值分别为和/> The maximum and minimum particle positions representing the OLTC gear position of the on-load tap changer are set to TC max and TC min respectively, the maximum and minimum particle positions representing the active power P 1 (t) of the intelligent soft switch SNOP are S 1max and -S 1max respectively, the maximum and minimum particle positions representing the reactive power Q 1 (t) of the intelligent soft switch SNOP are respectively S 1max and -S 1max , representing the maximum particle position of the intelligent soft switch SNOP reactive power Q 2 (t) and the minimum values are S 2max and -S 2max respectively, indicating that the maximum and minimum particle positions of the reactive power Q DG of the distributed power generation DG are respectively and />

设置粒子速度限值范围:[-0.2×(位置最大值-位置最小值),0.2×(位置最大值-位置最小值)];Set particle velocity limit range: [-0.2×(maximum position-minimum position), 0.2×(maximum position-minimum position)];

步骤S3.2、将粒子的位置解码为有载调压变压器OLTC的档位和智能软开关SNOP的第一变流器VSC1的有功功率P1、第一变流器VSC1和第二变流器VSC2的无功功率Q1和Q2、分布式电源DG的无功功率,并进行潮流计算,使其满足系统潮流约束、节点电压约束和支路潮流约束,根据目标函数计算各个粒子的适应度值;Step S3.2, decode the position of the particle into the gear position of the on-load tap changer OLTC and the active power P 1 of the first converter VSC1 of the intelligent soft switch SNOP, the reactive power Q 1 and Q 2 of the first converter VSC1 and the second converter VSC2, and the reactive power of the distributed power supply DG, and perform power flow calculation to make it meet the system power flow constraints, node voltage constraints and branch power flow constraints, and calculate the fitness value of each particle according to the objective function;

步骤S3.3、统计粒子个体的极值和群体极值,粒子个体的极值就是粒子的适应度值的历史最小值,群体极值就是所有粒子的历史最小值;Step S3.3, counting the extreme value of the individual particle and the extreme value of the group, the extreme value of the individual particle is the historical minimum value of the fitness value of the particle, and the group extreme value is the historical minimum value of all particles;

步骤S3.4、更新粒子群的位置和速度,根据整数约束、粒子位置限值和粒子速度限值修正更新后的位置和速度;Step S3.4, updating the position and velocity of the particle swarm, and correcting the updated position and velocity according to the integer constraint, particle position limit and particle velocity limit;

位置更新和速度更新公式如下:The position update and velocity update formulas are as follows:

式中,c1、c2为局部寻优方向和全局寻优方向的权重;r1、r2为两个[0-1]之间的随机数;和/>为第n次迭代第id个粒子的位置和速度,/>为第n次迭代第id个粒子的个体极值,pngd为第n次迭代种群极值;In the formula, c 1 and c 2 are the weights of the local optimization direction and the global optimization direction; r 1 and r 2 are random numbers between two [0-1]; and /> The position and velocity of the id particle for the nth iteration, /> is the individual extremum of the id particle in the nth iteration, and p ngd is the population extremum in the nth iteration;

步骤S3.5、判断是否达到迭代次数,若不满足则跳转到步骤S3.2,若满足,则群体极值对应的粒子位置就是最优解。Step S3.5, judging whether the number of iterations is reached, if not, jump to step S3.2, if satisfied, the particle position corresponding to the population extremum is the optimal solution.

本发明针对包含SNOP和DG的配电网,建立以系统有功网损和与上级电网无功交换功率最小为目标函数的无功优化模型,将有载调压变压器OLTC一天内动作次数限制作为约束条件,对无功优化模型进行两阶段优化,第一阶段优化OLTC的档位,第二阶段优化有功网损与无功功率,SNOP设备控制灵活,与DG配合能够优化配电网的无功分布和减小网损,本发明具有较好收敛性和寻优能力。Aiming at the distribution network including SNOP and DG, the present invention establishes a reactive power optimization model with the minimum active network loss of the system and the minimum reactive power exchanged with the upper-level power grid as the objective function, and takes the limit of the number of operations of the on-load tap changer OLTC in one day as a constraint condition, and performs two-stage optimization on the reactive power optimization model. The first stage optimizes the gear position of the OLTC, and the second stage optimizes active network loss and reactive power.

附图说明Description of drawings

图1是智能软开关SNOP的典型结构图。Figure 1 is a typical structure diagram of an intelligent soft switch SNOP.

图2是智能软开关SNOP中变流器VSC的运行范围示意图。Fig. 2 is a schematic diagram of the operating range of the converter VSC in the intelligent soft switch SNOP.

图3是本发明提供的一种配电网无功优化方法的流程图。Fig. 3 is a flowchart of a reactive power optimization method for a distribution network provided by the present invention.

图4是本发明一个实施例中改进的IEEE33节点系统的示意图。Fig. 4 is a schematic diagram of an improved IEEE33 node system in an embodiment of the present invention.

图5是本发明一个实施例中负荷波动情况、风机和光伏出力曲线图。Fig. 5 is a graph showing load fluctuations, fan and photovoltaic output in an embodiment of the present invention.

图6是本发明一个实施例中OLTC档位变化图。Fig. 6 is a diagram of OLTC gear change in an embodiment of the present invention.

图7是本发明一个实施例中目标函数优化结果。Fig. 7 is the optimization result of the objective function in one embodiment of the present invention.

图8是本发明一个实施例中SNOP控制变量优化结果示意图。Fig. 8 is a schematic diagram of the optimization result of the SNOP control variable in an embodiment of the present invention.

图9是本发明一个实施例中DG控制变量优化结果示意图。Fig. 9 is a schematic diagram of the optimization results of DG control variables in an embodiment of the present invention.

图10是本发明一个实施例中粒子群算法的收敛性的示意图。Fig. 10 is a schematic diagram of the convergence of the particle swarm optimization algorithm in an embodiment of the present invention.

具体实施方式Detailed ways

以下根据图1~图10,具体说明本发明的较佳实施例。A preferred embodiment of the present invention will be specifically described below with reference to FIGS. 1 to 10 .

由于负荷和风机和光伏等资源的波动性,无功优化问题需要求解不同时间段的优化结果,同时应满足时间上关联性,比如有载调压变压器(OLTC)一天的调档次数限制。在目标函数方面,主要考虑网损最小、无功发电经济性最优、运行风险最小、以及这些目标的组合。有关研究表明,配电网中接入SNOP能够显著提高负荷点电压水平和降低网损,对无功优化具有重要作用。含SNOP与DG的配电网无功优化的难点在于协调多个SNOP与DG的有功无功功率,同时应该满足多时间尺度的优化。Due to the fluctuation of loads and resources such as wind turbines and photovoltaics, the reactive power optimization problem needs to solve the optimization results in different time periods, and at the same time, it should meet the time correlation, such as the limit on the number of shifts of the on-load tap changer (OLTC) in a day. In terms of the objective function, the main considerations are the minimum network loss, the optimal economy of reactive power generation, the minimum operation risk, and the combination of these objectives. Relevant studies have shown that accessing SNOP in the distribution network can significantly increase the voltage level of the load point and reduce the network loss, which plays an important role in reactive power optimization. The difficulty of reactive power optimization of distribution network with SNOPs and DGs is to coordinate the active and reactive power of multiple SNOPs and DGs, and at the same time, it should satisfy the optimization of multiple time scales.

传统的配电网闭环设计和开环运行,辐射状网络通过联络开关实现正常运行时的网架重构和故障状态下负荷转供。SNOP可以代替联络开关,实现两条馈线之间交换有功功率,并提供一定的电压无功支撑。SNOP的典型结构如图1所示。无功优化问题属于正常运行状态的场景,本实施例中,SNOP采用PQ-VdcQ控制模式,控制变量有三个:第一变流器VSC1流向第二变流器VSC2的有功功率输出P1、VSC1和VSC2的无功功率Q1和Q2,其运行范围示意图如图2所示,功率约束公式如式(1)~(3)。The traditional closed-loop design and open-loop operation of distribution network, the radial network realizes the network structure reconstruction during normal operation and load transfer under fault state through tie switches. The SNOP can replace the tie switch to realize the exchange of active power between the two feeders and provide a certain voltage and reactive power support. A typical structure of a SNOP is shown in Figure 1. The reactive power optimization problem belongs to the scenario of normal operation. In this embodiment, SNOP adopts the PQ-V dc Q control mode, and there are three control variables: the active power output P 1 flowing from the first converter VSC1 to the second converter VSC2, and the reactive power Q 1 and Q 2 of VSC1 and VSC2 .

P1(t)+P2(t)=0(1)P 1 (t)+P 2 (t)=0(1)

式中,P1(t)和Q1(t)为t时段SNOP中第一变流器VSC1的有功功率和无功功率;P2(t)和Q2(t)为t时段SNOP中第二变流器VSC2的有功功率和无功功率;S1max和S2max为SNOP两个变流器的容量。In the formula, P 1 (t) and Q 1 (t) are the active power and reactive power of the first converter VSC1 in the SNOP in the t period; P 2 (t) and Q 2 (t) are the active power and reactive power of the second converter VSC2 in the SNOP in the t period; S 1max and S 2max are the capacities of the two converters in the SNOP.

通过变流器接入电网的分布式电源在提供有功功率的同时也能根据系统运行需要发出或吸收无功功率。变流器可以通过有功功率削减实现无功输出,大容量的变流器也可以在不损失有功输出的情况下实现额外的无功支撑。电网运营单位一般要求接入电网的变流器类型分布式电源能够实现超前或滞后运行,且功率因数应能在[cosθmin,1]范围内连续可调。分布式电源变流器的容量应满足/>式中,/>为第i个DG的最大有功功率。分布式电源的运行约束如数学表达式(4)和(5)所示,其变流器的容量约束条件同式(2)。The distributed power generation connected to the grid through the converter can not only provide active power, but also emit or absorb reactive power according to the needs of system operation. Converters can achieve reactive power output through active power reduction, and large-capacity converters can also achieve additional reactive power support without losing active power output. The power grid operation unit generally requires that the converter-type distributed power generation connected to the grid can achieve leading or lagging operation, and the power factor should be continuously adjustable within the range of [cosθ min , 1]. Capacity of Distributed Power Converter Should meet /> In the formula, /> is the maximum active power of the i-th DG. The operation constraints of distributed power generation are shown in mathematical expressions (4) and (5), and the capacity constraints of its converters are the same as equation (2).

式中,分别为第i个分布式电源DG的实际有功功率和无功功率,其中的值取决于DG所对应的风机和光伏资源情况;θmin为分布式电源允许最小功率因数所对应的角度。In the formula, are the actual active power and reactive power of the i-th distributed power generation DG, respectively, where The value of depends on the fan and photovoltaic resources corresponding to DG; θ min is the angle corresponding to the minimum power factor allowed by distributed power generation.

配电网无功优化需要考虑使系统的有功网损最小,同时配电网应满足“无功就地平衡”的原则,即配电网的根节点与上级电网交换的无功应尽量少。因此,如图3所示,本发明提供了一种配电网无功优化方法,针对包含SNOP和DG的配电网,建立以系统有功网损和与上级电网无功交换功率最小为目标函数的无功优化模型,将有载调压变压器OLTC一天内动作次数限制作为约束条件,对无功优化模型进行两阶段优化,第一阶段优化OLTC的档位,忽略OLTC的动作次数约束条件,利用混合整数粒子群算法求解各个时段有载调压变压器OLTC的档位,采用聚类算法得到有载调压变压器OLTC的动作方案,即得到OLTC一天各个时段的档位,第二阶段优化有功网损与无功功率,将有载调压变压器OLTC一天各个时段的档位作为已知值,采用标准粒子群算法求解SNOP与DG的运行状态,即VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率QDGThe reactive power optimization of the distribution network needs to consider minimizing the active network loss of the system. At the same time, the distribution network should meet the principle of "reactive power local balance", that is, the reactive power exchanged between the root node of the distribution network and the upper-level power grid should be as small as possible.因此,如图3所示,本发明提供了一种配电网无功优化方法,针对包含SNOP和DG的配电网,建立以系统有功网损和与上级电网无功交换功率最小为目标函数的无功优化模型,将有载调压变压器OLTC一天内动作次数限制作为约束条件,对无功优化模型进行两阶段优化,第一阶段优化OLTC的档位,忽略OLTC的动作次数约束条件,利用混合整数粒子群算法求解各个时段有载调压变压器OLTC的档位,采用聚类算法得到有载调压变压器OLTC的动作方案,即得到OLTC一天各个时段的档位,第二阶段优化有功网损与无功功率,将有载调压变压器OLTC一天各个时段的档位作为已知值,采用标准粒子群算法求解SNOP与DG的运行状态,即VSC1的有功功率P 1 、VSC1和VSC2的无功功率Q 1和Q 2 、DG的无功功率Q DG

具体来说,本发明包含以下步骤:Specifically, the present invention comprises the following steps:

步骤S1、建立以系统有功网损和与上级电网无功交换功率最小为目标函数的无功优化模型,其中,SNOP的有功功率PSOP与无功功率QSOP、DG的无功功率QDG和有载调压变压器(OLTC)的档位TC为控制变量。Step S1, establishing a reactive power optimization model with the objective function of the system active network loss and the minimum reactive power exchanged with the upper-level power grid, wherein the active power P SOP and reactive power Q SOP of the SNOP, the reactive power Q DG of the DG, and the gear position TC of the on-load tap changer transformer (OLTC) are control variables.

为了实现量纲的统一,对两个目标进行标幺化处理,即将有名值除以基准值得到单位为1的标幺值,构建的目标函数可表示为:In order to achieve the unification of dimensions, the two objectives are processed per unit, that is, the nominal value is divided by the reference value to obtain the per unit value with a unit of 1. The constructed objective function can be expressed as:

式中,f为适应度值,Pt,loss为t时刻的有功网损,P0,loss为系统在高峰负荷时初始有功网损,Pt,ref和Qt,ref分别为t时刻上级电网提供的有功功率和无功功率;n为研究时间段,本实施例中以小时为研究间隔,则n=24;ΩDG为DG的无功功率组合、ΩSOP为SNOP的有功和无功功率组合。综上,公式(6)的第一部分为实时网损与初始有功网损的比值,第二部分为与上级电网提供的无功功率绝对值和视在功率的比值。In the formula, f is the fitness value, P t,loss is the active network loss at time t, P 0,loss is the initial active network loss of the system at peak load, P t,ref and Q t,ref are the active power and reactive power provided by the upper power grid at time t, respectively; n is the research time period, and in this embodiment, the research interval is hours, so n=24; Ω DG is the reactive power combination of DG, and Ω SOP is the active and reactive power combination of SNOP. In summary, the first part of formula (6) is the ratio of the real-time network loss to the initial active network loss, and the second part is the ratio of the absolute value of the reactive power and the apparent power provided by the superior power grid.

QDG是表示某个DG的无功功率,侧重于表示该值为变量;ΩDG是使目标函数f最小的解中各个DG的无功功率组合,强调这个值是该目标函数的优化变量,目标函数最优时,它即是一系列具体值。一个是单变量,一个是变量集合。Q DG is to represent the reactive power of a certain DG, focusing on expressing that this value is a variable; Ω DG is the combination of reactive power of each DG in the solution that minimizes the objective function f, emphasizing that this value is the optimization variable of the objective function. When the objective function is optimal, it is a series of specific values. One is a single variable and the other is a set of variables.

P1指某特定SNOP的VSC1的有功功率,Q1和Q2指某特定SNOP的VSC1和VSC2的无功功率,两者的集合即为QSOP。ΩSOP是指多个SNOP的有功无功集合,即多个SNOP的PSOP和QSOP集合。P 1 refers to the active power of VSC1 of a specific SNOP, Q 1 and Q 2 refer to the reactive power of VSC1 and VSC2 of a specific SNOP, and the set of the two is Q SOP . Ω SOP refers to the set of active and reactive power of multiple SNOPs, that is, the set of PSOP and Q SOP of multiple SNOPs.

约束条件主要考虑系统潮流约束(见式(7))、节点电压约束(见式(8))、支路潮流约束(见式(9))、SNOP和DG运行约束(见式(1)-(5))、档位调节限制(见式(10)-(11))。Constraint conditions mainly consider system power flow constraints (see formula (7)), node voltage constraints (see formula (8)), branch power flow constraints (see formula (9)), SNOP and DG operation constraints (see formulas (1)-(5)), gear adjustment restrictions (see formulas (10)-(11)).

f(Pi,Qi,Ui)=0 (7)f(P i ,Q i ,U i )=0 (7)

Ui,min≤Ui≤Ui,max (8)U i,min ≤U i ≤U i,max (8)

TCmin≤TCt≤TCmax∩TC∈Z (10)TC min ≤TC t ≤TC max ∩TC∈Z (10)

NTC≤NTCmax (11)N TC ≤ N TCmax (11)

式中,Pi、Qi为节点i注入的总有功功率和无功功率,Ui为节点i的电压,Ui,min和Ui,max为节点i的最小和最大允许电压,Iij和Iij,max为节点i和节点j之间支路的电流幅值和电流幅值上限,TCt为t时刻的OLTC档位,TCmin和TCmax为OLTC的最小档位和最大档位,Z为整数集,NTC和NTCmax分别为OLTC一天的实际动作次数和最大允许动作次数。In the formula, P i and Q i are the total active power and reactive power injected by node i, U i is the voltage of node i, U i,min and U i,max are the minimum and maximum allowable voltages of node i, I ij and I ij,max are the current amplitude and the upper limit of the current amplitude of the branch between node i and node j, TC t is the OLTC gear at time t, TC min and TC max are the minimum gear and the maximum gear of OLTC, Z is an integer set, N TC and N TCmax They are the actual number of actions and the maximum allowed number of actions of OLTC in one day, respectively.

以上所建立的无功优化模型为带时间耦合的混合整数规划问题(MIP)。The reactive power optimization model established above is a mixed integer programming problem (MIP) with time coupling.

无功优化时,OLTC的档位和SNOP与DG的无功出力具有耦合关系,为了处理OLTC一天内动作次数限制,即约束条件(11),采用两阶段无功优化方法。During reactive power optimization, the gear position of OLTC and SNOP have a coupling relationship with the reactive power output of DG. In order to deal with the limitation of the number of operations of OLTC in a day, that is, the constraint condition (11), a two-stage reactive power optimization method is adopted.

步骤S2、第一阶段优化,忽略约束条件(11),采用混合整数粒子群算法求解各个时段的优化方案,对各个时段的OLTC的档位数进行聚类,得到一整天的OLTC动作方案。Step S2, the first stage of optimization, ignoring the constraint condition (11), using the mixed integer particle swarm optimization algorithm to solve the optimization scheme of each time period, clustering the number of OLTC stalls in each time period, and obtaining the OLTC action plan for the whole day.

对OLTC的档位、VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率QDG进行编码,采用混合整数粒子群算法计算OLTC在各个时段的档位,位置更新和速度更新公式如下:Encode the gear position of OLTC, the active power P 1 of VSC1, the reactive power Q 1 and Q 2 of VSC1 and VSC2, and the reactive power Q DG of DG, and use the mixed integer particle swarm optimization algorithm to calculate the gear position of OLTC at each time period. The position update and speed update formulas are as follows:

式中,c1、c2为局部寻优方向和全局寻优方向的权重;r1、r2为两个[0-1]之间的随机数;和/>为第n次迭代第id个粒子的位置和速度,/>为第n次迭代第id个粒子的个体极值,pngd为第n次迭代种群极值。根据公式(1)-(5)、(10)设置粒子位置的最大值和最小值,具体为:表示有载调压变压器(OLTC)档位TC的粒子位置最大值和最小值分别设置为TCmax和TCmin,表示SNOP有功功率P1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示SNOP无功功率Q1(t)的粒子位置最大值和最小值分别为S1max和-S1max,表示SNOP无功功率Q2(t)的粒子位置最大值和最小值分别为S2max和-S2max,表示DG的无功功率QDG的粒子位置最大值和最小值分别为/>和/> In the formula, c 1 and c 2 are the weights of the local optimization direction and the global optimization direction; r 1 and r 2 are random numbers between two [0-1]; and /> The position and velocity of the id particle for the nth iteration, /> is the individual extremum of the id particle in the nth iteration, and p ngd is the population extremum in the nth iteration. Set the maximum and minimum particle positions according to formulas (1)-(5) and (10), specifically: the maximum and minimum particle positions representing the on-load tap-changing transformer (OLTC) gear TC are set to TC max and TC min respectively, the maximum and minimum particle positions representing the SNOP active power P 1 (t) are S 1max and -S 1max respectively, and the maximum and minimum particle positions representing the SNOP reactive power Q 1 (t) are S 1max and -S 1max respectively , indicating that the maximum and minimum particle positions of SNOP reactive power Q 2 (t) are S 2max and -S 2max , respectively , indicating that the maximum and minimum particle positions of DG reactive power Q 2 (t) are /> and />

上述计算可以得到OLTC在各个时段的档位,通过调整部分时刻档位值使整体动作次数满足限制条件,采用聚类算法实现该目的。聚类的评价函数fcluster定义如下:The above calculation can obtain the gear position of OLTC in each time period. By adjusting the gear value at some time, the overall number of actions can meet the restriction conditions, and the clustering algorithm is used to achieve this purpose. The clustering evaluation function f cluster is defined as follows:

式中,K为聚类数,可以取值为OLTC最大允许动作次数NTCmax,Ji为第i个聚类,TCt为聚类Ji中t时刻的档位,TCi为第i个聚类的档位,其值等于该聚类中所有档位的均值并就近取整。In the formula, K is the number of clusters, which can be the maximum allowable number of actions of OLTC N TCmax , J i is the i-th cluster, TC t is the gear at time t in cluster J i , and TC i is the gear of the i-th cluster, and its value is equal to the average value of all gears in the cluster and rounded up to the nearest integer.

进一步,所述的第一阶段优化具体包含以下步骤:Further, the first-stage optimization specifically includes the following steps:

步骤S2.1、种群初始化。初始化种群规模、迭代次数、粒子初始位置和速度、粒子位置限值和速度限值。粒子位置限值根据公式(1)-(5)、(10)设置,粒子速度限值范围为[-0.2×(位置最大值-位置最小值),0.2×(位置最大值-位置最小值)]。Step S2.1, population initialization. Initialize the population size, number of iterations, particle initial position and velocity, particle position limit and velocity limit. The particle position limit is set according to formulas (1)-(5) and (10), and the particle speed limit range is [-0.2×(maximum position-minimum position), 0.2×(maximum position-minimum position)].

初始化粒子初始位置的时候,对OLTC的档位、VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率QDG进行编码。粒子位置的第1个值代表OLTC档位,第2个值代表SNOP1的VSC1的P1,依次类推,即确定粒子位置的各个值的物理含义就是编码过程,这个确定后才能确定粒子位置各个值的取值范围,即粒子位置限值。When initializing the initial position of the particle, encode the gear of OLTC, the active power P 1 of VSC1, the reactive power Q 1 and Q 2 of VSC1 and VSC2, and the reactive power Q DG of DG. The first value of the particle position represents the OLTC gear, the second value represents the P 1 of VSC1 of SNOP1, and so on, that is, to determine the physical meaning of each value of the particle position is the encoding process, and the value range of each value of the particle position can be determined after this is determined, that is, the particle position limit.

步骤S2.2、将粒子的位置解码为OLTC的档位和SNOP与DG的运行状态(SNOP与DG的运行状态即VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率),并进行潮流计算,使满足约束条件(7)-(9)。根据公式(6)计算各个粒子的适应度值。Step S2.2. Decode the position of the particle into the position of the OLTC and the operating state of SNOP and DG (the operating state of SNOP and DG is the active power P 1 of VSC1, the reactive power Q 1 and Q 2 of VSC1 and VSC2, and the reactive power of DG), and perform power flow calculation to satisfy the constraints (7)-(9). Calculate the fitness value of each particle according to formula (6).

步骤S2.3、统计粒子个体的极值和群体极值。粒子群算法每次迭代后,经过公式(6)就能计算每个粒子的适应度值,粒子个体的极值就是每次迭代后,将该粒子的适应度值的历史最小值,群体极值就是所有粒子的历史最小值。Step S2.3, counting individual extreme values and group extreme values of particles. After each iteration of the particle swarm algorithm, the fitness value of each particle can be calculated through formula (6). The extreme value of the individual particle is the historical minimum value of the fitness value of the particle after each iteration, and the group extreme value is the historical minimum value of all particles.

步骤S2.4、根据公式(12)、(13)更新粒子群的位置和速度。根据整数约束、位置限值和速度限值修正更新后的位置和速度。Step S2.4, update the position and velocity of the particle swarm according to formulas (12) and (13). Corrects the updated position and velocity based on integer constraints, position limits, and velocity limits.

步骤S2.5、判断是否满足收敛条件(将收敛条件设置为是否达到迭代次数),若不满足则跳转到步骤S2.2,若满足则进行步骤S2.6。Step S2.5, judging whether the convergence condition is met (set the convergence condition as whether the number of iterations is reached), if not, jump to step S2.2, and if yes, proceed to step S2.6.

步骤S2.6、统计各个时段OLTC的档位,每个档位初始化为一个聚类,将相邻相同档位的聚类合并为一个聚类,统计合并后的聚类数为NTCStep S2.6: Count the stalls of OLTC in each time period, initialize each stall as a cluster, merge adjacent clusters of the same stall into one cluster, and count the number of clusters after merging as N TC .

步骤S2.7、根据公式(14)计算各个相邻两聚类合并后的评价函数值,选取评价函数最小的方案进行合并,如果有多个方案,则随机选取一个方案进行合并。Step S2.7. Calculate the evaluation function value of each adjacent two clusters after merging according to formula (14), select the solution with the smallest evaluation function to merge, and if there are multiple solutions, randomly select one solution to merge.

步骤S2.8、合并后若聚类数NTC≤NTCmax,则转跳转到步骤S2.9,否则继续进行步骤S2.7。Step S2.8, if the number of clusters N TC ≤ N TCmax after merging, go to step S2.9, otherwise continue to step S2.7.

步骤S2.9、计算各个聚类中档位的平均值,四舍五入对应的整数为相应时间段内的OLTC的档位,计算聚类评价函数值。Step S2.9. Calculate the average value of the gears in each cluster, round up the corresponding integer to be the gear of the OLTC in the corresponding time period, and calculate the value of the clustering evaluation function.

注意,聚类过程(步骤S2.6到步骤S2.9)可以多次运行,根据最终的聚类评价函数值选取最优聚类方案。Note that the clustering process (step S2.6 to step S2.9) can be run multiple times, and the optimal clustering scheme is selected according to the final clustering evaluation function value.

步骤S3、第二阶段优化,将OLTC档位作为已知值,采用标准粒子群算法求解SNOP与DG的运行状态。Step S3, the second stage of optimization, takes the OLTC gear as a known value, and uses the standard particle swarm optimization algorithm to solve the running status of SNOP and DG.

所述的第二阶段优化具体包含以下步骤:The second stage of optimization specifically includes the following steps:

步骤S3.1、种群初始化。初始化种群规模、迭代次数、粒子初始位置和速度、粒子位置限值和速度限值。粒子位置限值根据公式(1)-(5)、(10)设置,粒子速度限值范围为[-0.2×(位置最大值-位置最小值),0.2×(位置最大值-位置最小值)]。Step S3.1, population initialization. Initialize the population size, number of iterations, particle initial position and velocity, particle position limit and velocity limit. The particle position limit is set according to formulas (1)-(5) and (10), and the particle speed limit range is [-0.2×(maximum position-minimum position), 0.2×(maximum position-minimum position)].

初始化粒子初始位置的时候,对VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率QDG进行编码。When initializing the initial position of the particle, the active power P 1 of VSC1 , the reactive power Q 1 and Q 2 of VSC1 and VSC2 , and the reactive power Q DG of DG are encoded.

步骤S3.2、将粒子的位置解码为SNOP与DG的运行状态(SNOP与DG的运行状态即VSC1的有功功率P1、VSC1和VSC2的无功功率Q1和Q2、DG的无功功率),并进行潮流计算,使满足约束条件(7)-(9)。根据公式(6)计算各个粒子的适应度值。Step S3.2. Decode the position of the particle into the operating state of SNOP and DG (the operating state of SNOP and DG is the active power P 1 of VSC1, the reactive power Q 1 and Q 2 of VSC1 and VSC2, and the reactive power of DG), and perform power flow calculation to satisfy the constraints (7)-(9). Calculate the fitness value of each particle according to formula (6).

步骤S3.3、统计粒子个体的极值和群体极值。粒子群算法每次迭代后,经过公式(6)就能计算每个粒子的适应度值,粒子个体的极值就是每次迭代后,将该粒子的适应度值的历史最小值,群体极值就是所有粒子的历史最小值。Step S3.3, counting the extreme values of individual particles and group extreme values. After each iteration of the particle swarm algorithm, the fitness value of each particle can be calculated through formula (6). The extreme value of the individual particle is the historical minimum value of the fitness value of the particle after each iteration, and the group extreme value is the historical minimum value of all particles.

步骤S3.4、根据公式(12)、(13)更新粒子群的位置和速度。根据位置限值和速度限值修正更新后的位置和速度。Step S3.4, update the position and velocity of the particle swarm according to formulas (12) and (13). The updated position and velocity are corrected according to the position and velocity limits.

步骤S3.5、判断是否满足收敛条件(将收敛条件设置为是否达到迭代次数),若不满足则跳转到步骤S3.2,若满足,则群体极值对应的粒子位置就是最优解,解码为配电网中SNOP与DG的参数值,这些参数值就是最优控制变量。Step S3.5, judging whether the convergence condition is satisfied (set the convergence condition to whether the number of iterations is reached), if not, jump to step S3.2, if satisfied, the particle position corresponding to the extreme value of the group is the optimal solution, decoded into the parameter values of SNOP and DG in the distribution network, and these parameter values are the optimal control variables.

采用标准粒子群算法进行求解,步骤与第一阶段优化过程的步骤S2.1到步骤S2.5相似,区别在于不考虑整数约束。The standard particle swarm optimization algorithm is used to solve the problem, and the steps are similar to the steps S2.1 to S2.5 of the first-stage optimization process, the difference is that integer constraints are not considered.

如图4所示,在本发明的一个实施例中,采用改进的IEEE33节点系统,允许电压范围为[0.9,1.1],节点1与OLTC相连,可调的档位为±8,每档可以调节1.25%,设置OLTC分接头一天允许动作次数为6次。联络线用两个SNOP替代,节点12到节点22的联络线用SNOP1代替,节点25到节点29的联络线用SNOP2代替。负荷波动情况、风机和光伏出力曲线如图5所示,其中负荷为居民负荷,负荷高峰集中在19:00-23:00。SNOP与DG的具体参数如表1所示,其中SNOP的两个变流器VSC的容量均为300kVA,DG的功率因数在[0.9,1]范围内连续可调。系统不考虑SNOP、DG且分接头不调整时,在高峰负荷时原始网损为202.7kW。As shown in Figure 4, in one embodiment of the present invention, the improved IEEE33 node system is adopted, the allowable voltage range is [0.9, 1.1], node 1 is connected to the OLTC, the adjustable gear is ±8, each gear can be adjusted by 1.25%, and the allowable number of actions of the OLTC tap is set to 6 times a day. The tie line is replaced by two SNOPs, the tie line from node 12 to node 22 is replaced by SNOP1, and the tie line from node 25 to node 29 is replaced by SNOP2. The load fluctuations, fan and photovoltaic output curves are shown in Figure 5, where the load is the residential load, and the peak load is concentrated between 19:00-23:00. The specific parameters of SNOP and DG are shown in Table 1. The capacity of the two converters VSC of SNOP is 300kVA, and the power factor of DG is continuously adjustable in the range of [0.9, 1]. When the system does not consider SNOP and DG and the tap is not adjusted, the original network loss is 202.7kW at peak load.

表1Table 1

SNOP(VSC1--VSC2)SNOP(VSC1--VSC2) 风机(WT)Fan (WT) 光伏(PV)Photovoltaic (PV) 位置Location 12—22、25—2912-22, 25-29 10、16、3010, 16, 30 7、13、277, 13, 27 容量capacity 300kVA--300kVA300kVA--300kVA 500kW500kW 400kW400kW

粒子群算法中,种群规模为100,迭代次数为80代,c1=c2=2。若粒子的位置范围为[xmin,xmax],则粒子速度范围设置为[-0.2(xmax-xmin),0.2(xmax-xmin)]。In the particle swarm optimization algorithm, the population size is 100, the number of iterations is 80 generations, and c 1 =c 2 =2. If the particle position range is [x min , x max ], then the particle velocity range is set to [-0.2(x max -x min ),0.2(x max -x min )].

OLTC档位优化:第一阶段优化中得到OLTC在各个时段原始档位如图6中虚线所示,档位受风机和光伏资源和负荷情况波动影响,比如7:00-17:00风机和光伏资源相对丰富、负荷处于中间水平,为了更好吸纳新能源导致档位整体较低。经聚类算法计算求得fcluster最小值为5,对应的将5时的档位调低2档、7时调高1档、17时调低1档以及18时调高1档,聚类后的OLTC档位如图6中实线所示。OLTC stall optimization: In the first stage of optimization, the original stalls of OLTC at each time period are shown as dotted lines in Figure 6. The stalls are affected by fluctuations in wind turbine and photovoltaic resources and load conditions. For example, 7:00-17:00 wind turbines and photovoltaic resources are relatively abundant, and the load is at an intermediate level. In order to better absorb new energy, the overall stalls are lower. Calculated by the clustering algorithm, the minimum value of f cluster is 5. Correspondingly, the gear position at 5 o’clock is lowered by 2 gears, 7 o’clock is raised by 1 gear, 17 o’clock is lowered by 1 gear, and 18 o’clock is raised by 1 gear. The OLTC gears after clustering are shown by the solid line in Figure 6.

有功网损与无功功率优化:第二阶段优化中,通过SNOP与DG的相互配合,实现对目标函数的优化,优化结果如图7所示。由图中虚线可以看出,各个时刻的网损均实现了降低,最低降到3.53%(时刻10),即使负荷高峰时(时刻21)也降低到94.9%,整体上负荷较小、风机和光伏资源丰富时降损效果更加明显,如1:00-17:00降低了80%以上的网损。由图中点横线可以看出,整体与上级电网交换的无功功率和视在功率比值较小,数值范围为[0,0.335],即与上级电网交换的无功功率较小,其对应的功率因数区间为[0.942,1]。在7:00-16:00与上级电网交换的无功基本等于0,此时段风机和光伏资源较为丰富,提供了足够的无功输出,实现了无功功率的就地平衡,减少了上级电网因传输无功功率而引起的有功损耗。Active network loss and reactive power optimization: In the second stage of optimization, through the cooperation of SNOP and DG, the optimization of the objective function is realized, and the optimization result is shown in Figure 7. It can be seen from the dotted line in the figure that the network loss has been reduced at all times, the lowest dropped to 3.53% (time 10), and even at the peak load (time 21) it was reduced to 94.9%. The overall loss reduction effect is more obvious when the load is small and the wind turbine and photovoltaic resources are abundant. For example, the network loss has been reduced by more than 80% from 1:00 to 17:00. It can be seen from the dotted horizontal line in the figure that the ratio of reactive power and apparent power exchanged with the upper-level grid as a whole is small, and the value range is [0, 0.335], that is, the reactive power exchanged with the upper-level grid is small, and the corresponding power factor interval is [0.942, 1]. From 7:00 to 16:00, the reactive power exchanged with the upper-level power grid is basically equal to 0. During this period, the wind turbine and photovoltaic resources are relatively abundant, which provides sufficient reactive power output, realizes the local balance of reactive power, and reduces the active power loss caused by the transmission of reactive power in the upper-level power grid.

上述优化结果对应的控制变量如图8和图9所示。SNOP传输的有功功率以小编号节点流向大编号节点为正方向,小编号节点侧对应的为VSC1。由图8可以看出,SNOP中传输的有功功率随着负荷、风机和光伏资源情况改变了方向,例如SNOP1的有功功率在7:00-16:00由节点22流向节点12,其余时刻有功功率方向相反,SNOP2的有功功率只在11时刻由节点29流向节点25,其余时刻方向相反。两个SNOP分别对应的两个VSC在全时刻都是发出无功功率。由图9可以看出,风机和光伏都是发出无功功率,大部分时间里发出的无功功率和图5中DG的有功功率走势一致,只有接于节点13的PV2和接于节点16的WT2在风机和光伏资源的高峰时刻因为无功较为充足而减小了无功输出量,分别如图9中点横线和带方块虚线所示。The control variables corresponding to the above optimization results are shown in Figure 8 and Figure 9. The active power transmitted by SNOP is from the small numbered node to the large numbered node as the positive direction, and the corresponding side of the small numbered node is VSC1. It can be seen from Figure 8 that the active power transmitted in SNOP changes its direction with the load, wind turbine and photovoltaic resources. For example, the active power of SNOP1 flows from node 22 to node 12 at 7:00-16:00, and the direction of active power is opposite at other times. The two VSCs corresponding to the two SNOPs emit reactive power at all times. It can be seen from Figure 9 that both wind turbines and photovoltaics emit reactive power, and the reactive power emitted most of the time is consistent with the active power of DG in Figure 5. Only PV2 connected to node 13 and WT2 connected to node 16 reduce the reactive power output due to sufficient reactive power at the peak time of wind turbines and photovoltaic resources, as shown by the horizontal line in the middle of the dot and the dotted line with squares in Figure 9, respectively.

单时刻断面分析与收敛性分析:以12时为例,此时总负荷有功功率为2.48MW,无功功率为1.53MVAr,单个光伏发出的有功功率为294.9kW,单个风机发出的有功功率为298.3kW,该时刻的第二阶段粒子群算法的收敛性如图10所示。算法在前八次迭代过程中快速向最优值逼近,在15次时收敛,具有较好地寻优能力和收敛性。Single-time cross-section analysis and convergence analysis: Take 12:00 as an example. At this time, the total active power of the load is 2.48MW, the reactive power is 1.53MVAr, the active power from a single photovoltaic is 294.9kW, and the active power from a single fan is 298.3kW. The convergence of the second-stage particle swarm optimization algorithm at this moment is shown in Figure 10. The algorithm quickly approaches the optimal value in the first eight iterations, and converges at the 15th iteration, which has good optimization ability and convergence.

DG最小允许功率因数为0.9,则该时刻光伏和风机能够发出或吸收无功功率最大值分别为142.8kVAr和144.5kVAr。该时刻有功网损为10.1kW,上级电网提供的无功功率为0.0kVAr。SNOP与DG的输出功率的优化组合如表2所示,表中加粗部分为达到上限值。结果表明以12时的负荷和风机和光伏资源情况,在目标函数为公式(6)时,SNOP与DG发出的无功并不是越高越好,而是应该就地平衡、就近补偿。The minimum allowable power factor of DG is 0.9, then the maximum reactive power that can be emitted or absorbed by photovoltaics and wind turbines at this moment is 142.8kVAr and 144.5kVAr respectively. At this moment, the active network loss is 10.1kW, and the reactive power provided by the superior grid is 0.0kVAr. The optimal combination of the output power of SNOP and DG is shown in Table 2, and the bold part in the table is the upper limit. The results show that based on the load, fan and photovoltaic resources at 12:00, when the objective function is formula (6), the reactive power generated by SNOP and DG is not as high as possible, but should be balanced locally and compensated nearby.

表2Table 2

SNOP与DG的接入增加了配电网无功优化问题的求解难度,同时可以通过设置合理目标能够极大地优化配电网运行状态。本发明建立的模型目标函数是最小化系统网损和与上级电网无功交换,充分考虑了SNOP与DG的运行约束和OLTC分接头档位等约束。利用两阶段无功优化方法求解上述模型,以改进的IEEE33节点系统为算例进行验证,结果表明SNOP设备控制灵活,与DG配合能够优化配电网的无功分布和减小网损,本发明提供的优化方法具有较好收敛性和寻优能力。The access of SNOP and DG increases the difficulty of solving the reactive power optimization problem of distribution network, and at the same time, it can greatly optimize the operation state of distribution network by setting reasonable targets. The objective function of the model established by the present invention is to minimize the system network loss and exchange reactive power with the upper-level power grid, and fully consider the operation constraints of SNOP and DG and the constraints of OLTC tap position and the like. The two-stage reactive power optimization method is used to solve the above model, and the improved IEEE33 node system is used as a calculation example to verify. The results show that the control of the SNOP equipment is flexible, and the cooperation with the DG can optimize the reactive power distribution of the distribution network and reduce the network loss. The optimization method provided by the invention has better convergence and optimization capabilities.

未来研究中可以开展包含多端SNOP的配电网无功优化问题。另外,SNOP的经济性研究目前较为欠缺,可以开展全寿命周期的SNOP优化配置与运行,求解最经济的SNOP安装数量、容量和位置。In future research, reactive power optimization problems in distribution networks including multi-terminal SNOP can be carried out. In addition, the economic research of SNOP is relatively lacking at present, and the optimal configuration and operation of SNOP in the whole life cycle can be carried out to solve the most economical SNOP installation quantity, capacity and location.

尽管本发明的内容已经通过上述优选实施例作了详细介绍,但应当认识到上述的描述不应被认为是对本发明的限制。在本领域技术人员阅读了上述内容后,对于本发明的多种修改和替代都将是显而易见的。因此,本发明的保护范围应由所附的权利要求来限定。Although the content of the present invention has been described in detail through the above preferred embodiments, it should be understood that the above description should not be considered as limiting the present invention. Various modifications and alterations to the present invention will become apparent to those skilled in the art upon reading the above disclosure. Therefore, the protection scope of the present invention should be defined by the appended claims.

Claims (1)

1. A reactive power optimization method for a power distribution network is characterized by establishing a reactive power optimization model taking the minimum system active network loss and the minimum reactive power exchange power with an upper power network as objective functions for the power distribution network comprising an intelligent soft switch SNOP and a distributed power source DG, performing two-stage optimization on the reactive power optimization model, optimizing the gear of an on-load voltage-regulating transformer OLTC in the first stage, and ignoring the on-load voltage-regulating transformer OLTC
Solving the gear of the on-load voltage-regulating transformer OLTC in each period by utilizing a mixed integer particle swarm algorithm under the constraint condition of action frequency limitation in one day, obtaining the gear of the on-load voltage-regulating transformer OLTC in each period in one day by adopting a clustering algorithm, optimizing active network loss and reactive power in the second stage, taking the gear of the on-load voltage-regulating transformer OLTC in each period in one day as a known value, and solving the active power of the first converter VSC1, the reactive power of the second converter VSC2 and the reactive power of the distributed power source DG in the intelligent soft switch SNOP by adopting a standard particle swarm algorithm;
the objective function is as follows:
wherein f is a fitness value, P t,loss Is the active network loss at the time t, P 0,loss For the initial active network loss of the system at peak load, P t,ref And Q t,ref Active power and reactive power provided by an upper power grid at t time respectively; n is the study period; omega shape DG Reactive power combination, Ω for distributed power supply DG SOP Active and reactive power combinations for intelligent soft switching SNOP;
the constraint conditions are as follows:
and (3) constraint of system tide: f (P) i ,Q i ,U i )=0
Node voltage constraint: u (U) i,min ≤U i ≤U i,max
Branch tidal current constraint:
power constraint of intelligent soft switch SNOP:
P 1 (t)+P 2 (t)=0
wherein P is 1 (t) and Q 1 (t) is the active power and reactive power of the first converter VSC1 in the t-period intelligent soft switch sno; p (P) 2 (t) and Q 2 (t) is the active power and reactive power of the second converter VSC2 in the t-period intelligent soft switch SNOP; s is S 1max And S is 2max The capacity of two converters in the intelligent soft switch SNOP;
power constraint of distributed power DG:
in the middle of,The actual active power and reactive power of the i-th distributed power source DG, respectively, wherein +.>The value of (1) depends on the condition of the fan and the photovoltaic resource corresponding to the distributed power supply DG; θ min Allowing an angle corresponding to the minimum power factor for the distributed power supply DG; />Is the capacity of the distributed power source DG;
gear adjustment limit constraint for on-load step-down transformer OLTC:
TC min ≤TC t ≤TC max ∩TC∈Z
N TC ≤N TCmax
wherein P is i 、Q i Total active and reactive power injected for node i, U i For the voltage of node i, U i,min And U i,max For minimum and maximum allowed voltages of node I, I ij And I ij,max For the current amplitude and upper current amplitude limit of the branch between the node i and the node j, TC t For the gear position of an on-load voltage regulating transformer OLTC at time t, TC min And TC max For the minimum gear and the maximum gear of the on-load voltage regulating transformer OLTC, Z is an integer set, N TC And N TCmax The actual action times and the maximum allowed action times of the on-load voltage regulating transformer OLTC in one day are respectively;
the first-stage method for optimizing the on-load voltage-regulating transformer OLTC gear comprises the following steps:
step S2.1, initializing population size, iteration number, particle initial position and speed, particle position limit and speed limit, active power P of first converter VSC1 of intelligent soft switch SNOP for gear of on-load voltage regulating transformer OLTC 1 Reactive power of the first converter VSC1 and the second converter VSC2Rate Q 1 And Q 2 Coding reactive power of the distributed power supply DG;
setting particle position limit values:
particle position maximum and minimum values representing on-load voltage regulating transformer OLTC gear TC are respectively set as TC max And TC min Representing the active power P of the intelligent soft switch SNOP 1 The maximum and minimum values of the particle position of (t) are S 1max and-S 1max Representing intelligent soft switch SNOP reactive power Q 1 The maximum and minimum values of the particle position of (t) are S 1max and-S 1max Representing intelligent soft switch SNOP reactive power Q 2 The maximum and minimum values of the particle position of (t) are S 2max and-S 2max Reactive power Q representing distributed power source DG DG The maximum and minimum values of the particle positions of (2) are respectively And->
Setting a particle speed limit range: [ -0.2× (position maximum-position minimum), 0.2× (position maximum-position minimum) ];
step S2.2 decoding the position of the particles into the gear of the on-load step-up transformer OLTC and the active power P of the first converter VSC1 of the intelligent soft switch SNOP 1 Reactive power Q of the first converter VSC1 and the second converter VSC2 1 And Q 2 Reactive power of the distributed power supply DG is subjected to load flow calculation, so that the reactive power meets system load flow constraint, node voltage constraint and branch load flow constraint, and the fitness value of each particle is calculated according to an objective function;
s2.3, counting extremum and population extremum of individual particles, wherein the extremum of the individual particles is the historical minimum value of fitness value of the particles, and the population extremum is the historical minimum value of all the particles;
s2.4, updating the position and the speed of the particle swarm, and correcting the updated position and speed according to integer constraint, particle position limit and particle speed limit;
the location update and velocity update formulas are as follows:
wherein, c 1 、c 2 Weights for the local and global optimization directions; r is (r) 1 、r 2 Two [0-1 ]]Random numbers in between;and->Position and velocity of the id-th particle for the nth iteration, < >>For the individual extremum, p, of the nth iteration, the id-th particle ngd The population extremum is the nth iteration;
step S2.5, judging whether iteration times are reached, if not, jumping to step S2.2, and if so, executing step S2.6;
step S2.6, counting gears of the on-load voltage-regulating transformer OLTC in each period, initializing each gear into one cluster, combining clusters adjacent to the same gear into one cluster, and counting the combined clusters as N TC
S2.7, calculating an evaluation function value after combining each two adjacent clusters, and selecting a scheme with the minimum evaluation function for combining;
evaluation function f of clustering cluster The definition is as follows:
wherein K is a cluster number, and the value is N which is the maximum allowable action times of an on-load voltage regulating transformer OLTC TCmax ,J i For the ith cluster, TC t For clustering J i Shift position at middle t moment, TC i The value of the gear is equal to the average value of all gears in the ith cluster and is rounded nearby;
step S2.8, merging and then determining the clustering number N TC ≤N TCmax The step is skipped to the step S2.9, otherwise, the step S2.7 is continued;
s2.9, calculating an average value of gears in each cluster, rounding the corresponding integer to be the gear of the on-load voltage-regulating transformer OLTC in the corresponding time period, and calculating a cluster evaluation function value; the second-stage active power loss and reactive power optimizing method comprises the following steps:
step S3.1, initializing population size, iteration number, particle initial position and velocity, particle position limit and velocity limit, active power P of first converter VSC1 of intelligent soft switch SNOP 1 Reactive power Q of the first converter VSC1 and the second converter VSC2 1 And Q 2 Coding reactive power of the distributed power supply DG;
setting particle position limit values:
representing intelligent soft switch SNOP active power P 1 The maximum and minimum values of the particle position of (t) are S 1max and-S 1max Representing intelligent soft switch SNOP reactive power Q 1 The maximum and minimum values of the particle position of (t) are S 1max and-S 1max Representing intelligent soft switch SNOP reactive power Q 2 The maximum and minimum values of the particle position of (t) are S 2max and-S 2max Reactive power Q representing distributed power source DG DG The maximum and minimum values of the particle positions of (2) are respectivelyAnd->Setting a particle speed limit range: [ -0.2× (position maximum-position minimum), 0.2× (position maximum-position minimum)];
Step S3.2 decoding the position of the particles into the gear of the on-load step-up transformer OLTC and the active power P of the first converter VSC1 of the intelligent soft switch SNOP 1 Reactive power Q of the first converter VSC1 and the second converter VSC2 1 And Q 2 Reactive power of the distributed power supply DG is subjected to load flow calculation, so that the reactive power meets system load flow constraint, node voltage constraint and branch load flow constraint, and the fitness value of each particle is calculated according to an objective function;
s3.3, counting extremum and population extremum of individual particles, wherein the extremum of the individual particles is the historical minimum value of fitness value of the particles, and the population extremum is the historical minimum value of all the particles;
s3.4, updating the position and the speed of the particle swarm, and correcting the updated position and speed according to integer constraint, particle position limit and particle speed limit;
the location update and velocity update formulas are as follows:
wherein, c 1 、c 2 Weights for the local and global optimization directions; r is (r) 1 、r 2 Two [0-1 ]]Random numbers in between;and->Position and velocity of the id-th particle for the nth iteration, < >>For the individual extremum, p, of the nth iteration, the id-th particle ngd The population extremum is the nth iteration;
and S3.5, judging whether the iteration times are reached, if not, jumping to the step S3.2, and if so, judging that the particle positions corresponding to the population extremum are the optimal solutions.
CN202010431382.9A 2020-05-20 2020-05-20 A reactive power optimization method for distribution network Active CN111490552B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010431382.9A CN111490552B (en) 2020-05-20 2020-05-20 A reactive power optimization method for distribution network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010431382.9A CN111490552B (en) 2020-05-20 2020-05-20 A reactive power optimization method for distribution network

Publications (2)

Publication Number Publication Date
CN111490552A CN111490552A (en) 2020-08-04
CN111490552B true CN111490552B (en) 2023-07-25

Family

ID=71811360

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010431382.9A Active CN111490552B (en) 2020-05-20 2020-05-20 A reactive power optimization method for distribution network

Country Status (1)

Country Link
CN (1) CN111490552B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111900765B (en) * 2020-08-27 2022-03-04 广东电网有限责任公司 Dynamic reactive power planning method and related device for wind power access system
CN112561136A (en) * 2020-11-30 2021-03-26 郑州轻工业大学 Power distribution network dynamic reactive power optimization method based on fuzzy time clustering
CN112909993B (en) * 2021-01-21 2022-07-05 山东大学 Three-phase current unbalance compensation method for medium-voltage photovoltaic power generation system
CN113363988B (en) * 2021-06-08 2022-12-06 南方电网科学研究院有限责任公司 Power grid operation optimization method, device and medium based on-load tap changer

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000116003A (en) * 1998-09-29 2000-04-21 Kansai Electric Power Co Inc:The Voltage reactive power control method
CN103280821A (en) * 2013-06-25 2013-09-04 国家电网公司 Multi-period dynamic reactive power optimization method of intelligent power distribution system
CN104821605A (en) * 2015-04-13 2015-08-05 国家电网公司 Active safety correction method based on improved particle swarm optimization algorithm
CN105740973A (en) * 2016-01-25 2016-07-06 天津大学 Mixed integer cone programming based intelligent distribution system synthetic voltage reactive power optimization method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000116003A (en) * 1998-09-29 2000-04-21 Kansai Electric Power Co Inc:The Voltage reactive power control method
CN103280821A (en) * 2013-06-25 2013-09-04 国家电网公司 Multi-period dynamic reactive power optimization method of intelligent power distribution system
CN104821605A (en) * 2015-04-13 2015-08-05 国家电网公司 Active safety correction method based on improved particle swarm optimization algorithm
CN105740973A (en) * 2016-01-25 2016-07-06 天津大学 Mixed integer cone programming based intelligent distribution system synthetic voltage reactive power optimization method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
A Hybrid Optimization Algorithm for Distribution Network Coordinated Operation with SNOP Based on Simulated Annealing and Conic Programming.风电场并网穿透功率极限研究.《华东电力》.2014,全文. *
Xuzhu Dong.A Hybrid Optimization Algorithm for Distribution Network Coordinated Operation with SNOP Based on Simulated Annealing and Conic Programming.《2016 IEEE Power and Energy Society General Meeting (PESGM)》.2016,全文. *
陈垚煜.考虑传统调控手段的配电网SOP 选址定容方法.《高电压技术》.2020,全文. *

Also Published As

Publication number Publication date
CN111490552A (en) 2020-08-04

Similar Documents

Publication Publication Date Title
CN111490552B (en) A reactive power optimization method for distribution network
JP6646182B2 (en) Long-term combined peaking scheduling method for inter-provincial communication hydropower plants
CN105846461B (en) Control method and system for large-scale energy storage power station self-adaptive dynamic planning
CN110690702B (en) Active power distribution network optimal scheduling and operation method considering comprehensive bearing capacity
CN110690732A (en) Photovoltaic reactive power partition pricing power distribution network reactive power optimization method
CN111626633B (en) Self-energy-storage flexible interconnected power distribution network expansion planning method based on comprehensive evaluation index
CN108683179A (en) Active distribution network Optimization Scheduling based on mixed integer linear programming and system
CN114865649B (en) Wind-solar-storage integrated station reactive power regulation method and device and electronic equipment
CN114996908B (en) Active distribution network expansion planning method and system considering intelligent soft switch access
CN106058858B (en) Power distribution network optimization method and device
CN107634518A (en) A Coordinated &#34;Source-Net-Load&#34; Active Distribution Network Economic Dispatch Method
CN102915472A (en) Comprehensive power distribution network optimization planning method based on gene modified chaos genetic algorithm
CN113178868B (en) Voltage optimization method for flexible interconnection power distribution system
CN108306346A (en) A kind of distribution network var compensation power-economizing method
CN103441506A (en) Method for multi-target coordination reactive power optimization control of distributed wind farm in different time scales
CN110380407B (en) Power distribution network operation optimization method considering agricultural electric irrigation and drainage loads
CN109034587A (en) A kind of active distribution system Optimization Scheduling for coordinating a variety of controllables
Ma et al. Reactive power optimization in power system based on improved niche genetic algorithm
CN114928057B (en) Multi-target power flow optimization method suitable for new energy multi-terminal flexible direct system
CN107565576A (en) A reactive power and voltage optimization method for active distribution network coordinated by multiple active management methods
CN112838622B (en) A reactive voltage optimal control method and system for a 10kV power supply area
CN104333047A (en) Real-time rolling planning method applied to wind power integration of power system
CN112736905A (en) Regional new energy capacity optimal configuration method and system
CN108155649A (en) A kind of consideration probabilistic distribution network structure Fuzzy Programmings of DG
CN115051406A (en) Multi-stage coordination control risk scheduling method considering source network uncertainty

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