2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America
Centralized Expansion Planning of the
Transmission Network in Competitive Markets.
A Solution based on a Hybrid Approach
W. H. Guamn, Student Member, IEEE, D. Ojeda, Graduate Student, IEEE and A. Vargas, Senior
Member, IEEE
 Since it is very well-known, mathematically the CTEP is an
Abstract-- In the framework of the electric industry where the
generation is competitive, the regulation visualizes different
schemes of transmission network expansion planning, among
them the Centralized Transmission Expansion Planning CTEP is
recognized, which is important in the Latin American
environment. Very little effort has been assigned to solve the
dynamic model of the CTEP, because of the complexity of the
optimization problem, which has been simplified in static and
multi-stage models to reduce the calculation time, but from this
viewpoint the commissioning year in service has been ignored. In
this research, a methodology for the decision-making in the
CTEP solution process, under a deterministic framework is
proposed. A hybrid approach in order to solve the dynamic
model of the CTEP is developed, based on: a meta-heuristic
evolutionary algorithm, a heuristic procedure and the classic
dynamic programming method.
Index Terms-- Competitive markets, dynamic model, dynamic
programming, evolutionary meta-heuristic algorithm, heuristic
procedure, long-term, multi-period, optimal investment
sequence, transmission planning.
I. INTRODUCTION
I N the framework of the electric industry where the
generation is competitive, the regulation handles different
intervention modalities in relation to the expansion planning
of the transmission network. In this framework, three basic
modalities of the transmission expansion planning can be
recognized:
1. Developed by the Regulator.
2. Carried out by a group of agents and approved by the
Regulator.
3. Carried out by the transmission company based on an
Indicative Plan of Generation and approved by the
Regulator.
The last planning modality is important in the Latin American
environment, since it is carried out in countries like: El
Salvador, Panama, Brazil, Colombia and Peru. It is also
known as Centralized Transmission Expansion Planning
CTEP.
This work was supported by the Electrical Energy Institute IEE of
National University of San Juan, Argentina, and by Deutscher Akademischer
Austausch Dienst DAAD, Germany.
The Authors are with the Electrical Energy Institute IEE, from National
University of San Juan, Argentina (e-mail: guaman@iee.unsj.edu.ar,
dojeda@iee.unsj.edu.ar, avargas@iee.unsj.edu.ar).
978-1-4577-0487-1/10/$26.00 2010 IEEE
581
integer-mixed problem of optimization, not lineal and not
convex. The solution to the dynamic model of the CTEP
results in producing the quantity and type of transmission
facilities, their location in the power system and the scheduled
year of these throughout the planning horizon.
Very little effort has been devoted in solving the dynamic
model of the CTEP [9] - [11], because of the complexity of the
optimization problem, which has been simplified in static and
multi-stage models to reduce the calculation time. Both, static
as multistage models determine the number of transmission
lines (TL) that should be installed at the end of each stage [3]-
[4]. However, under this classic perspective, the scheduled
year of the transmission facilities has been ignored.
Three strategies could be used to solve the dynamic model
of the CTEP. i) Solve a series of static planning problems
sequentially for each year of the planning horizon, starting
from the first year. Then in the next year, the problem would
be resolved by considering the addition of TL in the previous
year and so on sequentially until the last year planning
horizon. ii) Solve the static planning problem in the last year
planning horizon and then solve a dynamic programming
problem to determine the commissioning year into service of
each of the TL. iii) Implement a multi-stage planning model,
where each stage comprises a year of planning horizon.
Through this strategy, the dynamic planning problem would
be solved in one step.
A huge computational effort to develop the proposed
multistage model is evident, as well as in the first strategy,
where a static problem is solved many times as years has the
planning horizon. In this work, we have adopted the second
strategy, which begins to solve the planning problem from last
year, which exactly is the year that more stresses on the
network.
The methodology comprises two stages: i) first, a spatial
optimization of the transmission system is carried out, and ii)
in the second stage, the timing expansion of the system is
optimized. The methodology also is based on a "backward"
procedure, under a deterministic framework, where the main
objective is to solve the dynamic model of the CTEP.
Typically, optimization methods have been applied separately
to solve the problem of the CTEP. With the purpose of
exploiting the advantage offered by each one of them, this
work develops a hybrid approach based on: a meta-heuristic
582 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America
evolutionary algorithm, a heuristic procedure and the classic
dynamic programming method.
In the spatial optimization of the transmission system, the
static planning in the last year of the planning horizon, which
the system should spread towards is solved, by applying it to
the Evolutionary Particle Swarm Optimization method EPSO.
In this stage, the quantity of TL and their location within the
power system are determined, that is to say the respective
rights-of-way where these TL should be installed.
For the second stage, in the timing optimization of
expansion, the dynamic programming method is applied,
whose objective is to determine the year committed in service
of the TL that were obtained in the spatial optimization. In this
part, the study horizon of the CTEP is divided into annual
periods, where each one has associated a defined quantity of
states. The problem of timing optimization of expansion of the
CTEP presents a large quantity of states and feasible paths,
hindering the application of the dynamic programming and the
process of calculation of the optimal sequence, since the
planner has to analyze each one of the states in every period.
Therefore, it is necessary to use some technique to simplify
the number of states and feasible paths. In this work, this
problem is solved by a heuristic method that is based on the
overloaded rights-of-way and in the rights-of-way that have
reached their maximum transmission capacity. Finally, the
dynamic programming procedure is applied to find the optimal
the dynamic model of the CTEP presented in [4] is very
difficult to solve for large and medium-sized systems. Hence,
the mathematical model of the CTEP has been simplified in
static and multi-stage models. In the static model, the planning
horizon is considered single stage [2] - [8]. In the multi-stage
planning in [4], the planning horizon is divided into several
stages, for example in five year-stages, and in that context the
equipment that should be installed every five years should be
determined.
The study horizon of the CTEP of long-term spans periods
of time longer times than 10 years. Therefore, when dividing
the study horizon in annual stages or periods, it greatly
increases the complexity of the optimization problem. In this
article, with the methodology proposed is possible to
overcome the existing difficulties and to solve the dynamic
model of the CTEP in a long-term horizon of annual periods.
The spatial optimization problem in this work is resolved
starting from an indicative generation plan; therefore the
investment variables in generation in the mathematical model
are simplified. In this way, the static model used in the spatial
optimization and obtained from the model presented en [4]
becomes the following form:
Minimize:
co ( g PNS
1
CT cij nij  j j )< g j  C PNS k (1)
strategies of minimum cost of the CTEP. The proposed 1  I T
 i , j  j k
