Journal of Theoretical and Applied Information Technology

© 2005 - 2008 JATIT. All rights reserved.

www.jatit.org

A SURVEY OF OPTIMAL POWER FLOW METHODS

1
K.S.Pandya, 2S.K.Joshi
1
Electrical Engineering Department, Charotar Institute of Technology, Changa, India-388 421
2
Electrical Engineering Department, The M.S.University of Baroda, Vadodara, India-390 002

E-mail: kartik_pandya@rediffmail.com

ABSTRACT

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which
minimizes generation cost, loss etc. or maximizes social welfare, loadability etc. while maintaining an
acceptable system performance in terms of limits on generators’ real and reactive powers, line flow
limits, output of various compensating devices etc. Traditionally, classical optimization methods were
used to effectively solve OPF. But more recently due to incorporation of FACTS devices and
deregulation of a power sector, the traditional concepts and practices of power systems are superimposed
by an economic market management. So OPF have become complex. In recent years, Artificial
Intelligence (AI) methods have been emerged which can solve highly complex OPF problems. The
purpose of this paper is to present a comprehensive survey of various optimization methods used to solve
OPF problems.

Keywords: FACTS (Flexible A.C. Transmission system) devices, Optimal Power Flow (OPF), Power
System Deregulation.

1. INTRODUCTION and g(u,x) ≥0 (3)

A first comprehensive survey regarding optimal
power dispatch was given by H.H.Happ [1] and
subsequently an IEEE working group [2] presented
bibliography survey of major economic-security
functions in 1981. Thereafter in 1985, Carpentair
[3] presented a survey and classified the OPF
algorithms based on their solution methodology.
In 1990, Chowdhury [4] did a survey on economic
dispatch methods. In 1999, J.A.Momoh et al. [5]
presented a review of some selected OPF
techniques. In this paper, a review of following
optimization methods has been presented.
(1)Linear Programming (LP) method, (2) Newton-
Raphson (NR) method, (3)Quadratic Programming
(QP) method, (4)Nonlinear Programming (NLP)
method, (5)Interior Point (IP) method and (6)
Artificial Intelligence (AI) methods.
2. OPTIMAL POWER FLOW
FORMULATION
OPF is formulated mathematically as a general
constrained optimization problem.
Minimize a function F(u,x) (1)
Subject to h(u,x) =0 (2)
Where, u is the set of controllable quantities in
the system and x is the set of dependent variables.
F(u,x) is an objective function which is scalar.
Equality constraints (2) are derived from
conventional power balance equation. Inequality
constraints (3) are the limits on control variables u
and the operating limit on the other variables of
the system.
3. LINEAR PROGRAMMING (LP) METHOD
Linear programming formulation requires
linearization of objective function as well as
constraints with nonnegative variables.
T.S.Chung et al. [6] presented recursive linear
programming based approach for minimizing line
losses and finding the optimal capacitor allocation
in a distribution system. Cost-benefit calculation is
carried out for 14-bus system and this method does
not require any matrix inversion, thus saves
computational time and memory space.
E.Lobato et al. [7] proposed LP based OPF for
minimization of transmission losses and Generator
reactive margins of the Spanish power system. The
discrete nature of shunt reactors and capacitors is
modeled by integer variables. It linearizes both the

