Escolar Documentos
Profissional Documentos
Cultura Documentos
I-54
Where Pimin is the minimum operating limit of ith generator, t
max
Pi is the maximum operating limit of ith generator. Equation G (t ) G0 exp( D ) (8)
(4) is power equilibrium. PL is total transmission line power T
losses. The ED problem considered does not take into account
the transmission line. where G0 is the initial value of the gravitational constant
chosen randomly, is a constant, t is the current iteration and T
N is the total iteration number.
D ¦P P
i 1
i D PL 0 (4)
3.4. Step 4: Update the Gravitational and Inertial
Masses
PD represents the total active power demand in the system.
In this step, the gravitational and inertial masses are updated
3. Gravitational Search Algorithm for each agent at iteration as follows.
Rashedi et al. proposed a new meta-heuristic searching Mai Mpi Mii Mi , i 1,2,...,N (9)
algorithm called Gravitational Search Algorithm (GSA) in 2009.
GSA is a stochastic optimization algorithm population based
fit i t worst t
mi t
search algorithm motivated by the Newton’s laws of gravity and
(10)
best t worst t
mass interaction. According to the proposed algorithm, agents
are assumed to be objects that their performances are measured
by means of masses. The whole agents pull each other by the
gravitational attraction force and this force induces the where fiti(t) is the fitness of the ith agent at iteration t.
movement of all agents globally towards the agents with heavier
masses. In GSA, each mass has four particulars: its position, its mi t
inertial mass, its active gravitational mass and passive M i t N
(11)
¦ m t
gravitational mass. The position of the mass equaled to a
solution of the problem and its gravitational and inertial masses j
are specified using a fitness function [10]. GSA algorithm can j 1
be summarized following steps:
where Mai is the active gravitational mass of the ith agent,
3.1. Step 1: Initialization Mpi is the passive gravitational mass of the ith agent, Mii is the
inertia mass of the ith agent, Mi(t) is the mass of the ith agent at
When it is assumed that there is a system with N (dimension iteration t.
of the search space) masses, position of the ith mass is described
as follows. At first, the positions of masses are fixed randomly. 3.5. Step 5: Calculate the Total Force
Xi x ,..., x
1
i
d
i ,...xin for, i=1,2,…,N (5)
In this step, the total force acting on the ith agent (Fid(t)) is
calculated as follows.
In this step, to execute for all agents at each iteration and best where randj is a random number between interval [0,1] and
and worst fitness are computed at each iteration described as kbest is the set of first K agents with the best fitness value and
follows. biggest mass.
The force acting on the ith mass (Mi(t)) from the jth mass
(Mj(t)) at the specific iteration t is described according to the
best (t ) min fit j (t ) (6) gravitational theory as follows.
j{1,.., N }
M pi (t ) u M aj (t )
worst (t ) max fit j (t ) (7) Fijd (t ) G(t ) ( x dj (t ) xid (t )) (13)
j{1,.., N }
Rij (t ) H
where fitj(t) is the fitness of the jth agent of iteration t , best(t)
where Rij(t) is the Euclidian distance between ith and jth
X (t ), X
and worst(t) are best (minimum) and worst (maximum) fitness
of all agents. agents (t ) and is the small constant.
i j 2
3.3. Step 3: Compute the Gravitational Constant (G(t))
3.6. Step 6: Calculate the Acceleration and Velocity
In this step, the gravitational constant at iteration t (G(t)) is
computed as follows. In this step, the acceleration (aid(t)) and velocity (vid(t)) of
the ith agent at iteration t in dth dimension are calculated through
law of gravity and law of motion as follows.
I-55
Table 1. Setting parameters of proposed approach for test
Fi d (t )
aid (t ) (14) systems
M ii (t )
Test System Test System Test
Parameters
I II System III
vid (t 1) rand i uv di (t ) a id (t ) (15) N 200 150 50
G0 100 100 100
where randi is the random number between interval [0,1]. 10 10 10
T 200 250 300
3.7. Step 7: Update the Position of Agents
4.1. Test System I
th th d
In this step the next position of the i agents in d (xi (t+1))
dimension are updated as follows. This test system considered of 3 thermal units as given in
Table 2. In this case, the total load demand expected to be
determined was PD = 850 MW and other parameters of these
xid (t 1) xid (t ) vid (t 1) (16) generators is taken from ref. [15].
The best total fuel cost result obtained from proposed GSA
and other optimization algorithms such as Artificial Immune
System (AIS), Meta Evolutionary Programming, and Genetic
Algorithm (GA) are compared in Table 4. From the Table 4 it is
clear that result obtained from sum of generation units does not
meet the load demand for AIS approach.
Proposed Meta EP
Units AIS* [15] GA [15]
GSA [15]
1 438.8519 438.8570 - -
2 301.9486 301.9090 - -
3 109.1995 109.2339 - -
Fig. 1. The principle diagram of the GSA [10] Total Power
Output 850 850.00 - -
(MW)
4. Simulation Results Total Cost
8141.790495 8141.7905 8141.7905 8194.3600
($/h)
Proposed approach has been applied to solve ED problem. In *Sum of the generation units are 849.9999 MW according to result obtained
from AIS approach.
order to demonstrate the efficiency and robustness of proposed
GSA approach based on Newtonian physical law of gravity and Figure 2 shows convergence of the best total fuel cost result
law of motion which is tested for different test systems. These obtained from GSA for test system I.
are 3, 10 and 18 units systems ignored transmission line losses.
The setup parameters for the proposed algorithm are given in
Table 1.
I-56
obtained from sum of generation units. Figure 3 shows
convergence of the best total fuel cost result obtained from GSA
for test system II.
I-57
Table 8. Generator data for test system III
I-58
evolution with time-varying mutation", Electrical Power
and Energy Systems, vol. 33, pp. 753-766, 2011.
[8] Y. Lu, J. Zhou, H. Qin, Y. Wang, Y. Zhang, "Chaotic
differential evolution methods for dynamic economic
dispatch with valve-point effects", Engineering
Applications of Artificial Intelligence, vol. 24, pp. 378-387,
2011.
[9] M. A. Abido, "Multiobjective evolutionary algorithms for
electric power dispatch problem", IEEE Transactions on
Evolutionary Computation, vol. 10, no. 3, pp. 315-329,
2006.
[10] E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, "A
gravitational search algorithm", Information Sciences, vol.
179, pp. 2232-2248, 2009.
[11] E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, "Filter
modeling using gravitational search algorithm",
Engineering Applications of Artificial Intelligence, vol. 24,
pp. 117-122, 2011.
[12] M. Yin, Y. Hu, F. Yang, X. Li, W. Gu, "A novel hybrid K-
harmonic means and gravitational search algorithm
approach for clustering", Expert Systems with Applications,
vol. 38, pp. 9319-9324, 2011.
[13] C. Li, J. Zhou, "Parameters identification of hydraulic
turbine governing system using improved gravitational
search algorithm", Energy Conversion and Management,
vol. 52, pp. 374-381, 2011.
[14] S. Duman, U. Güvenç, N. Yörükeren, "Gravitational search
algorithm for economic dispatch with valve-point effects",
International Review of Electrical Engineering (I.R.E.E.),
vol. 5, no. 6, pp. 2890-2895, 2010.
[15] T. K. A. Rahman, Z. M. Yasin, W. N. W. Abdullah,
"Artificial-immune-based for solving economic dispatch in
power system", National Power & Energy Conference
(PECon), Kuala Lumpur, Malaysia, 2004, pp. 31-35.
[16] Y. Juan-jie, Z. Jian-zhong, W. Wei, L. Fang, "Application
of improved particle swarm optimization in economic
dispatching", Power System Technology, vol. 29, no. 2, pp.
1-4, 2005.
[17] Z. Tao, C. Jin-ding, "A new chaotic PSO with dynamic
inertia weight for economic dispatch problem",
International Conference on sustainable Power Generation
and Supply (SUPERGEN’09), 2009, pp. 1-6.
[18] I. G. Damousis, A. G. Bakirtzis, P. S. Dokopoulos,
"Network-constrained economic dispatch using real-coded
genetic algorithm", IEEE Transactions on Power Systems,
vol. 18, no. 1, pp. 198-205, 2003.
[19] U. Güvenç, S. Duman, B. Saraçolu, A. Öztürk, "A hybrid
GA-PSO approach based on similarity for various types of
economic dispatch problems", ELEKTRONIKA IR
ELEKTROTECHNIKA, no. 2, pp. 109-114, 2011.
I-59