# A Level-Based Learning Swarm Optimizer with Stochastic Fractal Search for Parameters Identification of Solar Photovoltaic Models

Authors: Qingsong Zhang; Yibo He; Meng Shu; Weizheng Zhang; Daojian Yang; Jinhua Song; Guanhua Li; Yanan Zheng; Yang Yang; Jinxin Tie; Jie Li; Meng Li
Journal: Mathematical Problems in Engineering
 (2023)

---

## Abstract

As the most popular renewable energy, solar energy could be converted into electricity by photovoltaic (PV) systems directly. To maximize the effectiveness of the conversion, it is critical to find the precise and accurate parameters of the PV model. In this paper, we propose a level-based learning swarm optimizer with stochastic fractal search (LLSOF) to tackle the parameter estimation of several kinds of solar PV models. The population is separated into multiple levels according to their fitness at first. The individuals at the lower levels evolve through learning from the individuals at the higher levels. Benefiting from the interactive learning among levels, the population could approach the multiple optimal regions rapidly. To enhance the local search ability, stochastic fractal search is introduced to locate the optima accurately. Combination of both, the proposed LLSOF could achieve a good balance on both exploration and exploitation. To evaluate the performance of LLSOF, it is used to obtain the parameters of three PV models and compared with nine well-established algorithms. Comparative results validate the excellent performance of LLSOF. Moreover, the application manufactory’s data sheets report the superior efficiency and effectiveness of LLSOF for the parameter estimation of PV systems.


---

## Body

## 1. Introduction

To cope with the predictable energy crisis and serious environmental problems, countries around the world endeavor to find renewable energy. Among the various renewable energies, solar energy draws much attention due to its advantages such as cleanliness, wide availability, acquisition, sustainability, and so on [1]. Solar energy could be obtained and utilized through the sunshine to electricity conversion. Photoelectric conversion, which is based on photovoltaic (PV) systems, is one of the well-known utilization of solar energy. Accurate PV modeling and parameter extraction could represent the nonlinear current-voltage (I-V) characteristics of solar cells [2]. To analyze the cell characteristics during various operating conditions, equivalent circuit models are applied. The most frequently used models are single diode model (SDM), double diode model (DDM), and three-diode model (TDM) [3]. The PV model is usually described by a set of nonlinear equations and the performance of the model depends mainly on the involving uncertain parameters. Therefore, it is critical to accurately identify these involving unknown parameters of the model. However, the circuit equation of the PV model is nonlinear, implicit, and multimodal; it is quite a challenge to identify the unknown parameters [4]. Moreover, PV systems are usually placed in the outdoors environment, and the temperature and radiation produce an effect on the PV systems. To improve the effectiveness and efficiency, it requires obtaining the best performance under different conditions, which depends on accurate and reliable parameter values. Therefore, a feasible optimization method to identify the parameters of the PV model is needed.In recent years, many works have been dedicated to estimating the parameters of cells and modules, including metaheuristic and analytical methods. Analytical methods reduce the number of parameters to be solved by using a specific set of data to analyze. Although these methods could consume fewer computational resources, the accuracy is hard to guarantee. Metaheuristic techniques are a category of models in evolutionary computation inspired by biological patterns or real-world problems to mimic physical laws. Compared with the traditional analytical methods, metaheuristic methods show significant potential in dealing with complex optimization problems due to the obvious advantages such as (1) obtaining multiple optima during one run and (2) could handle nonlinear problems without gradient information or extra constraints. Through the literature review, it is seen that the studies using metaheuristics become more and more popular and show promising performance for parameter estimation of the PV models.


### 1.1. Related Works

Numerous approaches and their alternatives have already been used to estimate the parameters of the PV model. A comprehensive survey [3, 4] has been made on the related works of identification of unknown parameters of solar cell models, including the electrical circuit models of PV cells, parameters extraction of PV models under different conditions, performance criterion, the proposed approaches, and future research directions. The existing research can be roughly classified into the following four categories.(1)
Traditional evolutionary algorithms (EAs)-based methods. As one of the typical EAs, the genetic algorithm (GA) has been applied to identify the parameters of PV cells and/or modules [5, 6]. GA was also combined with the simulated annealing to extract the unknown variables of SDM of the PV cell or module [7]. Moreover, differential evolution (DE) and its variants [8–13] garnered a lot of interest in identifying the PV models’ parameters. In reference [14], DE is recommended for the evaluation of PV cell parameters under various operating conditions. Lambert W function and a preliminary metaheuristic step were introduced to select the optimal mutation and crossover rates of DE for each specific I-V characteristic of PV cells and modules. In order to fast and accurately estimate the parameters of PV models, Li et al. [15] proposed a memetic adaptive DE (MADE), in which the success-history-based adaptive DE is used for the global search while the Nelder–Mead simplex method is employed for the local search. The experiments showed MADE could obtain competitive results with fewer computational resources. Liang et al. [16], proposed a self-adaptive ensemble-based differential DE (SEDE), in which three different mutation strategies with different properties are combined. Gao et al. [17] proposed directional permutation DE (DPDE). Through fully utilizing the information arisen from the search population and the direction of differential vectors, DPDE could achieve robust and competitive results for parameter estimation on SDM, DDM, TDM, and PV modules.(2)
Swarm intelligence (SI)-based methods. The SI technique is inspired by the intelligence and collective behavior of biological communities or the self-organized social processes. As one of the perspectives, particle swarm optimization (PSO) and its variants [18–23] have been proposed for estimation of PV models’ parameters. An improved mutated PSO (MPSO) [24] with an adaptive mutation strategy is proposed to identify the optimal parameters of different photovoltaic models. Liang et al. [25] proposed a classified perturbation mutation-based PSO algorithm which is evaluated by extracting parameters of five different photovoltaic models under different conditions. In reference [26], fractional chaotic ensemble PSO (FC-EPSO) was proposed to model solar PV modules under different environmental conditions. In reference [27], PSO and grey wolf optimization (GWO) were hybrid to extract unknown parameters of photovoltaic SDM, in which a new cost function based on the values of the datasheet was proposed. In addition, the salp swarm inspired algorithm (SSA) [28]and the opposition-based learning modified salp swarm algorithm (OLMSSA) [29] were proposed for extracting the parameters of the electrical equivalent circuit of PV cells. Moreover, the whale optimization algorithm (WOA) [30, 31], fireworks algorithm [32], artificial bee colony (ABC) algorithm [33], the bacterial foraging optimization approach [34], cuckoo search (CS) [35], tunicate swarm algorithm (TSA) [36], bird collective-behavioral based optimization (COOT) [37], and other swarm intelligence-based approaches are also applied to accurately model the solar photovoltaic cell properties.(3)
Physics and objective law inspired technique. In reference [38], a physics-based meta-heuristic algorithm called resistance-capacitance optimization algorithm (RCOA) based on the concept of resistance-capacitance circuit response was proposed. Combined with an improved version of the Newton–Raphson method, RCOA could find the optimal PV parameters in fewer iterations. In reference [39], Gaussian and Cauchy mutation-based hunger games search optimizer and enhanced Newton–Raphson method were proposed to solve the behavior of the current-voltage relation of the three-diode equivalent model. Moreover, as a newly developed optimization algorithm, the gradient-based optimization algorithm (GBO) has been successfully applied to real-world engineering problems. To quickly distinguish between the exploration and exploitation phases and converges on more accurate results, Premkumar with his/her team have been dedicated a lot of work. In reference [40], an improved gradient-based optimization algorithm with chaotic drifts (CGBO) algorithm was proposed to derive the parameters of PV modules while offering precise I-V and P-V curves. In reference [41], an enhanced version of GBO named CCNMGBO, in which the crisscross (CC) algorithm and Nelder–Mead simplex (NMs) strategy are hybridized with GBO to estimate the uncertain parameters of various PV models. Another enhanced variant of GBO, called opposition decided GBO with balance analysis and diversity maintenance (OBGOA) [42] was proposed for parameter identification of solar photovoltaic models. Furthermore, the arithmetic optimization algorithm was improved [43, 44] to extract the solar cell/panel parameters as well. In reference [45], a novel chaotic northern goshawk optimization algorithm based on the adoption of modified Levenberg–Marquardt is proposed to extract the parameter of the single-diode PV model of the cell/module globally.(4)
The others. Due to the advantage of free parameters, low computational time, and low complexity, JAYA draw a lot of attention since it was developed by Venkata Rao [46]. Later, many variants of JAYA have been proposed, including improved JAVA (IJAVA) [47], performance-guided JAYA (PGJAYA) [48], enhanced chaotic JAYA algorithm [49], and so on. Meantime, improved Rao-1 (IRao-1) algorithm [50], comprehensive learning Rao-1 optimization (CLRao-1) [51], and Rao-2 (R-II) and Rao-3 (R-III) algorithm [52] were proposed to estimate the PV cell parameters. Moreover, the supply-demand-based optimization algorithm (SDOA) [53], reinforcement learning technique [54], teaching-learning-based optimization (STLBO) [55], and honey badger algorithm (HBA) [56] were also employed to extract the unknown parameters of PV models.


