Optimal Power Flow Using Genetic Algorithm

Optimal Power Flow using Genetic Algorithm
Document By
SANTOSH BHARADWAJ REDDY
Email: help@matlabcodes.com
Engineeringpapers.blogspot.com
More Papers and Presentations available on above site
Abstract
This paper presents solution of optimal power flow problem of large
distribution systems via a simple genetic algorithm. The objective is to
minimize the fuel cost and keep the power outputs of generators, bus
voltages, shunt capacitors/reactors and transformers tap-setting in their
secure limits The IEEE 14 and IEEE- 30-bus system has been studied to
show the effectiveness of the algorithm.
Keyworks
Load flow, optimal power flow, and genetic algorithm.
I. INTRODUCTION
Genetic algorithms offer a new and powerful approach to these optimization
problems made possible by the increasing availability of high performance computers at
relatively low costs. These algorithms have recently found extensive applications in
solving global optimization searching problems when the closed-form optimization
technique cannot be applied. Genetic algorithms (GAs) are parallel and global search
techniques that emulate natural genetic operators. The GA is more likely to converge
toward the global solution because it, simultaneously, evaluates many points in the
parameter space.
II. PROBLEM FORMULATION
The standard OPF problem can be written in the following form,
Minimise F(x) (the objective function)
subject to :
hi(x) = 0, i = 1, 2, ..., n (equality constraints)
gj(x) = 0, j = 1, 2, ...,m (inequality constraints)
where x is the vector of the control variables, that is those which can be varied by a
control center operator (generated active and reactive powers, generation bus voltage
magnitudes, transformers taps etc.);
A. Objective Function
The most commonly used objective in the OPF problem formulation is the
minimisation of the total cost of real power generation. The individual costs of each
generating unit are assumed to be function, only, of active power generation and are
represented by quadratic curves of second order. The objective function for the entire
power system can then be written as the sum of the quadratic cost model at each
generator.
(1)
where ng is the number of generation including the slack bus. Pgi is the generated active
power at bus i. ai, bi and ci are the unit costs curve for ith generator.
B. Types of equality constraints
While minimizing the cost function, its necessary to make sure that the generation still
supplies the load demands plus losses in transmission lines. Usually the power flow
equations are used as equality constraints.
(2)
where active and reactive power injection at bus i are defined in the following equation:
(3)
C. Types of inequality constraints
The inequality constraints on the problem variables considered include:
• Upper and lower bounds on the active generations at generator buses P gimin ≤Pgi ≤ Pgimax ,
i = 1, ng.
• Upper and lower bounds on the reactive power generations at generator buses and
reactive power injection at buses with VAR compensation Qgimin ≤ Qgi ≤ Qgimax, i = 1, npv
• Upper and lower bounds on the voltage magnitude at the all buses Vimin ≤ Vi ≤ Vimax , i =
1, nbus.
• Upper and lower bounds on the bus voltage phase angles: , i = 1, nbus.
III. GENETIC ALGORITHM IN OPTIMAL POWER FLOW

A. Description of Genetic Algorithms
The genetic algorithms are part of the evolutionary algorithms family, which are
computational models, inspired in the Nature. Genetic algorithms are powerful stochastic
search algorithms based on the mechanism of natural selection and natural genetics
B. GA Applied to optimal power flow
A simple Genetic Algorithm is an iterative procedure, which maintains a constant
size population P of candidate solutions. During each iteration step (generation) three
genetic operators (reproduction, crossover, and mutation) are performing to generate new
populations (offspring), and the chromosomes of the new populations are evaluated via
the value of the fitness witch is related to cost function. Based on these genetic operators
and the evaluations, the better new populations of candidate solution are formed.
B.1 Chromosome coding and decoding
GAs works with a population of binary string, not the parameters themselves. For
simplicity and convenience, binary coding is used in this paper. With the binary coding
method, the active generation power set of 9-bus test system (Pg1,Pg2 and Pg3) would
be coded as binary string of O’s and 1’ with length B1, B2, and B3 (may be different),
respectively. Each parameter Pgi have upper bound Ui and lower bound Li .The choice of
B1, B2, and B3 for the parameters is concerned with the resolution specified by the
designer in the search space. In the binary coding method, the bit length Bi and the
corresponding resolution Ri is related by
(4)
TABLE I. PARAMETER SET OF Pg1
TABLE II. CODING OF Pgi PARAMETER SET
If the candidate parameters set is (1.7, 0.30, 1.1), then the chromosome is a binary
string 111000110111. The decoding procedure is the reverse procedure.
TABLE III. First generation of GA process for 9bus example
Fitness of candidate solutions and cost function

