Professional Documents
Culture Documents
C. A. Belhadj
M. A. Abido
INTRODUCTION
(1)
IL
IG =
Y 1 Y 2 VL
Y 3 Y 4 VG
(2)
VL
IG =
H 1 H 2 IL
H 3 H 4 VG
(3)
V ok =
nG
2 ki
V i
(4)
i =1
H 2 = Y 1 Y 2
(5)
Vok
VK
(6)
LK = 1 +
[ Y 1] Vok = [Y 2] VG
(7)
3.1 Overview
Simulated annealing is an optimization technique that
simulates the physical annealing process in the field of
combinatorial optimization. Annealing is the physical
process of heating up a solid until it melts, followed by
slow cooling it down by decreasing the temperature of the
environment in steps. At each step, the temperature is
maintained constant for a period of time sufficient for the
solid to reach thermal equilibrium.
Metropolis et al [17] proposed a Monte Carlo method
to simulate the process of reaching thermal equilibrium at a
fixed value of the temperature T. In this method, a
randomly generated perturbation of the current
configuration of the solid is applied so that a trial
configuration is obtained. This trial configuration is
accepted and becomes the current configuration if it
satisfies an acceptance criterion. The process continues
until the thermal equilibrium is achieved after a large
number of perturbations. By gradually decreasing the
temperature T and repeating Metropolis simulation, new
lower energy levels become achievable. As T approaches
zero least energy configurations will have a positive
probability of occurring.
3.2 SA Algorithm
At first, the analogy between a physical annealing
process and a combinatorial optimization problem is based
on the following [16]:
Solutions in an optimization problem are equivalent to
configurations of a physical system.
The cost of a solution is equivalent to the energy of a
configuration.
In addition, a control parameter Cp is introduced to play the
role of the temperature T.
The basic elements of SA are defined as follows : Current, trial, and best solutions, xcurrent, xtrial, and
xbest: these solutions are sets of the optimized
parameter values at any iteration.
Acceptance criterion: at any iteration, the trial
solution can be accepted as the current solution if it
meets one of the following critera; (a) J(xtrial) <
J(xcurrent); (b) J(xtrial) > J(xcurrent) and exp(-(J(xtrial)J(xcurrent))/ Cp) rand(0,1). Here, rand(0,1) is a
random number with domain [0,1] and J(xtrial)and
J(xcurrent) are the objective function values associated
with xtrial and xcurrent respectively. Criterion (b)
indicates that the trial solution is not necessarily
rejected if its objective function is not as good as that
of the current solution with hoping that a much better
solution become reachable.
G
1
5
G
1 .2 0
1.00
V o lta g e (p u )
B us 3
B us 4
0 .4 0
B us 5
B us 6
0 .0 0
0 .4 0
0.60
1.00
0 .8 0
1 .20
1.40
1 .60
1.80
2 .0 0
Lo ad F a ctor
(a)
1.20
1.00
V o lta g e (p u )
O b je ctive F unction
0.30
0.60
0.20
0.32
0 .8 0
0.80
Bus 3
0.60
Bus 4
Bus 5
0.40
Bus 6
0.28
0.20
0.26
0.00
0.40
0.6 0
0.80
1.00
1.20
1.40
1.60
Load Factor
(b)
0.24
0.22
0
10
20
30
Iterations
t4
t7
V1
V2
Qc4
Qc6
0.90
0.90
1.00
1.10
0.00
0.00
1.10
1.10
1.10
1.15
5.00
5.50
1.025
1.100
1.050
1.100
0.000
0.000
0.958
0.984
1.092
1.150
5.000
5.500
Qg1
Qg2
V3
V4
V5
V6
-20.0
-20.0
0.90
0.90
0.90
0.90
100.0
100.0
1.00
1.00
1.00
1.00
38.11
34.80
0.855
0.953
0.901
0.933
35.82
19.35
1.001
1.001
1.000
0.984
---
----
11.61
8.880
Dependent Variables
Generator MVAR
Voltages at load Buses (pu)
1.80
2.00
7
[1]
[2]
[3]
1 .20
Bus 3
[4]
Bus 4
1 .0 0
Bus 5
[5]
Bus 6
0 .6 0
index
0.80
0 .40
[6]
0 .2 0
0 .00
0 .40
0 .6 0
0.80
1 .0 0
1 .20
1 .4 0
1.60
1 .8 0
2.0 0
Load F actor
[7]
(a)
[8]
1 .20
B us 3
1.0 0
B us 4
B us 6
0.6 0
[10]
index
[9]
B us 5
0.80
0 .4 0
[11]
0 .2 0
0 .00
0 .4 0
0.6 0
0 .8 0
1.0 0
1 .2 0
1.40
1.60
1.80
2.00
[12]
Loa d F a ctor
(b)
Fig. 4: L-index values at load buses
(a)
Without optimization
(b)
With Optimization
[14]
CONCLUSIONS
[13]
ACKNOWLEDGEMENT
[15]
[16]
[17]
REFERENCES