### 1.2. Motivation and Contribution

Through the literature review, it is seen that most meta-heuristic algorithms have the inherent disadvantages, such as parameter dependency, premature convergence, sensitive to the initial population, and complicated processes. Moreover, due to the parameter extraction problem of PV models is a multimodal optimization problem, these meta-heuristic algorithms need to be strengthened. Consequently, developing for accurate, reliable, and efficient metaheuristic algorithms to extract the parameters of solar PV cell models is still ongoing.A level-based learning swarm optimizer (LLSO) [57] was proposed by Yang in 2018. It was inspired from the mixed-level learning methodology in which teachers treat students differently in accordance with their aptitude. Instead of using the historically best positions (such as pbest, gbest, or nbest) to update particles, particles in different levels are utilized to direct the learning of particles. Since particles in different levels have diverse potentials in exploration and exploitation, they possess diverse evolutionary information to evolve the swarm. Therefore, the diversity of the algorithm could be promoted. However, one of the main drawbacks of many meta-heuristic algorithms is that they are easy to fall into the local optima and could be avoided to some extent. On the other hand, through the attraction of high levels, the individuals could approach the optimal region rapidly. Moreover, since the individual in the lower level learns from individuals who are randomly selected from all levels better than its level instead of the first level, the population could cover multiple optimal regions at the same time. However, the first level is not updated in the original LLSO; it will slow down the convergence speed of the algorithm and influence the accuracy of the results.Stochastic fractal search (SFS) [58] is motivated by diffusion property turned up in fractals. It has been successfully applied in solving engineering problems [59]. Especially, it has a wonderful local search ability that could achieve a solution that has the least error compared with the globally optimum solution within a minimal number of iterations. Therefore, in this paper, the stochastic fractal search (SFS) is applied to the individuals of the first level in LLSO to enhance the local search ability. In this way, the exploration and exploitation could be well balanced through the combination of LLSO and SFS. This paper is a seminal attempt to apply an LLSO-based algorithm to the field of renewable energy. The major contributions of this paper are as follows.(1)
A new LLSOF algorithm for identifying the unknown PV cell/module parameters is proposed.(2)
Instead of using the historically best positions to update particles, particles in different levels are utilized to direct the learning of particles. In this way, the diversity of the population would be maintained and multiple optima regions could be considered at the same time.(3)
The SFS is introduced to improve the local search ability. The solutions in the first level approach the global/local optima accurately through Gaussian random walk.(4)
Extensive experimentation and comparisons on parameter estimation problems for the PV models including SDM, DDM, TDM, and PV module model validate the effectiveness and efficiency of the proposed LLSOF algorithm.The rest of this paper is arranged accordingly. Section2 reviews the electrical equivalent of various PV models and the problem formulation of PV models. Section 3 presents the traditional LLSO algorithm, the SFS algorithm, and the proposed LLSOF. Section 4 analyzes and shows the results on various PV models of the cell and module. In addition, the experimental results of the manufacturer’s data sheet are provided to validate the performance of the proposed LLSOF algorithm. Lastly, Section 5 includes conclusions.


## 1.1. Related Works

Numerous approaches and their alternatives have already been used to estimate the parameters of the PV model. A comprehensive survey [3, 4] has been made on the related works of identification of unknown parameters of solar cell models, including the electrical circuit models of PV cells, parameters extraction of PV models under different conditions, performance criterion, the proposed approaches, and future research directions. The existing research can be roughly classified into the following four categories.(1)
Traditional evolutionary algorithms (EAs)-based methods. As one of the typical EAs, the genetic algorithm (GA) has been applied to identify the parameters of PV cells and/or modules [5, 6]. GA was also combined with the simulated annealing to extract the unknown variables of SDM of the PV cell or module [7]. Moreover, differential evolution (DE) and its variants [8–13] garnered a lot of interest in identifying the PV models’ parameters. In reference [14], DE is recommended for the evaluation of PV cell parameters under various operating conditions. Lambert W function and a preliminary metaheuristic step were introduced to select the optimal mutation and crossover rates of DE for each specific I-V characteristic of PV cells and modules. In order to fast and accurately estimate the parameters of PV models, Li et al. [15] proposed a memetic adaptive DE (MADE), in which the success-history-based adaptive DE is used for the global search while the Nelder–Mead simplex method is employed for the local search. The experiments showed MADE could obtain competitive results with fewer computational resources. Liang et al. [16], proposed a self-adaptive ensemble-based differential DE (SEDE), in which three different mutation strategies with different properties are combined. Gao et al. [17] proposed directional permutation DE (DPDE). Through fully utilizing the information arisen from the search population and the direction of differential vectors, DPDE could achieve robust and competitive results for parameter estimation on SDM, DDM, TDM, and PV modules.(2)
Swarm intelligence (SI)-based methods. The SI technique is inspired by the intelligence and collective behavior of biological communities or the self-organized social processes. As one of the perspectives, particle swarm optimization (PSO) and its variants [18–23] have been proposed for estimation of PV models’ parameters. An improved mutated PSO (MPSO) [24] with an adaptive mutation strategy is proposed to identify the optimal parameters of different photovoltaic models. Liang et al. [25] proposed a classified perturbation mutation-based PSO algorithm which is evaluated by extracting parameters of five different photovoltaic models under different conditions. In reference [26], fractional chaotic ensemble PSO (FC-EPSO) was proposed to model solar PV modules under different environmental conditions. In reference [27], PSO and grey wolf optimization (GWO) were hybrid to extract unknown parameters of photovoltaic SDM, in which a new cost function based on the values of the datasheet was proposed. In addition, the salp swarm inspired algorithm (SSA) [28]and the opposition-based learning modified salp swarm algorithm (OLMSSA) [29] were proposed for extracting the parameters of the electrical equivalent circuit of PV cells. Moreover, the whale optimization algorithm (WOA) [30, 31], fireworks algorithm [32], artificial bee colony (ABC) algorithm [33], the bacterial foraging optimization approach [34], cuckoo search (CS) [35], tunicate swarm algorithm (TSA) [36], bird collective-behavioral based optimization (COOT) [37], and other swarm intelligence-based approaches are also applied to accurately model the solar photovoltaic cell properties.(3)
Physics and objective law inspired technique. In reference [38], a physics-based meta-heuristic algorithm called resistance-capacitance optimization algorithm (RCOA) based on the concept of resistance-capacitance circuit response was proposed. Combined with an improved version of the Newton–Raphson method, RCOA could find the optimal PV parameters in fewer iterations. In reference [39], Gaussian and Cauchy mutation-based hunger games search optimizer and enhanced Newton–Raphson method were proposed to solve the behavior of the current-voltage relation of the three-diode equivalent model. Moreover, as a newly developed optimization algorithm, the gradient-based optimization algorithm (GBO) has been successfully applied to real-world engineering problems. To quickly distinguish between the exploration and exploitation phases and converges on more accurate results, Premkumar with his/her team have been dedicated a lot of work. In reference [40], an improved gradient-based optimization algorithm with chaotic drifts (CGBO) algorithm was proposed to derive the parameters of PV modules while offering precise I-V and P-V curves. In reference [41], an enhanced version of GBO named CCNMGBO, in which the crisscross (CC) algorithm and Nelder–Mead simplex (NMs) strategy are hybridized with GBO to estimate the uncertain parameters of various PV models. Another enhanced variant of GBO, called opposition decided GBO with balance analysis and diversity maintenance (OBGOA) [42] was proposed for parameter identification of solar photovoltaic models. Furthermore, the arithmetic optimization algorithm was improved [43, 44] to extract the solar cell/panel parameters as well. In reference [45], a novel chaotic northern goshawk optimization algorithm based on the adoption of modified Levenberg–Marquardt is proposed to extract the parameter of the single-diode PV model of the cell/module globally.(4)
The others. Due to the advantage of free parameters, low computational time, and low complexity, JAYA draw a lot of attention since it was developed by Venkata Rao [46]. Later, many variants of JAYA have been proposed, including improved JAVA (IJAVA) [47], performance-guided JAYA (PGJAYA) [48], enhanced chaotic JAYA algorithm [49], and so on. Meantime, improved Rao-1 (IRao-1) algorithm [50], comprehensive learning Rao-1 optimization (CLRao-1) [51], and Rao-2 (R-II) and Rao-3 (R-III) algorithm [52] were proposed to estimate the PV cell parameters. Moreover, the supply-demand-based optimization algorithm (SDOA) [53], reinforcement learning technique [54], teaching-learning-based optimization (STLBO) [55], and honey badger algorithm (HBA) [56] were also employed to extract the unknown parameters of PV models.


