Beruflich Dokumente
Kultur Dokumente
Keywords: Simulated Annealing (SA) Unit Commitment (UC) and Economic Dispatch Problems
(EDP).
I. INTRODUCTION
Energy is the primary and most universal
measure of all kinds of work by human beings and
nature. Everything that happens in the world is the
expression of flow of energy in one of its forms
Energy is an important input in all sectors of a
countrys economy. The standard of living is directly
related to per capita energy consumption. Due to
rapid increase in the population and standard of
living; we are faced with energy crisis. Conventional
sources of energy are increasingly depleted. Hence,
Non Conventional Energy Sources have emerged as
potential source of energy in India and world at large.
During the past decades, the electric power industry
has undergone significant changes in response to the
rising concerns of global climate change and volatile
fossil fuel prices. For more efficient, reliable, and
environmentally friendly energy production, it is
critical to increase the deployment of distributed
generation, especially from Renewable Energy
resources (RE), as well as distributed Energy Storage
(ES). This trend has evolved into the concept of a
microgrid which can be described as a cluster of
distributed energy resources, energy storage and local
loads, managed by an intelligent energy management
system. Similar to bulk power grid operation,
microgrid operation can be determined by Unit
Commitment (UC) and Economic Dispatch(ED). The
All Rights Reserved 2017 IJORAT
11
Simulated
annealing (SA)
is
a probabilistic technique for approximating the global
optimum of a given function. Specifically, it is
a metaheuristic to approximate global optimization in
a large search space. It is often used when the search
space is discrete (e.g., all tours that visit a given set
of cities). For problems where finding an
approximate global optimum is more important than
finding a precise local optimum in a fixed amount of
time, simulated annealing may be preferable to
alternatives such as gradient descent. The name and
inspiration come from annealing in metallurgy, a
technique involving heating and controlled cooling of
a material to increase the size of its crystals and
reduce their defects. Both are attributes of the
material that depend on its thermodynamic free
energy. Heating and cooling the material affects both
the temperature and the thermodynamic free energy.
The simulation of annealing as an approach that
reduces a minimization of a function of large number
of variables to the statistical mechanics of
equilibration (annealing) of the mathematically
equivalent artificial multi atomic system was first
formulated by Armen G. Khachaturyan, Svetlana V.
Semenovskaya, Boris K. Vainshtein. These authors
used computer simulation mimicking annealing and
cooling of such a system to find its global minimum.
Simulated annealing interprets slow cooling as a slow
decrease in the probability of accepting worse
solutions as it explores the solution space. Accepting
worse solutions is a fundamental property of
metaheuristic because it allows for a more extensive
search for the optimal solution.
B. PROCEDURE FOR SA ALGORITHM
1.
2.
3.
4.
5.
6.
12
start
END
Figure 1: Flowchart Of Simulated Annealing Algorithm
Fig 1 shows the flowchart of the Simulated
Annealing algorithm which has the main advantage
of the low time consumption. The main and the first
step of this process were initializing all the necessary
values. Then check the limitation of the power flow
constraints. If it was satisfied then update all the
initialized values. This process repeated again and
again until the optimized values were obtained.
13
7.00
8.91
6.05
20.07
8.00
10.07
5.70
31.09
9.00
10.86
4.50
40.05
10.00
10.93
4.00
46.08
11.00
13.36
3.65
49.03
12.00
16.90
3.45
48.77
13.00
17.47
3.70
46.05
14.00
19.83
3.25
41.06
15.00
21.43
2.70
33.33
16.00
21.76
3.40
23.82
17.00
18.76
3.45
0.00
18.00
18.67
2.30
0.00
19.00
17.21
2.70
0.00
20.00
17.24
2.85
0.00
21.00
18.21
3.05
0.00
22.00
19.40
3.45
0.00
23.00
16.91
4.10
0.00
24.00
17.73
4.25
0.00
3.36
15.70
0.00
3.00
3.80
15.10
0.00
4.00
5.00
14.00
0.00
5.00
5.57
9.00
1.81
6.00
7.33
7.35
8.81
14
Hou
r
1.00
Load
dema
nd
(kW)
32.93
2.00
30.40
11.34
14.00
48.27
-15.86
3.00
29.13
10.23
15.00
47.93
-9.53
4.00
28.43
9.43
16.00
47.69
-1.30
5.00
28.60
12.22
17.00
48.99
26.78
6.00
28.74
5.25
18.00
49.94
28.97
7.00
33.06
-1.98
19.00
47.76
27.84
8.00
39.71
-7.15
20.00
44.71
24.62
9.00
44.94
-10.46
21.00
42.69
21.42
10.0
0
11.0
0
12.0
0
47.37
-13.64
22.00
42.19
19.34
47.91
-18.13
23.00
41.07
20.06
48.39
-20.74
24.00
36.53
14.55
2:00
3:00
4:00
5:00
6:00
7:00
8:00
9:00
10:00
11:00
12:00
13:00
14:00
15
16:00
17:00
18:00
19:00
20:00
21:00
22:00
23:00
0:00
19:00
20:00
21:00
22:00
23:00
0:00
23.1061080
32.0440809
40.5269757
10.2841441
29.2307531
39.8519228
0
0
0
0
0
0
0
0
0
0
0
0
The
simulated
annealing
algorithm
optimizing the power required for compensating the
load demand as well as reducing the cost for the
while system. Where the battery storage systems are
not allowed to charge form the Diesel generator
outputs and also not allowed to discharge beyond its
own DOD
The Economic dispatch from the proposed
stochastic model is shown in the following table 8
The power delivery is based on the load requirement
as well as battery SOCs, renewable energy
generations.
Table 8: Power delivery based on load and battery
SOCs.
Hour
PDG
PVRB
PAGM
(kW)
(kW)
(kW)
1:00
24.5386332 8.49831691 7.82929037
2:00
3:00
4:00
5:00
6:00
7:00
8:00
9:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
18:00
37.7515813
19.1298446
41.7198112
34.69597582
18.3610523
0
0
0
0
0
0
0
0
0
0
7.41401691
28.7940791
0
0
0
0
0
-8.5004205
7.90017258
-8.6410110
4.7871266
-5.4613604
3.3408634
8.8137456
-4.2716087
-8.3796460
8.09067149
0
0
0
0
0
0
0
-11.287087
9.65508073
-8.5775860
7.88088517
-10.958428
10.4921866
-9.9692017
6.42882152
-7.3452788
8.08952564
0
0
16
ACKNOWLEDGMENT
First of all we would like to thank the almighty for giving
me sound health throughout my paper work. This research
was supported/partially supported by our college. We thank
our staffs from our department who provided insight and
expertise that greatly assisted the research, although they
may not agree with all of the interpretations/conclusion of
this paper.
REFERENCES
1. D. P. Bertsekas, Dynamic Programming: Deterministic
and Stochastic Models, D. P. Bertsekas, Ed. Englewood
Cliffs, NJ, USA: Prentice- Hall, 1987.
2. H. Bilil, G. Aniba, and M. Maaroufi, Probabilistic
economic emission dispatch optimization of multi-sources
power system, Energy Procedia, vol. 50, no. 0, pp. 789
796, 2014.
17