G.

Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

PSO & GSA Algorithms For Global MPPT In

Photo Voltaic System

G. Lakshmi Hari Priyanka, A. Sri Hari Babu

PG SCHOLAR, Vignan Institute of Technology and science, Vadlamudi, Andhra pradesh, 522213
ASST. PROFESSOR, Vignan Institute of Technology and science, Vadlamudi, Andhra pradesh, 522213
ABSTRACT
A new unified power-quality cond itioning system
(MC-UPQC), capable of simultaneous
compensation for voltage and current in multi
bus/multi feeder systems. In this configuration, one
shunt voltage- source converter (shunt VSC) and
two or more series VSCs exist. The system can be
applied to adjacent feeders to compensate for
supply-voltage and load current imperfections on
the main feeder and full compensation of supply
voltage imperfections on the other feeders. In the
proposed configuration, all converters are
connected back to back on the dc side and share a
common dc-link capacitor. Therefore, power can
be transferred from one feeder to adjacent feeders
to compensate for sag/swell and interruption.
Key words- GSA Algorithm, VSC, interruption,
photo voltaic.
as electricity generation for distribution, heating
water, lightening building, crop drying etc.
The intensity of solar radiation reaching earth
surface which is 1369 watts per square meter is
known as Solar Constant. It is important to realize
that it is not the intensity per square meter of the
Earth’s surface but per square meter on a sphere
with the radius of 149,596,000 km and with the
Sun at its centre.
The total amount solar radiation intercepted by the
Earth is the Solar Constant multiplied by the cross
section area of the Earth. If we now divide the
calculated number by the surface area of the Earth,
we shall find how much solar radiation is received
in an average per square meter of the Earth's
surface.
Hence the average solar radiation R per square
meter of the Earth surface is,
s r2 1369 w
R    342
4 r2 4 m 2

1. INTRODUCTION
Solar energy is a non-conventional type of energy.
Solar energy has been harnessed by humans since
ancient times using a variety of technologies. Solar
radiation, along with secondary solar-powered
resources such as wave and wind power,
hydroelectricity and biomass, account for most of
the available non-conventional type of energy on
earth. Only a small fraction of the available solar
energy is used.
Solar powered electrical generation relies on
photovoltaic system and heat engines. Solar
energy's uses are limited only by human creativity.
To harvest the solar energy, the most common way
is to use photo voltaic panels which will receive
photon energy from sun and convert to electrical
energy. Solar technologies are broadly classified as
either passive solar or active solar depending on the
way they detain, convert and distribute solar
energy. Active solar techniques include the use of
PV panels and solar thermal collectors to strap up
the energy.
Passive solar techniques include orienting a
building to the Sun, selecting materials with
favorable thermal mass or light dispersing
properties and design spaces that naturally circulate
air Solar energy has a vast area of application such
w
where S is the solar constant (1369 ), r is the
m2
earth radius.
The Handy formula which is used to calculate solar
energy received by earth
E  3.6 * (10 9 ) *S* n* r 2
where E is the solar energy in EJ.
S is the Solar Constant in W/m2.
n is the number of hours.
r is the Earth's radius in km
2. LITERATURE SURVEY
Due to protection failures during natural disaster,
the nuclear power plants are getting down. This
lead to the concentration towards the renewable
energy sources drastically. Among them, solar
power systems attract more attention because they
provide excellent opportunity to generate electricity
while it is pollution and radiations free [1].
However, solar energy systems generally suffer
from the varying environmental condition and the
P–V characteristic curve exhibits a maximum
power point (MPP) that varies nonlinearly with
these conditions [2].