## 1.2. Motivation and Contribution

Through the literature review, it is seen that most meta-heuristic algorithms have the inherent disadvantages, such as parameter dependency, premature convergence, sensitive to the initial population, and complicated processes. Moreover, due to the parameter extraction problem of PV models is a multimodal optimization problem, these meta-heuristic algorithms need to be strengthened. Consequently, developing for accurate, reliable, and efficient metaheuristic algorithms to extract the parameters of solar PV cell models is still ongoing.A level-based learning swarm optimizer (LLSO) [57] was proposed by Yang in 2018. It was inspired from the mixed-level learning methodology in which teachers treat students differently in accordance with their aptitude. Instead of using the historically best positions (such as pbest, gbest, or nbest) to update particles, particles in different levels are utilized to direct the learning of particles. Since particles in different levels have diverse potentials in exploration and exploitation, they possess diverse evolutionary information to evolve the swarm. Therefore, the diversity of the algorithm could be promoted. However, one of the main drawbacks of many meta-heuristic algorithms is that they are easy to fall into the local optima and could be avoided to some extent. On the other hand, through the attraction of high levels, the individuals could approach the optimal region rapidly. Moreover, since the individual in the lower level learns from individuals who are randomly selected from all levels better than its level instead of the first level, the population could cover multiple optimal regions at the same time. However, the first level is not updated in the original LLSO; it will slow down the convergence speed of the algorithm and influence the accuracy of the results.Stochastic fractal search (SFS) [58] is motivated by diffusion property turned up in fractals. It has been successfully applied in solving engineering problems [59]. Especially, it has a wonderful local search ability that could achieve a solution that has the least error compared with the globally optimum solution within a minimal number of iterations. Therefore, in this paper, the stochastic fractal search (SFS) is applied to the individuals of the first level in LLSO to enhance the local search ability. In this way, the exploration and exploitation could be well balanced through the combination of LLSO and SFS. This paper is a seminal attempt to apply an LLSO-based algorithm to the field of renewable energy. The major contributions of this paper are as follows.(1)
A new LLSOF algorithm for identifying the unknown PV cell/module parameters is proposed.(2)
Instead of using the historically best positions to update particles, particles in different levels are utilized to direct the learning of particles. In this way, the diversity of the population would be maintained and multiple optima regions could be considered at the same time.(3)
The SFS is introduced to improve the local search ability. The solutions in the first level approach the global/local optima accurately through Gaussian random walk.(4)
Extensive experimentation and comparisons on parameter estimation problems for the PV models including SDM, DDM, TDM, and PV module model validate the effectiveness and efficiency of the proposed LLSOF algorithm.The rest of this paper is arranged accordingly. Section2 reviews the electrical equivalent of various PV models and the problem formulation of PV models. Section 3 presents the traditional LLSO algorithm, the SFS algorithm, and the proposed LLSOF. Section 4 analyzes and shows the results on various PV models of the cell and module. In addition, the experimental results of the manufacturer’s data sheet are provided to validate the performance of the proposed LLSOF algorithm. Lastly, Section 5 includes conclusions.


## 2. PV Models and Problem Formulation

PV model has the characteristics of a nonlinear output, so it is necessary to use an accurate mathematical model to describe it. Existing research has developed a variety of photovoltaic models, including the SDM, DDM, TDM, and PV module model. All variables and relevant parameters of the photovoltaic cell model are given and detailed in a list, as shown in Table1.Table 1
Relevant parameters of the PV cell model.
Id,Id1,Id2,Id3Diode current (μA)n,n1,n2,n3Diode ideal factorILOutput current of PV cell (A)kBoltzmann constant, 1.3806503 × 10−23J/KIphPhoto-generated current (A)qElectronic charge, 1.60217646 × 10−19CIsdReverse saturation current of diode (A)NpThe number of solar cells in parallelIsd1Diffusion current (A)NsThe number of solar cells in seriesIsd2, Isd3Saturation current (A)TTemperature of junction (K)IshShunt resistor current (A)VLCell output voltage (V)RshShunt resistor (Ω)VtJunction thermal voltage (V)RsSeries resistance (Ω)D,D1,⋯,DsDifferent ideal diodes


### 2.1. Single Diode Model

As shown in Figure1(a), the SDM is the most widely used PV model, which includes a current source, a parallel diode, a series resistor to represent the loss of load current, and a shunt resistor to denote the leakage current. PV cell output current in the single diode model can be derived as follows [4]:(1)IL=Iph−IsdexpqVt+ILRsnkT−1−VL+ILRsRsh.Figure 1
Equivalent circuit of PV: (a) single diode model, (b) double diode model, (c) triple diode model, and (d) PV module model.
(a)(b)(c)(d)There are five unknown parameters (Iph, Isd, n, Rs, and Rsh) that need to be determined in the single diode based model of the PV cell.


### 2.2. Double Diode Model

The equivalent circuit of the DDM is shown in Figure1(b), which includes a photo-generated current source, two parallel diodes, a series resistor, and a parallel resistor [11]. Similarly, the PV cell output current in the double diode-based model can be derived as follows [29]:(2)IL=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−VL+ILRsRsh.There are seven unknown parameters (Iph, Isd1, Isd2, n1, n2, Rs, and Rsh) that need to be determined in the DDM of the PV cell.


### 2.3. Triple Diode Model

As shown in Figure1(c), the TDM uses a third diode to simulate the leakage current in the grain boundaries of commercial solar cells. The output current IL can be calculated as follows:(3)IL=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−Isd3expqVL+ILRsn3kT−1−VL+ILRsRsh.


### 2.4. PV Module Model

As shown in Figure1(d), the PV module model usually consists of several PV cells connected in series and/or in parallel. The output current can be expressed as follows:(4)IL=IphNp−IsdNpexpqVL/Ns+ILRs/Npn1kT−1−VLNp/Ns+ILRsRsh.Same as in the SDM, there are five unknown parameters (Iph, Isd, n, Rs, and Rsh) that need to be estimated.


### 2.5. Objective Function Definition

