DISTRIBUTIVNI SISTEM IEC 61968

Sistem upravljanja distribucijom kompatibilan sa IEC 61968 arhitekturom

Standardne aplikacije mapirane na referentni model veza
 OPTIMIZACIJA

Identifikacija problema Eksplicitno definisati

problem i ogranienja

Odreivanje ciljeva Koje ciljeve treba ostvariti?

ta treba min/max (OF)

Identifikacija alternativa Koje su opcije/varijante na

raspolaganju?

Procena alternative Izvriti procenu opcija na osnovu

valjanih kriterijuma.

Izabrati opciju koja najbolje

Izbor najbolje alternative zadovoljava ciljeve imajui u
vidu identifikovani problem.

Finalni plan
 OPTIMIZACIJA/2

Korak 1: Identifikacija problema

Reiti pogrean problem esta greka

Korak 2: Identifikacija ciljeva

Ukoliko ne zna kuda ide, nikada tamo nee stii

Ciljevi (OF) su najee finansijske prirode (min. troka,

maks. dobiti)

Korak 3: Identifikacija alternativa

Najea greka: nedovoljno iroko sagledavanje problema
(prekratak horizont planiranja)

Nisu analizirane (razmatrane) sve alternative (primer)

 OPTIMIZACIJA/3

Korak 4: Ocena alternativa

Ocena alternativa prema ciljevima,

Ocena alternativa prema karakteristikama koje predstavljaju

zahteve korisnika, standarde i ogranienja.

Primer: ukoliko su standardi vezani za napon napajanja iz

opsega 1,05 do 0,95 r.j., alternativa je prihvatljiva ukoliko ima
napone do 0,95 r.j., ne nie.

Korak 5: Odabiranje najbolje alternative

Definicija najboljeg - Da li koriena metod selekcije
(ocenjivanja) moe tano razlikovati alternative.
 OPTIMIZACIJA/4

Primer: Optimalna lokacija i broj kondenzatorskih baterija cilj

smanjenje gubitaka

Fider sa 40 vorova, kandidat za jednu ili vie kondenzatorskih baterija.

Na kraju, automatizovana procedura planiranja odluuje da bateriju broj
jedan postavi u taku A, a bateriju broj dva u taku B.
 OPTIMIZACIJA/5

1.600 kombinacija (402) moguih lokacija dve kondenzatorske baterije na fideru

sa 40 vorova.
Automatizovna procedura za odreivanje pozicija kondenzatora ispitala je
samo one alternative koje su osenene (<2% moguih kombinacija).
 OPTIMIZACIJA/6
Cilj planiranja razvoja prenosnog i distributivnog sistema (PiD) je da
obezbedi dobro organizovano i ekonomino proirenje opreme i
ureaja koji e na budue zahteve, u pogledu potronje el. energije,
odgovoriti sa prihvatljivim nivoom pouzdanosti. Planiranje PiD
podrazumeva utvrivanje buduih potreba sistema PiD, ukljuujui
tane veliine, lokacije, meusobne veze, kao i raspored buduih
proirenja i izmena u okviru distributivnog sistema. Pored toga,
implicitni zahtev gotovo svakog planiranja jeste minimizacija trokova.
Svaki pojedinaan tip, prenosnog ili distributivnog voda, moe se
koristiti za prenos bilo koje koliine energije, sve do njegovog
maksimalnog kapaciteta, iz take A u taku B sa odreenim
posledicama:
snaga se prenosi iz take A u taku B;
pad napona se rauna od take A do take B;
gubici snage stvaraju trokove;
oprema i radna snaga, za postavljanje vodova, stvaraju trokove;
odravanje vodova stvara trokove
 OPTIMIZACIJA/7
Izracunava se ukupna sadanja vredost tridesetogodinjih trokova
za prenos snage na jednu milju kroz vod, u funkciji maksimalnog
godinjeg optereenja (pretpostavljeno je 8760 sati, faktor snage
90%, faktor optereenja 60%, faktor gubitaka 46%), Pmax=10.3MW

Promenljivi troak (svedeni trosak gubitaka energije):

30 1
Tp I (t )2 R EQF C W 8760
t 0 (1 d )t
EQ F faktor gubitaka izraunava se: EQF (LDF )1.912

Cw- cena gubitaka energije (/kWh).

LDF faktor optereenja,
d diskontna stopa,
t vreme (god)
 OPTIMIZACIJA/8
Na slici je prikazana ukupna sadanja vredost tridesetogodinjih
trokova za prenos snage na jednu milju kroz vod, u funkciji
maksimalnog godinjeg optereenja (pretpostavljeno je 8760 sati,
faktor snage 90%, faktor optereenja 60%, faktor gubitaka 46%),
Pmax=10.3MW
 OPTIMIZACIJA/9
Izraunavanje krive trokova drugog provodnika i odreivanje
oblasti u kojoj je jedan provodnik ekonominiji od drugog. Vod 636
MCM takoe ima vei termiki kapacitet (14.9MW umesto 10.3MW)
 OPTIMIZACIJA/10