450
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
objective function and the constraints in each
iteration and it is better than one which linearizes
only objective function once.
F. Lima et al. [8] used Mixed Integer Linear
Programming to conduct design study on the
combinatorial optimal placement of Thyristor
Controlled Phase Shifter Transformers (TCPSTs)
in large-scale power systems. It finds the number,
network location and settings of phase shifters that
maximize system loadability under the DC load
flow model, subject to limits on the installation
investment or total number of TCPSTs.
Computation time is significantly lower than those
of other published comparable cases.
4. NEWTON-RAPHSON (NR) METHOD
The necessary conditions of optimality referred
to as the Kuhn-Tucker conditions are obtained in
this method.
S.Chen et al. [9] proposed a new algorithm
based on Newton-Raphson (NR) method with
sensitivity factors incorporated to solve emission
dispatch in real-time. The Jacobian matrix and the
B-coefficients have been developed in terms of the
generalized generation shift distribution factor. So
the penalty factor and the incremental losses are
easily obtained. Execution time is lesser than that
of the conventional one.
K.L.Lo et al. [10] proposed two Newton-like
load flow methods, the Fixed Newton method and
the modification of the right-hand-side vector
method for line outage simulation that is a part of
contingency analysis. These two methods are
compared with the Newton-based full AC load
flow method and the fast decoupled load flow to
show their better convergence characteristics.
X. Tong et al. [11] presented the semismooth
Newton-type algorithms for solving OPF
problems. It treated general inequality constraints
and bounded constraints separately. By
introducing a diagonal matrix and the nonlinear
complementarity function, the KKT system of the
OPF is transformed equivalently to a system of
nonsmooth bounded constrained equations. The
number of variables is less compared to other
method. The method saves computing cost.
5. QUADRATIC PROGRAMMING (QP)
METHOD
It is a special form of nonlinear programming
whose objective function is quadratic and
constraints are linear.
451
J.A.Momoh [12] presented an extension of basic
Kuhn-Tucker conditions and employing a
generalized Quadratic-Based model for OPF. The
conditions for feasibility, convergence and
optimality are included in the construction of the
OPF algorithm. It is also capable of using
hierarchical structures to include multiple
objective functions and selectable constraints. The
generalized algorithm using sensitivity of
objective functions with optimal adjustments in the
constraints yields a global optimal solution.
Computational memory and execution time
required have been reduced.
N. Grudinin [13] proposed a reactive power
optimization model that was based on Successive
Quadratic Programming (SQP) methods. Six
optimization methods were used to test the IEEE
30 bus and 278 bus systems. It is found that the
developed SQP methods provide more fast and
reliable optimization in comparison with the usual
SLP method.
G.P.Granelli et al. [14] proposed Security-
constrained economic dispatch using dual
sequential quadratic programming. A dual feasible
starting point is achieved by relaxing transmission
limits and then constraint violations are enforced
using the dual quadratic algorithm. It is compared
with SQP method of NAG routine. It presents
limited computation time and sufficiently good
accuracy.
X.Lin et al. [15] integrated cost analysis and
voltage stability analysis using an OPF
formulation for competitive market, which was
solved using sequential quadratic programming.
Optimum reactive power dispatch are obtained
under various voltage stability margin
requirements in both normal and outage conditions
for IEEE 14-bus test system.
A.Berizzi et al. [16] presented Security–
Constrained Optimal Power Flow (SCOPF) to
determine optimal setting and operation mode of
UPFC and TCPAR. The solution of the OPF is
obtained by the use of the HP (Han-Powell)
algorithm. It is an efficient method that solves
nonlinear problems with nonlinear constraints
through the solution of successive quadratic
problems with linear constraints. It is applied to
CIGRE 63-bus system and Italian EHV network.
A global solution is achieved, even adopting
different starting points.
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
6. NONLINEAR PROGRAMMING (NLP)
METHOD
Nonlinear programming (NLP) deals with
problems involving nonlinear objective and/or
constraint functions.
J.A.Momoh et al. [17] proposed a new nonlinear
convex network flow programming (NLCNFP)
model and algorithm for solving the security-
constrained multi-area economic dispatch
(MAED) problem. It is solved by using a
combined method of quadratic programming and
network flow programming. The tie-line security
and transfer constraints in each area are
considered. An analysis of a buying and selling
contract in a multiarea environment is also
proposed. This method has been tested on four
interconnected power systems. It is feasible and
effective.
D.Pudjianto et al. [18] used LP and NLP based
reactive OPF for allocating (auctioning) reactive
power among competing generators in a
deregulated environment. It was concluded that the
overall cost associated with the system reactive
requirement calculated by LP method was
reasonably accurate, but the generator’s individual
commitment may vary considerably. Whereas,
NLP offers a faster computation speed and
accuracy for the solution but the convergence
could not be guaranteed for every condition.
G.L.Torres et al. [19] J.Z.Zhu [25] suggested
the methods to calculate the price of reactive
power support service in a multi-area power
system. The methods are cost-benefit analysis
(CBA) and nonlinear convex network flow
programming. By using multiple cost-benefit
indices, the reactive power support benefits with
respect to power delivery increases of tie lines are
computed.
A.K.Sharma [20] had proposed a method to
determine optimal number and location of TCSC
using Mixed Integer Nonlinear Programming
(MINLP) approach in the deregulated electricity
markets. The system loadability has been
determined in a hybrid market model utilizing the
secure transaction matrix.
7. INTERIOR POINT (IP) METHOD
Karmarkar proposed a new method in 1984 for
solving large-scale linear programming problems
very efficiently. It is known as an interior method
since it finds improved search directions strictly in
the interior of the feasible space.
452
Sergio Granville [21] presented application of an
Interior Point Method to the optimal reactive
power dispatch problem. It is based on the primal-
dual logarithmic barrier method as described by
Monteiro and Adler. The algorithm was applied on
large power systems and it converged in 40
iterations. CPU time was 398.9 seconds. The
proposed method has the following advantages:
number of iterations is not very sensitive to
network size or number of control variables,
numerical robustness, hot starting capability, no
active set identification difficulties and
effectiveness in dealing with optimal reactive
allocation and loss reduction problems in large
scale and ill-conditioned networks.
Whei-Min Lin et al. [22] presented the use of
Predictor-Corrector Interior-Point Nonlinear
Programming (PCIPNLP) algorithm to solve
social welfare maximization problem
incorporating FACTS devices in a deregulated
market structure. FACTS can ease the difficulties
caused by transmission congestion. The advantage
of the method is the inequality–constraint handling
capabilities. Active set identification for handling
various upper and lower limits is not required. A
strictly feasible starting point is not mandatory.
Ding Xiaoying et al. [23] presented an Interior
Point Branch and Cut Method (IPBCM) to solve
decoupled OPF problem. The Modern Interior
Point Algorithm (MIPA) is used to solve Active
Power Suboptimal Problem (APSOP) and use
IPBCM to iteratively solve linearizations of
Reactive Power Suboptimal Problem (RPSOP).
The advantages of the proposed method are: The
variables and constraints of RPSOP are lesser than
that of original OPF problem, which will enhance
the calculation speed. However, the proposed
algorithm fails in dealing with degenerate
problem.
Wei Yan et al. [24] presented the solution of the
Optimal Reactive Power Flow (ORPF) problem by
the Predictor Corrector Primal Dual Interior Point
Method (PCPDIPM). A new optimal reactive
power flow model in rectangular form is proposed.
The Hessian matrices in this model are constants
and need to be evaluated only once in the entire
optimal process. Total calculation time needed for
the proposed method is always shorter than that for
the conventional model for the seven test cases.
8. ARTIFICIAL INTELLIGENCE (AI)
METHODS
It is the science of making intelligent computer
program.
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
8.1. ARTIFICIAL NEURAL NETWORK
(ANN)
ANN is an interconnected group of artificial
neurons that uses a mathematical model or
computational model for information processing
based on a connectionist approach to computation.
Chowdhury [25] had suggested concept of
Integrated Security Constrained Optimal Dispatch
(ISCOD) which could solve the OPF problem
when it was constrained by both static and
dynamic security. ISCOD utilized the diagnostic
and decision making capabilities of Knowledge
Base System (KBS), massive parallel lisms and
learning features of an ANN along with
conventional power system network solution
methodologies to provide real-time control and
optimization. The KBS and the ANN are used in
different configuration for adding the dispatch or
in making control decisions.
N.I.Santoso et al. [26] presented a two-stage
Artificial Neural Network to control in real time
the multi tap capacitors installed on a distribution
system for a nonconforming load profile such that
the system losses are minimized. The required
input data are directly obtained from on-line
measurements which include the active and
reactive line power flows, voltage magnitudes and
the current capacitor settings at certain buses.
Inequality constraint consists of limits on capacitor
rating. The application of the proposed capacitor
control will be limited by the computation time
required for the learning process which in turn
depends on the number of conforming load groups
and capacitors installed rather than the number of
system buses.
8.2. FUZZY LOGIC (FL) METHOD
It is derived from fuzzy set theory dealing with
reasoning that is approximate rather than precisely
deduced from classical predicate logic.
Miranda et al. [27] gave a fuzzy model to
represent uncertainty in loads and generation as
fuzzy numbers. While uncertain injections were
dealt with D.C. fuzzy power flow model. System
optimal operation was calculated with Dantzing-
Wolfe decomposition technique and dual simplex
method. Among the results, fuzzy cost value for
system operation and possibility distribution of
branch power flows and power generation were
obtained.
V.C.Ramesh et al. [28] presented a Fuzzy Logic
approach for the contingency constrained OPF
problem formulated in a decomposed form that
453
allows for post-contingency corrective
rescheduling. Linear membership function is used.
The formulation treats the minimization of both
the base case (pre-contingency) operating cost and
of the post-contingency correction times as
conflicting but fuzzy goals. The proposed
approach can yield Pareto curves that can guide
the system operator regarding the tradeoff between
cost and security against contingencies. However,
choice of a suitable metric for measuring
correction time is unclear.
N.P.Padhy [29] presented an efficient hybrid
model for congestion management analysis for
both real and reactive power transaction under
deregulated Fuzzy environment of power system.
The proposed model determines the optimal
bilateral or multilateral transaction and their
corresponding load curtailment in two stages. In
the first stage classical gradient descent OPF
algorithm has been used to determine the set of
feasible curtailment strategies for different amount
of real and reactive power transactions. In second
stage, fuzzy decision opinion matrix has been used
to select the optimal transaction strategy.
8.3. GENETIC ALGORITHM (GA) METHOD
It belongs to the category of random search
algorithms which simulate the evolution process
based on the theory of survival of the fittest.
Walters et al. [30] applied a Genetic Algorithm
(GA) to solve an economic dispatch problem for
valve point discontinuities.
Po-H.Chen et al. [31] proposed a new genetic
algorithm for solving the Economic Dispatch (ED)
problem in large-scale systems. A new encoding
method is developed in which the chromosome
contains only an encoding of the normalized
system incremental cost. So the total number of
bits of chromosome is entirely independent of the
number of units. The approach can take network
losses, ramp rate limits and prohibited zone
avoidance into account. It is faster than lambda –
iteration method in large systems.
T.S.Chung et al. [32] presented a Hybrid
Genetic Algorithm (GA) method to solve OPF
incorporating FACTS devices. GA is integrated
with conventional OPF to select the best control
parameters to minimize the total generation fuel
cost and keep the power flows within the security
limits. TCPS and TCSC are modeled. The
proposed method was applied on modified IEEE
14 bus system and it converged in a few iterations.
L.J.Cai et al. [33] proposed optimal choice and
allocation of FACTS devices in multi-machine
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
power systems using genetic algorithm. The
objective is to achieve the power system economic
generation allocation and dispatch in deregulated
electricity market. The locations of the FACTS
devices, their types and ratings are optimized
simultaneously. UPFC, TCSC, TCPST and SVC
are modeled and their investment costs are also
considered.
8.4. MISCELLANEOUS AI METHODS
Chowdhury et al. [34] proposed Expert System
(ES) which was used in combination with a
transmission constrained economic dispatch to
provide real time security. The strategy for
combining the ES with an economic dispatch
which identifies the constraint violations in bus
voltage magnitudes and in line flows, as well as
the set of optimal generations. The ES then
determines the best possible control measure using
rules on voltage and line flow control. The purpose
of the expert system is to expeditiously remediate
voltage and branch over load problems.
H.Mori et al. [35] presented a Parallel Tabu
Search (PTS) based method for determining
optimal allocation of FACTS devices in
competitive power systems. Available Transfer
Capability (ATC) was maximized with the FACTS
devices. UPFC was modeled and concept of
incremental load rate was used. The proposed
method was compared with Simulated Annealing,
GA and Tabu Search methods. It is 1.95 and 2.68
times faster than TS and GA respectively. It is not
affected by the initial conditions and gave higher
quality solutions.
8.5. EVOLUTIONARY PROGRAMMING (EP)
It is a subset of evolutionary computation, a
generic population based metaheuristic
optimization algorithm.
P.Somasundaram et al. [36] proposed an
algorithm for solving security constrained optimal
power flow problem through the application of EP.
The controllable system quantities in the base-case
state are optimized to minimize some defined
objective function subject to the base-case
operating constraints as well as the contingency-
case security constraints. Fitness function
converges smoothly without any oscillations.
W.Ongsakul et al. [37] proposed Evolutionary
Programming (EP) to determine the optimal
allocation of FACTS devices for maximizing the
454
total transfer capability (TTC) of power
transactions between source and sink areas in
deregulated power system. EP simultaneously
searches for FACTS locations, FACTS
parameters, real power generations except slack
bus in source area, real power loads in sink area
and generation bus voltages.
P.Attaviriyanupap et al. [38] presented a new
bidding strategy for a day-ahead energy and
reserve markets based on an EP. The optimal
bidding parameters for both markets are
determined by solving an optimization problem
that takes unit commitment constraints such as
generating limits and unit minimum up/down time
constraints into account. The proposed algorithm
is developed from the view point of a generation
company wishing to maximize a profit as a
participant in the deregulated power and reserve
markets. Separate power and reserve markets are
considered, both are operated by clearing price
auction system.
T.Jayabarathi et al. [39] proposed the
application of Classical Evolutionary Programming
(EP), Fast EP and Improved FEP methods to solve
all kinds of economic dispatch problems such as
ED of generators with prohibited operating zones
(POZ), ED of generators with piecewise quadratic
cost function (PQCF), combined economic-
environmental dispatch (CEED) and multi-area
economic dispatch (MAED). The constraints
considered are the power balance, generating
capacity, prohibited operating zones, area power
balance, generation limits and tieline limits
constraints.
8.6. ANT COLONY OPTIMIZATION (ACO)
It is based on the ideas of ant foraging by
pheromone communication to make path.
I.K.Yu et al. [40] presented a novel co-operative
agents approach, Ant Colony Search Algorithm
(ACSA)-based scheme, for solving a short-term
generation scheduling problem of thermal power
systems. The state transition rule, global and local
updating rules are also introduced to ensure the
optimal solution. Once all the ants have completed
their tours, a global pheromone-updating rule is
then applied and the process is iterated until the
stop condition is satisfied. The feasibility of the
algorithm in large systems with more complicated
constraints is yet to be investigated.
Libao Shi et al. [41] presented ant colony
optimization algorithm with random perturbation
behavior (RPACO) based on combination of
general ant colony optimization and stochastic
 Journal of Theoretical and Applied Information Technology