©www.ijrcct.org | 167
 G. Lakshmi Hari Priyanka et al, International Journal of Research
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
Thus, the MPPT methods are used to maximize the
PV array output power by tracking the maximum
power on every operating condition. Many
different MPPT techniques have been proposed [3]
and the existing techniques vary in simplicity,
popularity, accuracy, time response, cost, and other
technical aspects. In perturb and observe (P&O)
method [4], the perturbation in the operating
voltage of the PV array depends on the difference
of the array terminal voltage and the actual MPP
voltage.
But it cannot be compared to find the new
operating voltage, since the change in power is
only considered to be a result of the array terminal
voltage perturbation. In hill climbing (HC) method
[5], the perturbation in the duty ratio of the power
converter perturbs the PV array current and
consequently perturbs the PV array voltage.
The process is repeated periodically until the MPP
is reached. At MPP the system oscillates about the
incremental conductance (IC) method [6], the MPP
can be tracked by comparing the instantaneous
conductance (I/V) to the incremental conductance
(ΔI/ΔV) and equating it to reference voltage to
make the difference zero.
But under change in atmospheric conditions, it
oscillates around the MPP. In [7], once the particles
find the MPP, their velocity associated with the
particles becomes very low or practically equal to
zero.
Till the particle finds the MPP, there is large
oscillation in duty cycle. Consequently, there is
loss of power and stability in the operating point of
the power converter.
In [8], the values of w, c1 and c2 are initially kept
as minimum values but later on it is incremented to
the maximum value at the end of iterations. If the
MPP point gets shifted in between the iterations,
there is a chance of tracking the local MPP.
In view of these drawbacks, algorithm of PSO and
algorithm of GSA were adopted in this paper to
realize the MPPT. Design procedures will be
presented first, and the simulation will be done to
demonstrate the validity of the proposed MPPT
algorithm.
3. METHODOLOGY
An ideal is modeled by a current source in parallel
with a diode. However no solar cell is ideal and
thereby shunt and series resistances are added to
the model as shown in the PV cell diagram above.
RS is the intrinsic series resistance whose value is
very small. RP is the equivalent shunt resistance
which has a very high value.
Applying Kirchhoff’s law to the node where I ph ,
diode, RP and RS meet, we get
ISSN (Online) 2278- 5841
ISSN (Print) 2320- 5156
I ph  I D  I RP  I P
(1)
We get the following equation for the photovoltaic
current:
I  I ph  I Rp  I D
(2)
Where, I ph is the insolation current, I is the Cell
current, I 0 is the reverse saturation current, V is
the cell voltage, RS is the series resistance, RP is
the parallel resistance, VT is the thermal voltage, K
is the Boltzman constant, T is the temperature in
Kelvin, q is the charge of an electron.
The PV cell modeled based on single diode will
have current source in parallel with a reverse
biased diode and with series/parallel internal
resistances, as shown in Figure 2.1 [12]. The output
current (I) can be written as
where I PV is the current generated by the
incidence of light, I 0 is the reverse saturation
current, VT is the thermal voltage of the PV
module having N s cells connected in series, q is
the electron charge, k is the Boltzmann constant,
T is the temperature of PN junction in Kelvin and
a is the diode ideality factor. This equation
originates electrical characteristics of single diode
PV cell in the form of V-I curves with the
computation of five parameters namely I PV , I 0 ,
R p , Rs and a, as shown in Figure 2.3. This model
was extensively used in the literature as this model
provides a good compromise between its simplicity
and accuracy. But the single diode models were
proposed on the assumption that recombination
loss in the depletion region is absent. In practice
this loss accounts for a substantial amount, which
cannot be neglected under extreme working
conditions. This is the real basis to work on the
alternate model that accounts this aspect [4].
As mentioned earlier, an alternate model based on
Two-diode approach has been proposed [12] to
handle the recombination loss. Various methods to
analyze the electrical behavior of PV cell based on
two diode approach were proposed in the literature
[12 - 14], which is based on estimation of model
parameters as a function of unknown dynamic
values.
A generalized approach has been proposed
to characterize the complete PV cell behavior based
©www.ijrcct.org | 168
 G. Lakshmi Hari Priyanka et al, International Journal of Research
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
on the information readily available on data sheet.
The main emphasis on this approach is the
simplification of current equation with minimum
number of unknown parameters that can be
evaluated by both algebraic and iterative manner.
The equivalent circuit for the two-diode model
proposed in [12] is shown in Figure 2.4.
Figure 1: Two Diode Model
The simplified current equation for the model is:
where I 01 and I 02 are the reverse saturation
currents of diodes D1 and D2 respectively, VT 1
and VT 2 are the thermal voltages of respective
diodes, a1 and a2 represents ideality constants of
respective diodes. The significance of additional
diode is to compensate for recombination loss in
the depletion region of PV cell.
The simplicity of the two diode model in [12] as
compared to the proposed two diode models in the
literature [13, 14] can be acceptable with the
approach followed in evaluating the model
parameters that are discussed in subsequent
sections.
The minimum oscillator frequency should be about
100 times longer than the transistor switching time
to maximize efficiency. This limitation is due to the
switching loss in the transistor. The transistor
switching loss increases with the switching
frequency and thereby, the efficiency decreases.
The core loss of the inductors limits the high
frequency operation.
Control voltage Vc is obtained by comparing the
output voltage with its desired value. Then the
output voltage can be compared with its desired
value to obtain the control voltage Vcr . The PWM
control signal for the dc converter is generated by
comparing Vcr with a saw tooth voltage Vr . There
are four topologies for the switching regulators:
buck converter, boost converter, buck-boost
converter and cứk converter. However my project
work deals with the boost regulator and further
discussions will be concentrated towards this one.
The standard PSO method can be defined using the
following equations:
ISSN (Online) 2278- 5841
ISSN (Print) 2320- 5156
vi  k  1  wvi  k   c1r1  pbest .i  xi  k    c2 r2  gbest  xi  k  
(5)
xi (k  1)  xi (k )  vi (k  1)
(6)
i  1, 2, , N
Where xi is the position of particle i; vi is the
velocity of particle i; k denotes the iteration
number; w is the inertia weight; r1 and r2 are
random variables uniformly distributed within [0,
1]; and c1 , c2 are the cognitive and social
coefficient, respectively.
Figure 2: Block diagram of the proposed PSO
system
This chapter provides a brief introduction of
recently developed population based heuristic
optimization approach called gravitational search
algorithm (GSA). Gravitational Search Algorithm
[17] is one of the heuristic optimization algorithm
which has been gaining interest among the
scientific community recently.
The word ‘‘heuristic” is Greek and means “to
find”, ‘‘to know”, ‘‘to discover” or ‘‘to guide an
investigation”. Specifically, ‘‘Heuristics are
techniques which seek good (i.e., near-optimal)
solutions at a reasonable computational cost
without being able to guarantee either optimality or
feasibility.
3.1 PROPOSED METHOD
In this thesis, a new optimization algorithm based
on the law of gravity, namely Gravitational Search
Algorithm (GSA) is proposed. This algorithm is
based on the Newtonian gravity: ‘‘Every particle in
the universe attracts every other particle with a
force that is directly proportional to the product of
their masses and inversely proportional to the
square of the distance between them.”
In this, our aim is to establish a new population-
based search algorithm considering the mentioned
aspects and based on the gravity rules. The brief
overview of gravitational force is given to provide
a proper background and followed by explanation
of GSA.
©www.ijrcct.org | 169
 G. Lakshmi Hari Priyanka et al, International Journal of Research
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
Figure 3: Block diagram of proposed GSA
3.1.1 Newton Law of Gravity
The gravitation is the tendency of masses to
accelerate toward each other. It is one of the four
fundamental interactions in nature (the others are:
the electromagnetic force, the weak nuclear force,
and the strong nuclear force). Every particle in the
universe attracts every other particle. Gravity is
everywhere in the universe. The inescapability of
gravity makes it different from all other natural
forces.
The way Newton’s gravitational force behaves is
called ‘‘action at a distance”. This means gravity
acts between separated particles without any
intermediary and without any delay. In the Newton
law of gravity, each particle attracts every other
particle with a ‘gravitational force’. The
gravitational force between two particles is directly
proportional to the product of their masses and
inversely proportional to the square of the distance
between them.
M 1M 2
F G (7)
R2
where F is the magnitude of the gravitational force,
G is gravitational constant, M 1 and M 2 are the
mass of the first and second particles respectively,
and R is the distance between the two particles.
4.2.2 Newton Law of Motion
Newton’s second law says that when a force, F, is
applied to a particle, its acceleration, a, depends
only on the force and its mass, M.
F Fij  G
a (8)
M (10)
Based on Eqs. (4.1) and (4.2), there is an attracting
gravity force among all particles of the universe
where the effect of bigger and the closer particle is
higher. An increase in the distance between two
particles means decreasing the gravity force
between them as it is illustrated in Figure 4.1. In
this figure, F1 j is the force that acting on M 1
ISSN (Online) 2278- 5841
ISSN (Print) 2320- 5156
from M j and F1 is the overall force that acts on
M 1 and causes the acceleration vector a1 .
In addition, due to the effect of decreasing gravity,
the actual value of the ‘‘gravitational constant”
depends on the actual age of the universe. Eq. (4.3)
gives the decrease of the gravitational constant, G,
with the age.

