=−
() ( )
II
exp exp
OSC
qV
aKT
qR I
aKT
OC S SC
(13)
=⎡
⎣
⎢
⎢
⎢+⎡
⎣−⎤
⎦
−
()
() ( )
II
I
1
exp 1
exp exp
PVn SC
SC
qR I
aKT
qV
aKT
qR I
aKT
SSC
OC S SC
(14)
At MPP, the derivative of the output power with respect to the
voltage must be zero. Hence, at the maximum power point;
==+=
dP
dV
dV I
dV VdI
dV I
() 0
MP MP MP MP (15)
=−
edI
dV
I
V
.. MP
MP (16)
Combining (16) and the derivative of (9) with respect to V
pv,
−=⎡
⎣⎤
⎦
⎡
⎣⎤
⎦−
+
+
I
V
exp
exp 1
MP
MP
qI
aKT
qV R I
aKT
qI
aKT
qV R I
aKT
()
()
OMPSMP
OMPSMP
(17)
Thus, by analytical approach, the parameter extraction of a single
diode ‘
’model can be executed by solving the four Eqs. (12)–(14) and
(17) [30–32]. It is noteworthy to mention that, instead of Eq. (17),
either one of the two slope equations derived at the open circuit point
or the short circuit point in the I-V curve can also be used to extract the
model parameters [33]. The same procedure can be adopted for SD and
DD models except that it requires some additional equations to extract
the parameters. For instance, for the conventional SD model, both the
slope equations (
R,
SO P
) are used along with the equations at the
open circuit, short circuit and maximum power points [19–21,34–40].
While, to extract the model parameters for a DD model, an additional
equation is derived using the assumption that the sum of the ideality
factors of the two diodes D
1
and D
2
is 3 [23–27]. For a detailed study on
analytical methods readers can refer to [14]. To conclude, the following
disadvantages limit the adaptability of analytical methods towards
parameter identification problem.
➣Involved complex mathematical expressions and computations.
➣Monumental time consumption in solving the equations.
➣Convergence is not always guaranteed.
➣Assumptions made for simplification significantly affect the accu-
racy of the parameters extracted.
➣Difficult to apply for improved PV models as the mathematical
formulations will be highly complex.
3.2. Metaheuristic algorithms for PV parameter Identification
Metaheuristic algorithms, in last few decades, have gained immense
momentum for solving complex multi objective optimization problems
in various engineering disciplines [41–44]. The enormous capability in
finding potential solutions provoked its importance towards PV para-
meter identification problem. The evolution of metaheuristic algo-
rithms started with Genetic Algorithm (GA) followed by Differential
Evolution (DE) and Particle Swarm Optimization (PSO). Inspired by
these basic algorithms, several new and hybrid metaheuristic algo-
rithms were developed in recent years [45–81]. Some prominent ob-
jective functions utilized by various metaheuristic algorithms for PV
parameter optimization are: 1) Root Mean Squared Error (RMSE)
[48,51–57,60,62–71,73,74], 2) Mean Squared Error (MSE) [45,59,72],
3) Absolute Error (A.E) [46,58,75,76] and 4) Derivative at maximum
power point (MPP) [60,67]. In this section, basic theory of every me-
taheuristic algorithm and its improved variants are outlined for fun-
damental understanding. Further, the performance of each algorithm is
reviewed based on: 1) Type of approach, 2) Compatibility towards
parameter identification, 3) Accuracy, 4) Convergence speed and 5)
Range of parameters set. In literature, as shown in Table 2, it can be
observed that each algorithm has used numerous solar cells/modules to
validate their results. However, for brevity, the ranges set and the
identified parameters are shown only for either one of the cells/mod-
ules used by each algorithm and the inferences discussed are identical
for other cells/modules as well. Moreover, a detailed analysis based on
all the cells/modules used for parameter identification is presented in
Section 4. The validating conditions of each method have also been
taken into account for a better evaluation on the performance various
algorithms.
3.2.1. Genetic algorithm (GA)
GA is a bio-inspired population-based algorithm which replicates
the phenomenon of ‘survival of the fittest’[82].The formulation of
objective function involves expressing the decision variables that are
encoded as chromosomes. An iteration based control strategy is fol-
lowed to improve the quality of each chromosome (solution). Based on
the fitness value of an offspring, the quality of the solutions is eval-
uated and offsprings for further iterations is chosen. Several works on
GA for the non-linear optimization of PV parameter estimation problem
is presented in [83,84]. GA follows three main steps; selection, cross-
over and mutation
1. Selection: Initially, solutions are randomly generated and the fitness
of each solution is evaluated. After selection, only fitter chromo-
somes are selected for the next generation.
Table 2
Cells/modules used for parameter identification.
Refs. Tested cells/Modules
[46] Sanyo HIT215, KC200 GT and ST40 PV Modules
[47] KC 200GT, ST40 and E20/333 PV Modules
[48,51,60,63,65,66,68,73–75,77] 57 mm dia RTC France Solar Cell
[49] SM 55 PV Module, Thin film ST40 PV Module, S75 Solar Module
[51,59,64,72,75] 57 mm dia RTC France Solar Cell, Photo watt PWP201 PV Module
[52] SL80CE Solar Cell, Photo watt PWP201 PV Module
[53] S75, SM55, S115, SQ150 PC, ST36 and ST40 PV Modules
[55] 57 mm dia RTC France Solar Cell, KC200GT and PWP201 PV Modules
[56] 5 W CuInSe2 Solar Cell, 50 W mono-Si and 50 W multi-Si PV Modules
[61] Kyocera KD210GH-2PU, Shell SP-70, Shell SQ-85 and ST-40 Thin Film PV Modules
[67] S36, SM55 and ST40 PV Modules
[70] 57 mm dia RTC France Solar Cell, Photo watt PWP201, S75, SM40, SM55, KC200 GT and ST40 PV Modules.
[71] 57 mm dia RTC France Solar Cell, KC200GT, SM55 and ST-40 Thin Film PV Modules
[73] Kyocera KC120 PV Module
[79] OST 80 Solar Cell, SM55 PV Module
[80] S36 PV Module, SP 70 PV Module, SM55 PV Module, KC200 GT PV Module
D.S. Pillai, N. Rajasekar Renewable and Sustainable Energy Reviews xxx (xxxx) xxx–xxx
5