The cost function is defined as:
(5)
Our objective is to search (Pg1,Pg2,Pg3) in their admissible limits to achieve the
optimization problem of OPF. The cost function F(x) takes a chromosome (a possible
(Pg1,Pg2,Pg3) and returns a value.
The objective of OPF has to be changed to the maximization of fitness to be used in the
simulated roulette wheel as follows:
(6)
Then the GA tries to generate better offspring to improve the fitness. Using the above
components, a standard GA procedure for solving the optimal power flow problem is
summarized in the diagram of the Figure 1.
Figure 1. A Simple flow chart of the GAOPF
IV. APPLICATION STUDY

The GAOPF has been developed by the use of Borland C++ Builder version 5. It
is tested using the modified IEEE 30-bus system [12].The system consists of 41 lines, 6
generators, 4 Tap-changing transformers, and shunt capacitor banks located at 9 buses .
TABLE IV. Power Generation Limits and Generator Cost Parameters of Ieee 30-Bus
System In P.U (Sb=100mva)*
* In Table IV, Pmin, Pmax, Qmin, Qmax, Vmin and Vmax are in (p.u), a in ($/hr), b in
($/MW.hr) and c in (($/MW².hr).
Figure 2. IEEE 30-bus electrical system topology

drawing by our OOENS software ver. 3.00 [13]
Fig.3 Voltage levels of IEEE 30 Bus electrical Network
Results :
TABLE V. Results of GAOPF Compared with Evolutionary

Methods for the IEEE 30-Bus System
TABLE VI . Results of GAOPF Compared with Evolutionary Methods
V. CONCLUSION
To save an important CPU time, the constraints are to be decomposing in active
constraints and reactive ones. The active constraints are the parameters whose enter
directly in the cost function and the reactive constraints are infecting the cost function
indirectly. With this approach, only the active constraints are taken to calculate the
optimal solution set. And the reactive constraints are taking in an efficient load flow by
recalculate active power of the slack bus. The developed system was then tested and
validated on the IEEE30-bus system. Solutions obtained with the developed Genetic
Algorithm Optimal Power Flow program has shown to be almost as fast as the solutions
given by a conventional language. Our GAOPF appears to be faster than other published
GAOPF methods.
REFERENCES
[1] H. W. Dommel, W. F. Tinney, Optimal Power Flow Solutions, IEEE Transactions on
power apparatus and systems, Vol. PAS-87, No. 10, p. 1866-1876, October 1968.
[2] K. Y. Lee, Y.M. Park, and J.L. Ortiz, A United Approach to Optimal Real and
Reactive Power Dispatch, IEEE Transactions on Power Systems, Vol. PAS-104, p.
1147-1153, May 1985.
[3] M. Sasson, Non linear Programming Solutions for load flow, minimum loss, and
economic dispatching problems, IEEE Trans. on power apparatus and systems, Vol.
PAS-88, No. 4, April 1969.
[4] T. Bouktir, M. Belkacemi, K. Zehar, Optimal power flow using modified gradient
method, Proceeding ICEL’2000, U.S.T.Oran, Algeria, Vol. 2, p. 436-442, 13-15
November 2000.
[5] R. Fletcher, Practical Methods of Optimisation, John Willey & Sons, 1986.
[6] D. E. Goldberg Genetic Algorithms in Search, Optimization and Machine Learning,

Addison Wesley Publishing Company, Ind. USA, 1989.
[7] J. Yuryevich, K. P. Wong, Evolutionary Programming Based Optimal Power Flow

Algorithm, IEEE Transaction on power Systems, Vol. 14, No. 4, November 1999.
Document By
SANTOSH BHARADWAJ REDDY
Email: help@matlabcodes.com
Engineeringpapers.blogspot.com
More Papers and Presentations available on above site

Optimal Power Flow Using Genetic Algorithm

Uploaded by

Copyright:

Available Formats

Optimal Power Flow Using Genetic Algorithm

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Optimal Power Flow Using Genetic Algorithm

Uploaded by

Copyright:

Available Formats

Optimal Power Flow using Genetic Algorithm

III. GENETIC ALGORITHM IN OPTIMAL POWER FLOW

TABLE I. PARAMETER SET OF Pg1

TABLE II. CODING OF Pgi PARAMETER SET

Fitness of candidate solutions and cost function

Figure 1. A Simple flow chart of the GAOPF

IV. APPLICATION STUDY

Figure 2. IEEE 30-bus electrical system topology

TABLE V. Results of GAOPF Compared with Evolutionary

[6] D. E. Goldberg Genetic Algorithms in Search, Optimization and Machine Learning,

[7] J. Yuryevich, K. P. Wong, Evolutionary Programming Based Optimal Power Flow

You might also like