You are on page 1of 4

Power Flow Calculation by Combination of

Newton-Raphson Method and Newton’s Method in


Optimization.
Andrey Pazderin, Sergey Yuferev
URAL STATE TECHNICAL UNIVERSITY - UPI
E-mail: pav@daes.ustu.ru, usv@daes.ustu.ru

Abstract--In this paper, the application of the Newton’s expressed as follows:


method in optimization for power flow calculation is considered.
Convergence conditions of the suggested method using an
example of a three-machine system are investigated. It is shown, W − W ( X, Y ) = 0 (1)
that the method allows to calculate non-existent state points and
automatically pulls them onto the boundary of power flow where W is the vector of parameters given for power flow
existence domain. A combined method which is composed of
calculation. In power flow calculation, real and reactive
Newton-Raphson method and Newton’s method in optimization
is presented in the paper. powers are set in each bus except for the slack bus. In
generation buses, the modulus of voltage can be fixed.
Index Terms—Newton method, Hessian matrix, convergence W(X,Y) is the nonlinear vector function of steady-state
of numerical methods, steady state stability. equations. Variables Y define the quasi-constant parameters
I. INTRODUCTION associated with an equivalent circuit of an electrical network.
X is a required state vector, it defines steady state of EPS.
The solution of the power flow problem is the basis on The dimension of the state vector coincides with the number
which other problems of managing the operation and of nonlinear equations of the system (1). There are various
development of electrical power systems (EPS) are solved. known forms of notation of the steady-state equations.
The complexity of the problem of power flow calculation is Normally, they are nodal-voltage equations in the form of
attributed to nonlinearity of steady-state equations system and power balance or in the form of current balance. Complex
its high dimensionality, which involves iterative methods. quantities in these equations can be presented in polar or
The basic problem of the power flow calculation is that of the rectangular coordinates, which leads to a sufficiently large
solution feasibility and iterative process convergence [1]. variety forms of the steady-state equations notation. There are
The desire to find a solution which would be on the variable methods of a nonlinear system of steady-state
boundary of the existence domain when the given nodal equations solution. They are united by the incremental vector
capacities are outside the existence domain of the solution, of independent variables ∆X being searched and the condition
and it is required to pull the state point back onto the of convergence being assessed at each iteration.
feasibility boundary, motivates to develop methods and
algorithms for power flow calculation, providing reliable B. The Newton's method in optimization
Another way of solving the problem of power flow
convergence to the solution.
calculation is related to defining a zero minimum of objective
The algorithm for the power flow calculation based on the
function of squares sum of discrepancies of steady-state
Newton's method in optimization allows to find a solution for
equations:
the situation when initial data are outside the existence
domain and to pull the operation point onto the feasibility
T
boundary by an optimal path. Also it is possible to estimate a F = ⎣⎡ W − W ( X, Y ) ⎦⎤ ⎣⎡ W − W ( X, Y ) ⎦⎤ ( 2)
static stability margin by utilizing Newton's method in
optimization.
As the algorithm based on the Newton’s method in The function minimum (2) is reached at the point where
optimization has considerable computational cost and power derivatives on all required variables are equal to zero:
control cannot be realized in all nodes, the algorithm based on
T
the combination of the Newton-Raphson methods and the
Newton’s method in optimization is offered to be utilized for
dF dX =− 2 dW dX ⎡⎣ W − W ( X, Y ) ⎤⎦ ( 3)
calculating speed, enhancing the power flow calculation.
It is necessary to solve a nonlinear set of equations (3) to
II. THEORETICAL BACKGROUND find the solution for the problem. Calculating the power flow,
which is made by the system of the linear equations with a
A. Steady-state equations Hessian matrix at each iteration, is referred to as the Newton's
The system of steady-state equations, in general, can be method in optimization [4]:

978-1-4244-4649-0/09/$25.00 ©2009 IEEE 1693


G ⋅ ΔX = − dF dX ( 4)
The Hessian matrix contains two items:

T
G = ( dW dX ) ( dW dX ) − d2 W dX2 ⎡⎣ W − W ( X, Y ) ⎤⎦ ( 5 )

During the power flow calculation, the determinant of


Hessian matrix is positive around zero and negative value of a
determinant of Jacobian J = dW dX . This allows to find the
state point during the power flow calculation, when initial
point has been outside of the existence domain.
The convergence domain of the solution of the Newton's
optimization method is limited by a positive value of the
Hessian matrix determinant. The iterative process even for a
solvable operating point can converge to an incorrect solution Fig. 2 – Domain of Existence for a Solution
if initial approximation has been outside convergence
domain. This allows to estimate a static stability margin of
the state and to find the most perilous path of its weighting.
III. INVESTIGATIONS ON THE TEST SCHEME
Convergence of the Newton's method in optimization with
a full Hessian matrix has been investigated. Calculations were
made based on program MathCAD for a network comprising
three buses the parameters of which are presented in Figure 1.
Dependant variables were angles of vectors of bus voltage 1
and 2 X={δ2, δ2}, independent variables were capacities in
nodes 1 and 2, and absolute values of voltages of nodes 1, 2
and 3 were fixed.

