Professional Documents
Culture Documents
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 545
detailed problem formulation of the proposed approach is as ● ‘I he inequality constrain on real power generation Pgi
follows: ofetich generation i
mill ~ pg, ~ pg;n.x
Pgi (4)
A. Base Case (Optimal generation without ally whee[ing
transaction) Where pg~in and Pgr are respectively minimum and
For a given power system network, the optimization cost of
maximum value of real power generation allowed at
generation is given by the following equation
generator i.
c = Min (1)
f .f, (% ,)
i=l ● The inequality constraint on voltage of each PQ bus
Where:
Pp” < ~. s ~.mm (5)
c= Optimal cost of generation when the utility
supplying its own load
Where ~in and ~m~ are respectively minimum “
m%)= Generation cost function of the ith generator
and maximum
i
voltage at bus i
for Pgi generation
Pgi = Power generation by the iti’ generator ● Power limit on transmission line
NAI
● ~Pgi=PD+Pl (2)
B. Evohtionary Progrant Based Optimal Po wer Flow
i=l
Where
P~ = Total load of the system
In the proposed hybrid optimal power flow
Pl Transmission losses of the system (when the approach, the optimal generation and cost of the generating
utility supplying its own load) units have been evaluated using evolutionary programming
. The power flow equation of the power network (EP) without violating transmission constraints, which has
been tested using Newton Rapson power flow algorithms.
g(lvl,~) = o The step be step algorithm of the proposed HOPF is as
Where follows:
1==1
1. Prepare the database for the line data, bus data and
generator data. These data for the test system is given in
table 2, 3 and 4.
g(lvl,+) = (xb’h?w” I For each’ 3)
2. Formation of Y bus using line resistance, reactance,
shunt elements and tap changer ratio.
qjq,f$-fy 1+m,PV notbus 3. Calculate the number of bit required for generators by
using the following condition
including
the ref. ~“-r’qd-’ < (p8’n’x-%min)V~~ 2“’-’”(’4 0)
bus. Where:
nr4mhw of decimal place accuracy required
Where
pr = 10
4. Calculate total number of the bit required for
Pi and Qi are respectively calculated real and reactive chromosomes generation using the formula.
power for PQ bus i. NV
(8)
Total bit required = bit — reqd ,
f
~.net and Q ~t are respectively specified real and 1%1
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 546
Where: i=]
21, Calculate the probability of selection using the formula
(11) pi = jitnessi IF for i=l to pop_size
PD=~Pdi
i=l 22. Determine cumulative probabilities for each ‘
=Number of buses chromosomes
Nb
9. The generation of the slack bus generator ‘ has been 1
for i=l to pop_size
calculated using the following equality constraint. 9i=z Pi
;=1
(12) Generate’ the pop_size (say 20) random numbers ~, in the
‘g slack
.- fPgi+PD+P1
i=!
range {O, 1}.
i $ duck
If ri < p ~ for i=l to pop_size
10. Check the pg slack ‘ it should be within pg ~~k
Then we select chromosomes for crossover.
23. Assume the mutation probability p,,, (say 0.0 1), and then
and Pg ~~& , otherwise go to stcp6.
generate random number in between {O, 1} for
11. Perform ~ the load flow using the Newton-Raphson ‘pop _ size x total _ bit_ reqd’ v if it iS less than Pm
method and hence determine bus voltage magnitudes and (0.01) for that numbers then mutate the bit, counting
phase angles. from starting bit of first chromosomes. the number of
12. Calculate the line flows and line losses and also find total mutate bit (Nmb) can be calculated by the formula
line losses in the network. If the difference between
Nmb = op_size x total_ bit _ reqd x pm (15)
calculated losses and assumed losses (or losses of the
previous’ iteration) violate the tolerable limit, set new 24. Replace the existing population by the new population
and go to step5.
fitness function that select the set ofpgi , leading to
25. Find the optimal solution among all population groups
optimal solution. within fixed number of iteration and stop.
13. Check the bus voltage violation
c. Wheeling Transaction and its Power Tramfer
~.’”i” <~. ~ ~i’”” ‘or i = 1‘0 ‘b
Capability
except generator bus.
A synthetic wheeling transaction have been included
If there is any bus the violated the limit then provide in the n bus power system, the seller at bus g and the buyer
reactive power support optimally or go to step 6 with a load at bus j. The corresponding wheeling transaction
14. Check the MVA flows violation, can be represented as WT(g-j), where g and j may be varied
from 1 ton and g is not equal to j.
MVAij < MVA~
Now let us assume that a non-utility generator
for all the lines connected between bus j and i. (NUG) wants to wheel certain amount of power to a buyer
If the limit violates then provide reactive power trough the transmission network of the utility. Taking into
support optimally or go to step 6. consideration transmission constrains, it is necessary to find
15. Calculate the cost of generation using the relation out the maximum amount of power that can be wheeled
without violating predefine network constraints, The
(13)
Cost =~(aix Pgf+bix Pgi+cj) procedure for calculating maximum power transfer capability
of a wheeling transaction is as follows.
The cost function may be of any other form. Assign a very high cost function pseudo generator at
16. Store the cost corresponding to all the available and the load bus j. Let the additional load demand at bus j, which
satisfactory chromosomes. NUG is willing to supply through the utility transmission
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 547
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 548
III. STEP BY STEP ALGORITHM FOR OPTIM+L IV. SIMULATION RESULTS AND DISCUSSION
SELECTION PROCEDURE
The developed algorithm was applied to the IEEE 30-Bus
standard test system [7].
The various steps for the optimal selections of wheeling
options is as follows:
A. Base Case
1: Find the optimal cost of generation for the given load
For the base case the optimal generation (MW) of the
pattern using HOPF for the base case.
generating units of the utility are presented in the fig. 1. The
2. Install an NUG ‘at bus (i.e. NUG Point) g and let it to
total cost of generation for the base case optimal schedule is
supply load at bus (i.e. load point) j. In this way an
C = 803.732 E/hr.
wheeling transaction WT(g-j) has been put to the given
power system.
3. Set NUG point count g=l
4. Set load point count j=l.
5. Find maximum amount of power that can be transferred
without violating network constraints for the wheeling
transaction.
6. If the equation (19) is satisfied go to next step otherwise
go to step 7.
7. Set all the utility generators at optimal point of step 1 and
provide the load demand Pdj by the NUG only and find
u, 11.U2 12.767
the shitl in optimal cost per unit of wheeling transaction
using the following formula. . I -, ❑ , Ra.,
I 2 5 8 II 13
AC2 W7’(g-,j)
= (c21m(g.,i) - c) j Pdj ) (27)
tus nudu
Gmcrating plant
9. Let there is an increase in load demand by Pc-J’ at j’h
load point.Find the optimal cost ( C 3, ) of ~enemtion
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 549
4 I 3.525 I 3.7{
5 3.644 3.672 3.686 1
6 3.566 3.794 3.686 1
7 3.623 3.677 3.742 1
8 3.577 3.801 3.700 1
9 3.568 3.797 3.688 1
10 3.568 3.797 3,690 1
11 3.567 3.794 3,688 1
12 3.518 3.744 3.589 1
13 3.516 3.744 3.589 1
357 9111316171921232527 i9 14 3.574 3,922 3,656 1
Id jmnt
(Bu5Mt.Y) 15 3.604 3.561 3.676 2
16 3.567 3.794 3.688 1
Fig2 tvkxhnn allowed Id s@id by NW throughdiffd
wtding lmmwticm ~14-j) 17 3.584 3.811 3.705 1
18 I
3.651 I
3.878 1
3.771 I
1
C. Option 1 19 ] 3.661 3.888 I 3.782 I 1
I
If the NUG is supplying the increased demand of lMW and 20 I 3.642 ] 3.868 I 3.765 I 1 x1
additional losses and the utility generators are set at their 21 3.612 3.840 3.730 1
original optimal point. The power supplied by the NUG, for
22 3.610 3.838 3.668 1
various loading points, is shown in fig.3.
23 3.646 3.872 3.768 1
24 3.664 3.891 3.783 1
25 3.644 3,870 3.768 1
26 3.737 3.963 3.854 1
27 1
3.593 I
3.822 1
3.718 t
1
28 I 3.587 3.813 I 3.704 I 1
1
29 I 3.724 I 3.954 I 3853
I
----- I
I
1 I
30 I 3.813 3.869 I 3.666 I 3
I
(5
14710131619222528
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 550
135,79111315171921 23252729
Loading pint (BUSNumber) for wheeling lmmactions 14T(14-j)
A new evolutionary programming based approach for optimal [2]. J.W. Marangon Lima, et al., “An Integrated
selection of wheeling option from the various feasible options Framework for Cost Allocation in a Multi-Owned
of power system considering various system constraints has Transmission System”, IEEE Trans. on Power
been proposed under deregulated environment. Systems, V~l.10, No.2, May 1995, pp.971-977.
The concept of pseudo transactions and generator has H,H, Happ, “Cost of Whgeling Methodologies”, IEEE
[3].
been used to determine the validity of the proposed HOPF. Trans. on Power Systems, Vol. 9, No. 1, February
The perfommnce of the developed algorithm has been 1994, pp147-156.
demonstrated using IEEE-30 bus test system. From the
[4]. Mukerji Rana, et al., “Evaluation of Wheeling and
results shown in tig.4, it is very much clear that for most of
Non-Utility Generation (NUG) Options using Optimal
wheeling transactions option 1 (i.e. the NUG supplying the
Power Flows” IEEE Trans. on Power Systems, VOI.7,
increased load demand and additional losses due to the
No. 1, February 1992.
wheal) has least increment in cost, where as for’ some other
transactions option 2 (i.e. the increased load supplied by the [5]. Robest A. Durham, et al., “Electrical Re-Regulation
combined operation of the utility and NUG) or option 3 (i.e. Impact”, IEEE Industry Application Magazine, VO1.5,
the increased load supplied by the utility alone) is most No.6, September/October 1999, pp.47-56.
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 551
1
$...
[,
on Power Systems, Vol. 14, No. 1, February 1999, \ Hamilton, Canada, from 1981 to
pplo5-111. 1983 as a post-doctorate fellow.
[19]. Janson Yuryevich & kit Po Wong, “Evoltttionary His rcscnrch interests am in the rues of eomputcr-oidcd design, rclinbility
Programming Based Optimal Power Flow Algorithm”, engineering, power network optimization anct power transformers.
0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 552