This article has been accepted for publication in a future issue of this journal, but has not been

fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TPWRS.2018.2875032, IE
EE Transactions on Power Systems

Two - stage Dynamic Reactive Power Dispatch

Strategy in Distribution Network Considering t
he Reactive Power Regulation of Distributed G
enerations
Lijuan Chen, Zhenli Deng, and Xiaohui Xu, Senior Member, IEEE

ND Set of load buses

Abstract--To solve the coordinated dispatch and time-space N Lc Set of branches S
oupling problem in the distribution network with distributed generation
s (DGs), a novel two-stage (Heuristic search and NG et of DGs
Variable correction) dynamic reactive power dispatch strategy is NC Set of CBs S
proposed in this paper. Meanwhile, according to the analysis of
Gauss-type and Z-type membership function, a new objective NT et of OLTC
function is put forward to achieve the balance between network H Set of the buses that directly connect to bus i
loss and voltage deviation. Firstly, the pre-optimization is made i
Parameters
n Niche genetic algorithm (NGA) to coordinate on-load tap
changer (OLTC), capacitor banks (CBs) and DGs. Secondly, the s Ui,t Voltage of bus i at time t
equential fuzzy c-means (SFCM) based on artificial bee colony (A Tk ,t Switching gears of the OLTC at time t Voltag
BC) algorithm is proposed and then the heuristic search based on
this method is used to formulate the day-ahead plan of OLTC an ij e angle difference of branch ij Real/imaginary
d CBs. Finally, the dispatch plans of OLTC and CBs are applied t
o recalibrate the day-ahead dispatch plan of DGs. Comparing wit Gij / Bij part of node admittance matrix Active/reactive
h existing schemes, strategies and optimization approaches based
Pi,t / Qi,t power injection at bus i time t
on diverse evaluation indicators, optimization results on IEEE 3
3-bus, IEEE 14-bus and PG&E 69-bus test systems verify the pra Active/reactive injection at bus i time t from
cticality and efficiency of the proposed method. In addition, the ef Pi,tgrid / i,tgrid
fects on the optimization results with different adjustment step a Q higher power grid
nd action time of the discrete adjust devices are discussed by the I Active/reactive output of DGs at bus l time t
EEE 33-bus test system. Pl,tDG / l,tDG
Index Terms-- Distributed generation, dynamic reactive power Qload Active/reactive load at bus i time t Th
optimization, sequential fuzzy c-means clustering, membership fu Pi,t / i,tload
nction, discrete control variables, space-time coupling. Q e status vector of all CBs at time t The
QC t

t status vector of all OLTC at time t

I. NOMENCLATURE
Indices and Sets C
Qc,t Reactive power compensation of CBs at bus c
i, j Index for buses time t
l Index for branches zˆi,tn The value of the i-th discrete variables after
t Index for time period adaptive segmentation
c Buses with CBs zi,step Unit switching capacity of the c-th CBs
g Buses with DGs
Pl ,t Transmission power of branch l at time t
k Buses with OLTC
NB Set of system buses Pl,t,max Transmission power limit of branch l at time t
nc _ ma Maximum allowable action time of the CBs
This work was supported by the Scientific Project of the State Grid Corpor Maximum allowable action time of the OLTC
ation of China (Research on Key Technologies for Flexible Coordinated Contr x nt _ m
ol and Joint Operation of Distributed Energy Storage on Customer Side) The number of CBs
ax nc
The number of OLTC
nl
Lijuan Chen, Zhenli Deng are with the Southeast University, Nanjing
210096, China (lijuanchen@seu.edu.cn; dengzhenli2016@163.com). x State variables
Xiaohui Xu is with the China Electric Power Research Institute (CEPRI), y Continuous control variables
Beijing 100192, China (xuxiaohui@epri.sgcc.com.cn).
z Discrete control variables