The main purpose of identifying the PV model parameters is to improve the parameter accuracy and reduce the difference between experimental data and simulated data. The error functions are defined as follows:For SDM:(5)fkVL,IL,X=Iph−IsdexpqVL+ILRsnkT−VL+ILRsRsh−IL,X=Iph,Isd,Rs,Rsh,z.For DDM:(6)fkVL,IL,X=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−VL+ILRsRsh−IL,X=Iph,Isd1,Isd2,Rs,Rsh,n1,n2.For TDM:(7)fVL,IL,x=Iph−Isd1expVL+ILRsn1Vt−1−Isd2expVL+ILRsn2Vt−1−Isd3expVL+ILRsn3Vt−1−VL+ILRsRsh−IL,x=Iph,Isd1,Isd2,Isd3,Rs,Rsh,n1,n2,n3.For PV module model:(8)fVL,IL,x=Iph−IphexpVL+ILRsNsn1kT−1−VL+ILNsRshNs−IL,x=Iph,Isd,Rs,Rsh,n.There are many objective functions used to describe the error, such as absolute error (AE), mean absolute error (MAE), sum squared error (SSE), and root mean square error (RMSE) [3]. Among them, RMSE is the most adopted function which is described as follows:(9)RMSEX=1N∑k=1NfkVL,IL,X2,where fkVL,IL,X is the error function of the measured and simulated values of the PV model, N stands for the size of the experimental data, and X represents the parameters required to be estimated.


## 2.1. Single Diode Model

As shown in Figure1(a), the SDM is the most widely used PV model, which includes a current source, a parallel diode, a series resistor to represent the loss of load current, and a shunt resistor to denote the leakage current. PV cell output current in the single diode model can be derived as follows [4]:(1)IL=Iph−IsdexpqVt+ILRsnkT−1−VL+ILRsRsh.Figure 1
Equivalent circuit of PV: (a) single diode model, (b) double diode model, (c) triple diode model, and (d) PV module model.
(a)(b)(c)(d)There are five unknown parameters (Iph, Isd, n, Rs, and Rsh) that need to be determined in the single diode based model of the PV cell.


## 2.2. Double Diode Model

The equivalent circuit of the DDM is shown in Figure1(b), which includes a photo-generated current source, two parallel diodes, a series resistor, and a parallel resistor [11]. Similarly, the PV cell output current in the double diode-based model can be derived as follows [29]:(2)IL=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−VL+ILRsRsh.There are seven unknown parameters (Iph, Isd1, Isd2, n1, n2, Rs, and Rsh) that need to be determined in the DDM of the PV cell.


## 2.3. Triple Diode Model

As shown in Figure1(c), the TDM uses a third diode to simulate the leakage current in the grain boundaries of commercial solar cells. The output current IL can be calculated as follows:(3)IL=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−Isd3expqVL+ILRsn3kT−1−VL+ILRsRsh.


## 2.4. PV Module Model

As shown in Figure1(d), the PV module model usually consists of several PV cells connected in series and/or in parallel. The output current can be expressed as follows:(4)IL=IphNp−IsdNpexpqVL/Ns+ILRs/Npn1kT−1−VLNp/Ns+ILRsRsh.Same as in the SDM, there are five unknown parameters (Iph, Isd, n, Rs, and Rsh) that need to be estimated.


## 2.5. Objective Function Definition

The main purpose of identifying the PV model parameters is to improve the parameter accuracy and reduce the difference between experimental data and simulated data. The error functions are defined as follows:For SDM:(5)fkVL,IL,X=Iph−IsdexpqVL+ILRsnkT−VL+ILRsRsh−IL,X=Iph,Isd,Rs,Rsh,z.For DDM:(6)fkVL,IL,X=Iph−Isd1expqVL+ILRsn1kT−1−Isd2expqVL+ILRsn2kT−1−VL+ILRsRsh−IL,X=Iph,Isd1,Isd2,Rs,Rsh,n1,n2.For TDM:(7)fVL,IL,x=Iph−Isd1expVL+ILRsn1Vt−1−Isd2expVL+ILRsn2Vt−1−Isd3expVL+ILRsn3Vt−1−VL+ILRsRsh−IL,x=Iph,Isd1,Isd2,Isd3,Rs,Rsh,n1,n2,n3.For PV module model:(8)fVL,IL,x=Iph−IphexpVL+ILRsNsn1kT−1−VL+ILNsRshNs−IL,x=Iph,Isd,Rs,Rsh,n.There are many objective functions used to describe the error, such as absolute error (AE), mean absolute error (MAE), sum squared error (SSE), and root mean square error (RMSE) [3]. Among them, RMSE is the most adopted function which is described as follows:(9)RMSEX=1N∑k=1NfkVL,IL,X2,where fkVL,IL,X is the error function of the measured and simulated values of the PV model, N stands for the size of the experimental data, and X represents the parameters required to be estimated.


## 3. The Proposed Method

### 3.1. Basic Level-Based Learning Swarm Optimizer (LLSO)

The LLSO is proposed by Yang [57] in 2018 for solving large-scale optimization problems. The basic idea is individuals are usually in different evolution states during evolution, and have different potentials in global and local search space. Algorithm 1 gives the pseudocode of the LLSO. The population P is separated into a number of levels Li1≤i≤NL, where NL represents several levels, according to their fitness value, and then, the individuals in the lower level update by learning from the higher level as follows:(10)vi,jd←r1vi,jd+r2xrl1,k1d−xi,jd+ϕr3xrl2,k2d−xi,jd,xi,jd←xi,jd+vi,jd,where Xi,j=xi,j1,⋯,xi,jd,⋯xi,jD is the location of the jth individual from the ith level and Vi,j=vi,j1,⋯,vi,jd,⋯vi,jD is the velocity. rl1 and rl2 represent the selected two different higher level indexes in the range of 1,i−1, k1 and k2 denote as the randomly selected individual index within 1,LS, where LS is the number of individuals in each level. Through the cooperation of levels, diversity could be enhanced. Figure 2 presents the illustration of the level-based learning strategy. The individuals in the second level learn from the first level, the individuals of the third level learn from the first and second levels, and the individuals in the ith level learn from the first to (i − 1)th levels.Algorithm 1: LLSO.
(1)
Initialize the populationP randomly and calculate the function values of individuals(2)
FES =Np;(3)
Xbest ← the best individual in the P;(4)
while FES < MAXFES do(5)
Sort the population in ascending order and separate them into NL levels;//Update the individuals inLNL, …, L3(6)
Forj = {1, …, LS} do(7)
Select two levels from the top (i − 1) levels: rl1, rl2:(8)
If (rl2 < rl1) then(9)
Swap (rl1, rl2);(10)
End If(11)
Randomly select two particles fromrl1, rl2: Xrl1,k1, Xrl2,k2;(12)
Update particleXi, j according to equations (8) and (9);(13)
Calculate the fitness valuef (Xi, j) of this particle;(14)
If (f (Xi, j) < f (Xbest)) then(15)
Xbest = Xi, j;(16)
End If(17)
End for(18)
FES = FES + LS;(19)
End for//Update the second level(20)
Forj = {1, 2026, LS} do(21)
Select two particles from the first level:X1,k1, X1,k2;(22)
If (f (X1,k2) < f (X1,k1)) then(23)
Swap (X1,k1, X1,k2);(24)
End If(25)
Update particleX2,j according to equations (8) and (9);(26)
Calculate the fitness valuef (X2,j) of this particle;(27)
If (f (X2,j) < f (Xbest)) then(28)
Xbest = X2,j;(29)
End If(30)
End for(31)
FES = FES + LS;(32)
End WhileFigure 2
Illustration of level-based learning strategy.


### 3.2. Stochastic Fractal Search

The stochastic fractal search [31] was inspired by the natural phenomenon of growth [32]. There are two main processes including diffusion and updating. The diffusion operation takes the responsibility of exploration while the updating process performs the neighborhood search for the exploitation task. In the diffusion process, two types of Gaussian random walk are applied to perform the diffusion procedure on each individual, and in the updating process, the new position for every current solution is generated according to the location of other solutions. The updating procedures are defined as follows:(11)X′=Xi−ε×Xr1−Xbest,ε≤0.5,X′=Xi+ε×Xr1−Xr2,ε>0.5,where Xr1 and Xr2 are randomly selected particles from population, Xbest is the best particle, ε is a random number which is uniformly distributed between [0, 1].