methodology is applied to a small power system of 6 nodes,
for a planning horizon of 10 years, under a framework of Subject to:
deterministic parameters. S f g d - PNS

 T 
This paper is organized as follows: in chapter II, the DC
fij  J ij T j
0
nij  nij 0
mathematical model for the spatial optimization of the i

transmission network is described. In chapter III, the

developed methodology to solve the dynamic model of the

f ij d nij  n ij
0
f ij

CTEP is explained. Then, in chapter IV, the test system and 0 d gj d gj

the input parameters to the process of the CTEP are specified.
In chapter V, the results obtained when applying the hybrid
approach are shown, and finally in chapter VI, the outstanding
conclusions are described.
II. MODEL MATHEMATICAL FOR SPATIAL OPTIMIZATION OF
THE TRANSMISSION NETWORK
The mathematical models used to represent the
optimization problem of the expansion planning of the
transmission network are of several types and different levels
of complexity. Among the main models described in [1] and
[2], the DC model is used in this study. The described models
were proposed initially to solve the problem of the CTEP of a
single stage; however, these have been extended to solve the
problem of the multi-stage CTEP [3] - [5], [12]. In [4], a DC
mathematical model of general character is outlined, in which
the objective function considers the investment in candidate
generation projects and the investment in transmission lines,
as well as the system operational costs for a long-term
planning horizon.
In the dynamic model, the committed date in service of the
transmission facilities is also a decision variable. Obviously,
0 d PNS k d d k
0 d n ij d n ij
n ij entero, T ij unbounded
(i, j ) :, k *
Where:
CT : Total present value of the expansion and operation cost
co j : Annual operation cost of the generation unit j
CPNS : Cost of loss of load or cost of the curtailment power
I : Discount rate
cij : Cost of a circuit in the i-j right-of-way
nij : Number of circuits that were added to the i-j right-of-way
nij0 : Number of circuits in the i-j right-of-way in the initial
configuration
fij : Power flow in the i-j right-of-way
J ij : Susceptance of the circuits in the i-j right-of-way
g j : Active power injected by the generation unit j
GUAMAN GUAJALA AND VARGAS : CENTRALIZED EXPANSION PLANNING OF THE
S: Matrix of incidences of nodes and branches
f: Vector of power flows i-j
g: Vector of active power injections of the generation units g j
d: Vector of power demand
PNSk : Curtailment power in the k nodes because of deficit in
transmission capacity
T : Vector of angles of nodal voltage
f ij , nij , g j : Upper limits of the decision variables
: : set of all rights-of-way
* : set of load nodes, where there is loss of load
III. A HYBRID APPROACH FOR SOLVING THE DYNAMIC MODEL
OF THE CTEP OVER A LONG-TERM HORIZON
The methodology proposed in this research is carried out in
gradual form, based on a hybrid approach and a backward
procedure to reach reasonable calculation times. It begins with
a spatial optimization in the last year of the planning horizon
and then a timing optimization of expansion of the
transmission plan found in the spatial optimization is carried
out. It can be observed in the diagram of blocks of the Fig. 1.
The objective is to achieve the multi-annual transmission
expansion plan over the long-term.
583
be found in [13]-[16] giving a vision of the EPSO, although in
this work only a general description of the EPSO is made. It
can be described in the following way: for a given iteration,
there is a group of solution or alternative denominated
particles. Each particle is defined by a position in the search
space (Xi) and a speed (Vi). In any given moment, there is at
least one particle that has the best position (bg) in the search
space. The population of particles recognizes such position,
then the particles spread to move in that direction, each
particle is also attracted to its best previous position (bi). The
particles are reproduced and evolved among a number of
generations according to the following steps:
REPLICATION: each particle is replied a number of r times,
giving place to new particles.
MUTATION: The movement of the particles is affected by
the mutation of strategic parameters wi.
REPRODUCTION: each mutated particle generates an
offspring according to the movement rule of the particle.
EVALUATION: each offspring is evaluated with a function
objective.
SELECTION: by means of a stochastic tournament or
another selection process, the best particles survive to form a
new generation.
The movement rule or producing offspring of the particles
is the following one: given a particle Xik , a new particle
X ik+1 results from:
X i( k 1) X i( k )  Vi( k 1) (2)
Vi ( k 1)
wi*1Vi( k )  wi*2  bi  X i   wi*3  bg* 
 Xi P (3)