Fig.3 - Boundary of existence domain

For the state points which are inside the existence domain,
the objective function (2) has been reduced to zero. For the
state points which are on the boundary of the existence
domain, objective function (2) has not been reduced to zero
and the calculated values of capacities differed from the given
Fig. 1 – The Test scheme capacities.
In Fig.3, the boundary of the existence domain is presented
In Figure 2, the boundary of existence domain for a in coordinates of capacities P1-P2. State points occurring on
solution of the steady-state is presented in angular coordinates the boundary of the existence domain (6) have been set by the
δ1-δ2. This boundary conforms to a positive value of the capacities which were outside the existence domain. As a
Jacobian determinant: result of power flow calculation by minimization (2) based on
the Newton's method in optimization, the iterative process
det ( J ) > 0 ( 6) converges to the nearest boundary point. It is due to the fact
that surfaces of the equal level of objective function (2) in
As a result of the power flow calculation based on the coordinates of nodal capacities are proper circles (for three-
Newton method in optimization, the angle values have been machine system) having the centre on the point defined by
received, these values corresponding to the given capacities given values of nodal capacities W . The graphic
in Fig.2 (generation is positive and loading is negative). interpretation of surfaces of the equal level of objective
function for operating point state with 13000 MW loading

978-1-4244-4649-0/09/$25.00 ©2009 IEEE 1694


bus 1 and 15000 MW generating bus 2 is presented in Fig.3. TABLE I
WEIGHTING COEFFICIENT EFFECT ON OUTPUT COMPUTATION FOR INITIAL
Hessian matrix is remarkable in its being not singular on SET CAPACITIES P1= -13000 MW AND P2= 15000 MW
the boundary of existence domain. The determinant of a
Coefficients P1, MW P2, MW δ1, deg δ2, deg
Hessian matrix (5) is positive around zero and a negative a1=1; a2=1; -7800 9410 -45 55
value of the Jacobian matrix determinant. This fact allows the a1=5; a2=1; -8600 8080 -69 25
power flow to be calculated even for the unstable points a1=0.005; a2=1; -5770 10140 -1 93
which are outside existence domain. The iterative process
based on the system of the linear equations (4) solution has TABLE II
WEIGHTING COEFFICIENT EFFECT ON OUTPUT COMPUTATION FOR INITIAL
converged to the critical stability point within 3-5 iteration. SET CAPACITIES P1= -8000 MW AND P2= -5000 MW
Naturally, the iterative process based on Newton-Raphson Coefficients P1, MW P2, MW δ1, deg δ2, deg
method is divergent for such unsolvable operating points. a1=1; a2=1; -4360 -1680 -92 -80
The convergence domain of the method under a1=0.01; a2=1; -1050 -4920 -76 -94
consideration has been investigated. What is meant is that not a1=1; a2=0.35; 5800 0 -99 -71
all unsolvable operating points will be pulled onto the
boundary of existence domain. A certain threshold having
been exceeded the iterative process has begun to converge to
the imaginary solution with angles exceeding 360° .
It is necessary to note that to receive a critical stability
operating point in case when initial nodal capacities are set
outside the boundary of the existence domain, there is no
necessity to make any additional terms as the iterative process
converges naturally to the nearest boundary point.
Pulling the operation point onto feasibility boundary is not
always possible by the shortest and optimal path. There are a
number of constraints, such as impossibility of load
(consumption) increase at buses, constraints of generation
shedding/gaining at stations. Load following capability of Fig.4 - Paths of pulling the operation point onto the feasibility boundary
generator units is various, consequently for faster pulling the
operation point onto the feasibility boundary it is necessary to IV. COMBINATION OF METHODS
carry out this pulling probably by longer, but faster path.
The algorithm provides possibility of path correction of If to compare the Newton’s method in optimization for
pulling. It is carried out by using of the weighting power flow calculation with Newton-Raphson using a
coefficients, which define degree of participation of each Jacobian matrix, the method computational costs on each
node in total control action. For this purpose diagonal matrix iteration will be several times greater as the property of
A of the weighting coefficients for each node is included into Hessian matrix being filled up by nonzero elements 2,5-3
the objective function (2): times greater than with Jacobian one. Each row of Jacobian
matrix corresponding to any bus contains nonzero elements
corresponding to all incident buses of the scheme. Each row
T
F = ⎡⎣ W-W ( X,Y ) ⎤⎦ A ⎡⎣ W-W ( X,Y ) ⎤⎦ (7) of Hessian matrix contains nonzero elements in the matrix
corresponding not only to the neighboring buses, but also
their neighbors. However, it is possible to compensate this
All diagonal elements of the weighting coefficient matrix
disadvantage through the combination Newton-Raphson
A should be greater-than zero:
method with Newton’s method in optimization. It means that
the part of nodes can be calculated by conventional Newton
ai ,i > 0. method, and the remaining buses will be computed by
Newton’s method in optimization. The first group of passive
When initial approximation lies into the feasibility nodes consists of buses in which it is not possible to change
domain, coefficients are not influence on the computational nodal capacity or it is not expedient. Hence, emergency
process and on the result. control actions are possible only in a small group of buses
In the figure 4 different paths of the pulling the same supplying with telecontrol. Most of the nodes including
operation point onto feasibility boundary depending on the purely transit buses are passive. Active nodes are generating
weighting coefficients are presented. Paths are presented for buses in which operating actions are provided. Such approach
two different operating points. allows to fix nodal capacity for all passive buses of the
In tables I and II effect of weighting coefficients on the scheme which have been calculated by Newton-Raphson
output computation is presented. In tables I and II k1 and k2 method. In active buses which have been calculated by
are weighting coefficient for buses 1 and 2, respectively. Newton’s method in optimization, deviations from set values