© 2005 - 2008 JATIT. All rights reserved.

www.jatit.org

mechanism is developed for the solution of decreased. The particle also adjusts its velocity
optimal unit commitment (UC) with probabilistic according to two extremes. One is the best position
spinning reserve determination. Total production of its own and the other is not always the best one
fuel costs, start-up costs of units in stage t, the of the group, but selected randomly from the
penalty cost imposed when any of constraints are group.
violated and the total accumulated cost from stage J.G.Vlachogiannis et al. [46] formulated the
0 to stage t. are included in objective function. The contributions of generators to the power flows in
security function approach is also applied to transmission lines as a multiobjective optimization
evaluate the desired level of system security. problem and calculated using a Parallel Vector
R.Meziane et al. [42] used ACO to solve the Evaluated Particle Swarm Optimization (VEPSO)
allocation problem involving the selection of algorithm. VEPSO accounts for nonlinear
electrical devices and the appropriate levels of characteristics of the generators and lines. The
redundancy to maximize system reliability of contributions of generators are modeled as
series-parallel topology, under performance and positions of agents in swarms. Generator
cost constraints. A universal moment generating constraints such as prohibited operating zones and
function (UMGF) approach is used by the ACO to line thermal limits are considered. It can obtain
determine the optimal electrical power network precise solutions compared to analytical methods.
topology. M.Saravanan et al. [47] proposed the
application of Particle Swarm Optimization to find
the optimal location, settings, type and number of
8.7. PARTICLE SWARM OPTIMIZATION FACTS devices to minimize their cost of
(PSO) installation and to improve system loadability for
single and multi-type FACTS devices. While
It is based on the ideas of social behavior of finding the optimal location, the thermal limit for
organisms such as animal flocking and fish the lines and voltage limit for the buses are taken
schooling. as constraints. TCSC, UPFC and SVC were
H.Yoshida et al. [43] proposed a Particle considered.
Swarm Optimization (PSO) for reactive power and
Voltage/VAR Control (VVC) considering voltage 9. SUMMARY OF THE PAPER
security assessment. It determines an on-line VVC The following table shows the suitable methods
strategy with continuous and discrete control for solving the various optimization problems of
variables such as AVR operating values of Electrical Engineering.
generators, tap positions of OLTC of transformers Objective
Suitable Reason to use
and the number of reactive power compensation function to be
method(s) that method
equipment. optimized
Jong-Bae Park et al. [44] suggested a Modified Economic Fast methods
Particle Swarm Optimization (MPSO) for LP, NR
dispatch
economic dispatch with nonsmooth cost functions. Economic Non-linear
A position adjustment strategy is proposed to dispatch with problem
provide the solutions satisfying the inequality AI
non-smooth
constraints. The equality constraint is resolved by cost function
reducing the degree of freedom by one at random. Economic – Suitable for
Dynamic search-space reduction strategy is Emission Fuzzy conflicting
devised to accelerate the process. The results dispatch objectives
obtained from the proposed method are compared Reactive Accurate
with those obtained by GA, TS, EP, MHNN, power NLP, QP,IP,AI methods
AHNN and NM methods. It has shown superiority optimization
to the conventional methods. Optimal Multiobjective
Cui-Ru Wang et al. [45] presented a Modified location of AI nonlinear
Particle Swarm Optimization (MPSO) algorithm to FACTS device problem
solve economic dispatch problem. In the new Social welfare QP, AI ---Do---
algorithm, particles not only studies from itself and Congestion ---Do----
the best one but also from other individuals. By AI
management
this enhanced study behavior, the opportunity to Security Stable
find the global optimum is increased and the NLP, IP
constrained convergence
influence of the initial position of the particles is