Analiza est provodnika za izgradnju 12.47kV, nadzemnog fidera,
se koristi za odreivanje opsega u kojem je svaki provodnik
najekonominiji.
 GUBICI SNAGE I ENERGIJE/1
Francuska gubici energije su 5.25%
GUBICI SNAGE I ENERGIJE/2
 GUBICI SNAGE I ENERGIJE/3
Kina -13% gubitaka energije (prenos i distribucija, 2003
god.)
India 22%
Pakistan 28%
Tajland 18%
Koreja 18%
Tajvan 12.5%
USA 7%
Nigeria 44.5% (2004. i 2005. god.)
Srbija 17%-18%
REKONFIGURACIJA (MATEMATIKA FORMULACIJA)
 Equation (12.2) stands for the branch current
constraints.
Equation (12.3) stands for the node voltage constraints.
Equation(12.4) represents Kirchhoff s first law (KCL),
Equation (12.5) represents Kirchhoff s second law
(KVL).
Equation (12.6) stands for topological constraints that
ensure radial structure of each candidate topology. It
consists of two structural constraints:
Feasibility: All nodes in the network must be connected by some
branches, i.e., there is no isolated node.
Radiality: The number of branches in the network must be
smaller than the number of nodes by one unit ( k l * NL = N 1)
 SOLUTION APPROCHES
Heuristic methods
Mathematical programming based methods
Artifical inteligenece base methods
(Multi-objective approach)
 HEURISTIC METHODS

Simple Branch Exchange Method

Enhanced Branch Exchange Method
Rule based approach

The final configuration depends on the initial network configuration.

The solution is a local optima, rather than global optima.
It is time consuming for selecting and operating each pair of switches
as well as computing the corresponding radial network load flow.

Optimal Flow Pattern

Enhanced Optimal Flow Pattern

 Rule -Based Comprehensive Method

Switching branches are divided into three types:

Type I: The switching branches are planned for maintenance in a

short period according to the equipment maintenance schedule.

Type II: The power flows of the switching branches almost reach
their maximal power limits (e.g., 90%).

Type III: The other switching branches that have enough available
transfer capacity under the system operation conditions.
The following rules will be used for the modified heuristic approach
according to the practical system operation experience of the
engineers:
If the switching branches lead to system power losses increase, do
not switch them.
If the switching branches lead to system power losses reduce but
cause the system to be overloaded, do not switch them.
If the switching branches belong to type I mentioned above and
also can lead to reduction of system power losses, select one that
makes maximal power loss reduction, PL I .
If the switching branches belong to type II mentioned above, and
also can lead to reduction of system power losses, select one that
makes maximal power loss reduction, PL II .
If the switching branches belong to type III mentioned above, and
also can lead to reduction of system power losses, select one that
makes maximal power loss reduction, PL III .
Use the following formula to determine the branch that will be switched:

PL i : The change of system power losses before and after the

branch switch.
W : The weighting coefficient of the different type of switching
branches. According to the experiences of the engineers, the
weighting factors of the three types of switches may be 0.1, 0.4, and
0.5,respectively. They may also be adjusted according to practical
system operation situations.
PI SW i : The performance index of the switching branch i . The largest
PI SW i of each switching loop will be switched.
 Optimal Flow Pattern

Compute load flow of initial radial network.

Close all normal open switches to produce loop networks.
Replace branch impedance by the corresponding branch resistance in
the loop and then compute the optimal flow.
Open a switch of the branch that has a minimal current value in the loop.
Re-compute the load flow for the remained network.
Open next branch switch, and repeat previous step until the network
becomes a radial.
Note:
If there are many normal open switches in a network, it means that the
calculation of optimal flow involves lots of loops. The final solution may
not be optimal because of the mutual effects among the loops.
 Enhanced Optimal Flow Pattern
The enhanced optimal flow pattern combines the advantages of two
heuristic algorithms - the approach is based on optimal flow pattern but it
does not close all normal open switches (only closing one switch and
opening one other switch each time). In addition, this method does not
care about the accuracy of network losses. It only focuses on the change
of losses that are caused by switch operation. Algorithm steps:
Open all normal open switches in a network so that the initial network
is a tree structure.
Close any one switch. In this way, there is only one loop in network.
Change the single - loop network into a pure resistance network, and
compute the optimal flow to find the branch with the minimal current
value. Open the switch on this branch.
Compute the load flow for this new radial network, and proceed the
calculation of next switch operation as steps (2) (3).
The algorithm will be stopped after going through all open switches.

Note:
The convergence process and speed are affected by the order of the
switch operation
 ARTIFICAL INTELIGENCE METHODS

Genetic Algorithms
Simulated Annealing Algorithms
Ant Colony Algorithms
Hybrid Algorithms
 SIMULATED ANNEALING ALGORITHM