t 
G t   G t0   0  ,   1 (9)
t 
where $G(t)$ is the value of the gravitational
constant at time t . G (t0 ) is the value of the
gravitational constant at the first cosmic quantum-
interval of time t0 . Three kinds of masses are
defined in theoretical physics:
Active gravitational mass (Ma), is a measure of the
strength of the gravitational field due to a particular
object. Gravitational field of an object with small
active gravitational mass is weaker than the object
with more active gravitational mass.
Passive gravitational mass (Mp), is a measure of
the strength of an object’s interaction with the
gravitational field. Within the same gravitational
field, an object with a smaller passive gravitational
mass experiences a smaller force than an object
with a larger passive gravitational mass.
Inertial mass (Mi), is a measure of an object
resistance to changing its state of motion when a
force is applied. An object with large inertial mass
changes its motion more slowly, and an object with
small inertial mass changes it rapidly. Now,
considering the above-mentioned aspects, we
rewrite Newton’s laws.
The gravitational force, Fij , that acts on mass i by
mass j , is proportional to the product of the active
gravitational of mass j and passive gravitational
of mass i , and inversely proportional to the square
distance between them. ai is proportional to Fij
and inversely proportional to inertia mass of i .
More precisely, one can rewrite Eqs. (4.1) and (4.2)
as follows:
M aj  M pi
R2
Fij
ai  (11)
M ii
where M aj and M pi represent the active
gravitational mass of particle i and passive
gravitational mass of particle j , respectively, and
M ii represents the inertia mass of particle i .
©www.ijrcct.org | 170
 G. Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