0885-8950 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Z The vector of maximum allowable action time
zi,t The normalized dates for i-th discrete
variables
Si The number of adaptive segmentation for i-th
discrete devices
sn Cluster number
m Weighted index
pc Cluster center of class c
k Lagrange multiplier
I Unit matrix
tn The duration of each period
II. INTRODUCTION
R ECENTLY, as an important complement to the traditional
centralized power generation, DGs are rapidly embarking
on the stage of the world power industry [1-3]. With the large-
scale application of renewable energy such as photovoltaic (P
V) and wind turbines (WT), energy consumption is becoming
increasingly clean and renewable. Meanwhile, the high propor
tion of DGs incorporating to the power system has brought ne
w challenges to safe operation and coordinated dispatch [4-8].
Reactive power balance is the basic guarantee for the safe a
nd stable operation of power grid [8-10]. The voltage level and
power quality depend directly on the rationality of reactive po
wer distribution [10-11]. At present, the reactive power regulat
ion in the distribution network mainly depends on both shunt
CBs and OLTC [3]. However, as the slow regulation devices, t
hese devices cannot switch frequently for the physical constrai
nts, which cause difficulty in achieving real-time adjustment o
f reactive power. Due to the advantages of continuous, quick a
nd frequent adjustment, the reactive power outputs of DGs are
used along with CBs and OLTC to regulate voltage will have a
broad application prospect.
The dynamic reactive power optimization (DRPO) of the di
stribution network with DG must not only handle the continuo
us control variables such as reactive power output of DG, but a
lso deal with discrete control variables such as capacitor bank g
ear, on-load tap changer transformer tap, and so on. After takin
g into account the switching times of discrete control variables,
the dynamic reactive power optimization mathematical model i
s a complex non-convex nonlinear mixed integer programming
problem with strong space-time coupling. The whole time is su
bject to discrete constraints of discrete control variables; in eac
h time section, a nonlinear mixed integer programming is form
ed in space [12-15].To solve this problem, various solutions ha
ve been proposed. In [16-18], the discrete variables were relaxe
d as continuous in the optimization model and then the continu
ous variables obtained from the optimization were rounded off
to the nearest integer, which may only lead to inequality constr
aints violations when rounding off discrete variables with large
step sizes such as shunt capacitor banks [19]. Reference [20] pr
oposes a novel two-stage dynamic reactive power coordination
dispatch strategy based on the Haar wavelet transform method,
and
a DPRO model considering reactive power output of DG is inn
ovatively built. Section IV proposes a novel two-stage (Heuris
DG’s reactive power be dispatched cooperatively with the
operation of the OLTC and CB in the distribution network. Referenc
e [21] proposed a day-ahead coordinated dispatch
method of reactive power. Meanwhile, reactive power outputs
of DGs are used along with CBs to regulate distribution netwo
rk voltage. However, the voltage adjustment ability of OLTC
was not considered in [20-21]. Reference [22] proposed a new
successive linear approximation method to handle the nonlinea
rity of the power flow equations and then the reactive power o
ptimal dispatch problem was solved by it. In [23], a data-drive
n stochastic reactive power optimization model was introduce
d to address uncertain DGs integrated into distribution networ
ks. However, the high penetration of DGs or their reactive po
wer adjustment ability was not considered in [22-23].
So far, there are three main shortcomings of the existing wo
rks on this subject.
1) After adding DGs, the DRPO mathematical model and t
he system reactive power adjustment capacity will change obv
iously. However, the coordinated dispatch with the traditional
reactive power devices was rarely considered in the above rese
arch work.
2) The existing DRPO approaches did not ideally address t
he problem that allowable action time of discrete adjust device
s is inconsistent.
3) The existing methods still have much room for improve
ment in improving system network loss and node voltage, whi
ch deserves further study.
Aiming at the existing problems, this paper proposes a nove
l two-stage method based on Heuristic search-Variable correct
ion. The main contributions of this paper are summarized as fo
llows:
1) It is the first time to propose an objective function based
on the membership function of Gauss-type and Z-type. By me
ans of the concave-convex feature of Gaussian-type and Z- typ
e membership functions, the network loss and node voltage de
viation are better balanced.
2) The SFCM method based on ABC is proposed innovati
vely and solves time-space coupling problem in the DPRO. M
eanwhile, it is worth noting that the proposed method achieves
the mutual independence of the sequential segmentation proce
ss, which can be solved in parallel thereby, greatly reducing th
e computation time. Furthermore, compared with the previous
methods, this method solves the problem encountered when th
e allowable action time of discrete adjust devices is not consist
ent.
3) A novel two-stage (Heuristic search and Variable corre
ction) dynamic reactive power dispatch strategy is proposed to
solve the coordinated dispatch problem in the distribution net
work. Through the coordination of DG, OLTC and CBs, the pr
oposed method improve the validity and feasibility of the day-
ahead dispatch plan.
4) The effects of adjustment step and action time on the opt
imization results are discussed in detail, which will have some
instructive significance for the related fields research and pract
ical engineering application.
The rest of the paper is organized as follows: In Section III,
tic search and Variable correction) dynamic reactive power dispatch strate
gy. Furthermore, simulation results obtained on IEEE 33-bus, IEEE 14-bu
s and PG&E 69-bus test systems demonstrate the practicality a
nd efficiency of the proposed method by different schemes, str
ategies and methods in Section V. Finally, conclusions are pre
sented in Section VI.
III. REACTIVE COORDINATION DISPATCH MODEL IN
DISTRIBUTION NETWORK WITH DGS
upper and lower limits is not enough to meet the voltage qualit
y requirements of the modern power system. Hence, in the da
y-ahead dispatch plan, it is necessary to make the node voltage
as close as possible to the expected value, which ensures adeq
uate reserve to control reactive power in the short-term dispatc
h. For this purpose, based on the Gauss-type membership func
tion, the satisfactory evaluation function of voltage deviation i
s proposed in this paper. It can be expressed as follows:
2
/
F av )  e(U c) (3)
(U e 2

A. Objective Function Where c and  are the parameters of Gauss-type membership

At present, the traditional mathematical models of reactive function, which determine the pivot point and width of functio
power optimization are widely built to minimize network loss, n curve, respectively. In this paper, c is taken as 1 and  is
but the voltage quality is less considered during these models 0.0425.
[16-23]. However, the volatility of DGs active output brings m In this paper, the Z-type membership function is used to co
ore uncertain factors to the reactive power balance and power nstruct the satisfaction function of network loss and the satisfa
quality. In the distribution network, the day-ahead dispatch of ction can be adjusted adaptively by means of its convexity and
reactive power need to keep voltage deviation as small as poss concave. Specifically, compared to the line-type satisfaction fu
ible to ensure that the short-term and real-time dispatch has suf nction, it can improve the satisfaction of the smaller network l
ficient margin. Hence, the satisfaction function is built in this oss and reduce the satisfaction of the larger network loss. Mea
paper to find an optimal control strategy with minimizing netw nwhile, the satisfaction function of voltage deviation construct
ork loss and voltage deviation through the Gauss-type and Z-t ed by Gauss-type membership function has similarly effect.
ype membership function. It can be expressed as: B. Restrictions
T T
For the distribution network, control variables and state
F  max(1  F (Ploss )  2  F(U av (1) variables need to be within the specified range to ensure the
e ))
t 1 t 1 system operate safely and economically. In this paper, the
Where F(Ploss), F(Uave) are network loss and voltage deviation equation constraints include active/reactive power balance con
satisfaction function and 1 , 2 are their weighting factor, resp straints and the inequality constraints consist of the reactive po
ectively. Therein, the calculation method of network loss is ref wer output of DG, the switching gears of OLTC, the reactive p
erred to reference [20]. ower compensation capacity of CBs and branch current limitat
The network loss is an important economic index to evaluat ion. Besides, the frequent switching of discrete devices (such a
e the economic operation and reactive power optimization perf s OLTC, CBs) will shorten their service life, directly increasin
ormance of power system [10-12]. Based on the Z-type memb g investment cost and maintenance cost. Therefore, action tim
ership function of spline interpolation, this paper builds the sat es of them need be strictly limited. All constraints are formulat
isfaction evaluation function of network loss. It can be describ ed as (4)-(12).
ed as grid
Pi,t  Pi,t  PDG
i,t  Pload
i, 
t
1
Ploss  a 2 Ploss  Ui,t  U j,t (Gij cosij,t  Bij sin ij,t ),i  NB (4)
ab  jH
a
1 2( ) a  Ploss  grid DG C load
F (Plo 
ss ) P b ab 2 (2) Qi,t  Qi,t  Qi,  Qi,t  Qi,t  (5)
a b t
Ui,t  U j,t (Gij sin ij,t  Bij cosij,t ),i  NB
2
2( loss )  Ploss  b
 b 2 jH
a b  Plos
 Ui,t,min  Ui,t  Ui,t,max , i  N (6)
0 s B

Where a is the ideal operation network loss, which is DG DG DG

Qg,t,min  Qg,t  g,t,max , gN (7)
Q G
calculated in the scenario when all reactive load demands are Q
C
C
 Q  QC ,cN (8)
locally compensated and the lines only transfer active power; c,t,min c,t c,t,max C
b is the maximum allowable operation network loss, which is c Tk,t,min  Tk,t  Tk,t,max , kN (9)
alculated in the scenario when all reactive devices have no T
power output. Pl, t  Pl,t,m ax ,
l  NL (1 0)
Voltage deviation is an important safety index in the T (11)
QC  C
 
distribution network. Moreover, the requirements for voltage q  c,t
Qc,t  nc _ max , c NC
t 1
uality of between power users and electrical equipment are inc 1
reasing. Nowadays, keeping the node amplitude within the
T
 k ,t   k ,t 1  nk _ kN (12)
the pre-optimization model is built in this section. Obviously, t
,
he built model is a mixed integer nonlinear nonconvex progra
max T
t 1
mming problem. NGA can keep the diversity of
So far, the control variables in the built dynamic reactive p solution well and has high global search ability and convergen
ce speed, especially suitable for complex multi-peak function
ower optimization dispatch model include the reactive power
optimization problem [24-25]. Hence, the preliminary day-ahe
output of WT and PV, the compensation power of CBs, the sw ad plans of OLTC, CBs and DGs are solved by the NGA in th
e pre-optimization stage. The built optimization model can be
itching gear of OLTC and the dispatch time of each
described as follows:
controllable devices, and so on. Hence, the built model is a no  T

n-convex nonlinear mixed integer dynamic programming min  f ( xt , yt , zt )

 t 0

problem with space-time coupling, whose can be described as  s.t. ht ( xt , yt , zt ) 

 (14)
g0 ( x , y , z )  0
follows. Therein, the state variables x  U i ,  ij  ; the  t t tt

continuous control variables y  Q DG

,Qgrid  ; the discrete 
 xt ,min  xt  xt ,max
control variables z   Q , C
 .
i,t i,
 yt ,min  yt  yt ,max

 
min
c,t
t
k,
T  zt ,mi  zt  zt ,max
  f ( xt , yt , zt
n
B. Heuristic search
)
t 0
 s.t. ht ( xt , yt , zt )  Based on the results of the pre-optimization, this paper prop
 0 oses a SFCM method to realize sequential segmentation of eac
 gt ( xt , yt , zt ) 
h OLTC switching gears and CBs switching capacity by
 (13) (15)-(27). Then, based on the ABC algorithm [26-28], the
0
xt ,min  xt  xt ,max

yt ,min  y t y t ,max sequential segmentation results are adjusted adaptively to meet
 zt ,min  zt  zt ,max the constraints of OLTC and CBs allowable action time by (2
 T 8)-(32). Finally, the equivalent OLTC switching gears and

 zi,t  zi,t 1  Z , i  1,... CBs switching capacity within each segment are calculated to
 t 0 n complete their day-ahead dispatch plans. It should be noted tha
t each discrete device is adaptively segmented by allowable
IV. TWO-STAGE OPTIMIZATION STRATEGY BASED ON action time. Moreover, all devices are independent of each oth
HEURISTIC-CORRECTION er, so parallel computing technology can be adopted to improv
In the reactive power adjustment devices, the OLTC and C e the calculation efficiency dramatically.
Bs with large adjustment ability are suitable as basic adjustme The sequential segmentation-polymerization of the OLTC a
nt for physical performance constraints. However, nd CBs is described in detail in this section. The total discrete
DG, due to fast and continuous adjustment ability, can be used control variables are presented as
as a supplement to adjust real-time reactive power balance. Fu z   z1 , z2  , i  1,...,nc  nl
zi ,z (15)
rthermore, to address coordinated dispatch and time-space cou  nc n l

pling problem, a two-stage optimization model is proposed to Each zi can be further presented as 
coordinate the discrete and continuous adjustment devices zi   zi,1 , zi,2 , zi,t , zi,T  , (16)
t  1,...T
and find an optimal solution that can achieve the balance betw The specific form of zi can be expressed as follows:
een network loss and voltage deviation. Meanwhile, this z  QC ,Q C , ,Q C , iN
method can hedge against some possible risks, such as, the
uncertainty of renewable energy. Therein, the Heuristic search i,1 i,2 nC ,T  C
i 
stage decisions (i.e., discrete reactive power compensators) are  or (17)
served as the “here and-now” decisions, i.e., they cannot be 
z   , , iN
, nL ,T  ,
adjusted after the uncertainty is revealed, while the variable co  i  i,t i,2 L
rrection stage decisions (i.e., continuous reactive power compe
The specific steps are as follows: 1）Origin
nsators) are represented as the “wait-and-see” decisions that ca al data standardization
n be adjusted after the first stage decisions are determined. To reduce the excessive impact of the maximum or
A. Pre-optimization maximum data for cluster results, the raw dates are standardize
d firstly. The normalized dates for i-th discrete variables are as
follows
The control variables in this section include the reactive po zi,t  min{zi }
wer output of WT and PV, the compensation power of CBs, zi,t (18)
max{z }  min{z

} i i
the switching gear of OLTC and the dispatch time of each
controllable devices. With (4)-(10) as the constraint conditions, 2 ） This paper takes the sum of the weighted distance
squares of the samples in the classes to each cluster center as t quadratic programming model with minimum variances of the
he objective function and calculates optimal fuzzy classificatio switching capacity series as the objective function is establishe
n matrix U and cluster center P [29-30]. The objective functio d based on the results of sequential segmentation. It is solved
n J (U, P) can be expressed as: by means of the efficient ABC algorithm. The mixed
24 sn
integer quadratic programming model of i-th discrete control
J (U , P)  min{(s,t )m (ds,t )2} variable is expressed as follows:
t 1 s1 (19) Si
 (zˆi,t
sn
24
Min  zi,t (28)
)2
 min{ (s,t ) m n
= (d s,t )2 } n1
t 1 s1
zˆi,tn / zi,step int (29)
Where sn Si


s1
s,t  1, t  1, ,T (20)  tn  24 (30)
n1
2,
s,t [0,1], (21) 0  tn  24 (31)
sn
s  1, 2, sn ; t  1, 2,T Si  zi,max (32)
s,t  24,
0  s1 s  1, (22) The optimization result obtained in the pre-optimization
2, sn
(d )2  z   p
 (z   p )T A(z   p (23) stage is marked with ξ =  y, z  . Next, the Heuristic search
)
i,t i,t
s,k i,t s A stage can be summarized as the following optimization model:
s s
Where  s,t is the membership that zi,t belongs to class s; ps  T

is the cluster center of class s; (ds,t )2 is the Euclidean

min


t 0
f ( xt , yt , zt )

distance from zi,t to ps. This article takes m=2, A=I.  s.t. ht ( xt , yt , zt ) 
Next, based on the Lagrangian multiplier method and 
 0 (28)
g t ( x t , y t , zt ) 
 0
cluster quasi-side, the Lagrange function is constructed as x x x
follows.
 t ,min t t ,max
 zt ,min  zt  zt ,max
s s
Fn
( s,t )m (ds,t )2  t (
n
s,t  (24) 
T
1)
s1 s1   zi,t  zi,t 1  Z , i  1,...n
According to the Kuhn-Tucker theorem, the partial derivati  t 0
ves of all input parameters are obtained. The necessary conditi
ons to minimize objective function (24) are as follows: C. Variable correction
In this stage, the reactive power output of WT and PV and
sn
1 their dispatch time are used as the control variables. With fixin
s,t   (ds,t / d j,t 2/(m1) (25)
g the optimal value of the OLTC and CBs obtained in the heur
) istic search stage, formulas (4)-(7) and formula (10) as the
j 1
T T
 pi   (s,t )m zi,  (s,t )
t t 1
m
t 1
Then, based on (24)-(26), the optimal fuzzy classification
matrix U and cluster center P can be obtained by primal-dual i
nterior method.
3） sequential segmentation for discrete devices
Since the cluster results do not have sequential
characteristics, they need to be sorted in chronological order. S
pecific steps are as follows: Firstly, the cluster numbers of
each discrete control variable at each time are marked
respectively. Secondly, the cluster results of same class and adj
acent time are merged into a section in chronological order.
After merging, the equivalent value of each segment for the i-
th discrete control variable zi,t is expressed as follows:
zi,t   zi,t /
(27)
nt
tNt
Where Nt is the serial number of discrete control variables cont
ained in the time interval t and nt is the corresponding number.
4） Adaptive timing segmentation
For each discrete control variable, a mixed integer
distribution network. Then, the coordinated dispatch plans of
DGs, OLTC and CBs can be obtained. The specific process is
shown in Fig. 1.
Start
Enter system parameters and
the forecast data of WT, PV, and load
Based on operational characteristics
analysis of PV and WT, calculate their upp
er and lower limits of reactive Power output
Take OLTC , CB and DG as decision
variables, perform pre-optimization
Stage 1: Heuristic search
The sequential fuzzy
C-means of OLTC and CBs
Adaptive timing segmentation of OLTC and CBs
Obtain the day-ahead
plan of the OLTC and CBs
Stage 2: Variable correction
Take DG's reactive power as decision
variables, perform variable correction
Based on ABC Algorithm, obtain
the day-ahead dispatch plan of the DG
(26) constraint conditions, (1) as the objective function, the reactive
power output of DGs each period is calculated by
NGA to complete its day-ahead reactive power dispatch plan.
The built model in this section belongs to a non-integer non
linear programming problem. Here, the optimization result obt
ained in the heuristic search stage is marked with ξˆ =  yˆ , zˆ 
, then, the variable correction stage can be summarized as the f
ollowing optimization model:

min  f ( xt , yt , zˆt )
 t
0
 s.t. ht ( xt , yt , zˆt )  (29)
 0
 gt ( xt , yt , zˆt )  0
 xt ,min  xt  xt ,max

 yt ,min  yt  yt ,max
D. Solution Process
Through the heuristic search and variable correction, the pr
oblems of the coordinated dispatch and space-time coupling is
solved in the dynamic reactive power optimization of the
Load 、WT and PV Factors
Load Factor
1.2 WT Factor at buses #19,#24 PV Factor at buses #27,#30
1
0.8
0.6
0.4
0.2
0
0 3 6 9 12 15 18 21 24
Time Period (hours)
Fig. 2. Forecast coefficients of Load, WT and PV for next day
A. Simulation Analysis of IEEE 33-bus System
In this section, the IEEE 33-bus distribution network modifi
ed by reference [3] is used to comprehensively analyze and ve
rify the practicality of the proposed dispatch strategy and algor
ithm. The IEEE 33-bus distribution network has 33 nodes and
32 branches. The reference capacity of the system is 10 MVA
while the reference voltage is 12.66 kV. Therein, the OLTC in
the substation accesses to the root node 0, and its step is 0.01 a
nd the switchable range is [0.94, 1.06]. Two switchable CBs ar
e connected to buses {#2, #8} and marked as CB1 and CB2, r
espectively, whose capacities are both [0,
+0.5] Mvar, whose steps are 0.01 Mvar. Besides, the maximu
m action time over 24 hours for both is 5. The PVs are installe
d at buses #27 and #30 with rated capacity being 0.3 MW. The
DFIGs are connected to #19 and #24 nodes with rated capacity
being 0.3 MW. Specific topology is shown in Fig. 3.
 Output coordinated dispatch plan
End
Fig. 1. Flow chart of solving model
V. NUMERICAL SIMULATION
Based on the typical load demand curve, PV and WT active
power prediction curve, the predicted values of each period ar
e converted into the corresponding proportion with their respec
tive predicted peak values. In this way, the load demand, WT a
nd PV output ratio coefficients are solved, which are shown in
Fig. 2. Meanwhile, it should be noted that taking into account t
he areas covered by the distribution system is small, all WTs a
nd PVs adopt the same wind speed and light curve in the simul
ation analysis.
18 19 20 21 OLTC
CBs DG
0 123 456789 10 11 12 13 14 15 16 17
25 26 27 28 29 30 31 32
22 23 24
Fig. 3. Diagram of modified IEEE 33-bus distribution network
According to the optimization results in Fig. 4, it is easy to
see that the reactive power outputs of DGs are within respectiv
e output limits. As a whole, due to the apparent power limit of
the grid-connected inverters, DG's reactive power output is op
posite to the corresponding active power, which is shown in th
e Fig.4. Meanwhile, DG's reactive power output still has a cert
ain adjustment margin, which will increase its ability to cope
with system uncertainties. Moreover, each parallel CBs also sa
tisfies the operational constraints of its action time and reactiv
e power output limit. For the OLTC, its maximum allowable a
ction time is set to 4 and the switching result also satisfies the
constraints of action time and adjustment range. The optimizat
ion results of OLTC are shown by the blue curve marked with
the triangle in Fig. 5 or the green curve marked with the circle
in Fig. 6.
 1.045

OLTC secondary voltage/(p.u.)

1.04

0.5
1.035
Reactive power output /(kvar)

0.4

0.3 1.03
continuous
0.2 1
1.025 2
0.1 4(This paper)
8
0 1.02
0 0 3 6 9 12 15 18 21 24
3 Time section/(h)
6
9
12
CB2 Fig. 5. Impact of action time limit on OLTC
15 CB1
PV2
Time section/ 18 PV1
(h) 21 WT2
24 WT1 1.07

Reactive power regulating devices

1.06

OLTC secondary voltage/(p.u.)

1.05
Fig. 4. The result of day-ahead reactive power dispatch for distribution networ
k with DGs 1.04

1.03
1 ） The impact of action time and adjustment step of discr
ete devices on the result 1.02
continuous
0.01 p.u.(This paper)
1.01
The distribution system may be reconfigured due to the nee 0.025 p.u.
0.05 p.u.
d of transmission network operation by shifting loads, DGs 1
0 3 6 9 12 15 18 21 24
and CBs from substation to another substation. When the distri Time section/(h)

bution network as a whole is switched from substation to anot

Fig. 6. Impact of adjustment steps on OLTC (nk_max=4)
her substation, the topology of the distribution network will no
t change. The only change is the OLTC connected to the distri
bution network. After the switching, the adjustment characteri 1.07

stics of the OLTC may be different, that is, the difference is its 1.06
OLTC secondaed voltage/(p.u.)

action time and adjustment step. To address this issue, this sec 1.05

tion analyzes the impact of action time and adjustment step of

1.04
OLTC on the result.
In this section, the parameters of CBs remain unchanged. 1.03

The adjustment step of OLTC is still set to 0.01 p.u. The optim 1.02 continuous
0.01 p.u.(This paper)
ization results are shown in Fig.5 when the action time changi 1.01 0.025 p.u.

ng from 1 to 8. The results indicate that the discrete 1

0.05 p.u.

0 3 6 9 12 15 18 21 24
ladder curve gradually approaches ideal curve. It should be not Time section/(h)

ed that the ideal curve is the optimization results that the switc
hing gears of OLTC are taken the continuous variation without Fig. 7. Impact of adjustment step on OLTC (nk_max=8)
considering its action time constraints.
Further, the action time of OLTC is fixed to 4. The adjustm 22.12
0.01p.u.
ent step is set to 0.01 p.u, 0.025 p.u, and 0.05 p.u., 0.025p.u.
The satisfaction of dispatch results

0.05p.u.
respectively. The simulation results are shown in Fig. 6. Simil 21.12

arly, the action time of OLTC is fixed to 8, the results corresp

onding to different adjustment steps are shown in Fig. 7. 20.12

Finally, the adjustment step of OLTC is fixed to 0.01p.u., 0 19.12

025p.u. and 0.05p.u., respectively. As allowable action times i
ncrease, the satisfaction trend of simulation results is shown in 18.12
1 2 3 4 5 6 7 8
detail in Fig. 8. Action times of the OLTC

Fig. 8. Impact of different adjustment steps and action times on satisfaction f

unction

As shown in Fig. 5, 6 and 7, the tap of OLTC is all positive

regulation during each period, this is because the voltage ampl
itude at the terminal of feeder line is too low. Therefore, it is f
oreseeable that with DG permeability increasing the
terminal node voltage will be gradually raise, and the tap of O th the allowable action time increasing, the OLTC secondary voltage ampl
LTC may perform negative regulation. As seen from Fig. 5, wi itude gradually approaches the ideal curve. From Fig. 6 and Fig. 7, the adj
ustment with small step is difficult to accurately track the fluct each period. In addition, in order to improve the credibility of t
uation of load demand and DG output when lacking action tim he optimization results, this paper has chosen the average valu
e, so that the es of the running results for 10 times, which are shown in
Figures 9, 10, 11 and TableⅠ, respectively.

120
110
adjustment results are relatively poor. However, the discrete d 120

evices can achieve frequent adjustment when having a large ac 110 100

tion time, so that the adjustment with small steps can be more 100

Network loss/(kwar)
90 90
refined and the adjustment effect is better. Besides, in the case 80
of the adjustment step increasing to 0.05 p.u., the switchable d 70 80

uration of OLTC does not change during the process of the all 60
70
owable action time changing from 4 to 8. OLTC is only adjust 50

40
ed twice during the whole process, though with more allowabl strategy 3 60
strategy 2
e action time. Meanwhile, it can be verified from Fig. 8, satisf strategy 1
15 18
21
24

50
action function is always 20.04 when action scheme 3
scheme 2 6
9
12

time changing from 2 to 8. Hence, if it is adjusted, it will only scheme 1 0

3

Time section/(h)
make the result worse, so OLTC is not adjusted when its allow
able action time changing from 2 to 8. It can also be clearly see Fig. 9. Comparison of network loss in different dispatch schemes and
n from Fig. 8 that the larger adjustment step can achieve better strategies
results in the case of few allowable action time. For example,
when the allowable action time is set as 1, the satisfaction is 18.
22, 18.72 and 18.97 respectively for the adjustment step being 1.035

0.01 p.u., 0.025 p.u. and 0.05 p.u.. On the contrary, the smaller 1.04
1.03

adjustment steps can get better results. For example, when the 1.03
1.025

allowable action time is set as 8, the satisfaction is 21.12, 20.56 1.02

Voltage amplitude/(p.u.)

1.02
and 20.04 respectively for the adjustment step being 0.01 p.u., 1.015
1.01
0.025p.u. and 0.05 p.u.. 1.01
1
2）Comparison between different schemes or strategies 0.99
1.005

This section conducts comparative analysis from the 1

following three schemes and three strategies. 0.98

strategy 3 0.995

strategy 2
Scheme 1: DGs do not participate in reactive power dispatc strategy 1 24
28
32 0.99

20
h; scheme 3
scheme 2
12
16 0.985
8
Scheme 2: DGs participate in reactive power dispatch with scheme 1 0
4
System node
the constant power factor 0.95;
Scheme 3: DGs participate in the optimization dispatch wit
Fig. 10. Comparison of node voltage amplitude in different dispatch schemes
hin the reactive power output limit. and strategies
Strategy 1: Network loss is set as the objective function to
perform reactive power dispatch; 0.75
Strategy 2: Voltage deviation is set as the objective functio scheme 1
n to perform reactive power dispatch; 0.675 scheme 2
Voltage deviation/(p.u.)

Strategy 3: The satisfaction function, considering both netw scheme 3

strategy 1
ork loss and voltage deviation, is used to perform reactive pow strategy 2
0.55
er dispatch. strategy 3

Fig. 9 shows the operation network loss under different sch

emes and strategies. Fig. 10 and Fig. 11 show the voltage ampl 0.425

itude and voltage deviation of each node under different sche

mes and strategies, respectively. Here, time 16 is taken as an e
0.3
xample in Fig. 10 to present each node voltage. The ordinate i 1 4 7 10 13 16 19 22 24
Time section/(h)
n Fig. 11 is the sum of the absolute values of voltage deviation
for all nodes during each period. Further, comparative analyse Fig. 11. Comparison of node voltage deviation each period in different dispatc
s on optimization results in different schemes and strategies ar h schemes and strategies
e done in voltage amplitude, network
loss and satisfaction, as shown in TableⅠ. The network loss a From the Fig. 9, 10, 11 and Table Ⅰ , we can see that schem
nd voltage deviation in TableⅠ are the cumulative values in a e 3 can better reduce the network loss than the schemes
dispatch cycle and the satisfaction is the average values of 1 and 2, whose reduction rate stands at 23.90% and 16.16%,
respectively. There is a similar result in the controlling voltage vely. In-depth view, under the condition of ensuring the maximum active
deviation. Meanwhile, compared to scheme 1 and scheme 2, sc power output of WT and PV, through reasonable control strategies, the W
heme 3 increase 3.0452 and 1.9734 in the satisfaction, respecti T and PV can output reactive power based on reactive power demand wit
 hin its physical constraints, and realize reactive power local co
mpensation. This alleviates the network loss and voltage drop
caused by the long-distance transmission of reactive power on
the feeder. At the same time, it can be foreseen that when over
voltage occurs in the distribution network, the WT

Fig.12 The contradistinction of linear satisfaction and satisfaction propose

d in this paper

TABLEⅠ
COMPREHENSIVE COMPARISON OF DIFFERENT SCHEMES
AND STRATEGIES (IEEE 33)
and PV can output inductive reactive power to reduce the
system node voltage, which will ensure safe and stable Schemes/ Network voltage
Satisfaction
operation of power system. This just shows that DG participatin strategies loss/(kW) deviation/(p.u.)
g in reactive power dispatch within its reactive output range can scheme1 2048.8 14.0570 18.6441
better improve the running performance of power system, and i scheme2 1859.7 12.4621 19.7159
mprove its utilization rate and exert greater value. scheme3 1559.2 9.8339 21.6893
Future, compared with the strategy 1 and strategy 2, strateg strategy1 1591.6 10.9485 21.0876
y 3 proposed in this paper better achieves the balance between strategy2 1604.4 10.6200 21.0680
network loss and voltage deviation, and the strategy3 1598.0 10.6842 21.3319
satisfaction is improved by 0.2443 and 0.2639, respectively. It TABLE Ⅱ
is worth noting that the satisfaction here is the average value i COMPREHENSIVE COMPARISION OF DIFFERENT SCHEMES
n a dispatch cycle. Hence, the optimization effect will be more AND STRATEGIES (IEEE 14)
prominent when the analysis is done by the total increments of
the satisfaction in a dispatch cycle. From fig. 12, compared wit Voltage d
h the line-type satisfaction function, in the case of the same net Scheme/ Strat Network lo
eviation Satisfaction
work loss (input parameter), the built Z-type satisfaction functi egy ss/MW
/p.u.
on will have a better satisfaction value during the [a, a+b]. In scheme 1 13.5763 5.9636 18.8627
contrast, it will have a worse satisfaction value in the [a+b, b]. scheme 2 11.6738 5.7112 19.4422
Specifically, it can improve the satisfaction of the smaller net 19.8496 4.3932 21.9187
scheme 3
work loss and reduce the satisfaction of the larger network los 10.1133 4.6448 21.2948
strategy1
s. Similar to the Z-type satisfaction function, the gauss-type sa
strategy2 10.2214 4.5049 21.2650
tisfaction function of voltage deviation has the same effect. Co
strategy3 10.1610 4.5509 21.5192
mpared with the line- type satisfaction function, in the case of
the same node voltage amplitude (input parameter), the built g
auss-type satisfaction function will have a worse satisfaction v TABLE Ⅲ
alue at the time of unqualified voltage, such as [0.9, 0.95] and COMPREHENSIVE COMPARISION OF DIFFERENT SCHEMES
AND STRATEGIES (PG&E 69)
[1.05, 1.1]. In
contrast, it will have a better satisfaction value in the period of
voltage qualification [0.95, 1.05]. Hence, in order to achieve Scheme/ Network Voltage
Satisfaction
greater satisfaction, the unqualified node voltage will be better o Strategy loss/(kW) deviation/(p.u.)
ptimized. In short, the Z-type satisfaction function of network l scheme1 3761.29 29.3919 17.3712
oss and the gauss-type satisfaction function of voltage deviation scheme2 3302.56 26.0751 18.5247
can be adjusted adaptively by means of its convexity and conca scheme3 2817.86 20.5618 19.8926
ve, which better achieve the balance between network loss and strategy1 2900.33 22.8923 19.0876
voltage deviation of the distribution system. Through the compa strategy2 2925.71 22.2051 19.0583
rison and analysis, it can be clearly seen that the optimization strategy3 2911.30 22.4300 19.1389
effect of the proposed strategy is
close to that of the scheme 3, which well explain the feasibili Feeder node1
CBs DG
ty and superiority of the proposed strategy.
node3 node4
node11
node2

node8 node12
node6 node10
node9
node7node14
node5 node13

Fig.13 Diagram of modified IEEE 14-bus distribution network

 28 29 30 31 32 33 34 35
OLTC
CBs DG
59 60 61 62 63 64 65 66 67 68 69
40 4157 58
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
36 37 38 39 55 56
42 43 44 45 46 47 48 49 50 51 52 53 54
Fig. 14. Diagram of modified PG&E-69 bus distribution network
B. Simulation analyses of IEEE 14-bus and PG&E 69-bu
s test systems
The IEEE 14-bus distribution network has 3 feeders and 16
branches. The reference capacity of the system is 100 MVA w
hile the reference voltage is 23 kV. With the removal of the thr
ee branches (14, 15 and 16), it will lead to a radiation typical d
istribution network structure with 14 nodes and 13 branches, w
hich can operate in the form of open loop. Among them, the O
LTC in the substation accesses to the root node 0, and its step i
s 0.025 and the switchable range is [0.95, 1.05]. The switchabl
e capacitors, with the capacity of [0, +2.0] Mvar and the step o
f 0.1 Mvar, are connected to bus #3. Besides, the maximum all
owable action time over 24 hours is 5. The DFIGs are connect
ed with node 19 and node 24, respectively, whose rated capaci
ty are both 2 MVA. The PV connected to grid by inverters are
installed at buses #9 and #14, whose rated capacity are both 1.
5 MVA. The topology of IEEE-14 bus distribution system is s
hown in Fig. 13.
The PG&E 69-bus distribution network has 69 nodes and 7
3 branches and 5 contact switches. Its base capacity is 10 MV
A and reference voltage is 12.66 kV. Among them, the OLTC
in the substation accesses to the root node 1, and its step is 0.0
1 and the switchable range is [0.95, 1.05]. The switchable capa
citors are connected to buses {#21, #61}, whose capacity are b
oth [0, +0.5] Mvar, and the steps are 0.02 Mvar. Besides, the
maximum allowable action time over 24 hours for both is 5. T
he DFIGs are connected to buses {#16, #28, #51, #66}, whos
e rated capacity are all 0.5 MVA. The
PVs are installed at buses #41, #54, #56 and #58, whose rated
capacity are all 0.5 MVA. The topology of PG&E 69-bus distr
ibution system is shown in Fig. 14.
To further verify the proposed model, we use IEEE 14-bus
and PG&E 69-bus distribution network as the simulation syste
ms in this section. Considering that the feasibility of the propo
sed strategy has been fully verified by the IEEE 33-bus distrib
ution network, here, based on the spatial constraints, the analy
sis for IEEE 14-bus and PG&E 69-bus test systems are perfor
med from three aspects of voltage amplitude, network
loss and satisfaction to further verify the universality and
efficiency of the proposed strategy. Then, comparative
analyses on optimization results in different schemes and strateg
ies are done in voltage amplitude, network loss and
satisfaction, as shown in Table Ⅱ and Table Ⅲ . The used
schemes and strategies are remain the same as section 4.1 in
this section.
In Table Ⅱ , three schemes are compared in terms of opti
mizing network loss and voltage deviation, the scheme 3 is
the service life of OLTC and CB. The method 2 uses the segm
obviously better than scheme 1 and scheme 2. Then, in three d
ispatch strategies, compared with the strategy 1 and strategy 2,
the proposed strategy 3 better achieves the balance between ne
twork loss and voltage deviation, and the satisfaction is impro
ved by 0.2244 and 0.2542 respectively. The causes associated
to what is happening physically have been explained in detail i
n section A of numerical simulation. Here, it will not be descri
bed in detail. Similarly, through the comparison and analyses
between three strategies and scheme 3, it can be clearly seen th
at the optimization effect of proposed strategy is close to that o
f scheme 3, so optimization results are ideal. At the same time,
through the three schemes
and three strategies in Table Ⅲ, it can be clearly seen that the
simulation results of PG&E-69 bus distribution system are
similar to those of the IEEE-33 and IEEE-14 bus distribution s
ystem. The validity and feasibility of the proposed strategy is a
lso verified. Due to limited space, it will not be analyzed in det
ail in this section.
C. Comparative analysis of multiple optimization methods
In order to further verify the practicability of the proposed
optimization method, comparisons with two most effective an
d recently reported optimization approaches from the referenc
es [13], [15] and [20] are carried out. It is worth noting that the
same coordinated scheduling strategy is adopted in [13] and [1
5]. Therefore, the following will mainly compare with the met
hod of reference [13]. Before comparing with the optimization
method in [13], we first develop the Matlab program based on
the optimization method and test system described in [13], and
strictly verify the correctness of our program by comparison w
ith the simulation results in [13]. Then, in order to ensure the s
trictness of the comparative analysis, here we change the objec
tive function in [20] to the formula (1) in our manuscript, and
OLTC's switching gear as a control variable is considered. Fin
ally, we compare the proposed optimization method with the li
terature [13] and [20] based on the modified IEEE 33-bus test
system in our manuscript that is the most commonly used stan
dard test system in the distribution network. The three method
s used for comparative analysis are as follows:
Method 1: optimization method in [13];
Method 2: optimization method in [20];
Method 3: the proposed optimization method in our man
uscript.
The detailed results are shown in Table IV below.
TABLE IV
COMPARATIVE ANALYSIS OFMULTIPLE OPTIMIZATION
METHODS
Action time of OLTC and CB
Method Satisfaction
OLTC CB1 CB2
Method 1 5 6 10 21.3681
5
Method 2 5 5 20.1927
Method 3 4 3 4 21.9187
As can be seen from Tab. IV, the method 1 requires freque
nt adjustments of OLTC and CB to cope with system fluctuati
ons without the limit of the action time, which affects
entation static method to divide the dynamic net load curve into 5 segmen
ts, and both OLTC and CB are adjusted 5 times in the scheduli
ng cycle. Moreover, this method is difficult to handle the case
where the OLTC and the CB have different action times. Com
pared with the method 1 and method 2, the method 3 proposed
in this paper has better satisfaction within the maximum allow
able action number of discrete devices, and the satisfaction is i
mproved by 0.1638 and 0.5392, respectively. Since the satisfa
ction is determined by the network loss and node voltage, it ca
n be known that the method 3 better improves network loss an
d the node voltage of the system. Therefore, the method 3 prop
osed in this paper has good practicability and feasibility.
D. Selection criteria of weighting factors
For the multi-objective functions to be converted into sin
gle-objective functions, we first solve the problem of dimensio
nal inconsistency by standardizing the F(Ploss ) and
F(Uave ) , and then transform the multi-objective function into
a single objective function based on the weighting method. Alt
hough the weighting method is currently the most common an
d practical method, it faces the problem of how to select the w
eighting factors. Here, the criteria of weighting factors selecte
d in equation (1) is: under the premise of ensuring the safe and
stable operation, taking 0.05 as the step size, the weighting fac
tors that ultimately makes the satisfaction function the largest i
s selected as the weighting factors. Finally, the results of three
IEEE test systems show that this method can achieve satisfact
ory effect. By this method, the weighting factors for each
test system are as follows:
1  0.55 and 2  0.45 in the IEEE 33-bus test system;
1  0.65 and 2  0.35 in the IEEE 14-bus test system;
1  0.35 and 2  0.65 in the PG&E 69-bus test system. Due t
o space limitations, the following is an example of the satisfact
ion of IEEE 33-bus test system under different weights, which
is shown in Fig. 15.
Fig. 15 the satisfaction of the IEEE 33-bus test system under different weight f
actors
VI. CONCLUSION
This paper proposes a two-stage (Heuristic search and Vari
able correction) dynamic reactive power coordinated dispatch
method to solve the problem of coordinated dispatch and time-
space coupling in the DRPO considering the reactive
[18] Y. Li, M. Li, and Q. Wu, “Optimal reactive power dispatch with wind po
wer integrated using group search optimizer with intraspecific competitio
n and levy walk,” J. Mod. Power Syst. Clean Energy, vol. 2. no. 4, pp. 30
power regulation ability of DGs. Meanwhile, based on the anal
ysis of Gauss-type and Z-type membership function, a new obj
ective function is put forward to better balance both network l
oss and voltage deviation. The comparison with the traditional
dispatch schemes, strategies and optimization approaches thro
ugh IEEE 33-bus, IEEE 14-bus and PG&E 69 test systems pro
ve that the proposed method can achieve better optimal solutio
n and computational performance than existing methods. More
over, Numerical results also demonstrate that making full use
of DGs reactive power adjustment potential is conducive to im
proving the system security and economy.
REFERENCES
[1] B. Zhu, H. Tazvinga, X. Xia, “Switched model predictive control for ener
gy dispatching of a photovoltaic-diesel-battery hybrid power system,” IE
EE Trans. on Control Syst. Technol., vol. 23, no. 3, pp. 1229- 1236, May
2015.
[2] S. Gill, I. Kockar, G. W. Ault. “Dynamic optimal power flow for active d
istribution networks,” IEEE Trans Power Syst., vol. 29, no.1: 121-131, Ja
n. 2014.
[3] T. Ding, S. Liu, W. Yuan Z. Bie and B. Zeng, “A two-stage robust reactiv
e power optimization considering uncertain wind power integration in act
ive distribution networks,” IEEE Trans. Sustain. Energy, vol.7, no.1, pp.
301-311, Jan. 2016.
[4] A. Cagnano, E. De Tuglie, M. Liserre, and R. A. Mastromauro, “On-line
optimal reactive power control strategy of PV-inverters,” IEEE Trans. In
d. Electron., vol. 58, no. 10, pp. 4549-4558, Oct. 2011.
[5] A. V. Stiphout, K. D. Vos, G. Deconinck, “The Impact of Operating Rese
rves on Investment Planning of Renewable Power Systems,” IEEE Trans .
Power Syst., vol. 32, no. 1, pp. 378-388, Jan. 2017.
[6] T. Niu, Q. Guo, H. Jin, et al, “Dynamic reactive power optimal allocation
to decrease wind power curtailment in a largescale wind power integratio
n area,” IET Renew. Power Gener., vol. 11, no.13, pp. 1667- 1678, Nov.
2017.
[7] S. Eftekharnejad, V. Vittal, G. T. Heydt, B. Keel; J. Loehr. “Impact of in
creased penetration of photovoltaic generation on power systems,” IEEE
Trans. Power Syst., vol.28, no. 2, pp.893-901, May 2013.
[8] J. V. Paatero, P. D. Lund, “Effects of large-scale photovoltaic power integ
ration on electricity distribution networks,” Renewable Energy, vol. 32, n
o. 2, pp.216-234, Feb. 2007.
[9] C. G. Kaloudas, L.F. Ochoa, B. Marshall, et al., “Assessing the future tre
nds of reactive power demand of distribution networks,” IEEE Trans. Po
wer Syst., vol.32, no.6, pp.4278-4288, Nov. 2017.
[10] L. Chen, H. Li, “Optimized reactive power supports using transformer ta
p stagger in distribution networks,” IEEE Trans. on Smart Grid, vol. 8, n
o. 4, pp. 1987-1996, July 2017.
[11] Z. Yang, A. Bose, H. Zhong, N. Zhang, Q, Xia, C, Kang, “Optimal reacti
ve power dispatch with accurately modeled discrete control devices: A su
ccessive linear approximation approach,” IEEE Trans. Power Syst., vol. 3
2, no.3, pp. 2435-2444, May 2017.
[12] K. Zou, A. P. Agalgaonkar, K. M. Muttaqi, “Distribution system plannin
g with incorporating DG reactive capability and system uncertainties,” I
EEE Trans. Power Syst., vol.3, no.1, pp.112-123, Jan. 2012.
[13] Y. J. Kim, P. Hwang, G. Pyo, S. M. Kim, “Coordinated control of a DG a
nd voltage control devicesusing a dynamic programming algorithm,” IEE
E Trans on Power Syst., vol. 28, no. 1, pp.42-51, Feb. 2013.
[14] Y. Deng, X. Ren, C. Zhao, “A heuristic and algorithmic combined approa
ch for reactive power optimization with time-varying load demand in dist
ribution systems,” IEEE Trans. Power Syst., vol.17, no.4, pp.1068- 1072,
Nov. 2002.
[15] Y. J. Kim, J. L. Kirtley, L. K. Norford, “Reactive power ancillary service
of synchronous DGs in coordination with voltage control devices,” IEEE
Trans on Smart Grid, vol. 8, no. 2, pp.515-527, Mar. 2017.
[16] W. Yan, J. Yu, D. C. Yu, and K. Bhattarai, “A new optimal reactive pow
er flow model in rectangular form and its solution by predictor corrector
primal dual interior point method,” IEEE Trans. Power Syst., vol. 21, no.
1, pp. 61-67, Feb. 2006.
[17] A. A. A. Esmin, G. Lambert-Torres and A. C. Z. De Souza, “A hybrid pa
rticle swarm optimization applied to loss power minimization,” IEEE Tr
ans. Power Syst., vol. 20, no. 2, pp. 859-866, May 2005.
8-318, Dec. 2014.
[19] W. H. E. Liu, A. D. Papalexopoulos, and W. F. Tinney, “Discrete shunt controls in a N
ewton optimal power flow,” IEEE Trans. Power Syst., vol. 7, no. 4, pp. 1509-1518, No
 v. 1992.
[20] C. Wang, L. Xiang, Z. Deng, et al., “Reactive power optimization dispatc
h strategy in distribution network with distributed generators,” The Journ
al of Engineering, 2017(13): 1418-1422, 2017. Xiaohui Xu received the B.Sc. (Eng.) and Ph.D. degre
[21] L. Zhang, W. Tang, J, Liang, et al., “Coordinated day-ahead reactive pow es in Precision Machinery and Precision Instrumentati
er dispatch in distribution network based on real power forecast errors,” I on from the University of Science and Technology of
EEE Trans. Power Syst., vol. 31, no. 3, pp. 2472-2480, May 2016. China, Hefei, China, in 2003 and 2008, respectively. H
[22] Z. Yang, A. Bose, H. Zhong, et al., “Optimal reactive power dispatch wit e engaged in the postdoctoral work in the Jiangsu Pow
h accurately modeled discrete control devices: a successive linear approx er Company and Southeast University from 2009 to 20
imation approach,” IEEE Trans. Power Syst., vol 32, no. 3, pp. 2435-244 11. He worked at Jiangxi Power Company from 2008 t
4, May 2017. o 2009. Since 2011, he has been employed at China El
[23] T. Ding, Q. Yang, Y. Yang, et al., “A data-driven stochastic reactive pow ectric Power Research Institute (CEPRI). He is the aut
er optimization considering uncertainties in active distribution networks a hor or coauthor of more than 50
nd decomposition method,” IEEE Trans. on Smart Grid, IEEE Early Acc published papers and 3 textbooks. His research interests include smart distribu
ess Articles, 2017. tion grid, grid integration of renewable energy sources and demand response.
[24] S. Liu, J, Zhang, Z. Liu, “Reactive power optimization and voltage contr
ol using an improved genetic algorithm,”//2010 International Conference
on Power System Technology, IEEE/PES and CSEE, pp. 24- 28, Oct. 20
10.
[25] D. H. Cho, J. K. Kin, H. K. Jung, C. G. Lee, “Optimal design of permane
nt-magnet motor using autotuning niching genetic algorithm,” IEEE Tra
ns. Magn., vol. 39, no.3, pp. 1265-1268, May 2003.
[26] D. Karaboga, “An Idea Based on Honey Bee Swarm for Numerical Optim
ization,” Technical Report-TRO6, Erciyes University, Kasyeri, Jan. 2005.
[27] D. Karaboga, B, Basturk, “On the performance of artiflcial bee colony (A
BC) algorithm,” Applied Soft Computing, vol.8, no.1, pp. 687-697, Jan. 2
008.
[28] X. Wang, X. Xu, Q. Sheng Z. Wang and L. Yao, “Novel artificial bee col
ony algorithms for QoS-aware service selection,” IEEE Trans. Services
Computing, IEEE Early Access Articles, 2016.
[29] B. Lami, K. Bhattacharya, “Clustering Technique Applied to Nodal Relia
bility Indices for Optimal Planning of Energy Resources,” IEEE Trans. P
ower Syst., vol. 31, no.6, pp. 4679-4690, Nov. 2016.
[30] Y. Wang, F. Li, Q. Wan, and H. Chen, “Reactive power planning based o
n fuzzy clustering, gray code, and simulated annealing,” IEEE Trans. Po
wer Syst., vol. 26, no. 4, pp. 2246-2255, Nov. 2011.

Lijuan Chen was born in Jiangsu, China, on Novemb

er 15, 1982. She received the B.Sc. (Eng.), M.Sc. (En
g.) and Ph.D. degrees in electrical engineering from th
e Southeast University, Nanjing, China, in 2003, 2005
and 2007, respectively. She engaged in the postdoctor
al work in the Jiangsu Power Company and Southeast
University from 2007 to 2009. Presently, she is servin
g as senior engineer in the School of Electrical Engine
ering, Southeast University, Nanjing, China. Her rese
arch interests
include demand response, electricity markets operation & economics and grid i
ntegration of renewable energy sources.

Zhenli Deng received the B.S. degree from the School o

f Electrical Engineering and Automation, Henan Polytec
hnic University, Henan, China, in 2016. He is currently
pursuing the M.S. degree at the School of Electrical Eng
ineering, Southeast University, Nanjing, China. His maj
or research interests include reactive power optimization
and grid integration of renewable energy sources.