You are on page 1of 8

EVOLUTIONARY PROGRAMMING BASED ALGORITHM FOR

SELECTION OF WHEELING OPTIONS

Yog Raj Sood S.Verrna Narayana Prasad Padhy H. O. Gupta

Dcpnrhncnt of Elcctricnl Engineering


University of Roorkee
India 247667
e mail: nppeefee@rurkiu. ernet. in

from market activities can be quite different from the


Abstract: This paper describes, how to select a particuhu’ wheeling
traditional one. Further since any non-utility generator (NUG)
option among the various feasible transaction options available
in the system can sell all or part of its output to single or
under dercgulntcd environment of modcm power syshms. An
elYicient hybrid optimnl power now (1101’17) nigori[hm lms been multiple buyers Iocatcd anywhere within the network, have
proposed to determine the optimal selection based on wheeling cost. made the problem very much complicated. NUGS includes
In this proposed HOPF, Newton-Raphson method and evolutionary both independent power producers (IPPs) and co-generators
programming (EP) algorithm have been used for power flow and [4]. There is a need for an optimal system, which may
economic dispatch respectively. Based on the power transfer balance the needs of energy providers, the resellers, the large
capability and minimum generation cost, an optimal wheeling option industrial customers and residential consumers [5]. Some
will be suggested to both the owners of private non-utility generator
methods and mathematical models have been reported in
(i.e. independent power producers or co-generators) and the utility.
literature for solving above-mentioned problems,
The proposed algorithm is independent of the cost characteristics of
The general concept of wheeling and optimization has :
non- utility generators (NUGS). The proposed modei hm been
tested on the IEEE-30 bus test system with synthetic imposition of been explained in [6,7]. The review of the major existing
wheeling transactions, The solutions obtained are quite encouraging methods of wheeling have been discussed [8] and various
and useful in the present deregulated environment. existing models are in use in different countries [91.
Privatizing and restructuring the state electricity boards has
Keywords: ,optimai power jlow, Wheeling, evolutionary been proposed for the Indian power sector [1 Oj and Norway’s
programming, transaction options, non-utili~ generator. power sector [11 ]. Systematic exposure to modeling language
.
as applied to power system optimization problems is reported
L INTRODUCTION in the literature [12]. In one of the model [13] an optimization
approach is adopted to evaluate a critical influence of electric
Wheeling is the transmission of electrical energy tlom a wheeling and to determine the systems size and operational
seller to buyer though a transmission network owned by a strategies rationally for a co-generation system. It has been
third party [1]. As dependence on electricity grew, regulation proved [14] that a small 50MW combustion turbine peak
on the federal rmd local level increased as well. ‘Ihe industry generating plant can make a dramatic improvement if its
essential became a regulated monopoly in 1935. But the need location is internally within a 2500MW load area in a
for more efficiency in power production and delivery has led generating deficient system that has the potential for voltage
to a restructuring of the power sector in several countries cbllapse. Methodologies [15-16] are presented to compute the
traditionally under control of federal and state governments. optimal inter utility power interchange in deregulated power
The incorporation of transmission into this competitive system. The optimal approach explained in this paper, using
framework has proven more complicate and is the subject of EP-OPF, in the proposed hybrid model, is simple and
on going research and debate among utility consumers and eftlcient under various complicated situations and systems
suppliers [2-3]. constraints. HOPF has many advantages over the other
In this new environment of deregulation, one common classical OPF methods reported in literature [17-19]. It can
problem has been encouraged namely the market activities in handle the generating plant with non-convex or any other cost
electricity trading can exert unprecedented and serve pressure chrrracteristics. The proposed approach is free from
on the existing tnmsmission system. Such networks were mathematical complexity and suitable for highly complex
originally designed to accommodate certain generatiotiload environment. Hence hybrid model (HOPF) has been used to
pattern. Under deregulation the generation patterns resulting determined most economical and suitable (satisfying various
system constrains) options for wheeling transactions under
deregukrtcd environment of power systems.

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 545

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


II. PROBLEM FORMULATION
Pmand P;’ are respectively calculated and specified real
The selection of wheeling transaction is based on power for PV bus m.
optimization of generation cost without violating system v and @ are voltage magnitude and phase angles of
constraints. So the optimization of cost of generation has
been formulated based on classical OPF and HOPF, The differpuf h!lses.

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

Ng = Number of generator connected in the network A4VAfP ~ < A4VAfpm: (6)

Where WAfP~qu is the maximum rating of


The cost is optimized with the following power system
constraint transmission line connecting bus p and q.

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

reactive power for PQ bus i.

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 546

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


5. Assume max population and population size. 17. Check the number of chromosomes generated, if it is less
6. Generate chromosomes randomly consisting bits (O or 1) then pop_size (say 20) go to step 6 for next random
Ci=[OIO...OO1] generation of chromosome.
7. Separate out the bits of each chromosome for 18. Check the total number of population, if it equal to
generations, and convert it into its equivalent decimal maximum population then go to step25.
values. The values of generation corresponding to the ith 19. The probability of selection will be higher for the
generation may be expressed by the following chromosomes which has low value of cost, therefore
formula fitness of each chromosomes will be reciprocal of cost.
jitlies,y, = 1/ cos ti for i =1 to pop_size
Pg =p#i”+ffec(@!j . . .. Jx((P#(P##’-(l’’)/(l’@’”~ -l))
Where fitnessi = fitness value of function for i~h
(9)
chromosome
Where, ~eci (blbz ........) * represents the decimal value
20. Calculate the total fitness value
of bits corresponding to i“’ generation. pop _ size

8. Assume P/ = (),03 ~ PD (lo) F = ~ jitnessi (14)

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 (C) 2000 IEEE


All the equations ((1 ) to (6)) of the base case will also be
system by a wheeling transaction is ~~.. Run the HOPF with
applicable to this option 1.
all the generator of the utility being held at fixed optimal
setting of base case under these conditions. The amount of E. Option 2: (tile increased load is supplied by the combine
power generated by the high cost pseudo generator, represent operation of the utili~ and IWJG)
power that could not be wheeled across the network owing to
the transmission constraints. To find the optimal cost CZ ~(g.jl of
So the maximum allowed real power load
generation for the combine operation of the utility and NUG
demand pd ~&’ (g-j) for wheeling transaction (g-j), which connected at bus g, when the load is increased at j’h load point

can be supplied by NUG, through utility transmission by pdj


network is given by the following equation M
C2 w(R -/) = Min (~ fl(~g I) + fNUG (X-j)(pg wc (g-j)))
/.1
(22)
With
Pd~~~(g-j)””Ow = Pd.i – Pg(g.,j)ps’ (10 .
Where:
fpgi ‘pgNW(g-j) = PD +p~l +p~z(g.j) (23)
Pse= Power generated by the pseudo generator for i=l
n(.-i)
g..
the wheeling transaction WT(g-j) and (pgt~G(g.j) < ‘g~~(g-j) s ‘g~;G(g-j) )
Where:
So the maximum allowable real power generation = Transmission losses when the load demand
PI 2 (q-j)
R%%(g.,j) by the NUG, for the wheeling transaction increases at jti load point and increased load supplied
WT(g-j) is given by by combine operation of existing utility and an NUG
connected at bus g.
The other constraints equations (3) to (6) will remain same.
pg;::(g.j) = Pd NUG(g-j)
“[[”w + ~~(g-j)
(17)

where F. Option 3 {The increased load supplied by the utility


= Change in the transmission losses due to alone)
APl(g_j)
Let there is an increase in load demand due to buyer
wheeling transaction WT(g-j)
(18) by p~ at j’” bus. Optimal cost Cs j of generation, with
‘z(g-j) = ‘il(g.j) – ‘1
where EP-OPF, when the existing utility is supplying this increased
load, is given by
Pll (g-j) = Transmission losses when increased load (24)
C3, =Min f f,(m i)
demand at the jti load point is supplied by NUG 1.1
connected at bus g, while the utility set at previous N
(25)
optimal point of base case. Pg ~ =PD+Pllj+Pdj
Y
i=l
Where
= Real power generation of it” generator when load
(19) Pgti
increases at j’h load point and this load supplied by the
min are
(Where, Pg NUG (g-j) max existing utility only
and ‘g NUG (g-j)
= Transmission losses when load demand increases
respectively minimum and maximum possible generation of Pllj
non-utility generator) at the j’h load point and load supplied by the existing utility
then option 1 is possible otherwise go to option 2 directly, only.
The other constraints equations (3) to (6) will remain
D. Optionl: (The iVUG supplying tile increased load same.
demand and additional losses)
Set all the utility generators at optimal point of base case G. Selection of Wheeling Option
and provide the load demand Pdj by the NUG only.
The wheeling transaction option is selected on the basis
so, of minimum inc;ease in the operational cost of generation.
(20) Hence increase in the cost for various options is found out as
cl W (g-j) = fNIJG ~.-j~(pg “NUG (g-j)

Where: presented in the following table 1.

= Pd ~g_jl + API (g-j) (21)


‘g NUG (g -j)

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 548

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


TnMc 1. Shift in the optimal cost for various Options 10. lf ccmditioo of equation (19) is satisfied go to next step
otherwise go to step 12.
Option I Increase in the optimal cost of 11. Find minimum of AC1,,, AC2w(g_,j) and
Number I generation for per unit increase I
I in power transaction AC3 I? ’T(g-j)
o If AClj is minimum, the option 1 is

Option 1 ACI Wr(g.,, = c1 ,,7(8.1) I Pal”’’<’”


N1:G( X-,) selected. If AC2m(g_j) is minimum option 2 is
Option 2 AC2 Wr(g-j)= (c2w(g_J) - c)/ F’d,
selected. If AC3w(x_j) is minimum option 3 is selected
Option 3 AC3i=(C3, -C)/Pdj
and go to step 13.
12. Find minimum of AC2, and AC3w(g_j) . If AC2,
To select the best possible option, based on minimum is minimum, then option 2 is selected otherwise option3
increment in optimal cost of generation. If Condition of is selected.
equation (19) is satisfied minimum increment cost wheeling 13. Increment j by 1, and if j is less than or equal to number
option among all the three options is selected, otherwise the of buses (n) then go to step 5.
minimum cost wheeling option mnong option 2 nnd option 3 14. Increment g by 1 and if g is less than or equal to number
is selected. of buses (oj go to step 4,-otherwise stop.

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

the cost of generation Cl ~7(g_,i)as per option 1, Find

the increase in the optimal cost per unit allowed


wheeling power as

AC1 ~(%-.i) = c1 WT(g-j)‘Pd$l%(g-j) (26)

8. Find the optimal cost of generation Cz,j for the combine


23.014 23.039
operation of the utility and NUG as per option 2 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

for option 1 using HOPF, when the existing utility is also


supplying this increased load. Find increase in optimal
cost of generation using the following equation.
AC3.,, =[C3,
.,< –C)/Pd. ., (28)

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 549

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


B. Power Transfer al[owed for a Wheeling Transaction The results in fig,3 shows that at bus number
Let us assume that NUG of 50MW maximum capacity is 1,2,3,4,6,9,10,11,12,13, 16 the power required to meet the
connected at bus no. 14 (It may be installed at any other increased load is less than 1 MW, this is due to reduction in
bus).Now the question is whether it can sell full 50 MW losses of the network. Therefore at theses loading points,
.
to the buyer through the utility or not. If not, what NUG will be more intrested to supply Dower. The cost of
amount of power it can sell. For this analysis a pseudo generation for different wheeling - ;r&;action is given in
generator of very high cost characteristics is connected to table2
the load point bus (at which this additional power is to be
sold). Based on the power supplied by the pseudo Table2: Selection of wheeling transaction option
generator, the maximum allowed power generation by Bus Option 1 Option 2 Option Transaction
the NUG for a given wheeling transaction is known from No. 3 option
(17). Fig.2 presents the maximum allowed load that can
I Iselected
be supplied by the NUG through different wheeling 1 3.278 3.619 ] 3,245 ] 3
I I
transaction at different load points.

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

lading ~“nts ferwhdimg transadions VLT(14-j) D. Oution 2


.
If the utility makes an, agreement with the NUG and
Fg.3@naaticn dW3tomattheextra lcwfoflMN all seven generators (including NUG) are supplying the
increased load demand. The increment in the optimal cost is
shown in table 2.

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 550

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


4
3.9
3.8
3.7
3.6
3.5
3.4
3.3 —Optbi-11
3.2
-+-0ption2
3.1
~optioq
3

135,79111315171921 23252729
Loading pint (BUSNumber) for wheeling lmmactions 14T(14-j)

Fig. 4: Cbrqmkon of incremntd costof wheelingoptions

E. Option 3 economical. Hence before a wheeling transaction is allowed,


The change in the optimal generation and hence the this analysis is very much necessary to find out most
total cost have been observed for one MW increase in load at economical decision.
all the buses (taking one at a time) as per option 3. The
incremental cost is shown in table 3. VI. ACKNOWLEDGMENTS
The authors wish to express their sincere gratitude to the
E. The Comparison of Different Options Department of Electrical Engg. University of Roorkee,
The comparison of increment in optimum cost from the base Roorkee (U. P.) India, for their support to the work reported in
case optimum cost for different options is given in table 3 and the’ paper. They are also grateful to Quality Improvement
is also plotted in fig.4 for comparison. It is very much clear Program of MHRD, Government of India and also to REC
from this figure, that for most of the wheeling transactions Hamirp& (H. P.) India for sponsoring one of the author Y.R.
option 1 is economical. However for some transactions e.g. Sood for his Ph.D. work
for wheeling transaction WT( 14-15) when loading point was
bus number 15, option 2 has least increment in cost. For
VII. REFERENCES
wheeling transactions WT( 14-1) and WT( 14-30), when
loading point is bus number 1 and 30 respectively, the option [1]. Michael C. Caramanis, Roger E.bohn and Fred C.
3 is most economical. Schweppe, “The costs of wheeling and optimal
wheeling rates”, IEEE transactions on Power System
v. CONCLUSION vol. PWRS-1, No. 1, Feb. 1986, pp63-73.

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

0-7803-6674-3/00/$10.00 (C) 2000 IEEE


[6]. Allcu~ J. Wood nnd Bruce F, Wollenbcrg, “power IEEE Trans. on Power Syslems, Vol. 14, No.4,
Generation, Operation and Control”, Second Edition, A November 1999, pp1245-1250.
Wiley- Interscince publication, New York, 19 p.
[7]. O. Alsac and B. Stott, “Optimal load flow with steady
state security” “, IEEE Trans. on Power Apparatus and
Systems, Vol. PAS-93, No. 3, May/June 1974, pp745- BIOGRAPHIES
751.
[8]. Y.R. Sood and N. P. Padhy, “Methods of evalutiting cost Yog R}!] Soort wn.s born in Bnnur (Prrtinla), lndirr. I [c obtaimxi his B.SC
of wheeling based on marginal cost theory”, degree from P.U. Chahdigarh in
proceedings of International Symposium on Electricity 1980. He received his B,E. degree in
Electrical Engineering with
Distribution in the developing countries, 20-21 Jan.
“Honours” and M.E. in Power
2000, CBIP, New Delhi (India), pp168-1 75. System from Punjab Engineering
[9]. Richard D. Christie, Bruce F. Wollenberg and Ivar College Chandigarh (U.T.), in 1984
and 1987 respectively, He joined
Wangensteen, “Transmission Management in the
Regional Engineering College
Deregulated Environment” Proceedings of the IEEE, Kurukshetra in 1986, He has been
Vol. 88, No.2, February 2000, pp. 170-195. working as Assistant Professor in the
Electrical Engineering Department of
[10]. C. Palanicharmy, et al., “Privatizing and Restructuring Regional Engineering College,
Indian Power Sector - An Overview”, I.E. (I) Jottrnal- Hamirpur (H. P.) since 1991. He has
EL, Vol. 80, May 1999, pp23-30. published a number of research
papers, Hc is doing his Ph.D. from
[1 1]. Olav B. Fasso, etl.,’’Generation scheduling in a
University of Roorkee,Roorkee (U. P).
deregulated system: The Norwegian case”, IEEE Trans.
on Fewer Systems, Vol. 14, No. 1, February 1999, His research interests are in the area of computer applications to power
pp75-81. system, wheeling, deregulated and open access transmission system, power
network optimization and non-convent ionrd sources of energy.
[]2]. Deliabrate Chattopadhyay, “Application of general
algebraic modeling system to power system S.Verma obtained his degree of engineering from Aligarh Muslim
University and completed his Master of Engineering in Power System from
optimization”, IEEE Trans. on Power Systems, Vol. 14,
University of Roorkee, Roorkee, in 1999. Presently he is working as lecturer
No. 1, February 1999, pp. in deprrrtment of electrical engineering, T.l,E,T. Patiala (Ph.), India.
[13]. K. Ito, et al., “Analysis of Electric Wheeling on
Narayams Prasad Parlhy obtained his degree of engineering and Master of
Cooperative Fuel Cell Co-generation Systems Installed
Engineering in 1990 and 1993,
in Multi-Areas”, Journal of Energy Resources respectively. In 1997, he obtained his
Technology, Vol. 116, September 1994, pp.211 -217. Ph.D. degree from Anna University,
Chennai, India. He joined Birla
[14]. Les Pereira and Don DeBerry, “Thr role of less- Institute of Technology & Science as
economic generating units in the open access an Assistant Professor in 1997, He is
transmission era” IEEE Trans. on Power Systems, Vol. presently with the faculty of
14, No. 3, August 1999, ppl 133-1136. Electrical Engineering, University of
Roorkec, Roorkee. }{e taught course
[15]. Roberto W. Ferrero and S. M. Shahidehpour, “ optimal in Basic Electrical Engineering,
Power Transaction with network constraints in Power Systems and Artificial
Deregulated Systems”, Electrical Machine and Power Intelligence, His field of interest is
Artificial Intelligence Applications to
System, VOI.25, Number 6, July 1997, pp661 -675. Power System Optimization Problem.
[16]. Sunii Verma, “Analysis and Management of Open
Access Power Transaction based on Al Techniques” A
Dissertation of M.E. in Electrical Engineering (Power 11.0. Gupta was born in Agra, India. t+c obtained his B,E. in Electrical
System), under the guidance of Dr. N.P. Padhy, UOR, Engineering from the
Roorkee(U.P.) India, March 2000. Government Engineering
College, Jabalpur. He received
[1’7]. James A Momoh, et al, “A Review of selected optimal his M.E. in systems engineering
power literature to 1993 part I: Non-linear and and operation research and
Quadratic Programming Approi]ches” IEEE Trans. on mf), from the University of
Roorkee, f{oorkee, in 1975 and
Power Systems, Vol. 14, No. 1, February 1999, pp96-
1980 respectively. At present he
104. is working as a professor in the
[18]. James A Momoh, et al. “A Review of selected optimal Electrical Engineering
Dcpmtment of the University of
power Iiterrtture to 1993 part 11: Newton, Line,ar
Roorkee. Ruorkcc. [[c visited
Programming and Interior Point Methods” 1EEE Trans. ,$,
1 McMaster [Ja ivers it y,

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

0-7803-6674-3/00/$10.00 (C) 2000 IEEE

You might also like