Although inertial mass, passive gravitational mass,
and active gravitational mass are conceptually
distinct, no experiment has ever unambiguously
demonstrated any difference between them. The
theory of general relativity rests on the assumption
that inertial and passive gravitational mass are
equivalent.
This is known as the weak equivalence principle.
Standard general relativity also assumes the
equivalence of inertial mass and active
gravitational mass; this equivalence is sometimes
called the strong equivalent principle.
3.2 GRAVITATIONAL SEARCH ALGORITHM
(GSA)
In this thesis, we introduce our optimization
algorithm based on the law of gravity. In the
proposed algorithm, agents are considered as
objects and their performance is measured by their
masses. All these objects attract each other by the
gravity force, and this force causes a global
movement of all objects towards the objects with
heavier masses. Hence, masses cooperate using a
direct form of communication, through
gravitational force. The heavy masses – which
correspond to good solutions – move more slowly
than lighter ones, this guarantees the exploitation
step of the algorithm.
In GSA, each mass (agent) has four specifications:
position, inertial mass, active gravitational mass,
and passive gravitational mass. The position of the
mass corresponds to a solution of the problem, and
its gravitational and inertial masses are determined
using a fitness function. In other words, each mass
presents a solution, and the algorithm is navigated
by properly adjusting the gravitational and inertia
masses. By lapse of time, we expect that masses be
attracted by the heaviest mass. This mass will
present an optimum solution in the search space.
The GSA could be considered as an isolated system
of masses. It is like a small artificial world of
masses obeying the Newtonian laws of gravitation
and motion. More precisely, masses obey the
following laws:
Law of gravity: Each particle attracts every other
particle and the gravitational force between two
particles is directly proportional to the product of
their masses and inversely proportional to the
distance between them, R. We use here R instead
of R2, because according to our experiment results,
R provides better results than R2 in all experimental
cases.
Law of motion: The current velocity of any mass is
equal to the sum of the fraction of its previous
velocity and the variation in the velocity. Variation
in the velocity or acceleration of any mass is equal
to the force acted on the system divided by mass of
inertia.
Now, consider a system with N agents (masses).
We define the position of the ith agent by:

