Ijeet: International Journal of Electrical Engineering & Technology (Ijeet)

International Journal of Electrical Engineering and Technology (IJEET), ISSN 0976 6545(Print),
ISSN 0976 6553(Online) Volume 5, Issue 7, July (2014), pp. 45-55 IAEME
45

TRANSMISSION EXPANSION PLANNING AND COST ALLOCATION
WITH AND WITHOUT SECURITY CONSTRAINTS IN A DEREGULATED
POWER SYSTEM

Srujana Raghupatruni Uddavolu

Assistant Professor, Department of Electrical Engineering, Muffakham Jah College of Engineering
and Technology, Hyderabad, India

ABSTRACT

This paper presents a novel approach for static transmission expansion planning and
allocation of the associated expansion costs to individual market entities in a restructured power
system. The approach seeks the optimal addition of transmission lines among the possible candidate
transmission lines minimizing the overall system costs and at the same time satisfying the system
operational and security constraints. Novelty of the approach lies in applying a widely known
technique used for overload security analysis to an area such as Transmission expansion planning.
Transmission expansion costs are allocated using distribution factors to the individual entities in a
fair and transparent manner. The results for modified Garver Test system demonstrate that the
approach with the advantage of its simplicity can be applied to transmission expansion planning and
cost allocation in restructured power system.

Keywords: Open Access, Deregulation, Restructured Power System, Transmission Expansion
Planning (TEP), Security Constraints, Power Flow Tracing.

1. INTRODUCTION

Growing electricity demand driven by fast industrial growth and growing access to electricity
in developing countries has necessitated the increase in generation and need for adequate
transmission capacity. One of the many means of enhancing transmission capacity that involves
significant capital expenditure is that of Transmission Expansion Planning (TEP). Vast number of
influencing parameters including candidate circuits, electricity demand, generation forecast,
operational network topology, etc. are required for an optimal solution of TEP problem. In general,
INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING &
TECHNOLOGY (IJEET)

ISSN 0976 6545(Print)
ISSN 0976 6553(Online)
Volume 5, Issue 7, July (2014), pp. 45-55
IAEME: www.iaeme.com/IJEET.asp
Journal Impact Factor (2014): 6.8310 (Calculated by GISI)
www.jifactor.com

IJEET
I A E M E
46

TEP consists of choosing, from a predefined set of circuits, those that should be built in order to
minimize the investment cost, and to supply the forecasted demand along the planning horizon.
The TEP problem is generally considered as non-linear, no-convex optimization problem.
During past few decades, significant number of methods have been proposed to solve TEP problem.
One of the earliest approaches for TEP was proposed by authors in [1], where TEP problem was
formulated as a power flow problem and used a linear programming algorithm to find the most direct
routes from generation to loads. The approach discourages power flow on the right of ways without
existing transmission lines by penalizing them .The transmission line that alleviates maximum
overload emerged as the one chosen for addition. A new interactive method of TEP optimization
approach was proposed by authors in [11]. A mixed integer linear programming approach to solve
the static TEP problem has been proposed in [12]. The proposed approach considers the line losses in
the optimization framework. However in this method it is generally hard to guaranty the model
feasibility and global optimality of the problem solution. Authors in [13] proposed a new method
known as branch and bound method to solve the TEP optimization problem. The authors have used a
transportation model to represent the transmission network. Authors in [2], proposed a combined
use of linear and dynamic programming. Linear programming was used to find the minimum cost
capacity increments required to meet the changes on demand and generation. Afterwards, they used
dynamic programming to search for a close to optimal sequence of investment (continuous)
decisions. Reference [3] proposed a pure dynamic programming, but due to the computational
effort, its applications were very restricted.
Authors in [4] proposed the use of interactive tools for transmission planning. To rank the
possible additions this approach used a sensitivity analysis with respect to circuits susceptances of a
least effort index, which is the result of an optimization problem whose solution is identical to a
DC power flow solution. In 1984, Villasana [6] proposed two approaches to be applied in
transmission expansion planning. The first one is formulated combining a DC power flow model
with a transportation model. While the DC model evaluated the power flow for the existing
transmission facilities, the transportation model was used to compute the overload flow. This
approach consists in an improvement of the approach proposed in [1]. The second approach used
linear mixed integer formulation.
The use of mathematical decomposition schemes for this problem started with the approach
proposed in [5], where the author has applied a Benders decomposition technique to decompose the
global problem into two sub problems: the Master investment sub problem, which chooses the trial
expansion plan, and the operation sub problem that analyzes the trial investment decisions and
expresses operational violated constraints in terms of investment variables through Benders cuts.
However the hierarchical level II reliability calculations employed for composite system planning
increases the complexity of overall problem.
Many researchers [8],[9] have applied meta-heuristic techniques like GA and simulated
annealing to tackle the TEP problem. However there are some limitations of these evolutionary
optimization approaches. These limitations include large computational burden and constraint
handling problem which becomes more complex for highly constrained problems especially in large
power networks.
Authors in [14] formulated the composite system expansion planning as a nonlinear model
while considering different location based fuel supplying costs. Thought the method employs n-1
contingency criterion, reliability measure has not been studied quantitatively. Authors in [7] have
described an automatic way of finding the least cost method of securing a given power system.
With the advent of electricity markets ,the inability of wheeling electricity through desired path
either due to physical and operating limits of the transmission lines or the absence of transmission
lines in the desired right of way may hamper the prospects of trading electricity as dictated by
47

