You are on page 1of 3

Juan Sebastin Guzmn Feria

Master Thesis

ADVANCE N3.1 MASTERS THESIS SIZING A HYBRID ENERGY


STORAGE SYSTEM IN A POWER SYSTEM
In the present document is shown the flow diagram that ilustrate the procedure to
solve the HESS sizing optimization problem

Juan Sebastin Guzmn Feria


Master Thesis
In the foregoing thesis advance (3), was established the HESS sizing optimization
problem framework. This is carried out along the time planning horizon, which is
divided in scenarios (s) each one representing one day. In turn each scenario is
divided in several periods time. The flow chart in this document is explaining the
optimization process for only one scenario, i.e. for all the time steps that comprise
an scenario, the number of steps depend of the time step duration, the more steps
the better accuracy in the scenarios.
Next, each step of the diagram is explained.

1. INPUT PARAMETERS
All the parameters required for the solution of the optimization problem are put in
place. These are:

Scenarios parameters

PDi ( s ,t ) ; P Ri ( s ,t )

HESS cost data an parameters

ST

ST
r
CE ; CP ;C ST
E ; C P ; P i ; Pi ; ; i ; n

Generator parameters
max
min
max
min
max
N G ; ai ; bi ; c i ; P Gi ; Pmin
Gi ; P Gi ; V Gi V Gi N G ; P Gi ; PGi

Power flow constraints parameters

max
max
V min
; others
PQi V PQi N PQ ; Pl

Optimization problem parameters

N B ; N T ; N S ; t

2. VALUES OF THE SIZING VARIABLES


Due to the nature of the objective function, whose decision variables are the
Energy and Power Capacities (at each bus i ) for both Long and Short-Term
ESS

( E C ,i ; PC , i ; ECST,i ; PCST, i )

, but at the same time are constraints in the HESS

model which is part of the problem. Its necessary to suppose initial values for this
variables, to evaluate the objective function at the first iteration, then it is again

Juan Sebastin Guzmn Feria


Master Thesis
evaluated, updating the values of the decision variables, until a stop criteria be
fulfilled, in this case the maximum number of iterations in the optimization
algorithm.

3. EVALUATION OF THE COST FUNCTION: MIN Total Costs (HESS costs


+ Generation costs)
The problem to be solved is stated in the next objective function. It is solved by
mean of the OPF concept, based on some heuristic technique like PSO, GA,
among others. Is worth to be noticed that the minimization problem must to be
solved as many time as time periods in the problem, e.g. if each time step has a
duration of 10 minutes, this means that each scenario encompasses 144 time
periods.
NS

[ (
NT

NG

ai P2Gi ( s ,t ) +bi PGi ( s , t ) + ci


s=1 t =1

i=1

)]

NB

EC ,i DC E + PC , i DC P + ESTC ,i DC STE + PCST,i DC STP


i=1

4. FULFILL MAXIMUM ITERATIONS


This block refers to the stop criteria. This mean that the numbers of times that
HESS sizing variables are changing and hence the OPF is solved, are limited.
Usually it depends on maximum number of iterations of the solution algorithm.
5. OBTAIN THE OPTMAL SOLUTION
Once the stop criteria is fulfilled, the problem is supposed solved. It means that the
objective function is achieved, and therefore the optimal values of the decision
variables are found.

You might also like