### 3.3. The Proposed Algorithm: LLSOF

Through the learning among levels, the LLSO could maintain a good diversity and has promising exploration ability. However, the individuals in the first level do not go through any updating process at all in the original LLSO, which constrains the local search ability. Therefore, the updating procedure of stochastic fractal search is adopted to improve the local search ability of the individuals in the first level in the proposed algorithm. Figure3 shows the flowchart of the proposed level-based learning swarm optimizer with stochastic fractal search (LLSOF). The population is separated into NL levels at first, and each of them has LS individuals. The individuals in Lk ∈ {LNL, …, L3} evolve through learning from {Lk−1, …, L1}, and individuals in L2 update through learning from L1, and individuals in L1 locally search through stochastic fractal search. The interaction through different levels maintains the diversity and the local search of the first level promotes convergence and accuracy.Figure 3
Flowchart of the LLSOF algorithm for the identification of PV parameters.It is worth noting that since the updating procedure of stochastic fractal search can only be implemented on the individuals in the first level, theXr1 and Xr2 from equation (11) are the individuals randomly selected from the first level.


### 3.4. Complexity Analysis

The proposed LLSOF takes the maintenance of the algorithmic simplicity of LLSO, which takesO (NP × log (NP) + NP), to rank the swarm and divide the swarm into NL levels at each generation, and takes O (NP × Dim) to update of particles in all levels, where Dim is the number of variables to be optimized. Overall, the time complexity of the proposed algorithm LLSOF is O (NP × log (NP) + NP + NP × Dim). Therefore, the time complexity is approximately O (NP × log (NP) + NP) due to Dim is much smaller than NP in the parameter identification of PV models. As for the space complexity, LLSOF takes O (NP × Dim) space.


## 3.1. Basic Level-Based Learning Swarm Optimizer (LLSO)

The LLSO is proposed by Yang [57] in 2018 for solving large-scale optimization problems. The basic idea is individuals are usually in different evolution states during evolution, and have different potentials in global and local search space. Algorithm 1 gives the pseudocode of the LLSO. The population P is separated into a number of levels Li1≤i≤NL, where NL represents several levels, according to their fitness value, and then, the individuals in the lower level update by learning from the higher level as follows:(10)vi,jd←r1vi,jd+r2xrl1,k1d−xi,jd+ϕr3xrl2,k2d−xi,jd,xi,jd←xi,jd+vi,jd,where Xi,j=xi,j1,⋯,xi,jd,⋯xi,jD is the location of the jth individual from the ith level and Vi,j=vi,j1,⋯,vi,jd,⋯vi,jD is the velocity. rl1 and rl2 represent the selected two different higher level indexes in the range of 1,i−1, k1 and k2 denote as the randomly selected individual index within 1,LS, where LS is the number of individuals in each level. Through the cooperation of levels, diversity could be enhanced. Figure 2 presents the illustration of the level-based learning strategy. The individuals in the second level learn from the first level, the individuals of the third level learn from the first and second levels, and the individuals in the ith level learn from the first to (i − 1)th levels.Algorithm 1: LLSO.
(1)
Initialize the populationP randomly and calculate the function values of individuals(2)
FES =Np;(3)
Xbest ← the best individual in the P;(4)
while FES < MAXFES do(5)
Sort the population in ascending order and separate them into NL levels;//Update the individuals inLNL, …, L3(6)
Forj = {1, …, LS} do(7)
Select two levels from the top (i − 1) levels: rl1, rl2:(8)
If (rl2 < rl1) then(9)
Swap (rl1, rl2);(10)
End If(11)
Randomly select two particles fromrl1, rl2: Xrl1,k1, Xrl2,k2;(12)
Update particleXi, j according to equations (8) and (9);(13)
Calculate the fitness valuef (Xi, j) of this particle;(14)
If (f (Xi, j) < f (Xbest)) then(15)
Xbest = Xi, j;(16)
End If(17)
End for(18)
FES = FES + LS;(19)
End for//Update the second level(20)
Forj = {1, 2026, LS} do(21)
Select two particles from the first level:X1,k1, X1,k2;(22)
If (f (X1,k2) < f (X1,k1)) then(23)
Swap (X1,k1, X1,k2);(24)
End If(25)
Update particleX2,j according to equations (8) and (9);(26)
Calculate the fitness valuef (X2,j) of this particle;(27)
If (f (X2,j) < f (Xbest)) then(28)
Xbest = X2,j;(29)
End If(30)
End for(31)
FES = FES + LS;(32)
End WhileFigure 2
Illustration of level-based learning strategy.


## 3.2. Stochastic Fractal Search

The stochastic fractal search [31] was inspired by the natural phenomenon of growth [32]. There are two main processes including diffusion and updating. The diffusion operation takes the responsibility of exploration while the updating process performs the neighborhood search for the exploitation task. In the diffusion process, two types of Gaussian random walk are applied to perform the diffusion procedure on each individual, and in the updating process, the new position for every current solution is generated according to the location of other solutions. The updating procedures are defined as follows:(11)X′=Xi−ε×Xr1−Xbest,ε≤0.5,X′=Xi+ε×Xr1−Xr2,ε>0.5,where Xr1 and Xr2 are randomly selected particles from population, Xbest is the best particle, ε is a random number which is uniformly distributed between [0, 1].


## 3.3. The Proposed Algorithm: LLSOF

Through the learning among levels, the LLSO could maintain a good diversity and has promising exploration ability. However, the individuals in the first level do not go through any updating process at all in the original LLSO, which constrains the local search ability. Therefore, the updating procedure of stochastic fractal search is adopted to improve the local search ability of the individuals in the first level in the proposed algorithm. Figure3 shows the flowchart of the proposed level-based learning swarm optimizer with stochastic fractal search (LLSOF). The population is separated into NL levels at first, and each of them has LS individuals. The individuals in Lk ∈ {LNL, …, L3} evolve through learning from {Lk−1, …, L1}, and individuals in L2 update through learning from L1, and individuals in L1 locally search through stochastic fractal search. The interaction through different levels maintains the diversity and the local search of the first level promotes convergence and accuracy.Figure 3
Flowchart of the LLSOF algorithm for the identification of PV parameters.It is worth noting that since the updating procedure of stochastic fractal search can only be implemented on the individuals in the first level, theXr1 and Xr2 from equation (11) are the individuals randomly selected from the first level.


## 3.4. Complexity Analysis

The proposed LLSOF takes the maintenance of the algorithmic simplicity of LLSO, which takesO (NP × log (NP) + NP), to rank the swarm and divide the swarm into NL levels at each generation, and takes O (NP × Dim) to update of particles in all levels, where Dim is the number of variables to be optimized. Overall, the time complexity of the proposed algorithm LLSOF is O (NP × log (NP) + NP + NP × Dim). Therefore, the time complexity is approximately O (NP × log (NP) + NP) due to Dim is much smaller than NP in the parameter identification of PV models. As for the space complexity, LLSOF takes O (NP × Dim) space.


## 4. Experiments and Discussion