455
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
OPF
10. CONCLUSION
In this paper an attempt has been made to review
various optimization methods used to solve OPF
problems. Even though, excellent advancements
have been made in classical methods, they suffer
with the following disadvantages: In most cases,
mathematical formulations have to be simplified to
get the solutions because of the extremely limited
capability to solve real-world large-scale power
system problems. They are weak in handling
qualitative constraints. They have poor
convergence, may get stuck at local optimum, they
can find only a single optimized solution in a
single simulation run, they become too slow if
number of variables are large and they are
computationally expensive for solution of a large
system.
Whereas, the major advantage of the AI methods
is that they are relatively versatile for handling
various qualitative constraints. AI methods can
find multiple optimal solutions in single simulation
run. So they are quite suitable in solving multi-
objective optimization problems. In most cases,
they can find the global optimum solution. The
main advantages of ANN are: Possesses learning
ability, fast, appropriate for non-linear modeling,
etc. whereas, large dimensionality and the choice
of training methodology are some disadvantages of
ANN. The advantages of Fuzzy method are:
Accurately represents the operational constraints
and fuzzified constraints are softer than traditional
constraints. The advantages of GA methods are: It
only uses the values of the objective function and
less likely to get trapped at a local optimum.
Higher computational time is its disadvantage. The
advantages of EP are adaptability to change,
ability to generate good enough solutions and
rapid convergence. ACO and PSO are the latest
entry in the field of optimization. The main
advantages of ACO are positive feedback for
recovery of good solutions, distributed
computation, which avoids premature
convergence. It has been mainly used in finding
the shortest route in transmission network, short-
term generation scheduling and optimal unit
commitment. PSO can be used to solve complex
optimization problems, which are non-linear, non-
differentiable and multi-model. The main merits of
PSO are its fast convergence speed and it can be
realized simply for less parameters need adjusting.
PSO has been mainly used to solve Bi-objective
456
generation scheduling, optimal reactive power
dispatch and to minimize total cost of power
generation. Yet, the applications of ACO and PSO
to solve Security constrained OPF, Contingency
constrained OPF, Congestion management
incorporating FACTS devices etc. of a deregulated
power system are to be explored out.
Authors strongly believe that this survey article
will be very much useful to the researchers for
finding out the relevant references as well as the
previous work done in the field of OPF methods,
So that further research work can be carried out.
11. REFERENCES
[1] H. H. Happ, “Optimal power dispatch-A
comprehensive survey”, IEEE Trans. Power
Apparat. Syst.,vol. PAS-90, pp. 841-854,
1977.
[2] IEEE working group, “Description and
bibliography of major economic-security
functions part-II and III, IEEE Trans. Power
Apparat. Syst., vol. PAS-100, pp. 215-235,
1981.
[3] J. Carpentier, “Optimal power flow, uses,
methods and development”, Planning and
operation of electrical energy system Proc. of
IFAC symposium, Brazil, 1985, pp. 11-21.
[4] B. H. Chowdhury and Rahman, “Recent
advances in economic dispatch”, IEEE Trans.
Power Syst., no. 5, pp. 1248-1259, 1990.
[5] J. A. Momoh, M. E. El-Harwary and
Ramababu Adapa, “A review of selected
optimal power flow literature to 1993, part- I
and II”, IEEE Trans. Power Syst., vol. 14,
no. 1, pp. 96-111, Feb. 1999.
[6] T. S. Chung and Ge Shaoyun, “A recursive
LP-based approach for optimal capacitor
allocation with cost-benefit consideration”,
Electric Power Syst. Research, vol. 39, pp.
129-136, 1997.
[7] E. Lobato, L. Rouco, M. I. Navarrete, R.
Casanova and G. Lopez, “An LP-based
optimal power flow for transmission losses
and generator reactive margins minimization”,
in Proc. of IEEE porto power tech
conference, Portugal, Sept. 2001.
[8] F. G. M. Lima, F. D. Galiana, I. Kockar and J.
Munoz, “Phase shifter placement in large-
scale systems via mixed integer linear
programming”, IEEE Trans. Power Syst, vol.
18, no. 3, pp. 1029-1034, Aug. 2003.
[9] S. D. Chen and J. F. Chen, “A new algorithm
based on the Newton-Raphson approach for
real-time emission dispatch”, Electric Power
Syst. Research, vol. 40, pp. 137-141, 1997.
 Journal of Theoretical and Applied Information Technology