X i  xi1 ,..., xid ,..., xin  for i=1,2,….,N
(4.6)
where xid represents the position of ith agent in the
dth dimension.
At a specific time ‘t’, we define the force acting on
mass ‘i’ from mass ‘j’ as following:
M pi t  M aj t 
Fijd t   G t 
Rij t 
x t   x t 
d
j
d
i
(12)
where Maj is the active gravitational mass related to
agent j, Mpi is the passive gravitational mass related
to agent i, G(t) is gravitational constant at time t,
 is a small constant, and Rij(t) is the Euclidian
distance between two agents i and j:
Rij t   X i t , X j t 
2
(13)
To give a stochastic characteristic to our algorithm,
we suppose that the total force that acts on agent i
in a dimension d be a randomly weighted sum of
dth components of the forces exerted from other
agents:
N
Fi t  
d
 rand F t  j
d
ij
j 1, j i
(14)
where randj is a random number in the interval [0,
1].
Hence, by the law of motion, the acceleration of the
agent i at time t, and in direction dth, aid(t) is given
as follows:
Fi d t 
aid t  
M ii t 
(15)
where Mii is the inertial mass of ith agent.
Furthermore, the next velocity of an agent is
considered as a fraction of its current velocity
added to its acceleration. Therefore, its position and
its velocity could be calculated as follows:
vid t 1  rand i  vid t   aid t 
(16)
xid t  1  xid t   vid t  1
(17)
where randi is a uniform random variable in the
interval [0, 1]. We use this random number to give
a randomized characteristic to the search.
The gravitational constant, G, is initialized at the
beginning and will be reduced with time to control

©www.ijrcct.org | 171
 G. Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

the search accuracy. In other words, G is a function initial value K0 at the beginning and decreasing
of the initial value ( G0 ) and time (t): with time. In such a way, at the beginning, all
Gt   GG0 , t  agents apply the force, and as time passes, K best is
(18) decreased linearly and at the end there will be just
Gravitational and inertia masses are simply one agent applying force to the others. Therefore,
calculated by the fitness evaluation. A heavier mass Eq. (19) could be modified as:
means a more efficient agent. This means that Fi d t    rand j Fijd t 
better agents have higher attractions and walk more jKbest , j  i
slowly. Assuming the equality of the gravitational (26)
and inertia mass, the values of masses is calculated
using the map of fitness. We update the
where K best is the set of first K agents with the
gravitational and inertial masses by the following best fitness value and biggest mass.
equations: 3.3 ALGORITHM FOR GSA
M ai  M pi  M ii  M i The steps of GSA are as follows:
Step 1: Initialization of Agents:
The positions of the N number of agents are
(19) initialized randomly.

fit i t   worst t 

X i  xi1 ,..., xid ,..., xin  for i=1,2,….,N
mi t   xidrepresents the position of ith agent in the
best t   worst t 
where
th
d dimension.
(20) Step 2: Evolution of Fitness and computation:
mi t 
M i t  
For minimization or maximization problems, the

m j t 
fitness evolution is performed by evaluating the

N
j 1 best and worst fitness for all agents at each
(21) iteration.
where fiti(t) represent the fitness value of the agent Minimization problems:
i at time t, and, worst(t) and best(t) are defined as bestt   min fit j t 
j1,..., N 
follows (for a minimization problem):
bestt   min fit j t 
j1,..., N  worstt   max fit j t 
j1,..., N 
(22)
worstt   max fit j t  Maximization problems:
j1,..., N 
(23) best t   max fit j t 
j1,..., N 
best t   max fit j t 
j1,..., N 
(24) worstt   min fit j t 
j1,..., N 
worstt   min fit j t  where fiti(t) represent the fitness value of the agent
j1,..., N 
(25) i at time t, and, worst(t) and best(t).
One way to perform a good compromise between Step 3: Calculation of G:
exploration and exploitation is to reduce the Gravitational constant G is computed at iteration t.
number of agents with lapse of time in Eq. (19). G t   G0 e   / T 
Hence, we propose only a set of agents with bigger G0 and  are initialized at the beginning and will
mass apply their force to the other. However, we be reduced with time to control
should be careful of using this policy because it the search accuracy. T is the total number of
may reduce the exploration power and increase the iterations.
exploitation capability. Step 4: Calculation of Masses of the agents:
We remind that in order to avoid trapping in a local Gravitational and inertia masses for each agent are
optimum the algorithm must use the exploration at calculated at iteration t.
beginning. By lapse of iterations, exploration must
fade out and exploitation must fade in. To improve
M ai  M pi  M ii  M i
the performance of GSA by controlling exploration
and exploitation only the K best agents will attract
the others. K best is a function of time, with the