In this section, both SDM and DDM are adopted to validate the performance of the proposed algorithm to extract the PV optimal parameters. The data for the current voltage of SDM, DDM, and TDM were measured on 57 mm diameter commercial silicon R. T. C France solar sold under the irradiance of 1,000 W/m2 at 33°C. For Photo Watt-PWP201, which has 36 connected cells in series under a temperature of 45°C with the irradiance of 100 W/m2, and experimental data coming from several manufacturer’s data sheets are considered as well in this paper. Table 2 represents the lower and upper bounds of the involved parameters of the PV model. Seven state-of-the-art metaheuristic algorithms are chosen for comparison, including biogeography-based learning, particle swarm optimization (BLPSO) [34], PGJAYA [6], logistic chaotic JAYA algorithm (LCJAYA) [35], multiple learning backtracking spiral algorithm (MLBSA) [36], SEDE [7], HBA [23], COOT [21], and TSA [20]. Table 3 represents the controlling parameters of the related algorithms. It is worth noting that all involved parameters are in accordance with the original recommendations in the proposed paper. As to the proposed LLSOF, the population size is set to 50, and the number of levels NL is adaptively adjusted through a pool S = [4, 6, 8, 10, 20, 50] and ϕ is set to 0.4 according to LLSO. Each experiment runs 30 independent times. All experiments are implemented on a PC with 1.80 GHz Intel (R) Core (TM) i7-8565U CPU and 16 GB of RAM with MATLAB R2020a. Furthermore, the maximum number of function evaluations (MaxFES) sets to 5×104 for all competitors.Table 2
Parameters of different PV models.
ParametersSDM/DDM/TDMPV module[LB, UB][LB, UB]IphA[0, 1][0, 2]Isd, Isd1, Isd2, Isd3μA[0, 1][0, 50]RsΩ[0, 0.5][0, 2]RshΩ[0, 100][0, 1000]n, n1, n2, n3[1, 2][1, 50]Table 3
Parameter setting of different algorithms.
YearsAlgorithmsDescriptionsControl parameters2018MLBSAMultiple learning backtracking search algorithmNP = 502019PGJAYAPerformance-guided JAYA algorithmNP = 202019LCJAYALogistic chaotic JAYA algorithmNP = 202020TSATunicate swarm algorithmNP = 80;Pmin = 1; Pmax = 42020SEDESelf-adaptive ensemble-based DE;NP = 30;F = [1.0, 1.0, 0.8]; Cr = [0.1, 0.9, 0.2]2021COOTCoot optimization algorithmsNP = 30;p=0.5; NL = 10; Ncoot = 202021DPDEDirectional permutation DENP = 18 × Dim;p=0.11; H = 52021CAJDEChaotic local search-based JADENP = 30;L = 50; r = 0.01; p=0.052022HBAHoney badger algorithmNP = 30;C = 2; β = 6LLSOFLevel-based learning swarm optimizer with stochastic fractal searchNP = 50;ϕ = 0.4


### 4.1. Experimental Results on SDM

The parameters and the best RMSE values obtained by the compared algorithms on SDM are presented in Table4. It is seen that LLSOF and SEDE are tied for the first place among the ten algorithms. The results obtained by SEDE, MLBSA, DPDE, and CAJDE are pretty competitive as well. Moreover, the measured data and the simulated data are plotted in Figure 4. It is observed from Figure 4 that the difference between the measured data and the estimated data by LLSOF is almost negligible, which illustrates that LLSOF could extract the parameters for SDM.Table 4
Comparison of estimation results of the RTC France solar cell using the SDM.
AlgorithmsIphAIsdμARsΩRshΩnRMSEPGJAYA0.76070.32300.036353.71581.48119.86060444E−04LCJAYA0.76070.32370.036353.77101.48149.91598597E−04MLBSA0.76070.32350.036353.75321.48139.86021877E−04SEDE0.76070.32300.036353.71851.48119.86021877E−04HBA0.76070.32300.036353.73001.48123.07128673E−03COOT0.76090.43300.035999.83711.51041.28535049E−03TSA0.78360.29790.019756.62681.48291.70175001E−03DPDE0.76080.32300.036453.71851.48119.86021877E−04CAJDE0.76080.32300.036453.71851.48119.86021877E−04LLSOF0.76070.32300.036353.71851.48119.86021877E−04The best results are marked in bold.Figure 4
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the SDM.
(a)(b)


### 4.2. Experimental Results on DDM

The fitness landscape of the DDM is much more complex than that of the SDM. Therefore, extracting the parameters of DDM throws a bigger challenge to the algorithm. Table5 lists the best RMSE and the involved parameters obtained by the compared algorithms. From Table 5, LLSOF ranks the first compared with the other competitors. It is seen that MLBSA, SEDE, HBA, DPDE, and CAJDE get similar results, which are relatively small as well. Same with DDM, the estimated results and the measured data are plotted in Figure 5; similar results could be observed. The estimated results are entirely consistent with the measured data. These results fully validate LLSOF and are effective for extracting the parameters of the DDM.Table 5
Comparison of estimation results of the RTC France solar cell using the DDM.
AlgorithmsIphAIsdμARsΩRshΩn1Isd2μAn2RMSEPGJAYA0.76080.21160.036855.79201.44550.87402.00009.82605320E−04LCJAYA0.76070.225960.036755.48151.45180.746402.00009.82503561E−04MLBSA0.76080.22730.067055.46121.45150.738352.00009.82484851E−04SEDE0.76080.74930.036755.48542.00000.22601.45109.82484851E−04HBA0.75970.99980.035993.38871.91240.22651.45749.82970552E−04COOT0.76520.81870.029745.15691.60810.72281.77191.67982102E−03TSA0.76320.31060.045520.45361.28000.52911.81403.11825221E−03DPDE0.76080.00000.036755.48542.00000.00001.45109.82484851E−04CAJDE0.76080.74930.036755.48542.00000.22601.45109.82484851E−04LLSOF0.76070.32000.036353.71851.48110.29371.48119.82484851E−04Figure 5
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the DDM.
(a)(b)


### 4.3. Experimental Results on TDM

There are nine parameters that need to be estimated in TDM; therefore, the complexity of the model is noticeably higher. Table6 shows the best RMSE and the involved parameters obtained by the compared algorithms. From Table 6, it can be concluded that the LLSOF achieves the best results with PGJAYA, MLBSA, SEDE, HBA, DPDE, and CAJDE. The power with voltage characteristics gained by LLSOF is illustrated in Figure 6. From Figure 6, the LLSOF’s test values of power and current fit the real model well.Table 6
Comparison of estimation results of the RTC France solar cell using the TDM.
AlgorithmsIphAIsd1μARsΩRshΩn1Isd2μAn2Isd3μAn3RMSEPGJAYA0.76080.38010.036755.48541.45100.55801.58920.00002.00009.82484851E − 04LCJAYA0.76070.25360.036556.25761.46120.58432.00000.00121.85729.85756778E−04MLBSA0.76080.09710.036552.90631.01790.21121.93180.00001.48529.82484851E − 04SEDE0.76080.22600.036755.48542.00000.22601.45100.19142.00009.82484851E − 04HBA0.76080.22600.036755.48541.45100.74932.00000.00001.76839.82484851E − 04COOT0.76080.21330.036855.83491.44620.86092.00000.00171.99951.23160248E−03TSA0.76080.62640.036755.18151.99510.19421.47390.05111.71631.03033980E−03DPDE0.76080.74930.036755.48542.00000.22591.45100.01391.45109.82484851E − 04CAJDE0.76080.74930.036755.48541.45100.00001.38250.74932.00009.82484851E − 04LLSOF0.76080.74930.036755.48542.00000.21201.45100.01391.45109.82484851E − 04Figure 6
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the TDM.
(a)(b)


### 4.4. Experimental Results on the PV Module Model

The best RMSE value and the related parameters obtained by the algorithms on the PV module are listed in Table7. It is observed that LLSOF and SEDE achieved the first place among the other competitors. Except for COOT and TSA, the remaining algorithms could obtain very competitive RMSE results. In addition, Figure 7 shows the obvious I-V and P-V fitting curves of the measured data and the estimated results of LLSOF. It demonstrates that the estimated results achieved by LLSOF are almost equivalent to the measured data. In summary, LLSOF can obtain very accurate parameters.Table 7
Comparison of estimation results of the photowatt-PWP201 solar module.
AlgorithmsIphAIsdμARsΩRshΩnRMSEBLPSO1.03053.48541.2013986.668648.64602.42512012E−03PGJAYA1.03053.46321.2019975.449048.62192.42507488E−03LCJAYA1.03414.87091.1743898.325249.97112.42877254E−03MLBSA1.03053.62001.1968999.828448.79282.42844709E−03STLBO1.03053.48831.2011984.153348.64952.42507526E−03SEDE1.03053.48231.2013981.982348.64282.42507486E−03HBA1.05146.22500.1970889.075482.76482.42507536E−03COOT1.06878.50840.0763999.840286.17761.51913356E−02TSA1.08154.72110.1187283.885279.88951.39303804E−02DPDE1.03053.48230.033327.27721.35112.42507486E−03CAJDE1.03053.48230.033327.27721.35112.42507486E−03LLSOF1.03053.48231.2013981.982348.64282.42507486E−03The best results are marked in bold.Figure 7
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the photowatt-PWP201 model.
(a)(b)