economics. In forward markets, it would be beneficial to plan for transmission expansion to ensure
fair competition among the market participants. Transmission expansion planning must therefore,
simulate market behaviour sufficiently to encourage and facilitate fair electricity market
environment.
The present paper can be divide into three main sections- the first section (section II)
discusses transmission expansion planning without security constraints ,where the transmission lines
with the overall benefit of being comparatively inexpensive and being able to alleviate maximum
overload are added one at a time till the overload on the network is alleviated. Reliability is of utmost
importance in competitive markets and the second section (section III) deals with TEP to obtain N-1
secure system. As expected, the number of lines that were added for N-1 secure system were higher.
In the the third section (section IV) the transmission expansion costs were allocated to individual
generators and loads using distribution factors [10]. Results are discussed in section V followed by
concluding remarks in section VI.

2. TEP WITHOUT SECURITY CONSTRAINTS

2.1 Method Adopted
The method adopted is similar to overload security analysis, where in instead of removing a
line (as in overload security analysis), line addition is simulated.
The brute force method involves adding one line at a time and performing DC load flow. A much
more efficient approach is to simulate the line addition by using Thevenins /Nortons equivalent. In
this approach the base case network before line addition remains the same for all candidate circuits
as shown in Fig.1.

thkm
X
k
m
f
km
P
f km
X X =
km

Fig. 1: Thevenins equivalent for single topological change

For a line addition between buses k and m, thethakm (
0
km
) shown in the Thevenins
equivalent model is computed as defined in (1).

0 0 0
m k km
=
(1)

(superscript 0 denotes that the values correspond to base case)

Thevenins equivalent impedance is evaluated as defined in (2).

mk km mm kk thkm
X X X X X + =
(2)

48

f thkm
km f
km
X X
P
+
=
0
(3)

To find out the effect of the line addition on the rest of the system, the angle changes are
evaluated as defined in (4)-(6).

f f
P X =
(4)

where,

] 0 ... 0 ...... 0 0 [
f
km
f
km
f
P P P =
(5)

(the two entries correspond to buses k and m affected)

f f
+ =
0
(6)
DC load flow is run to get post addition flows using the new angles (
f
).
From flows obtained, the indices
p
PI and NI are calculated as defined in (7) and (8)
respectively.

2
max
flowl
p
l l
P
PI
P
(
=
(

(7)

where, l belongs to the set of all the lines that are overloaded to avoid masking effect i.e., the line
that is just below its limit contributes to performance index almost equal to the line just above the
limit.

os
base
p p
PI PI
NI
C t
| |
=
|
\
(8)

Using the procedure described below the optimal solution is arrived at.

2.2 Algorithm

1) DC load flow is run on the base case network (modified Garver Six bus system) to obtain the
flows on all the lines and bus angles prior to the line addition
and performance index,
base
p
PI is calculated.
2) A line is added amongst the 5 possible right of way using Thevenins Equivalent approach
described above and flows are calculated.
3) From the flows, performance index,
p
PI and a normalized index, NI are calculated.
4) Go to step 2 until normalized index is found out for all possible right of way (ROW).

Add the line with largest value of the normalized index and go to step 1 till all the overloads
on the network are alleviated.

49

3. TEP WITH SECURITY CONSTRAINTS