© 2005 - 2008 JATIT. All rights reserved.
www.jatit.org
[10] K. L. Lo and Z. J. Meng, “Newton-like
method for line outage simulation”, IEE proc.-
Gener. Transm. Distrib., vol. 151, no. 2, pp.
225-231, March 2004.
[11] X. Tong and M. Lin, “Semismooth Newton-
type algorithms for solving optimal power
flow problems”, in Proc. of IEEE/PES
Transmission and Distribution Conference,
Dalian, China, 2005, pp.1-7.
[12] J. A. Momoh, “A generalized quadratic-based
model for optimal power flow”, CH2809-
2/89/0000-0261 $1.00 © 1989 IEEE, pp. 261-
267.
[13] N. Grudinin, “Reactive power optimization
using successive quadratic programming
method”, IEEE Trans. Power Syst., vol. 13,
no. 4, pp. 1219-1225, Nov. 1998.
[14] G. P. Granelli and M. Montagna, “Security-
constrained economic dispatch using dual
quadratic programming”, Electric Power Syst.
Research, vol 56, pp. 71-80, 2000.
[15] X. Lin, A. K. David and C. W. Yu, “Reactive
power optimization with voltage stability
consideration in power market systems”, IEE
proc.-Gener. Transm. Distrib., vol. 150, no. 3,
pp. 305-310, May 2003.
[16] A. berizzi, M. Delfanti, P. Marannino, M. S.
Pasquadibisceglie and A. Silvestri, “Enhanced
security-constrained OPF with FACTS
devices”, IEEE Trans. Power Syst., vol. 20,
no. 3, pp. 1597-1605, Aug. 2005.
[17] J. A. Momoh and J. Zhu, “Multi-area power
systems economic dispatch using nonlinear
convex network flow programming”, Electric
Power Syst. Research, vol. 59, pp. 13-20,
2001.
[18] D. Pudjianto, S. Ahmed and G. Strbac,
“Allocation of VAR support using LP and
NLP based optimal power flows”, IEE proc.-
Gener. Transm. Distrib., vol. 149, no. 4, pp.
377-383, July 2002.
[19] G. L. Torres and V. H. Quintana, “A jacobian
smoothing nonlinear complementarity method
for solving nonlinear optimal power flows”, in
Proc. Of 14th PSCC, Sevilla, Session 41, paper
1, June 2002, pp.1-7.
[20] A. K. Sharma, “Optimal number and location
of TCSC and loadability enhancement in
deregulated electricity markets using
MINLP”, Int. J. of Emerging Electric Power
Syst., vol. 5, issue. 1, pp. 1-13, 2006.
[21] S. Granville, “Optimal reactive dispatch
through interior point methods”, IEEE Trans.
Power Syst., vol. 9, no. 1, pp. 136-146, Feb.
1994.
457
[22] Whei-Min Lin, S-J. Chen and Y.S Su, “An
application of interior point based OPF for
system expansion with FACTS devices in a
deregulated environment”, 0-7803-6338-
8/00/$10.00 © 2000 IEEE, pp. 1407-1412.
[23] D.Xiaoying, W. Xifan, S. Yonghua and
G.Jian, “The interior point branch and cut
method for optimal power flow”, 0-7803-
7459-2/02/$17.00 © 2002 IEEE, pp. 651-655.
[24] Wei Yan, J. Yu, D. C. Yu and K. Bhattarai,
“A new optimal reactive power 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.
[25] Badrul H. Chowdhury, “Towards the concept
of integrated security: optimal dispatch under
static and dynamic security constraints”,
Electric Power Syst. Research, vol.25, pp.
213-225, 1992.
[26] N. Iwan Santoso and Owen T. Tan, “Neural-
net based real time control of capacitors
installed on distribution systems”, IEEE
Trans. Power delivery, vol.5, no.1, pp. 266-
272, Jan. 1990.
[27] V. Miranda and J. T. Saraiva, “Fuzzy
modeling of power system optimal load flow”,
IEEE Trans. Power Syst., vol. 7, no. 2,
pp.843-849, 1992.
[28] V. C. Ramesh and Xuan Li, “A fuzzy
multiobjective approach to contingency
constrained OPF”, IEEE Trans. Power Syst.,
vol. 12, no. 3, pp.1348-1354, Aug. 1997.
[29] Narayana Prasad Padhy, “Congestion
management under deregulated fuzzy
environment”, IEEE International Conference
on Electric Utility Deregulation,
Restructuring and Power Technologies
(DRPT2004), Hong Kong, April 2004, pp.
133-139.
[30] David C. Walters and Gerald B. Sheble,
“Genetic algorithm solution of economic
dispatch with valve point loading”, 92SM
414-3, IEEE/PES 1992 summer meeting.
[31] P. H. Chen and H. C. Chang, “Large scale
economic dispatch by genetic algorithm”,
IEEE Trans. Power Syst., vol. 10, no. 4, pp.
1919-1926, Nov. 1995.
[32] T. S. Chung and Y. Z. Li, “A hybrid GA
approach for OPF with consideration of
FACTS devices”, IEEE Power Engineering
Review, pp. 47-50, Feb. 2001.
[33] L. J. Cai, I. Erlich and G. Stamtsis, “Optimal
choice and allocation of FACTS devices in
deregulated electricity market using genetic
 Journal of Theoretical and Applied Information Technology