1. Input: Cooling schedule /*Initial temperature (Tmax), Final temperature (Tmin), Cooling
rate, Number of iterations at a fixed temperature*/.
2. s = s0 ; / *Generation of the initial solution* /
3. Tk = Tmax ; /* Starting (initial) temperature* /
4. k=0;
5. Repeat /*General iteration, k*/
6. Repeat / *At a fixed temperature Tk (at iteration k)* /
7. Generate a random neighborhood solution s;
8. E = f (s) f (s); /*Cost difference*/
9. If E 0 Then s = s; / *Accept s as the current solution*/
10. If f (s) f (sbest)<0 Then sbest = s; /*Accept s as the best solution found so far
(sbest)*/
E / Tk E / Tk
11. Else Accept s with a probability e (If e > random [0,1] accept, otherwise
discard)
12. Until Equilibrium condition / *e.g. a given number of iterations executed at each
temperature Tk */
13. Tk+1 = g(Tk ) ; /* Cooling rate*/
14. k=k+1;
15. Until Stopping criteria is satisfied /* e.g. Tk < Tmin*/
16. Output: Best solution found.
 MIXED - INTEGER LINEAR PROGRAMMING
APPROACH
nsa ,b
min z
aME
La ( ( xa ,ns xa' ,ns ) KLoss a ,ns )
ns 1

a) Power balance

( xa xa' ) ( xa,b xa' ,b ) Dn DGm , (NDGNTOT) n N TOT m N DG

aTn aFn

b) Capacity constraints
nsa
x xa, ,ns
,
a
ns 1
nsa
xa xa ,ns
ns 1
xa,ns wa (Xsega,ns Xsega ,( ns 1) ) 0
xa, ,ns wa, (Xsega,ns Xsega ,( ns 1) ) 0
Xsega,0 0
Xsega,nsa Xmax
a

(a M E ) (ns 1,....., ns a ,b )
 d) Voltage constraints

nsa
Vl Vk Za ( xa ,ns xa' ,ns ) {( wa wa' ) 1} V min
ns 1
nsa
Vl Vk Za ( xa,ns xa' ,ns ) {(wa wa' ) 1} Vmin
ns 1

Vmax Vl Vmin
(a (Fl Tk )) (l , k N TOT )
,

Za (ra sin x a cos ) L a

g) Radiality constraints

aME
(wa wa' ) n TOT - nS

( xaDG xa,DG ) ( xaDG xa,DG ) KDGn (n NTOT )

aTn aFn

KDGn 1 n NDG
KDG n 0 n NDG
 C [$]

Ca ,b,2
Xseg a ,b,2

Xseg a ,b,1 Xseg a ,b,2 Xseg a ,b,3 Xseg a,b,4 X amax

,b x [A]

ca ,ns ca ,ns ca ,ns 1

KLossa ,ns , ns=1,..,nsa
Xseg a ,ns Xseg a ,ns Xseg a ,ns 1

KLossa ,1 KLossa,2 ......... KLossa,nsa ,b

 MULTI-OBJECTIVE OPTIMIZATION MODEL
1. Minimization of power losses

2. Minimizing the deviation of node voltages

3. Branch capacity margin

Multiobjective function
 Global non-inferior solution of the multi-objective problem is one in
which any improvement of one objective function can be achieved
only at the expense of at least one of the other objectives. That is, a
design is non-inferior if improving an objective requires degradation
in at least one of the other objectives

Typically, an infinite number of non-inferior points exist in a given

multi-objective problem.

Decision-maker attempts to generate non-inferior solutions to a

multi-objective problem when trying to obtain a final design.

The decision - maker combines subjective judgment with

quantitative analysis, since the non-inferior optimal solutions
generally consist of an infinite number of points.
Notes on Optimal Flow Pattern Approach
 Fault management - FLISR
Fault location
Isolation
Service restoration
 Fault location

Current method
Impedance method
 Service restoration
Heuristic methods
Mathematical programming based
methods (MILP)
Artificial intelligence based methods
Heuristicki pristup/1
Heuristicki pristup/2
Heuristicki pristup/3
Heuristicki pristup/4
Heuristicki pristup/5
Heuristicki pristup/6
 MILP Model
N cp
~ { ~
min w ( 1 zi ) cli Li d F }
i 1
N nc N no N cp

{ { 1 ( xl x'l
)} cl ( xm x'm ) cm { ( xs x's )} ci zi ci }
l 1 m 1 i 1 s i
The power balance in each node:
~ ~' ~ ~' ~ ~
k k k k
( P P ) ( P P ) Li K pb zi , (i 1,..,N),
kTi kFi
Supply transformer capacity constraints:
~ ~~ ~
( Pk Pk' ) Gq , (q 1, ,N s ),
kFq
Line capacity constraints:
~ ~
Pk Pmax k x k 0
~ ~
Pk' Pmax k x k' 0, (k 1, ,M),
Radiality constraints:

( x k x k' ) 1, (k 1, ,M),
kTi
Branch exclusiveness:

( xk x'k ) 1, (k M ),
Impedance method