©www.ijrcct.org | 172
 G. Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

fit i t   worst t 
mi t  
best t   worst t 

mi t 
M i t  
 m j t 
N
j 1
Mai and Mpi are the active and passive gravitational
masses respectively, while Mii is the inertia mass of
the ith agent.
Step 5: Accelerations of agent’s calculation:
Acceleration of the ith agents at iteration t is
computed.
Fi d t 
a t  
d

M ii t 
i

Fid(t) is the total force acting on ith agent calculated

as:
Fi d t    rand j Fijd t 
jKbest , j  i

K best is the set of first K agents with the best Figure 4: Flow chart of GSA
fitness value and biggest mass. K best will decrease RESULTS
linearly with time and at the end there will be only
one agent applying force to the others. Fijd(t) is
computed as the following equation:

M pi t   M aj t 
Fijd t   G t 
Rij t  
x t   x t 
d
j
d
i

Fijd(t)is the force acting on agent i from agent j at

d dimension and tth iteration. Rij(t) is the Euclidian
th

distance between two agents i and j at iteration t.

G(t) is the computed gravitational constant at the Figure 5: Input of Vpv at Radiation 1000,
same iteration while  is a small constant. Temperature 25oC for PSO
Step 6: Update agents of Velocity and positions:
Velocity and the position of the agents at next
iteration (t+1) are computed based on the following
equations:
vid t 1  rand i  vid t   aid t 

xid t  1  xid t   vid t  1

Step 7: Repeat steps 2 to 6:
Steps 2 to 6 are repeated until the iterations reach
their maximum limit. The best fitness value at the
final iteration is computed as the global fitness
while the position of the corresponding agent at
specified dimensions is computed as the global Figure 6: Output of Vpv at Radiation 1000,
solution of that particular problem. Temperature 25oC For PSO
4.5 FLOW CHART OF GSA

©www.ijrcct.org | 173
 G. Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

circuit(I2C) Interface,” IEEE Trans. Energy

Convers., vol. 26, no. 1, pp. 281–289, Mar. 2011.
[2] G. Farivar and B. Asaei, “A new approach for
solar module temperature estimation using the
simple diode model,” IEEE Trans. Energy
Convers., vol. 26, no. 4, pp. 1118–1126, Dec. 2011.

[3] P. Thounthong, “Model based-energy control of

a solar power plant with a supercapacitor for grid-
independent applications,” IEEE Trans. Energy
Convers., vol. 26, no. 4, pp. 1210–1218, Dec. 2011.

[4] A. Maki and S. Valkealahti, “Power losses in

Figure 7: Input of Vpv at Radiation 1000, long string and parallel-connected short strings of
Temperature 25oC for GSA series-connected silicon-based photovoltaic
modules due to partial shading conditions,” IEEE
Trans. Energy Con-vers., vol. 27, no. 1, pp. 173–
183, Mar. 2012.

[5] O. Lopez-Lapena, M. T. Penella, and M.

Gasulla, “A closed-loop maximum power point
tracker for subwatt photovoltaic panels,” IEEE
Trans.Ind. Electron., vol. 59, no. 3, pp. 1588–1596,
Mar. 2012.

[6] D. P. Hohm and M. E. Ropp, “Comparative

study of maximum power point tracking
Figure 8: Output of Vpv at Radiation 1000, algorithms,” Proc. IEE Photovoltaic’s: Res. Appl.,
Temperature 25oC For GSA vol. 11,no. 1, pp. 47–62, Jan. 2003.