Fig. 1. Hybrid Approach for solving the dynamic model of the CTEP
A. Spatial Optimization
In this stage, the optimization problem of the CTEP in the
last year of the planning horizon is solved by means of the
evolutionary meta-heuristic algorithm Evolutionary Particle
Swarm Optimization EPSO. It is a novel meta-heuristic
algorithm of optimization that can be seen as a hybrid method
of Evolutionary Strategies/Evolutionary Programming and of
the Particle Swarm Optimization PSO. In competition with
other meta-heuristic algorithms, EPSO has achieved
successful results in many problems related with the power
systems, positioning to the method as a serious option when
one has to solve complex optimization problems [13].
Because of that a wide and solid theoretical framework can
Where:
bi: better point found by the particle i in their past life to up the
current generation
bg: global better point found by the swarm of particles in their
past life up to the current generation
X ik : location of the particle i at generation k
Vi( k ) X i( k )  X i( k 1) : speed of the particle i at generation k
wi1 : weight conditioning the inertia term
wi 2 : weight conditioning the memory term
wi3 : weight conditioning the cooperation or information
exchange term
P: communication factor
In the movement rule the symbol * means that those
parameters will undergo evolution as products of the mutation
process. The mutation rule that affects the weights is:
W
wik* wik > log N (0,1) @ (4)
Where:
logN (0,1): is a random variable with lognormal distribution
derived from a Gaussian distribution N(0,1) of mean 0 and
variance 1.
584
W : is an externally fixed-learning parameter, which controls
the width of the mutations.
In an approximated form the following one can be used as a
mutation rule for the weights:
wik* wik >1  W N (0,1) @ (5)
Where:
N(0,1): is a random variable with Gaussian distribution of
mean 0 and variance 1. Equations (4) and (5) are equivalent
whenever W is small, so that the negative weights are
discarded.
In addition, the best global solution bg is perturbed randomly
to give the following equation:
bg* bg  wi*4 N (0,1) (6)
where wi 4 is the fourth strategic parameter (weight)
associated with the particle i. It controls the size of the
neighborhood of bg, where it is more probable to find the
global best solution or at least a better solution than the current
bg. The weight wi 4 is mutated (denoted by *) according to the
general mutation rule previously described.
With the theoretical framework described in a general
manner, the EPSO model developed in this work and shown in
the diagram of blocks in Fig. 2. allows for obtaining the static
transmission plan in the last year of the planning horizon.
EPSO can also be adapted to work with discrete variables,
through rounding strategies of non-integer variables, as
described in [14]. In this paper, we apply a simple rounding
technique to those particles containing right of way with non-
integer TL (variables). Non-integer value is rounded to the
nearest integer in its neighborhood, ever mindful not to violate
the maximum number of TL in each right of way.
B. Timing Optimization of Expansion Planning
The second stage of the methodology consists in
determining the optimal investment sequence in TL
throughout the planning horizon, which leads to a policy of
minimum total cost, resulting in obtaining the optimal multi-
annual transmission plan and as well as a list of alternative
plans.
The dynamic programming is a technique used to solve
problems wherever it is necessary to make a sequence of
interrelated decisions. The problem of timing optimization of
the CTEP can be resolved by means of this procedure because
it basically complies with the following considerations:
 The dynamic programming method grants the finding of an