### 4.5. Comparison with Original LLSO

Since LLSOF is modified from LLSO, their comparisons with SDM, DDM, TDM, and PV modules are carried out. Figure8 shows the obtained RMSE results of LLSOF and LLSO with SDM, DDM, TDM, and PV modules in 30 independent runs. It is observed that the results obtained by LLSOF are much more stable than LLSO with all PV models. Meanwhile, the best RMSE values obtained by LLSOF are better than LLSO in almost all instances. The reason is that the introduced random walk could promote the local search and help the population jump out of the local optima. Compared with basic LLSO, the results achieved by LLSOF have smaller variations for different runs, which shows the robustness of LLSOF.Figure 8
Distribution of best results over 30 independent runs. (a) SDM, (b) DDM, (c) TDM, and (d) Photowatt-PWP201 solar module.
(a)(b)(c)(d)


### 4.6. Comparation on CPU Time

The rank of average CPU time for all runs under uniform function evaluations (FEs) is listed in Figure9. The LLSOF consumes the least amount of CPU calculation time due to its concise and efficient structure. Most of the other algorithms consume more execution time than the LLSOF.Figure 9
The rank of average CPU time for the compared algorithms.


### 4.7. Results of Experimental Data from the Manufacturer’s Datasheet

To test the practicability of the proposed algorithm, the manufacturer’s data sheet of three PV modules which includes thin-film (ST40), monocrystalline (SM55), and multicrystalline (KC200GT) [24] is adopted to further evaluate the performance of LLSOF. The used experimental data are directly extracted from the current-voltage curves given in the manufacturer’s data sheets at five different irradiation levels (1000 W/m2, 800 W/m2, 600 W/m2, 400 W/m2, and 200 W/m2) and temperature at 25°C.The best estimated parameters for the three types of PV modules at different levels of irradiation are shown in Table8. From Table 8, it can be observed that for the PV models, Iph and Isd will be increased while Rs, Rsh, and n fluctuate as the irradiance increases in results of RMSE are quite small for all the situations. Moreover, to evaluate the estimated optimal parameters of the PV modules, the obtained current and the I-V characteristics are plotted in Figure 10. It is observed that the calculated data are perfectly matched with the data from the manufacturer. As a whole, the LLSOF could effectively identify the parameters of the PV systems.Table 8
At various irradiance levels andT = 25°C, LLSOF extracted parameter values for PV modules.
ParametersIphAIsdμARsΩRshΩnRMSEThin-film (ST40)200w/m20.53311.4296E−061.1857344.97651.49754.7720089E−04400w/m21.06671.5442E−061.0368379.22091.55397.7929510E−04600w/m21.60442.0816E−061.1041353.99721.50316.9396278E−04800w/m22.13362.1112E−061.0750408.08861.53642.1003116E−031000w/m22.67332.3800E−061.0925406.14831.53281.3936515E−03Monocrystalline (SM55)200w/m20.69151.5118E−070.2779448.98901.38353.2138535E−04400w/m21.38221.6746E−070.3281444.87561.39439.4193343E−04600w/m22.06962.0808E−070.3105492.08421.41231.1437149E−03800w/m22.75635.3919E−070.2598473.23181.49703.4516198E−031000w/m23.44366.2859E−070.28041095.31591.51196.5007079E−03Multicrystalline (KC200GT)200w/m21.64322.2863E−080.1537861.29291.12213.0553221E−03400w/m23.28123.3691E−080.22481726.23711.20637.8213473E−03600w/m24.92414.8503E−080.27974829.38451.23057.8202473E−03800w/m26.56865.4811E−090.25634918.36111.28313.0239818E−031000w/m28.21547.8511E−080.28164169.35551.24792.7433792E−03Figure 10
Comparison between experimental and calculated data for three type modules at different irradiance. (a) Thin-film ST40, (b) monocrystalline SM55, and (c) multicrystalline (KC200GT).
(a)(b)(c)


## 4.1. Experimental Results on SDM

The parameters and the best RMSE values obtained by the compared algorithms on SDM are presented in Table4. It is seen that LLSOF and SEDE are tied for the first place among the ten algorithms. The results obtained by SEDE, MLBSA, DPDE, and CAJDE are pretty competitive as well. Moreover, the measured data and the simulated data are plotted in Figure 4. It is observed from Figure 4 that the difference between the measured data and the estimated data by LLSOF is almost negligible, which illustrates that LLSOF could extract the parameters for SDM.Table 4
Comparison of estimation results of the RTC France solar cell using the SDM.
AlgorithmsIphAIsdμARsΩRshΩnRMSEPGJAYA0.76070.32300.036353.71581.48119.86060444E−04LCJAYA0.76070.32370.036353.77101.48149.91598597E−04MLBSA0.76070.32350.036353.75321.48139.86021877E−04SEDE0.76070.32300.036353.71851.48119.86021877E−04HBA0.76070.32300.036353.73001.48123.07128673E−03COOT0.76090.43300.035999.83711.51041.28535049E−03TSA0.78360.29790.019756.62681.48291.70175001E−03DPDE0.76080.32300.036453.71851.48119.86021877E−04CAJDE0.76080.32300.036453.71851.48119.86021877E−04LLSOF0.76070.32300.036353.71851.48119.86021877E−04The best results are marked in bold.Figure 4
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the SDM.
(a)(b)


## 4.2. Experimental Results on DDM

The fitness landscape of the DDM is much more complex than that of the SDM. Therefore, extracting the parameters of DDM throws a bigger challenge to the algorithm. Table5 lists the best RMSE and the involved parameters obtained by the compared algorithms. From Table 5, LLSOF ranks the first compared with the other competitors. It is seen that MLBSA, SEDE, HBA, DPDE, and CAJDE get similar results, which are relatively small as well. Same with DDM, the estimated results and the measured data are plotted in Figure 5; similar results could be observed. The estimated results are entirely consistent with the measured data. These results fully validate LLSOF and are effective for extracting the parameters of the DDM.Table 5
Comparison of estimation results of the RTC France solar cell using the DDM.
AlgorithmsIphAIsdμARsΩRshΩn1Isd2μAn2RMSEPGJAYA0.76080.21160.036855.79201.44550.87402.00009.82605320E−04LCJAYA0.76070.225960.036755.48151.45180.746402.00009.82503561E−04MLBSA0.76080.22730.067055.46121.45150.738352.00009.82484851E−04SEDE0.76080.74930.036755.48542.00000.22601.45109.82484851E−04HBA0.75970.99980.035993.38871.91240.22651.45749.82970552E−04COOT0.76520.81870.029745.15691.60810.72281.77191.67982102E−03TSA0.76320.31060.045520.45361.28000.52911.81403.11825221E−03DPDE0.76080.00000.036755.48542.00000.00001.45109.82484851E−04CAJDE0.76080.74930.036755.48542.00000.22601.45109.82484851E−04LLSOF0.76070.32000.036353.71851.48110.29371.48119.82484851E−04Figure 5
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the DDM.
(a)(b)


## 4.3. Experimental Results on TDM