© 2005 - 2008 JATIT. All rights reserved.

www.jatit.org

algorithms”, 0-7803-8718-X/04/$20.00 © Syst., vol. 15, no. 4, pp. 1232-1239, Nov.

2004 IEEE. 2000.
[34] Badrul H. Chowdhury et al., “An expert [44] J. B. Park, Ki. S. Lee, J. R. Shi and K. Y. Lee,
system as a system operator’s aid in real-time “A particle swarm optimization for economic
solution of the optimal power flow”, Electric dispatch with nonsmooth cost functions”,
Power Syst. Research, vol. 26, pp. 21-30, IEEE Trans. Power Syst., vol. 20, no. 1, pp.
1993. 34-42, Feb. 2005.
[35] Hiroyuki Mori and Yuichiro Goto, “A parallel [45] Cui-Ru Wang, He-Jin Yuan, Zhi-Qiang
tabu search based method for determining Huang, Jiang-Wei Zhang and Chen-Jun Sun,
optimal allocation of FACTS in power “A modified particle swarm optimization
systems”, 0-7803-6338-8/00/$10.00 © 2000 algorithm and its application in optimal power
IEEE, pp. 1077-1082. flow problem”,in 4th International Conference
[36] P. Somasundaram, K. Kuppusamy and R. P. on Machine Learning and Cybernetics,
K. Devi, “Evolutionary programming based Guangzhou, August 2005, pp.2885-2889.
security constrained optimal power flow”, [46] J. G. Vlachogiannis and K. Y. Lee,
Electric Power Syst. Research, 72, pp. 137- “Determining generator contributions to
145, 2004. transmission system using parallel vector
[37] Weerakorn Ongsakul and Peerapol Jirapong, evaluated particle swarm optimization”, IEEE
“Optimal allocation of FACTS devices to Trans. Power Syst., vol.20, no.4, pp.1765-
enhance total transfer capability using 1774, Nov. 2005.
evolutionary programming”, in IEEE Int. [47] M. Saravanan, S. M. R. Slochanal, P.
Symposium on Circuits and Systems, ISCAS, Venkatesh, J. P. S. Abraham, “Application of
vol. 5, May 2005, pp. 4175-4178. particle swarm optimization technique for
[38] P. Attaviriyanupap, H. Kita, E. Tanaka, J. optimal location of FACTS devices
Hasegawa, “New bidding strategy formulation considering cost of installation and system
for day-ahead energy and reserve markets loadability”, Electric Power Syst. Research,
based on evolutionary programming”, vol. 77, pp. 276-283, 2007.
Electrical Power and Energy Syst., vol. 27
pp.157-167, 2005.
[39] T. Jayabarathi, K. Jayaprakash, D. N.
Jeyakumar and T. Raghunathan,
“Evolutionary programming techniques for
different kinds of economic dispatch
problems”, Electric Power Syst. Research, 73,
pp.169-176, 2005.
[40] I. K. Yu and Y. H. Song, “A novel short-term
generation scheduling technique of thermal
units using ant colony search algorithms”,
Electrical power and energy syst., vol. 23, pp.
471-479, 2001.
[41] Libao Shi, Jin Hao, Jiaqi Zhou and Guoyu Xu,
“Ant colony optimization algorithm with
random perturbation behavior to the problem
of optimal unit commitment with probabilistic
spinning reserve determination”, Electric
Power Syst. Research, vol. 69, pp. 295-303,
2004.
[42] R. Meziane, Y. Massim, A. Zeblah, A. Ghoraf
and R. Rahli, “Reliability optimization using
ant colony algorithm under performance and
cost constraints”, Electric Power Syst.
Research, vol. 76, pp. 1-8, 2005.
[43] H. Yoshida, K. Kawata, Y. Fukuyama et al.
“A particle swarm optimization for reactive
power and voltage control considering voltage
security assessment”, IEEE Trans. Power

458