optimal solution for problems with functions of non-
continuous costs and non-convex in a non-convex space of
feasible solutions.
 The application of the dynamic programming requires that
the objective function and restrictive conditions are
separable, that is to say, that the Bellmans principle of
optimality is fulfilled. This principle is satisfied by the
problem of the CTEP, since the sequence of decisions
determined as optimal to arrive at a certain configuration j
2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America
to a year of study n, is independent of the future decisions
concerning the incorporation of new components.
1) Formulation of the problem in Dynamic Programming:
The dynamic programming is a general type of approach;
therefore, the equations should be developed in order to be
adjusted to each situation. This concept is based on the
technique that considers the problem as a multi-stage or multi-
period process of decision-making, where the optimal
strategies can be recursively calculated.
Read Data
- Parameters associated
- Current Power System
- Indicative Generation Plan
with EPSO
- Technic and economic
- Load demand , fuel prices
data
Creation of the Initial Population
Random Generation of the transmission
expansion plans (initial particles )
Assessment of the plans of the initial population
Calculation of Fitness Value F = net present value NPV
NPV = Investment Costs in TL + Operational Costs
Cloning of the population
According to the factor r
Mutation of the cloned population
Applying the mutation rule to the plans of
the cloned population
Particles Movement
Application of the movement rule
Assessment of the plans of the cloned population
Selection of the best plans
An elitist selection is applied to the r offspring of each
original plan, and the original population is replaced .
Storing ancestor best plans
The best global plan and the best plan
in each particle stay as latent individuals
No Meets stopping
criterion?
Yes
Optimum Static Transmission Plan
Fig. 2. EPSO Model applied in the spatial optimization.
For the problem of the CTEP, this recursive relationship is
defined as:
f n* ( s ) min { immediate cost of the period n + future
xn
minimum cost (period n+1 forward)}
GUAMAN GUAJALA AND VARGAS : CENTRALIZED EXPANSION PLANNING OF THE
f n* ( s ) ^ `
min csxn  f n*1 ( xn )
xn
(7)
Where to find the optimal decision-making policy when it
begins in the state s in the period n, is required to find the
value xn that minimizes the function f n (s ) , where f n (s ) is
the total cost of investment and operation in the state s in the
period n.
The notation used in the timing optimization of the CTEP is
the following one:
N: total number of periods
n: current period (n = 1, 2, 3,, N)
sn: current state for the period n
xn: decision variable for the period n, given the state s. In this
case, the investment in TL in the period n
xn* : optimal value of xn, given the state sn.
f n ( s n , xn ) : contribution of the periods n, n+1,.., N to
the function objective if the system begins in the state sn in the
period n. xn is the immediate decision of investment and the
optimal decisions are made from this point on.
* *
When defining f n ( s n ) in function of f n1 ( sn 1 ) , (7) is a
recursive relationship of f n* ( s n ) , the recursive relationship
stays recurrent as it moves back year after year. When the
current number of periods is decreased in one, the new
function f n* ( s n ) is obtained when using f n*1 ( sn1 ) , a
function that has been obtained in the preceding iteration. This
process remains recursive until arriving at the initial year.
Owing to this condition, the procedure involves regressive
movement period after period. The procedure is denominated
"backward", to denote the number of remaining periods
towards the destination. In this way, the dynamic
programming finds the optimal investment sequence (optimal
path) in TL throughout the planning horizon.
To find the optimal sequence, the planner has to analyze a
fixed number of states in every period of the planning horizon
and a large number of feasible paths. The set of states in every
period is obtained from the possible combinations among the
TL of the transmission plan of the spatial optimization. In this
work, the planning horizon is divided into annual periods.
Each combination gives origin to a state, the total number of
combinations that should be analyzed in every year is 2L,
where L is the number of TL of the transmission plan
mentioned. Therefore, while the number of TL increases, the
number of combinations increase exponentially, being able to
reach an excessively high number of states.
The dynamic programming finds the optimal path
successfully when the number of states in every period is not
too high. In contrast to this, the outlined problem of the CTEP
presents a huge number of states in every year of cut and
therefore a great quantity of feasible paths, which leads to a
task of enormous calculation effort in the process of decision-
making. Therefore, some technique should be used to simplify
the number of states and of feasible paths that should be
evaluated by the planner.
585
2) Heuristic Procedure:
The dynamic programming is a strategy of optimization
and not a closed algorithm. This permits an easy incorporation
of different calculations and subordinates heuristic procedures
during the optimization process.
The problem related to the huge quantity of states and
feasible paths can be solved for heuristic methods. These
methods have been used as an alternative to the methods of
mathematical optimization in the field of power system
planning. The use of the heuristic algorithms is very attractive,
because they can meet good feasible solutions with little
computational effort.
The heuristic model proposed takes into account the
overloaded rights-of-way and those that have reached their
maximum transmission capacity. The procedure starts
analyzing the transmission configuration of the current year
n=0 in the following year of cut n=1 or destination period. In
n=1 the planner carries out the optimal power flow of the
mentioned configuration. Then, the presence of overloads in
the rights-of-way and also the rights-of-way that has reached
their maximum transmission capacity are analyzed. If there is
more than an overloaded right-of-way, the planner will add a
TL in the right-of-way that presents the percentage index of
overload of largest magnitude. This index is obtained of the
ratio between the real flow and the maximum limit of flow of
active power of the overloaded respective right-of-way, as in
(8).
f dv
isc *100 (8)
f dv
Where:
isc: index of overload percentage
f dv : real flow of active power of the right-of-way
f dv maximum limit of flow of the active power of the right-
of-way
This process is carried out successively until the
elimination of the overloads is achieved; after this a
configuration will be created, the same one that could be
identified in the set of configurations obtained initially.
When some right-of-way has reached its maximum
transmission capacity, the planner will add one TL to reduce
the load level of the corresponding right-of-way. If there is
more than a right-of-way that has reached its maximum
transmission capacity, the planner will evaluate the resulting
number of combinations of the rights-of-way mentioned.
Similarly, for each analyzed combination that reduces the load
level of the rights-of-way, a configuration is obtained. When
eliminating the overloads and the load level of the rights-of-
way is reduced, the planner will only have identified the
necessary configurations for the period n=1. The
configurations identified in the period n=1 are analyzed in the
period n=2 and this way in successive form until arriving to
the optimal configuration of the last year of cut.
When using this procedure period after period, the planner
goes creating a net of feasible paths, where are only immersed
586
the necessary configurations that alleviate the overloads and
reduce the load level of the rights-of-way. The procedure
heuristic used in this study is shown schematically in the
diagram of blocks of Fig. 3.
Where:
rw: right-of-way
mtc: maximum transmission capacity
OPF: optimal power flow dc
OPI: overload percentage index
Fig. 3. Heuristic procedure used in the timing optimization.
IV. TEST SYSTEM AND INPUT PARAMETERS OF THE CTEP
The proposed methodology is applied to a modified version
of the Garvers system. This system has six nodes and 15
rights-of-way for the addition of new circuits or TL. The
initial configuration of the system is shown in Fig. 4.
The indicative generation plan shown in Fig. 5. is an
external parameter proposed by the planner, which comprises
thermoelectric generation units that use fuel-oil, gas and coal.
The data of load demand is shown in TABLE I. It is supposed
that the demand grows to an annual rate of approximately 8%.
The fuel prices and the demand growth rate are the result of
the simulation of these input parameters through stochastic
models developed during the execution of this work. Other
data of the test system can be found in [2].
V. RESULTS OF THE METHODOLOGY
A. Spatial Optimization
The optimization problem has 51 variables, 15 of them are
integer variables. The algorithm of optimization EPSO was
programmed in MATLAB. The most important aspects of the
implemented EPSO are the following ones: The population
size is of 80 particles. Each particle represents a solution to the
problem of spatial optimization, specifically an expansion
2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America
plan. An expansion plan, in the EPSO model is coded by a
numeric vector of 15 digits. Each digit means the number of
existing TL in the corresponding right-of-way.
Fig. 4. Initial configuration of the modified Garvers system.
The stop criterion of the algorithm for this problem is based
on a defined number of generations, which has been defined
after a series of tests of the algorithm. The maximum number
of generations so that the algorithm reaches the best solution is
of 50 generations. The parameters strategic wi1, wi2, wi3 and wi4
have been taken of [14], where the EPSO has been applied to
solve the problem of classical dispatch. The assigned initial
weights are: [0,5; 0,5; 0,5; 1,0]. The learning rate W has also
been taken of [14]. The algorithm was run 100 times with
values of W = 1; W = 1,5 and W = 2,0 to evaluate the robustness
of the algorithm. In most of the cases the optimal solution was
obtained.
The best results were obtained when W took the value of
2,0. The number of clones is r = 3 (including the original
particle). The mutation rule used in this study is as in (5) and
the communication factor P=1.
After applying the EPSO model to solve the spatial
optimization, the costs and the new TL of the optimal
expansion plan and 3 other plans near the optimal plan are
shown in TABLE II. The plans are ranked by costs.
B. Timing Optimization
According to the optimal transmission plan of TABLE II,
five are the new TL that will be installed in the power system
along the planning horizon. The number possible of
combinations for the optimal plan is 25 = 32, i.e., that the
planner should analyze 32 states in every year of cut.
In Fig. 6., the diagram of states and of feasible paths for
plan 3 of TABLE II is shown. In this case, the number of
states in every year of cut is 27=128.
GUAMAN GUAJALA AND VARGAS : CENTRALIZED EXPANSION PLANNING OF THE 587

Fig. 5. Indicative Generation Plan along the planning horizon.

TABLE I
LOAD DEMAND ALONG THE PLANNING HORIZON
Expected Peak Load Demand [MW]
Current Years
Node 0 1 2 3 4 5 6 7 8 9 10
1 140 151 163 176 190 206 222 240 259 280 302
2 300 324 350 378 408 441 476 514 555 600 648
3 40 43 47 50 54 59 63 69 74 80 86
4 220 238 257 277 299 323 349 377 407 440 475
5 300 324 350 378 408 441 476 514 555 600 648
Total 1000 1080 1167 1259 1359 1470 1586 1714 1850 2000 2159

TABLE II
TRANSMISSION PLANS LIST RANKED BY COSTS
Transmission Expansion Plans For plan 3, the total number of states decreases
Total Cost [$]
Number of new transmission lines considerably from 1154 to 54 states, making the application of
right- the dynamic programming easier.
[12 13 14 15 16 23 24 25 26 34 35 36 45 46 56]
of-way
Plan 1 [0; 0; 0; 0; 0; 2; 0; 0; 0; 0; 1; 0; 0; 2; 0] 1.566.516.221,75 The method of dynamic programming and the heuristic
Plan 2 [0; 0; 0; 0; 0; 1; 0; 0; 1; 0; 2; 0; 0; 2; 0] 1.571.866.324 procedure were applied to all the transmission plans of
Plan 3 [0; 0; 0; 0; 0; 2; 0; 0; 1; 0; 2; 0; 0; 2; 0] 1.577.011.532 TABLE II, in order to evaluate their optimal policies of
Plan 4 [0; 0; 0; 0; 0; 2; 0; 0; 1; 0; 1; 0; 0; 1; 0] 1.619.942.730 minimum cost. The results are shown in TABLE III.
Just as it is observed in TABLE III, when analyzing the
In Fig. 6., the numbers external to the node or circle counts results from the static planning perspective, Plan 1 is the plan
the total quantity of states in the whole planning horizon, of minimum cost. When the timing optimization is performed,
1154.While the numbers inside the node or circle counts the the ranking of the plans changes, in this case Plan 3 is the
states in every year of cut, 128. expansion alternative of minimum cost. The optimal sequence
The numbers inside the circle also represent the number of of investments according to plan 3 is presented in TABLE IV.
the system configuration. The planner would have to analyze The planner should make the decision of investing in 1 TL
exactly 290 states for the optimal plan and 1154 states for plan in the right-of- way 3-5 in the year 1. Then in the year 2, the
3. When applying the heuristic procedure, the number of planner should invest 1 TL in the right-of-way 2-6. The
feasible paths that would contain to the optimal policies is planner should not carry out investments from now on, if not
decreased. until the 7th year and then in the 9th year.
TABLE III
COST OF THE TRANSMISSION EXPANSION PLANS
Plans Spatial Optimization Timing Optimization
Cost [$] Rank Cost [$] Rank
Plan 1 1.566.516.221,7 1 2.915.946.643 4
Plan 2 1.571.866.324 2 2.897.030.885 2
Plan 3 1.577.011.532 3 2.892.505.568,87 1
Plan 4 1.619.942.730 4 2.914.569.564 3

TABLE IV
OPTIMAL SEQUENCE OF INVESTMENTS
Year committed in Number Right-of-way
service of TL
1 1 3-5
2 1 2-6
7 2 2-3, 4-6
9 3 2-3, 3-5, 4-6

Fig. 6. State diagram and feasible paths of Plan 3.

588
VI. CONCLUSIONS
In this research, the dynamic model of the CTEP is solved
from a deterministic viewpoint and within the framework of
competitive electric markets, for a long-term horizon.
The methodology implemented separates the problem of the
CTEP in two stages, carrying out a spatial and timing
optimization in hierarchical form. To solve the involved tasks,
a hybrid approach that comprehends three optimization
methods is used. By means of an evolutionary meta-heuristic
algorithm EPSO developed in this work, the spatial
optimization is solved. In the timing optimization, the number
of existing states and feasible paths between the initial year
and the last year of the planning horizon becomes increasingly
exponential as the number of TL that conform the resulting
plan of the spatial optimization is increased. To overcome this
problem of combinational explosion, a heuristic procedure
based on the overloads and the rights-of-way that have
reached their maximum transmission capacity is intended. By
means of this procedure the number of states and feasible
paths is decreased, facilitating the application of the dynamic
programming. Finally, by means of this methodology a
process for decision-making is proposed, obtaining the
optimal sequence of investment decisions in TL for a long-
term horizon of 10 years.
So far, we have presented the results of the strategy
adopted in this work, since this is one of the first of a series of
papers. In the future we will compare the results with those
obtained by applying other strategies.
VII. REFERENCES
[1] 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. September 2003, Vol. 150, No. 5.
[2] R. Romero, A. Monticelli, A. Garca, S. Haffner, Test systems and
mathematical models for transmission network expansion planning,
IEE Proc.-Gener. Transm. Distrib., January 2002, Vol. 149, No. 1.
[3] I. J. Silva, M. J. Rider, R. Romero, and C. A. Murari, Genetic
Algorithm of Chu and Beasley for Static and Multistage Transmission
Expansion Planning, IEEE 2006.
[4] A. H. Escobar, R. A. Gallego, and R. Romero, Multistage and
Coordinated Planning of the Expansion of Transmission Systems, IEEE
Transactions on Power Systems, vol. 19, No. 2, May 2004.
[5] E. N. Asada, A. V. Garca, E. Carreo, and R. Romero, A Branch-and-
Bound Algorithm for the Multi-Stage Transmission Expansion
Planning, IEEE, 2005.
[6] R. Romero, R. A. Gallego, and A. Monticelli, Transmission system
expansion planning by simulated annealing, IEEE Trans. Power Syst.,
11, (1), pp. 364-369, 1996.
[7] R. D. Cruz-Rodrguez, and G. Latorre-Bayona, HIPER: Interactive
Tool for Mid-Term Transmission Expansion Planning in a Deregulated
Environment, IEEE Power Engineering Review, pp. 61-62, November
2000.
[8] R. A. Gallego, A. Monticelli, and R. Romero, Transmission system
expansion planning by extended genetic algorithm, in Proc. IEE 1998,
Gener. Transm. Distrib, 145, (3), pp. 329-335.
[9] J. C. Kaltenbatch, J. Peshon, and E. H. Gehrig, A mathematical
optimization technique for the expansion of electrical power
transmission systems, IEEE Trans. Power Apparat. Syst., vol. PAS-89,
pp. 113-119, Feb. 1970.
[10] Y. P. Dusonchet and A. H. El-Abiad, Transmission planning using
discrete dynamic optimization, IEEE Trans. Power Apparat. Syst., Vol.
PAS-92, pp. 1358-1371, July 1973.
[11] H. K. M. Youssef, Dynamic Transmission Planning using a
Constrained Genetic Algorithm, Electrical Power and Energy Systems
23, 857 862, 2001.
2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America
[12] S. Haffner, A. Garca, A. Monticelli, and R. Romero, Planejamento
Dinmico da Expanso de Sistemas de Transmisso de Energia Eltrica
considerando Mltiplos Estgios, XV SNPTEE, Brasil, Outubro 1999.
[13] V. Miranda, and N. Fonseca, New Evolutionary Particle Swarm
Algorithm (EPSO) Applied to Voltage/Var Control, Proceedings of
14th Power Systems Computation Conference (PSCC'02), Sevilla,
Spain, 24-28 Jun, 2002.
[14] V. Miranda, Evolutionary Algorithms with Particle Swarm
Movements, ISAP, 2005.
[15] R. M. Pringles, V. Miranda, and F. Garces, Expansin ptima del
Sistema de Transporte implementando EPSO, VII Latin American
Congress on Electricity Generation & Transmission, October 24-27
2007.
[16] V. Miranda and N. Fonseca, EPSO Evolutionary Particle Swarm
Optimization, a New Algorithm with applications in Power Systems,
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.99.
Wilson Guamn (M10) obtained the degree of
Electric Engineer from Escuela Politcnica Nacional
in Quito, Ecuador in 2003. From 2003 - 2005, he
worked as Maintenance Engineer in a private
maintenance service company for the Ecuador
Transmission System.
Currently, he is a candidate to obtain his Ph.D.
degree in Electric Engineering from the Instituto de
Energa Elctrica from Universidad Nacional de San
Juan, in San Juan, Argentina. Between January and
May of 2010, he visited the Elektrische Anlagen und
Netze Institute from Duisburg-Essen Universitt in Duisburg, Germany as a
researcher. His special fields of interest include transmission expansion
planning under a framework of uncertainties, methods of optimization and the
application of artificial intelligence techniques in power systems.
Diego Ojeda-Esteybar (GS99) received his
undergraduate degree in Electrical Engineering from
the Universidad Nacional de San Juan (UNSJ),
Argentina in 2005 and the Ph.D. degree in Electrical
Engineering in 2010 from the Universidad Nacional
de San Juan (UNSJ). At present, he is a Research
Assistant and Professor of undergraduate and
postgraduate studies at the Instituto de Energa
Elctrica (IEE)UNSJ. His research is dedicated to
optimal scheduling of integrated natural gas and
electric power systems, energy storage modeling and
energy price forecasting.
Alberto Vargas (M97SM08) received
Electromechanical Engineering degree in 1975 from
the Universidad Nacional de Cuyo, Mendoza,
Argentina, and the degree of Ph.D. in Electric
Engineering in 2001 from the Universidad Nacional
de San Juan, San Juan, Argentina.
From 1985, he has been a Chief Researcher in
Competitive Electric Markets in the Instituto de
Energa Elctrica of the Universidad Nacional de
San Juan (IEE-UNSJ). At the present time, the Dr.
Vargas is a Professor of the Postgraduate Program of
the IEE-UNSJ and he is Senior Member of the IEEE Power Engineering
Society.