Professional Documents
Culture Documents
-
Abstract The capacitor sizing problem is a special case of the general posed such a solution method to determine the number as well as loca-
capacitor placement problem. The problem is to determine the optimal tion and the size of capacitors. Chang [4] considered voltage limits in
size of capacitors placed on the nodes of a radial distribution system so his solution scheme.
that the real power losses will be minimized for a given load profile. Duran [3], by exploiting the discrete nature of the capacitor sizes,
This problem is formulated as a nonliiear programming problem. The used a more realistic model Tor the reeder with many sections of
ac power flow model of the system, constraints on the node voltage different wire sizes and concentrated loads and proposed a dynamic pro-
magnitudes, and the cost of capacitors are explicitly incorporated in the gramming solution method. Ponnavaiko and Prakaso [12] considered
formulation A solution algorithm, based on a Phase I - Phase II feasi-, load growth as well as system capacity release and voltagc raise at light
ble directions approach, is proposed. Also presented are a new formula- load conditions and used a local optimization technique called the
tion of the power flow equations in a radial distribution network and a method of local variables by treating capacitor sizes as discrete variables.
numerically robust, computationally efficient solution scheme. This solu-
tion scheme is used as a subroutine in the optimization algorithm. Test Recently, interests in Distribution Automation and Control (DAC)
results for both the capacitor sizing problem and the power flow solution have generated quite a lot of new studies in capacitor placement prob-
schemes are presented. lem. Grainger and Lee pioneered in refoimulating the problem as a non-
h e a r programming problem and in developing computationally efficient
solution methods. In [6], they generalized Cooks formulation for a
1. INTRODUCTION radial feeder, regarded the capacitor sizes as continuous variables, and
Capacitors are widely used in distribution systems for reactive developed a computationally simple, iterative solution scheme. They
power compensation to achieve power and energy loss reduction, voltage later introduced switched type. capacitors with simultaneous switching [7]
regulation, and system capacity release. The extent of these benefits will and a voltage dependent model for loss reduction [8]. In [9], together
depend upon how the capacitors are placed on the system, i.e., (ii) the with El-Kib, they proposed. a solution method to determine the optimal
number and location, (i) the type (fixed or switched), (iii) the size, and design and real-time control scheme for switched capacitors with non-
(iv) the control scheme of the capacitors. simultaneous switching under certain assumptions. Grainger and Civan-
Therefore, the capacitor placement problem in distribution feeders lar considered the optimal design and control scheme for continuous
consists of determining the place ( number and location), type, size, and capacitive compensation case [lo] and introduced a voltage dependent
control scheme of capacitors to be installed such that the benefits men- solution scheme [14]. El-Kib et. al., [16] extended the methodologies
tioned above be weighted against the fixed and running costs of the developed in [6]-[9] to encompass unbalanced three-phase feeders.
capacitors and their accessories. Kaplan [13] extended the formulation for multi lateral feeders and pro-
The early analytical methods for capacitor placement are mainly posed the use of heuristics for the solution. Grainger and Civanlar [151
developed by Neagle and Samson [l]. The problem is defined as deter- combined capacitor placement and voltage regulator problems for a gen-
mining the location and size of a given number of fixed type capacitors eral distribution system and proposed a decoupled solution methodology.
to minimize the power loss for a given load level. The results, the sim- The basic idea in our formulation of the general problem is similar
plest of which is the celebrated 2/3 rule, were based on a simplified, vol- to that of Grainger et. al., i.e., formulating it as a nonlinear programming
tage independent system model obtained by: (i) considering only the problem. We will consider a capacitor placement problem that (i) incor-
main feeder with uniform load distribution and wire size, (ii) takig into porates directly the ac power flows as system model, (i) enforces the
account only the loss reduction due to the change in the reactive com- voltage constraints. We develop a solution methodology by using
ponent of the branch cumnts, (iii) ignoring the changes in the node vol- decomposition techniques. At the lowest level of the decomposition, we
tages, and (iv) neglecting the cost of capacitors. Later, a more have special capacitor placement problcms, callcd the buse problems. A
comprehensive derivation of these rules was given by Bae, [5]. Fawzi base problem is a sizing type problem which is used to find the optimum
et. al. [ l l ] incorporated the released substation W A and the voltage sizes of a set of selected capacitors placed on the nodes of the distribu-
raise at light load conditions into the model. tion system and thcrefore, it is of practical intercst in its own right. The
These analytical methods are also integrated with some heuristics solution algorithm for the sizing problem is a special Phase I - Phase I1
to obtain computer oriented solution methodologies and thus to over- Feasible Directions method which takes into account the structure of the
come some of their shortcomings. Cook [2] extended the formulation of problem. We present the formulation of the sizing problem and the
the problem to include peak power and energy loss reduction and pro- solution algorithm developed for it in this paper. The solution of the
general problcm is presented in another papcr [17].
Also in this paper, a new formulation of the ac power flow equa-
tions for the radial distribution systems is introduced and a computation-
ally efficient and numerically robust solution methodology, callcd Dist-
Flow, is presented. Such a solution methodology is needed because of
88 WM 065-5 .4 p a p e r recommended and approved its repeated use in the optimization algorithm.
by t h e IEEE T r a n s m i s s i o n and D i s t r i b u t i o n Committee In section 2, the new power flow equations for radial distribution
of t h e IEEE Power E n g i n e e r i n g S o c i e t y for p r e s e n t a t - systems are presented. The sizing problem is stated in section 3. Sec-
i o n a t t h e IEEEIPES 1988 W i n t e r Meeting, New York, tion 4 describes the general approach for the solution. The structure of
New York, J a n u a r y 31 - F e b r u a r y 5, 1988. Manuscript the problem is studied in section 5 and the proposed solution algorithm
s u b m i t t e d September 1, 1987; made a v a i l a b l e o r is prcsented in section 6. Section 7 contains the tcst runs and conclu-
p r i n t i n g November 13, 1987.
sions are given in section 8.
II. DISTRIBUTION SYSTEM POWER FLOW as DirtFlow Equations. They are of the form
Power flows in a distribution system obey physical laws (Kirchoff G(xo,u) = 0 (4)
laws and Ohm law), which become part of the constraints in the capaci- Where, 4 = [x&. . . &IT is the branch variables and U is the capacitor
tor placement problem. In our proposed solution algorithm for the capa-
sizes. For a given load profile (i.e., set of demands P f i , Qfi :
citor placement problem, the distribution system power Row solution is
i = 1 , . . . ,n ) and capacitor sizes (connof variables). U , 3(n+I) Dist-
to be used as a subroutine in every iteration. Therefore, it is essential to
Flow equations can be used to determine the operating point, x,, of the
have a computationally efficient and numerically robust method for solv- system. Such a solution algorithm is developed in the appendix.
ing the distribution system power flow.
General Case
In this section, we present the new power flow equations for radial
distribution systems. The formulation is conducive to efficient solution The DistFlow equations can be generalized to include laterals.
methods. For pedagogic convenience, we first consider a special case Consider a lateral branching out from the main feeder as shown in Fig.2.
where there is only one main feeder. The general case for any radial For notational simplicity, the lateral branching out from node k will be
distribution system is considered next. To simplify the presentation, the referred to as the lateral k and the node k will be referred to as the
system is assumed to be balanced 3-phase system. branching node.
Special Case :Radial Main Feeder V"
Consider a distribution system consists of a radial main feeder
only. The one-line diagram of such a feeder comprising n branches /
nodes is shown in Fig.1.
Vl vi
the cost of a capacitor is a differentiable function of its size. (ii) Objective function of PS does not seem to be flat near the optimum
Therefore, the sizing problem determines the optimal sizes of the capaci- as in the OPF case.
tors once they are placed. This special case was considered by Lee and Based on these considerations, a first order method, called Phase I
Grainger in [8]. However, in this proposed formulation, the voltage - Phase I1 Feasible Direction.@Method, is selected for the solution of the
projile of the system (voltages at all nodes) is required to lie within the PS problem. The method obtains the solution in two steps. The first
acceptable limits. step, Phase I, 'is applied to get a feasible point if the initial point is
To formulate the sizing problem as a nonlinear programming prob- infeasible. In the sccond step, Phase 11, the solution is improved itera-
lcm, consider a radial distribution system with n branches, J laterals, and tively until the solution converges to the optimal point. This is an
nc capacitors placed at the nodes of the system and a load profile, appealing property of the method since it allows one to stop earlier in
Pli , Q, , i = 1, . . . ,n. The objective comprises two terms; the sav- the solution process and yet get an approximate and feasible solution.
ings due to real power loss reduction in the system as a result of capaci- Also to improve the convergence, the method incorporates the functional
inequality constraints directly in the direction of movement, i.e., search
tor placement, and the cost of capacitors. The real power losses in the
direction, unlike the reduced gradient-penalty function method in which
network can be calculated as the sum of the i2r loss on each branch,
i.e., these constraints are treated as penalties.
The first step in applying this method to PS involves the transcrip-
(7) tion of the problem into a nonlinear programming problem with inequal-
ity - constraints - only form by eliminating the equality constraints of
DistFlow equations, (6). Since, as shown in the appendix, the Jacobian
The other term in the objective function, namely the capacitor cost func-
tion, is to be assumed linear with a constant marginal cost r,$/kvur for of the system equations, a
ax is well dcfined, it seems reasonable to
simplicity. Then the objective can be written as assume that the conditions for the implicit function theorem hold and
there is a solution x(u) for all 0 < U I U'"" such that G(x(u),u) = 0,
i.e., one can solve x in terms of U using Eq.(6). Then the problem
reduces to the following inequality constrainted-type problem.
Where, kp is the weighting factor for the losses.
PC min ( fo(u) I f J ( u ) 5 0 j = 1 , . . . ,n 1
There are three sets of constraints. U
(9.i) region, and (ii) sharp comers are created only when constraints of
different types are binding. Therefore, we modify the feasible directions
(9.ii) by including only one or two gradients from the violated constraints. If
'
(9.iii) only lower voltage limits are violated, we include the gradient of the
most violated constraint (corresponding to the lowest bus voltage) in the
Note that the real power flow is decoupled and can be dropped from cal- feasible direction. If both lower voltage limit and upper voltage limit
culations. This simplified DistFlow model is similar to the current violations are present, we include the gradient of the most violated lower
model adopted in literature [6]. The appealing properties of these equa- voltage constraint and the gradient of the most violated upper voltage
tions are that they are linear and can be solved directly. The general constraint in the feasible direction.
form of the voltage equation is as follows.
To be more specific, the selection of the feasible direction h is as fol-
It
lows.
V', = (VjY + 2 C c j k Qck
k=l
(10)
1. Phase I (to get a feasible point)
Where, e l k is the total line reactance of the section of the network which Case 1: There are only lower voltage limit violations. Then, we cpn-
corresponds to intersection of two paths extending between the nodes 0-j sider only the smallest voltage V, below the lower bound limit V"" ,
and 0-k. i.e.,
Therefore, the upper and the lower voltage constraints become V, S V , -F j and VI <V"
hyperplanes and the feasible region defined by these constraints will be a
and select the feasible direction as h = V?, .
polytope. To illustrate such a feasible region, consider the small system
shown in Fig.4. Case 2 : There are only upper voltage limit violations. Then, we con-
sider only the greatest voltage V,, above the upper bound limit VmPX,
VO V1 vz v3 v4 v5 i.e.,
I I
+ V,,, 2 VI -F j and V, > Vm"
QO
and select the feasible direction as h = - V?,.
Case 3 : There are both lower voltage limit violations and upper voltage
limit violations. We consider only the smallest voltage, V, below Vm
and the greatest voltage, V, above Vmu as defined above and calculate
Figure 4 : A small main feeder
the feasible direction as
Some of the voltage equations are
h = - argmin {%I h l z I h = -pL!V9,+p,,,
W,,, ; p/,p, 2 0 ; p,+p,,, = 1 )
V? = WP)' + b i Q c z + b i Q c 4 P1.k
Figure 5 : Feasible region defined by voltage constraints Case 3 : There are both q active lower and upper voltage limits. We
Now consider the hyperplanes that corresponds to the lower bound consider only V, and V,,, as defined above and calculate the search
constraints. For the example, they are stacked on top of each other in direction as
almost parallel fashion as depicted in Fig.5. Therefore, the intersection
of two hyperplanes of the lower bound constraints will not create sharp
comers. A sharp comer may be created by h e hyperplanes of con-
straints V: = V"' and V? = Vmm2 as shown in the figure. The overall solution algorithm is presented below
The foregoing observation on the example leads us to assume that step 0 :initialization
in general: choose ~y , E >~ O ; a ,P E (0,l) ; uo
the constraints of the same type (either the lower voltage limit con- step 1 :feasibility check
straints or the upper voltage limits constraints) will not create sharp
comers in the feasible region, if E V, <Pin or E V, >vm"
sharp comers may be created by the constraints of different types. then phase = 1 else phase = 2
This assumption will be used in the next section to simplify the step 2 :search direction
calculations involved in a Phase I - Phase I1 type solution algorithm. Calculate the search direction h as explained above
step 3 :step size
calculate A i such that ui + Aiih S U"
VI. SOLUTION ALGORITHM
calculate the step size Xi by Armijo Rule i.e..
In this section, we will prcscnt an efficient solution algorithm for the
I
if phase = 1 then
Sizing Problem. The algorithm involves modification of the Phase I -
'
Phase I1 feasible directions method specifically for the radial distribution
system capacitor placement problem.
From the analysis of Sec.V, it is reasonable to assume that: (i) the
constraints of the same type do not crcate sharp comers in the feasible
i
hi = max X, = p k ~ i i
k=O. X I
yr(u,+hih) - y(ui) 2 - Xialhlz
G(xi+l,u;+hih) = 0
7------
2 700
"7 600 --
-
Figure 7 : Solution Trajectory for TS1 Test A Figure 8 : Solution Trajectory for TSl Test B
300 ,-
0 1 2 3 4 5 i + r
Figure 9 : Solution Trajectory for TS2
740
REFERENCES
N. M. Neagle and D. R. Samson, "Loss Reduction from Capacitors
Installed on Primary Feeders", AIEE Transactions part I l l , vol. 75,
pp. 950-959, Oct. 1956.
R. F. Cook, "Optimizing the Application of Shunt Capacitors for
Reactive Volt-Ampere Control and Loss Reduction" , AIEE Trun-
suctions part I l l , vol. 80, pp. 430-444, August 1961.
H.Duran, "Optimum Number, Location, and Size of Shunt Capaci-
tors in Radial Distribution Feeders: A Dynamic Programming
Approach, IEEE Trans. on Power Apparatus and Systems, vol.
87, pp. 1769-1774, Sept. 1968.
N. E. Chang, "Locating Shunt Capacitors on Primary Feeders for
Voltage Control and Loss Reduction", IEEE Trans. on Power
Apparatus and Systems, vol. 88, pp. 1574-1577. Oct. 1969.
Y. G. Bae, "Analytical Method of Capacitor Application on Distri-
bution Primary Feeders", IEEE Trans. on Paver Apparatus and
SyStems, vol. 97, pp. 1232-1237, JUly/AUg. 1978.
J. J. Grainger, and S. H. Lee, "Optimum Size and Location of
Shunt Capacitors for Reduction of Losses on Distribution Feeders",
IEEE Trans. on Power Apparatus and Systems, vol. 100, pp.
1105-1118, March 1981.
S. H. Lee and J. J. Grainger, "Optimum Placement of Fixed and
Switched Capacitors on Primary Distribution Feeders", IEEE
Trans. on Power Apparatus and Systems, vol. 100, pp. 345-352,
January 1981.
1. J. Grainger, and S. H. Lee, "Capacity Release by Shunt Capaci-
tor Placcment on Distribution Fecdcrs: a Ncw Voltage Dependent
Model", IEEE Trans. on Power Apparatus and Systems, vol. 101,
pp. 1236-1244, May 1982.
74 1
J. J. Grainger, S.H. Lee. and A. A. El-Kib. "Design of a Real-Time the beginning of the lateral, xko= [PbQkoV,'O]; since then the rest of the
Switching Control Scheme for Capacitive Compensation of Distribu- variables, xy can be calculated by using the branch flow equations succes-
tion Feeders", IEEE Trans. on Power Apparatus and Systems. vol. sively. To be more specific, let us consider two cases again, namely first
101. pp. 2420-2428. August 1982. the main feeder and then the general case.
J. J. Grainger. S.Civanlar, and S. H. Lee, "Optimal Design and Con- Special Case :Main Feeder Only
trol Scheme for Continuous Capacitive Compensation of Distribu- Since the substation voltage, Vo is given, the only Variables need to be
tion Feeders", IEEE Trans. on Power Apparatus and Systems, vol. determined are z, = [PoQolT,i.e., the power supplied from the substation.
102, pp. 3271-3278, October 1983. Therefore, z, constitutes the "state" of the system. To eliminate the other
T. H. Fawzi, S. M. El-Sobki, and M. A. Abdel-Halim, "A New
variables, xgi from the Eq.(a.l), we use the terminal conditions at the end
Approach for the Application of Shunt Capacitors to the Primary of the feeder, i.e.,
Distribution feeders", IEEE Trans. on Power Apparatus and Sys-
tems, vol. 102. pp.10-13, Jan. 1983. p n =Po,, (xo,,-l) = 0 ; Q, = 40. (xh-1) = 0 (a.2)
M. Ponnavaikko and K. S. hakasa Rao, "Optimal Choice of Fixed and eliminate %'s by substituting the branch flow equations, Eq.(a.l.i)
and Switched Shunt Capacitors on Radial Distribution Feeders by
recursively fori = n - l , n - 2 , . . . , 1. As a result, we get two equations of
the Method of Local Variations", IEEE Trans. on Power Apparatus
the following form.
andsystems, vol. 102, pp.1607-1614, June 1983.
M. Kaplan, "Optimization of Number, Location, Size, Control Type, Po,, (zo0.u) = 0 ; (foe (%.U) =0 (a.3)
and Control Setting of Shunt Capacitors on Radial Distribution We will use these two equations to solve for a given U .
Feeders", IEEE Trans. on Power Apparatus and Systems, vol. 103, General Case :Feeder with Laterals
pp.2659-2665, Sept. 1984.
J. J. Grainger. S. Civanlar, and K. N. Clinard, L. J. Gale, "Optimal For simplicity, it will be assumed that the system consists only of a
Voltage Dependent Continuous Time Control of Reactive Power on main feeder and 1 primary laterals (laterals branching out from the main).
Primary Distribution Feeders", IEEE Trans. on Power Apparatus We generalize the procedure of reducing the system equations as follows.
andSystems. vol. 103, pp. 2714-2723, Sept. 1984. For lateral k, we choose two new variables, Pko and Qko- the real and the
S . Civanlar and J. J. Grainger, "VolWar Control on Distribution reactive power flows into the lateral respectively - as the extra state vari-
Systems with Lateral Branches Using Shunt Capacitors and Voltage ables zb = [PbQbIT . Then the same process of reduction applied to the
Regulators: Part 1. Part 11, Part III", IEEE Trans. on Power main feeder can be repeated for the lateral by using the branch equations
Apparafus andsysKems, vol. 104, pp. 3278-3297, Nov. 1985. of (a.1) and the associated terminal conditions. Ph = 0 , Qh= 0 This .
A. A. El-Kib, J. J. Grainger, and K.N. Clinad, L. J. Gale, "Place- will give two new equations of the following form.
ment of Fixed and/or Non-Simultanmusly Switched Capacitors on Ph (210, . . . * 2, ,zo0,u) = 0 (a.4.i)
Unbalanced Three-phase Feeders Involving Laterals", IEEE Trans.
on Paver Apparatus and Systems, vol. 104, pp. 3298-3305. NOV. ffh(210. f . . ,Z b ,z,.u) = 0 (a.4.ii)
1985. Hence, in general, for a distribution network of n branches and 1
M. E. Baran and F. F. Wu, "Optimal Capacitor Placement on Radial laterals, reduced DistFlow equations comprise Q(a.4) for tach lateral
Distribution Systems". submitted to IEEE PES winter meeting, 1988. k = 1, . . . ,I together with the equations for the main feeder, Eq(a.3)
D. Shirmohammadi. H. W. Hong. and A. Semlyen, G. X. Luo. "A which can now be rewritten as,
Compansation Based Power Flow Method for Weakly Meshed Dis-
tribution and Transmission Networks" , IEEE PICA meeting, June Pol, (z10. . . . ,210 ,%*U) =0 (a.5 .i)
1987. Montreal. dol, (210, . . . ,zlo .%J4 =0 (a.55)
F. F. Wu. G. Gross. and J. F. Luini, P. M. Look. "A Two Stage
Approach to Solving Large Scale Optimal Power Flows", PICA
Proceedings. Cleveland, May 15-18 1979. pp. 126-136. Solution of DistFlow Equations
E. Polak, R. Trahan, and D. Q. Mayne, "Combined Phase I - Phase I1 The reduced DistFlow equations are of the form
Methods of Feasible Directions", Mathematical Programming,
~01.17,N0.1, pp.61-73, 1979. H(z,u) = 0 (a.6)
E. Polak, Computational Methodr in Optimization, Academic Press. and can be used to solve for the "state variables" z = [zL . . . ZL 41.
'
New York,1971 Let's consider solving (a6) for z by Ne,wton-RaphsonMethod (NR)for a
D. G. Luenberger, Introduction to Linear and Nonlinear Progrm- given U. From an estimated value of 9 ,an iteration step of NR involves
ming, Second Edition, Addison-Wesley Publishing Co., Mas- three steps:
sachusetts, 1984. Step 1 : calculation of the mismatches H(d)
P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization. Step 2 :construction of the system Jacobian matrix
Academic Press, New York, 1981.
' aH
J(z') = -
a2
'
lZ=d
(a.7)
Appendix :Solution of DistFlow Equations Step 3 : solution of the following system of equations to update the states
2.
The DistFlow equations of a radial distribution system, as shown in
section 2. comprises branch flow equations and the associated terminal J(z')AzJ = - H(d) (a.8)
conditions for each lateral including the main feeder which is treated as the
O'th lateral. They are of the following form. We consider the special case - the main feeder only - first. The
mismatches for this case can be calculated as follows. At iteration j, the
Xy+1 = fki+l(XY .UY+l) k =0,1,. .., I (a.1.i) substation bus voltage Vo is given and the updated values of the substation
X,~=Q~, xh =xh,=O i =0,1,.. . ,&-I (al.ii) powers Po,Q o are available. Therefore, the recursive branch Row equa-
tions of (a.1.i) can be employed to update the variables
We can use these equations to determine the operating point, ~i = [Pi,Qi .V?lT i = 1, . . . ,n successively along the feeder starting
xy = [PYQYVz]of the system for a given, U. But rather then using the from the substation and proceeding towards the end of the feeder. When
a b v e equations to solve for xY's directly, we are going to conceptually we reach the end of the feeder, the updated variables P,, ,Q,, will be the
reduce the number of equations first and then propose an efficient solution mismatches as indicated by (a.2). We'll refer to this procedure as afor-
algorithm. ward sweep.
The elements of system Jacobian can be calculated by using the Chain
Reduction of DistFlow Equations Rule. For the main feeder case, the Jacobian is a 2x2 matrix of the follow-
Note that for a given lateral k. we need only to know the variables at ing form.
742
Numerical Properties
The DistFlow method described above is numerically robust and the
solution scheme is insensitive to system parameters, in particular, the
(a.9) branch r/x ratios. This can be seen as follows.
When the elements of the branch jacobians, J i are calculated in per
unit, PA., J i has the following structure
[:I:
By using the branch flow equations, (a.1.i) and applying the Chain Rule,
J(z,-,,) can be constructed as follows.
Ji = E 1 AQ; (a.13)
I 1-2ri-
Pi-1
Vi?,
-2ri-
Qi-1
v;2,
ri
( P A +QA)
1 As a result of (a.13), the system Jacobian, J is well conditioned for
the main feeder only case.
For the general case, it can easily be shown that, the diagonal ele-
ments, Je of the system Jacobian has the Same properties as that of the
main feeder, J, and the system Jacobian is block diagonally dominant,
i.e., det (Je) = 1 > det ( J k ) -V i # k , k # 0 (a. 14)
Therefore, the system Jacobian, J is well conditioned, i.e.,
Ji is the Jacobian of branch flow equation i and will be referred as the det(J) = 1 (a.15)
brunch Jacobian. Therefore, calculation of the 2x2 Jacobian in Eq.(a.9)
can easily be conducted by the multiplication of 2x3 and 3x3 matrices in and this is true independent of the line parameters.
(a.lO). These results indicate that the NR solution algorithm will be numeri-
The third step of the solution procedure involves the solution of a cally stable and robust. This very desirable property is one of the
2x2 matrix equation. advantages of the new formulation over the conventional one where con-
vergence problems has been experienced when there are branches with
This calculation procedure can be generalized for general radial distri-
high r / x ratios in the system [HI.
bution feeders. Again, we consider a system having a main feeder and I
primary laterals only. Furthermore, these numerical properties can be exploited to modify
the DistFlow solution scheme to make it even more efficient computa-
The mismatches can be calculated by generalizing the forward sweep
tionally.
procedure as follows. For the lateral k, given the estimated power
injected into lateral, Pko.Qro.and the voltage at the branching node (subs- Enhancement of Computational Efficiency
tation for the main), Vk,the forward sweep method of the main feeder We use the numerical properties and the special structure of the Jaco-
case can be applied to update the variables xk = [Pk.Q,,V,] along bian matrix, J in simplifying its construction and in solving the update
lateral and get the mismatches corresponding to this lateral: P , and Qh. equations of (a.8).
To update all the variables and thus obtain all the mismatches, above Since by (a.14). the off diagonal terms Jk , i # k k = 1. . . . , l are
procedure is applied to all the laterals in an order such that the main much smaller than the diagonal terms, Jk , k = 1 , . . . . I , off diagonal
feeder is updated before the laterals branching out from it. terms can be dropped in the Jacobian except the ones in the last row,
System Jacobian, J for the general case will be a Z(l+l)x(l+l) matrix i.e., d = [Jol . . . Jar] . This basically decomposes the update equations
of the following form. into I+1 equations as follows.
JkAzko = H ~ ( z ) R = 1, . . . , I (a. 16.i)
J11 JIO
J& = H d z ) - dr, (a.16.ii)
JZl Jzz Ju,
. . Where, Hk = &,,(z) &,(z)IT, r, = [AzL. . . &,$IT. Therefore, the states
J = . . .. (a.12) that correspond to the laterals, z i o , i = 1.. . . , I can be updated
. . independently first by Eq(a.16.i). then the state for the main feeder, zm
JII Jrz Jir Jh is updated by (a.16.ii).
JOI Joz Jor JGQ Furthermore, since Jes are well conditioned and almost constant, as
indicated by (a.13), the Jacobian needs to be constructed only once and
Where, then it can be used in a l l the iterations. Therefore, updating step of NR
reduces to the solution of (a.16).
This modified solution scheme brings down the overall cost of com-
putation to about 8n+8(1+1) multiplications for each iteration; 8n multi-
plications to calculate the mismatches and 8(1+1) multiplications to solve
the update equations of (a.16). This amount of computation is compar-
able to 6n multiplications involved in just solving the update equations
and can be calculated by Chain Rule similar to (a.lO). (like Eq4a.16)) of conventional fast decoupled power flow solution
The third step involves the solution of 2(l+l)xZ(l+l) matrix equation scheme.
of the form (a.8).
Note that the mismatches and the Jacobian matrix in the proposed Mesut E. Baran received his B.S. and M.S.from Middle East Technical
method involve only the evaluation of simple algebraic expressions and University, Turkey. He is cumntly a Ph.D.student ai the University of
no trigonometric functiomds opposed to the standard load flow case. Califomia, Berkeley.
Thus computationally the proposed method is efficient. In the following Felix F. Wu received his B.S. from National Taiwan University, M.S.
tow subsections, we show that the method has very good numerical pro- from the University of Pittsburgh. and W.D. from the University of Cal-
perties and it can be modified to make it computationally even more ifornia, Berkeley. He is a professor of Electrical Engineering and Com-
efficient. puter Sciences at the University of California, Berkeley.
743
Discussion M.E. Baran and F. F. Wu :The authors appreciate the interest shown in
this paper by the discussers and thank them for their comments.
A. Chandrasekaran and R. P. Broadwater (Center for Electric Power, Concerning the first question by Mr. Vempati and Dr. Shoults about
Tennessee Technological University, Cookeville, TN): The authors are to the extension of the DistFlow algorithm to solve networks with loops, two
be complimented for bringing under a single mathematical framework all possible approaches seem workable. The first approach would be to put
the various problems of capacitor placement, sizing, time-varying loads, DistFlow equations corresponding to the radial system together with addi-
and other special features of radial power distribution systems. A lot of tional equations due to looping branches and to apply Newton Raphson
rigor has gone into the analysis of transmission systems. However, radial algorithm to solve the resulting equations. In this case,the structure of the
distribution systems have received very little, and mostly sporadic and system Jacobian can still be exploited to reduce computational burden and
desultory, mathematical treatment. The paper under discussion fulftlls a hence retain the robusmess and the speed of the algorithm. However,
long-felt need in distribution analysis. We request the authors to comment computations for each iteration will increase as the number of loops
on the following observations.
1) Recognition of the minimum (state?) variables required to solve the increases since the system Jacobian will get fuller. An altemative
distribution systems as the branch flows in the source branch and the fxst approach would be opening of the the loops at certain points of the looping
branches in the radials in the DistFlow algorithm is of special interest. In branches and putting current injections at these points to simulate the
[Dl] we proposed a load flow formulation based on branch losses and effect of the loops. An iterative scheme can be developed to obtain the
voltages and the resulting Jacobean structureis similar. What is the authors solution as proposed in [18]. In each iteration, currents passing through
opinion about the convergence characteristics when the variables chosen are the opened points on the looping branches are estimated and then Dist-
the losses? Flow equations are solved to determine the power flow in the radial system
2) Even though much is talked about the difficulties of convergence in with extra injections. The robustness of the method would still be valid
radial systems, most of the practical algorithms in use are based on the because of the usage of the branch powers as variables. However, the
simple ladder technique of Kersting [D2] and appear to work very well. Are speed of convergence and hence the computational efficiency of the
there documented cases that the authors are aware of where convergence method would probably suffer as the number of loops increases.
was a problem? Is it possible to construct meaningful examples of radial
systems depicting nonconvergence with simple methods? DistFlow method can also be generalized to represent the voltage
3) The upper voltage constraints used in Test Run B is 1.1 pu, and if the dependent loads and capacitors as shunt susceptances. Modification for
source voltage is 1 pu, does this mean leading power factor currents can voltage dependent load representation will entail making the real and eac-
flow in some parts of the system? Are there optimal limits for tive power components of load, , in branch Bow equations (1 .i)
permissible upper and lower voltages? and (1.ii) a function of voltage, (i.e. Pu+l =@fi+l(V,+l), QL+I = &+,(V,+I) ).
4) The cost factors kp and ru used in (8) are oversimplified. What will be Similarly, reactive power injections by capacitors, e,.+, in Eq.(l.ii), can be
the effect on the solution if more complex factors are used? changed as QP.+~= Q,4.+lV~l,where Q,4.+1 corresponds to the nominal capa-
We congratulate the authors once again for a very interesting paper. city of the capacitor, to represent the capacitors as shunt susceptances. We
intend to incorporate voltage dependent loads and capacitors into our pro-
References gram.
[Dl] A. Chandrasekaran and R. P. Broadwater, A New Formulation of Because of the fact that starting point of the algorithm can be
Load Flow Equations in Balanced Radii Distribution Systems, selected as the solution of the approximate method (see comment at the
C4nadion Electrical Engineering Journal, Vol. 12, No. 4, October last paragraph of seC.VI), we have not encountered the problem of slow
1987, p ~ 147-151.
. convergence and suboptimal solutions that are known to exist in the first
[D2] W. H. Kersting and D. L. Mendive, An Application of Ladder order OPF methods. The success of second order OPF is due largely to the
Network Theory to the Solution of Three-phase Radial Load Flow exploitation of the structure of the OPF equations. We believe the
Problems, Presented at the IEEE Winter Power Meeting, New development of a successful second order solution method for the capaci-
York, 1976. tor sizing problem would be an interesting research project. Here, we
Manuscript received February 22, 1988. want also to point out another additional advantage of the method which is
not mentioned in the paper. The method used can easily be modified to
include different load/capacitor models as pointed above.
We thank Mr. Chandrasekm and Dr. Broadwater for directing our
attention to reference [Dl]. The use of branch losses and voltages as state
N. Vempati and R. R. Sboults (The University of Texas at Arlington,
Arlington, TX): The authors are to be commended for their excellent paper. variables is an interesting idea. The convergence characteristics of the
Their approach of rewriting the branch flow equationsin a recursive format same method (e.g. Newton-Raphson) applied to two different formulations
enables an efficient algorithm. This is under the assumption of a radial of the same problem may be different. We do not have experience on the
distribution system. When loops are encountered, similar equations can be method using losses as state variables to comment on its convergence
formulated. Would the authors comment on the robustness and speed of the characteristics.
algorithm in the presence of loops. Reference [18] pointed out the convergence problems for distribution
Loads and capacitors are considered to constant power devices in the power flows. In addition to convergence, different methods may exhibit
paper. It is now well known that reactive power load is not a constant power different computational efficiency. The so-called simple methods may be
type load, rather it is more like a constant susceptance. Would the authors convergent in most cases, but the convergence is usually slow.
comment on the impact, if any, on accuracy if voltage dependent load
models are not used. It has been our experience with various optimization optimal sizing of capacitors may result in leading power factor
procedures that significant differences result when different load modeling currents in the branches dependiig on the load profile. places of capacitors
assumptions are used. and the voltage limits. This is more likely the case when capacitors are
The authors allude to the fact that second-order methods are also used for voltage regulation purposes (like TSl TB in the paper). The per-
available in addition to first-order methods for the solution of nonlinear missible upper and lower voltages are set by the load demand require-
optimization problems. They also present their rationale for implementing ments and system operating requirements. The optimality seems in prac-
the first-order method. In optimal power flow (OPF) problems, it has been tice to be dependent on local condition.
shown that first-order methods can give misleading results. The conver-
gence rate can be too slow and sometimes results in a suboptimal solution. Representing the cost of a capacitor by a fixed cost and a linear capa-
The second-order Newton method has been found to be more reliable. It city cost is an approximation. The capacity cost in practice will be a stair-
would be interesting to see comparison cases between their first-order case curve. A linear cost curve is the simplest approximation of the stair-
method and a second-order Newton type method for their problem case curve as a differentiable function. A quadratic function, or any other
formulation. Would the authors please comment. nonlinear function may be used for a better approximation. The increase
We again congratulate the authors for a very fine paper, which is very in computation as result is minimal. However the effect, if any, on the
characteristic of their proven abilities. overall convergence is not known.
Manuscript received February 23, 1988. Manuscript received May 2, 1988.