An important aspect that must be considered when planning a transmission network
expansion is system-security. Contingency analysis looks at the state of the system after some lines
of the network fail. The N-1 contingency analysis looks at the system state after a single line of the
network fails and see if it is secure or not. N-1 contingency analysis requires that after each line fails
independently, the network constraints be satisfied.
When planning a transmission expansion, it is desirable to consider whether or not the
topology modification plan will be secure after any single line outage.
Seifu et. al. [13] have first considered a base case network (optimal expansion plan obtained
from TEP without security constraints) in which there are no overloads. They have then considered a
network expansion plan beyond that network so that it does not have overloads in a single line out
case (N-1 secure).
In the proposed method, the overall network planning for (N-1) security is solved in an
integrated fashion i.e. there is no distinction as base case network planning (without security
constraints) and planning against contingencies. The proposed method considers outage possibility of
any line (excluding radial lines) one at a time and plans the network expansion such that there are no
overloads in any (Nc+1) topology cases.

3.1 Method Adopted
A double line outage kind of approach is used for security constrained transmission
expansion planning to simulate two network changes a line addition and another line removal.For a
line addition between buses, k and m and line removal between buses, i and j, the Thevenins
equivalent model is computed as defined in (9)-(16).

th
X

T
f f
km ij
P P (

0
0

km
f
ij
X
X
X
(
=
(

0
0
km
ij
(
(
(

Fig. 2: Thevenins equivalent for double topological change

0 0 0
m k km
=
(9)

0 0 0
j i ij
=
(10)

(superscript 0 denotes that the values correspond to base case)
Thevenins equivalent impedance is evaluated as,

ji ij jj ii ij thij
X X X X X + =
,
(11)

, thkm km kk mm km mk
X X X X X = +
(12)

, , thkm ij thij km ik im jk jm
X X X X X X = = + (13)

50

(
=
ij thij km thij
ij thkm km thkm
th
X X
X X
X
, ,
, ,
(14)

(
(
+ =
(
(

0
0
1
] [
ij
km
f th f
ij
f
km
X X
P
P
(15)
where,

(
+
=
ij
km
f
x
x
X
0
0
(16)

To find out the effect of the change in the network topology on the rest of the system, the
angle changes are evaluated as defined in (17)-(19).

f f
P X =
(17)
where,

] 0 .... .... 0 ... ... 0 ...... 0 0 [
f
ij
f
ij
f
km
f
km
f
P P P P P =
(18)
Therefore,

f f
+ =
0
(19)

DC load flow is run to get post changes flows using the new angles (
f
).
From flows obtained, the indices
p
PI (which is a double summation over number of outage
topologies and base case and number of overloaded lines) and NI are calculated

(
=
= l l
flowlj
Nc
j
P
P
PIp
2
max
0
(20)

Using the procedure described below the optimal N-1 secure solution is arrived at
.

os
base
p p
PI PI
NI
C t
| |
=
|
\
(21)

3.2 Algorithm
1. DC load flow is run for the base case and
base
p
PI is evaluated.
2. A single line outage simulation is done for all the Nc outage topologies considering one line out
at time and
p
PI calculated is added to the PIpbase obtained for the base case to get PIpbase for all the
Nc+1 topologies.
3. For all candidate circuit considered one at a time , using double line outage kind of approach
(adding this line and considering Nc+1 outage topologies one at a time) indices
p
PI , NI are
calculated.
4. The line with highest NI is added and go to step 1 till a network which is N-1 secure is obtained.
51

5. Redundant lines are removed by carrying out a double line outage simulation if it does not result
in overloads for all the Nc+1 topologies to arrive at the optimal secure expansion plan.
(Radial lines and the line added are not considered for outage)

5. RESULTS

The validity of the method is investigated by applying it to the modified Garver 6-bus test
system for expansion[1].Table 1 shows the lines added to meet forecasted load without security
constraints. Additional lines are added in Right of Ways (ROW) 35,62,64. The total cost of
the transmission expansion is 1X100 + 3X150 + 2X150 = 850 currency units. Transmission
Expansion Planning without security constraints leaves the system unable to supply certain loads in
case of transmission outages (planned and unplanned).The results for Transmission expansion
planning with security constraints (Table II) shows that additional lines have to be added above those
added in the previous case to make the system N-1 secure. The total cost of transmission expansion
is 1340 currency units for the lines added as shown in Table II. An additional cost of 490 currency
units needs to be incurred.
Using the D and C factors, the transmission expansion costs can be attributed to generators
and loads respectively. Negative costs indicate a certain entity is responsible for

Table I: Results for TEP without security constraints

L
i
n
e

n
o
.

B
e
t
w
e
e
n

b
u
s
e
s

(
k
-
m
)

N
o
.

o
f

l
i
n
e
s

a
d
d
e
d

T
o
t
a
l

n
o
.

o
f

l
i
n
e
s

i
n

t
h
e

R
O
W

F
l
o
w

i
n

t
h
e

R
O
W
(
p
.
u
)

C
o
s
t

1 1-2 0 1 -0.5125 --
2 1-4 0 1 -0.3175 --
3 1-5 0 1 0.5300 --
4 2-3 0 1 0.6200 --
5 2-4 0 1 0.0363 --
6 3-5 1 2 1.8700 100
7 6-2 3 4 3.5689 150
8 6-4 2 2 1.8812 150
9 6-5 0 0 0 305
10 6-3 0 0 0 240

52

Table II: Results for TEP with security constraints

L
i
n
e

n
o
.

B
e
t
w
e
e
n

b
u
s
e
s

(
k
-
m
)

N
o
.

o
f

l
i
n
e
s

a
d
d
e
d

T
o
t
a
l

n
o
.

o
f

l
i
n
e
s

i
n

t
h
e

R
O
W

F
l
o
w

i
n

t
h
e

R
O
W
(
p
.
u
)

C
o
s
t

1 1-2 0 1 -0.3348 --
2 1-4 0 1 -0.2682 --
3 1-5 0 1 0.3030 --
4 2-3 0 1 0.2735 --
5 2-4 0 1 -0.0675 --
6 3-5 2 3 2.0970 100
7 6-2 3 4 2.9408 150
8 6-4 3 3 1.9357 150
9 6-5 0 0 0 305
10 6-3 1 1 0.5735 240

counter flows and therefore instead of being charged, the corresponding entity will be credited. It
therefore encourages the entities that can reschedule their transactions to reduce/avoid the need for
transmission expansion planning while charging the other entities for the additional transmission
capacity to be added. Tables III and Table IV show the cost allocation without security constraints
for generators and loads respectively. Tables V and Table VI show the cost allocation with security
constraints for generators and loads respectively.

6. CONCLUSION

The optimal design of Transmission lines is an important part of the overall planning task of
electric power systems. A single line outage simulation using Thevenins equivalent kind of
approach was used to study the effect of line addition and to arrive at the optimal expansion without
security constraints. Given the right of way where new transmission lines can be added, the solution
gives the right of way in which the new line has to be added.
A novel method for Transmission expansion planning incorporating security aspects so that
the designed network is also secure due single outages has been presented .In the proposed method,
the overall network is solved in an integrated fashion i.e., there is no

53

6
5.45 G =
1
0.5 G =
5
2.4 L =
2
2.4 L =
4
1.6 L =
1
0.8 L =
3
0.4 L =
3
1.65 G =

Fig. 3: Optimal transmission expansion plan without security constraints (newly added lines shown
in red color)

6
5.45 G =
1
0.5 G =
5
2.4 L =
2
2.4 L =
4
1.6 L =
1
0.8 L =
3
0.4 L =
3
1.65 G =

Fig. 4: Optimal transmission expansion plan with security constraints (newly added lines shown in
red color)
54

Table III: TEP without Security Constraints Cost Allocation to Generators
line G1 G3 G6
3--5 -3.07 43.27 59.80
6--2 -0.88 -21.28 472.15
6--4 1.11 26.91 271.98
Total cost -2.84 48.90 803.94

Table IV: TEP without Security Constraints Cost Allocation to Consumers/loads
L1 L2 L3 L4 L5
15.44 2.41 -5.23 7.27 80.10
48.78 190.87 28.84 17.37 164.14
29.80 33.06 9.27 161.01 66.87
94.02 226.34 32.88 185.65 311.11

Table V: TEP with Security Constraints Cost Allocation to Generators
line G1 G3 G6
3--5 -6.06 73.75 132.31
6--2 -0.01 -0.20 450.21
6--4 2.56 54.35 393.09
6--3 -4.59 -97.28 341.87
Total cost -8.09 30.62 1317.48

Table VI: TEP with Security Constraints Cost allocation to Consumers/loads
line L1 L2 L3 L4 L5
3--5 30.75 4.85 -7.35 10.11 161.64
6--2 47.38 225.31 23.73 11.23 142.34
6--4 43.27 52.18 10.51 264.29 79.74
6--3 32.60 10.09 36.21 -26.32 187.42
Total cost 154.00 292.44 63.10 259.31 571.14

distinction as base case expansion planning and planning against contingencies. The solutions (for
both with and without constraints) were obtained for Modified Garver six bus system (Fig. 7) using
MATLAB matched with that reported in [7].
Cost of transmission expansion planning under market environment is also discussed in this
paper. Using distribution factors the cost of TEP and the cost of security enhancement has also been
computed. The simplicity of the transmission expansion planning and the incentive based cost
allocation are the advantages of the approach in the present paper.

55

ACKNOWLEDGEMENT

The author would like to express her heartfelt gratitude to Prof. K.R.M. Rao, Retd. Dean,
Osmania University for his constant support and motivation.

REFERENCES

[1] L. L. Garver, Transmission network estimation using linear programming, IEEE Trans. on
PAS, vol. PAS-89, no. 7, pp. 16881687, 1970.
[2] J. C. Kaltenbatch, J. Peshon, and E. H. Gehrig, A mathematical optimization technique for
the expansion of electrical power transmission systems, IEEE Trans. on PAS, vol. PAS-89,
no. 1, pp. 113119, 1970.
[3] Y. P. Dusonchet and A. H. El-Abiad, Transmission planning using discrete dynamic
optimization, IEEE Trans. on PAS, vol. PAS-92, pp. 13581371, 1973.
[4] A. Monticelli, A. Santos Jr., M. V. F. Pereira, S. H. F. Cunha, J. G. Praga, and B. Park,
Interactive transmission network planning using a least-effort criterion, IEEE Trans. on
PAS, vol. PAS-l01, no. 10, pp.39193925, 1982.
[5] M. V. F. Pereira, L. M. V. G. Pinto, S. H. F. Cunha, and G. C. Oliveira, A decomposition
approach to automated generation-transmission expansion planning, IEEE Trans. on PAS,
vol. PAS-104, no. 11, 1985.
[6] R. Villasana, L. L. Garver, and S. J. Salon, Transmission network planning using linear
programming, IEEE Trans. on PAS, vol. PAS-104, 1985.
[7] A. Seifu, S. Salon, and G. List, Optimization of transmission line planning including
security constraints, IEEE Trans. Power Syst., vol. 4, pp. 15071513, Oct. 1989.
[8] E. L. da Silva, H. A. Gil, and J. M. Areiza, Transmission network expansion planning
under an improved genetic algorithm, IEEE Trans. Power Syst., vol. 15, pp. 11681175,
Aug. 2000.
[9] R. A. Gallego, A. B. Alves, A. Monticelli, and R. Romero, Parallel simulated annealing
applied to long term transmission network expansion planning, IEEE Trans. Power Syst.,
vol. 12, pp. 181188, Feb. 1997.
[10] Mohammad Shahidehpour, Hatim Yamin and Zuyi Li, Market Operations in Electric
Power Systems, Wiley; 2002.
[11] R. Romero, C. Rocha, M. Mantovani and J. R. S. Mantovani, Analysis of heuristic
algorithms for the transportation model in static and multistage planning in network
expansion systems, IEE Proc. Gener.Transm. Distrib., vol. 150, no. 5, pp. 521-526,
Sep.2003
[12] L. Bahiense, G. C. Oliveira, M. Pereira, and S. Granville, A mixed integer disjunctive
model for transmission network expansion, IEEE Trans. Power Syst., vol. 16, pp. 560565,
Aug. 2001.
[13] S. Haffner, A. Monticelli, A. Garcia, J. Mantovani and R. Romero, Branch and bound
algorithm for transmission system expansion planning using transportation model, IEE
Proc. Gener. Transm. Distrib., vol. 147, no.3, pp. 149-156, May 2000.
[14] Sepasian, M.S., Seifi, H., Foroud, A.A., Hatami, A.R.: A multiyear security constrained
hybrid generation-transmission expansion planning algorithm including fuel supply costs,
IEEE Trans. Power Syst., 2009, 24, (3), pp. 16091618.
[15] Guguloth Ramesh and T. K. Sunil Kumar, Power Flow Solution with Flexible AC
Transmission System Devices, International Journal of Electrical Engineering &
Technology (IJEET), Volume 4, Issue 4, 2013, pp. 232 - 244, ISSN Print : 0976-6545,
ISSN Online: 0976-6553.

Ijeet: International Journal of Electrical Engineering & Technology (Ijeet)

Uploaded by

Document Information

Original Title

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

Ijeet: International Journal of Electrical Engineering & Technology (Ijeet)

Uploaded by

Copyright:

Available Formats

International Journal of Electrical Engineering and Technology (IJEET), ISSN 0976 6545(Print),

You might also like