There are nine parameters that need to be estimated in TDM; therefore, the complexity of the model is noticeably higher. Table6 shows the best RMSE and the involved parameters obtained by the compared algorithms. From Table 6, it can be concluded that the LLSOF achieves the best results with PGJAYA, MLBSA, SEDE, HBA, DPDE, and CAJDE. The power with voltage characteristics gained by LLSOF is illustrated in Figure 6. From Figure 6, the LLSOF’s test values of power and current fit the real model well.Table 6
Comparison of estimation results of the RTC France solar cell using the TDM.
AlgorithmsIphAIsd1μARsΩRshΩn1Isd2μAn2Isd3μAn3RMSEPGJAYA0.76080.38010.036755.48541.45100.55801.58920.00002.00009.82484851E − 04LCJAYA0.76070.25360.036556.25761.46120.58432.00000.00121.85729.85756778E−04MLBSA0.76080.09710.036552.90631.01790.21121.93180.00001.48529.82484851E − 04SEDE0.76080.22600.036755.48542.00000.22601.45100.19142.00009.82484851E − 04HBA0.76080.22600.036755.48541.45100.74932.00000.00001.76839.82484851E − 04COOT0.76080.21330.036855.83491.44620.86092.00000.00171.99951.23160248E−03TSA0.76080.62640.036755.18151.99510.19421.47390.05111.71631.03033980E−03DPDE0.76080.74930.036755.48542.00000.22591.45100.01391.45109.82484851E − 04CAJDE0.76080.74930.036755.48541.45100.00001.38250.74932.00009.82484851E − 04LLSOF0.76080.74930.036755.48542.00000.21201.45100.01391.45109.82484851E − 04Figure 6
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the TDM.
(a)(b)


## 4.4. Experimental Results on the PV Module Model

The best RMSE value and the related parameters obtained by the algorithms on the PV module are listed in Table7. It is observed that LLSOF and SEDE achieved the first place among the other competitors. Except for COOT and TSA, the remaining algorithms could obtain very competitive RMSE results. In addition, Figure 7 shows the obvious I-V and P-V fitting curves of the measured data and the estimated results of LLSOF. It demonstrates that the estimated results achieved by LLSOF are almost equivalent to the measured data. In summary, LLSOF can obtain very accurate parameters.Table 7
Comparison of estimation results of the photowatt-PWP201 solar module.
AlgorithmsIphAIsdμARsΩRshΩnRMSEBLPSO1.03053.48541.2013986.668648.64602.42512012E−03PGJAYA1.03053.46321.2019975.449048.62192.42507488E−03LCJAYA1.03414.87091.1743898.325249.97112.42877254E−03MLBSA1.03053.62001.1968999.828448.79282.42844709E−03STLBO1.03053.48831.2011984.153348.64952.42507526E−03SEDE1.03053.48231.2013981.982348.64282.42507486E−03HBA1.05146.22500.1970889.075482.76482.42507536E−03COOT1.06878.50840.0763999.840286.17761.51913356E−02TSA1.08154.72110.1187283.885279.88951.39303804E−02DPDE1.03053.48230.033327.27721.35112.42507486E−03CAJDE1.03053.48230.033327.27721.35112.42507486E−03LLSOF1.03053.48231.2013981.982348.64282.42507486E−03The best results are marked in bold.Figure 7
The curves of (a) I-V characteristic and (b) P-V characteristic based on the parameters identified by LLSOF with the photowatt-PWP201 model.
(a)(b)


## 4.5. Comparison with Original LLSO

Since LLSOF is modified from LLSO, their comparisons with SDM, DDM, TDM, and PV modules are carried out. Figure8 shows the obtained RMSE results of LLSOF and LLSO with SDM, DDM, TDM, and PV modules in 30 independent runs. It is observed that the results obtained by LLSOF are much more stable than LLSO with all PV models. Meanwhile, the best RMSE values obtained by LLSOF are better than LLSO in almost all instances. The reason is that the introduced random walk could promote the local search and help the population jump out of the local optima. Compared with basic LLSO, the results achieved by LLSOF have smaller variations for different runs, which shows the robustness of LLSOF.Figure 8
Distribution of best results over 30 independent runs. (a) SDM, (b) DDM, (c) TDM, and (d) Photowatt-PWP201 solar module.
(a)(b)(c)(d)


## 4.6. Comparation on CPU Time

The rank of average CPU time for all runs under uniform function evaluations (FEs) is listed in Figure9. The LLSOF consumes the least amount of CPU calculation time due to its concise and efficient structure. Most of the other algorithms consume more execution time than the LLSOF.Figure 9
The rank of average CPU time for the compared algorithms.


## 4.7. Results of Experimental Data from the Manufacturer’s Datasheet

To test the practicability of the proposed algorithm, the manufacturer’s data sheet of three PV modules which includes thin-film (ST40), monocrystalline (SM55), and multicrystalline (KC200GT) [24] is adopted to further evaluate the performance of LLSOF. The used experimental data are directly extracted from the current-voltage curves given in the manufacturer’s data sheets at five different irradiation levels (1000 W/m2, 800 W/m2, 600 W/m2, 400 W/m2, and 200 W/m2) and temperature at 25°C.The best estimated parameters for the three types of PV modules at different levels of irradiation are shown in Table8. From Table 8, it can be observed that for the PV models, Iph and Isd will be increased while Rs, Rsh, and n fluctuate as the irradiance increases in results of RMSE are quite small for all the situations. Moreover, to evaluate the estimated optimal parameters of the PV modules, the obtained current and the I-V characteristics are plotted in Figure 10. It is observed that the calculated data are perfectly matched with the data from the manufacturer. As a whole, the LLSOF could effectively identify the parameters of the PV systems.Table 8
At various irradiance levels andT = 25°C, LLSOF extracted parameter values for PV modules.
ParametersIphAIsdμARsΩRshΩnRMSEThin-film (ST40)200w/m20.53311.4296E−061.1857344.97651.49754.7720089E−04400w/m21.06671.5442E−061.0368379.22091.55397.7929510E−04600w/m21.60442.0816E−061.1041353.99721.50316.9396278E−04800w/m22.13362.1112E−061.0750408.08861.53642.1003116E−031000w/m22.67332.3800E−061.0925406.14831.53281.3936515E−03Monocrystalline (SM55)200w/m20.69151.5118E−070.2779448.98901.38353.2138535E−04400w/m21.38221.6746E−070.3281444.87561.39439.4193343E−04600w/m22.06962.0808E−070.3105492.08421.41231.1437149E−03800w/m22.75635.3919E−070.2598473.23181.49703.4516198E−031000w/m23.44366.2859E−070.28041095.31591.51196.5007079E−03Multicrystalline (KC200GT)200w/m21.64322.2863E−080.1537861.29291.12213.0553221E−03400w/m23.28123.3691E−080.22481726.23711.20637.8213473E−03600w/m24.92414.8503E−080.27974829.38451.23057.8202473E−03800w/m26.56865.4811E−090.25634918.36111.28313.0239818E−031000w/m28.21547.8511E−080.28164169.35551.24792.7433792E−03Figure 10
Comparison between experimental and calculated data for three type modules at different irradiance. (a) Thin-film ST40, (b) monocrystalline SM55, and (c) multicrystalline (KC200GT).
(a)(b)(c)


## 5. Conclusion

In this paper, an improved and level-based learning with stochastic fractal search (LLSOF) has been proposed to identify the unknown parameters in complex nonlinear PV systems. The proposed algorithm is easy to implement and is applied to solve nonlinear optimization problems. The LLSOF is able to search for better solutions while maintaining a good diversity of the population. Experimental results on a bunch of benchmark problems and manufactures’ data illustrate that LLSOF can find better and more stable solutions than the basic LLSO and the other nine peer methods. However, there are parameters that need to be determined in the proposed algorithm. Therefore, to further improve our work, LLSOF with self-adaptive parameters would be a promising direction. Moreover, the other local search strategy such as the simulated annealing method is worth a try. In our future work, the proposed algorithm would be implemented in the parameter identification for PV cells in the application of illumination and heating for tobacco factory.



---

*Source: 3397430-2023-02-22.xml*