CONCLUSION [7] V. Salas, E. Ol ́ıas, A. Barrado, and A. Lazaro,

In this project the mathematical modeling of non- “Review of the maximum ́power point tracking
linear nature of solar energy sources are developed algorithms for stand-alone photovoltaic
and the developed equations are simulated using systems,”Sol. Energy Mater. Sol. Cells, vol. 90, no.
MATLAB/SIMULINK. Developed model is 11, pp. 1555–1578, Jul. 2006.
validated using data provided on manufacture data
sheet. [8] T. Esram and P. L. Chapman, “Comparison of
An exact SPVA electrical model is presented in photovoltaic array maximum power point tracking
this project to track robust maximum power point. techniques,” IEEE Trans. Energy Convers., vol.
The proposed model of PSO & GSA based 22,no. 2, pp. 439–449, Jun. 2007.
controller are used for the developed model for
solar photovoltaic system along with power [9] H. Patel and V. Agarwal, “MATLAB-based
electronic converter is simulated in MATLAB/ modeling to study the effects of partial shading on
Simulink environment. MATLAB model is PV array characteristics,” IEEE Trans.
validated using the data of commercially available EnergyConvers., vol. 23, no. 1, pp. 302–310, Mar.
Solar PV module USP-75. 2008.

FUTURE SCOPE: [10] Y. J. Wang and P. C. Hsu, “Analytical

In order to increase reliability few more sources modelling of partial shading and different
such as hydel and biomass may be added. orientation of photovoltaic modules,” IET Renew.
Hardware system can be implemented for the Power Gener.,vol. 4, no. 3, pp. 272–282, May
proposed model. 2010.

REFERENCES: [11] E. V. Paraskevadaki and S. A. Papathanassiou,

[1] H. J. Chiu, Y. K. Lo, C. J. Yao, T. P. Lee, J. M. “Evaluation of MPP voltage and power of mc-Si
Wang, and J. X. Lee, “A modular self controlled PV modules in partial shading conditions,” IEEE
photovoltaic charger with interintegrated Trans. Energy Convers., vol. 26, no. 3, pp. 923–
932, Sep. 2011.

©www.ijrcct.org | 174
 G. Lakshmi Hari Priyanka et al, International Journal of Research ISSN (Online) 2278- 5841
in computer and communication Technology , Vol 6, Issue- 5, May- 2017
ISSN (Print) 2320- 5156

[12] G. Carannante, C. Fraddanno, M. Pagano, and

L. Piegari, “Experimental performance of MPPT
algorithm for photovoltaic sources subject to
inhomogeneous insolation,” IEEE Trans. Ind.
Electron., vol. 56, no. 11,pp. 4374–4380, Nov.
2009.

[13] K. Kobayashi, I. Takano, and Y. Sawada, “A

study of a two stage maximum power point
tracking control of a photovoltaic system under
partially shaded insolation conditions,” Sol. Energy
Mater. Sol. Cells, vol. 90, no. 18–19, pp. 2975–
2988, Nov. 2006.

[14] Y. H. Ji, D. Y. Jung, J. G. Kim, J. H. Kim, T.

W. Lee, and C. Y. Won, “A real maximum power
point tracking method for mismatching
compensation in PV array under partially shaded
conditions,” IEEE Trans. Power Electron.,vol. 26,
no. 4, pp. 1001–1009, Apr. 2011.

[15] N. A. Ahmed and M. Miyatake, “A novel

maximum power point tracking for photovoltaic
applications under partially shaded insolation
conditions,”Electric Power Syst. Res., vol. 78, no.
5, pp. 777–784, May 2008.

[16] W. Rong-Jong, W. Wen-Hung, and L. Chung-

You, “High-Performance Stand-Alone Photovoltaic
Generation System,” IEEE Trans. Indust.
Electronics, vol. 55, pp. 240-250, 2008.

[17] R. Gules, J. De Pellegrin Pacheco, H. L. Hey,

and J. Imhoff, “A Maximum Power Point Tracking
System with Parallel Connection for PV Stand-
Alone Applications,” IEEE Trans. Indust.
Electronics, vol. 55, pp. 2674-2683, 2008.

©www.ijrcct.org | 175