978-1-4244-4649-0/09/$25.00 ©2009 IEEE 1695


of nodal capacity are possible. These deviations can be V. CONCLUSION
considered as control action. The power flow calculation 1. The power flow calculation of an electric network by
algorithm based on combination Newton – Raphson method minimizing the square sum of discrepancies of nodal
and Newton’s method in optimization can be presented as capacities based on the Newton's method in optimization
follows: materially increases the productivity of deriving a solution for
1. The linear equation system with Jacobian matrix is heavy in terms of conditions of stability states and the
generated for all buses of the scheme. unstable states outside the existence domain of the solution.
∂ΔW pas ∂ΔW pas 2. During the power flow calculation, the determinant of
∂X pas ∂X act ΔX pas ΔW pas Hessian matrix is positive around zero and negative value of
⋅ =− the Jacobian matrix determinant. The iterative process
∂ΔWact ∂ΔWact ΔX act ΔWact naturally converges to the nearest marginal state point during
∂X pas ∂X act the power flow calculation, when the initial operating point
has been outside of the existence domain.
2. The solution process of the linear equation system with 3. There is a possibility of control action correction for the
Jacobian is started by utilizing the Gauss method for all pulling operation point onto feasibility boundary by using
passive buses. Factorization of the linear equations system is matrix of weighting coefficients.
terminated when all passive buses are eliminated. Factorized 4. Utilization of the combined method for power flow
equations are kept. calculation allows to use all advantages of Newton’s method
in optimization and to provide high calculating speed.
5. In case when the setting nodal powers are outside the
∂Wact existence domain, there are discrepancies in the active buses,
∂X act which can be considered as control actions for pulling the
3. The nodal admittance matrix is generated from not state point onto the feasibility boundary. When the initial
factorized the part of Jacobian matrix corresponding to active state point is inside the existence domain, the iterative process
buses. This admittance matrix contains parameters of the converges with zero discrepancies for both active and passive
equivalent network which contains only active buses. buses.
∂Wact REFERENCES
Yact
∂X act [1] D. A. Arzamastsev, P. I. Bartolomej, A. M. Holjan, Automatic control
system and optimization of modes of electric power systems, Moscow:
4. The linear equation system with Hessian matrix (4) is Vysshaya Shkola, 1983.
generated for the obtained equivalent by Newton’s method in [2] V. I. Tarasov, Nonlinear minimization methods for calculating steady
optimization. states of electric power systems, – Novosibirsk: Nauka, 2001, p. 214.
[3] A. Z. Gamm, Statistical methods of power system state estimation,
5. The linear equation system with Hessian matrix is Moscow: Nauka, 1976, p. 220.
calculated and changes of independent variables ΔX act are [4] V. M. Gornshtejn, B. P. Miroshnichenko, A.V. Ponomarev, Methods of
power system mode optimization, Moscow: Energiya, 1981, p. 336.
defined for active buses.
6. Factorized equations of passive buses are calculated, BIOGRAPHIES
and changes of independent variables ΔX pas are defined for Andrey V. Pazderin was born in
Ekaterinburg, Russia, on June 12, 1960. He
passive buses. graduated from the Urals Polytechnic Institute,
Ekaterinburg, in 1982. He obtained PhD in 1987.
ΔX pas In 2005 the Doctoral degree was received by him.
From his graduation A.V. Pazderin has been
employed by Ural State Technical University as
Professor and head of the Power Engineering
department (from 2006).
7. The vector of independent variables is updated using the His special fields of interest include power
changes of independent variables for all buses. system state estimation, energy meters verification, power loss calculation.
8. New nodal capacities in all buses of the network are
defined; constraints are checked; if it necessary, the list of Sergey V. Yuferev was born in Russia on
May 14, 1985. He received the M.Sc. degree at
active buses will be corrected. Ural State Technical University, Ekaterinburg,
9. Convergence of the iterative process is checked. If Russia, in 2008.
changes of variables are significant, it is necessary to return His research interests lie in the field of power
flow calculation, power system analysis and
to item 1. steady-state stability.
Taking into account the number of active buses in the
network aren’t large, computational costs of such algorithm
slightly exceed computational costs of the Newton-Raphson
method.

978-1-4244-4649-0/09/$25.00 ©2009 IEEE 1696

You might also like