A Population Classification Evolution Algorithm for the Parameter Extraction of Solar Cell Models

Zhang, Yiqun; Lin, Peijie; Chen, Zhicong; Cheng, Shuying

doi:https://doi.org/10.1155/2016/2174573

International Journal of Photoenergy

On this page

Abstract Introduction Conclusions Acknowledgments Supplementary Materials References Copyright Related Articles

Research Article | Open Access

Volume 2016 | Article ID 2174573 | https://doi.org/10.1155/2016/2174573

A Population Classification Evolution Algorithm for the Parameter Extraction of Solar Cell Models

Yiqun Zhang,^1,2Peijie Lin,^1,2Zhicong Chen,^1,2and Shuying Cheng^1,2

Academic Editor: Tamer Khatib

Received11 May 2016

Revised21 Jun 2016

Accepted22 Jun 2016

Published08 Aug 2016

Abstract

To quickly and precisely extract the parameters for solar cell models, inspired by simplified bird mating optimizer (SBMO), a new optimization technology referred to as population classification evolution (PCE) is proposed. PCE divides the population into two groups, elite and ordinary, to reach a better compromise between exploitation and exploration. For the evolution of elite individuals, we adopt the idea of parthenogenesis in nature to afford a fast exploitation. For the evolution of ordinary individuals, we adopt an effective differential evolution strategy and a random movement of small probability is added to strengthen the ability to jump out of a local optimum, which affords a fast exploration. The proposed PCE is first estimated on 13 classic benchmark functions. The experimental results demonstrate that PCE yields the best results on 11 functions by comparing it with six evolutional algorithms. Then, PCE is applied to extract the parameters for solar cell models, that is, the single diode and the double diode. The experimental analyses demonstrate that the proposed PCE is superior when comparing it with other optimization algorithms for parameter identification. Moreover, PCE is tested using three different sources of data with good accuracy.

1. Introduction

The rising cost of fossil fuels, atmospheric pollution, and global energy shortage have prompted the development and use of renewable energy [1, 2]. PV (photovoltaic) systems such as solar cells have recently received significant attention with characteristics of renewability, clean-type, convenience, and low noise technique [1, 3, 4]. PV systems usually operate in outdoor environment and their PV arrays are prone to deteriorate and may even undergo various faults due to harsh weather condition and aging, which greatly affect the solar energy utilization efficiency and even cause safety issues. Therefore, in order to optimize PV systems, it is crucial to evaluate the actual behavior of PV arrays in operation through accurate modeling based on experimental data. Numerous mathematical models have been proposed to clarify the characteristic of a PV system under different operating conditions. However, in practical terms, two solar cell models are the most frequently used: the single and double diode models [3, 5]. Although the double diode model can achieve more precise results than the single diode model, the ability to achieve an adequate concession between simplified and precise results in the single diode model is a more preferable option [6]. Accurate parameters of a mathematical model is crucial to simulate, estimate, and optimize solar cell systems. Therefore, it is necessary to consider parameters identification with a feasible optimization approach [7].

The techniques utilized to identify the parameters of PV models in the literature can be divided in two groups: deterministic techniques and heuristic techniques [2]. Deterministic techniques, that is, least squares [8], Lambert functions [9], and iterative curve fitting [10], force some model constraints like convexity and differentiability which must be exactly used. Thus, these deterministic methods drastically depend on initialization and can also be easy to fall into a local optimum [2]. Recently, based on the theory of reproduction and evolution of different biological populations, many heuristic technologies have been proposed to deal with the parameter estimation issues of solar cells such as particle swarm optimization (PSO) [11, 12], genetic algorithms (GA) [13–15], differential evolution (DE) [4, 16–18], pattern search (PS) [19], simulated annealing (SA) [20], harmony search (HS) [21], and artificial bee swarm optimization (ABSO) [3]. Although heuristic methods present a higher probability of obtaining a global solution in comparison with deterministic ones, they have important limits [13]. In case of GA and PSO, they maintain a trend that concentrates toward local optima, since their elitist mechanism forces premature convergence [2]. Such behavior becomes worse when the optimization algorithm faces multimodal functions. On the other hand, due to the fact that SA and HS are single-searcher algorithms, their performance is sensitive to the starting point of the search, having a lower probability to localize the global minimum in multimodal problems than population algorithms such as GA and PSO [2]. Therefore, GA, PSO, SA, and HS present bad performance when they are applied to multimodal and noisy objective functions. Therefore, there is the possibility to yield better performance with more capable algorithms.

In biological populations, birds have around 10,000 living species, which are the most species of tetrapod vertebrates [22]. In birds, the courtship behavior is innate. During the mating season, a bird tries to find spouse(s) with good genes for raising a brood that can survive for a longer time, which is similar to that of a search for the optimal solution. To develop a more capable heuristic optimization algorithm, Askarzadeh and Rezazadeh [22] propose a bird mating optimizer (BMO). In BMO algorithm, there are four breeding strategies: monogamy, polygamy, polyandry, and promiscuity. Experimental results indicate the superior performance of BMO. However, there are two main drawbacks in BMO: (1) numerous types of birds and (2) numerous numbers of tunable parameters. To overcome these disadvantages, Askarzadeh and dos Santos Coelho [6] propose a simplified BMO algorithm (SBMO). In SBMO algorithm, all birds in the population are ranked according to their objective function values such that the bird with the best objective function value is ranked first. Then, these birds are divided into three types for breeding based on their rank. These three breeding strategies are parthenogenesis, monogamy, and polygamy, respectively. The SBMO algorithm reduces the computational complexity and yields good performance on PV modules.

However, SBMO has a disadvantage of slow convergence. Firstly, the disturbance coefficient in Type 1 (parthenogenesis) is very small, which means the exploitation space is very limited. Thus, it is not easy to find a better solution. Secondly, in Type 2 (monogamy), a female mating bird is randomly selected from Type 1. Therefore, the selected female mating bird may be not the optimal. The convergence speed of Type 2 is limited. Thirdly, Type 3 (polygamy) plays a similar role to Type 2, which means SBMO has no effective strategy to avoid trapping in a local optimum.

The parameter estimation method should be reliable, accurate, and fast, for a range of different types of cells estimation. To further improve the efficiency and reliability of parameters identification of photovoltaic models, here, we propose a new optimization technique referred to as population classification evolution (PCE) to overcome the slow convergence of SBMO. In PCE, we divide the population into two categories, that is, elite and ordinary. The elite are the parthenogenesis corresponding to the neighborhood-based search known as the local search strategy to afford exploitation. In the elite evolution strategy, we magnify the exploitation space to accelerate convergence. In the ordinary, we employ DE mutation “DE/best/1” operator to guide an individual to be close to the global optimum. Then, a crossover operator following mutation is employed to increase the diversity of the population. In addition, we add a random movement of small probability for the evolution of ordinary individuals to further increase the diversity of the population and overcome the premature convergence. Obviously, the ordinary evolution is corresponding to the global search to afford exploration. To estimate the performance of PCE, it is first compared with five well-known evolutional algorithms (EAs), SBMO, cuckoo search (CS), artificial bee colony (ABC), improved adaptive differential evolution (IADE), and self-adapting control parameters in differential evolution (called jDE) on 13 classic benchmark functions. And a start-of-the-art evolutional algorithm called generalized oppositional teaching learning based optimization (GOTLBO) is also adopted to compare with PCE. PCE has a faster convergence speed and higher accuracy than these six EAs on most benchmark functions through emulation. In addition, PCE is applied to extract the parameters of both the single and double diode model. The emulation data indicate that the proposed PCE is superior when comparing it with other parameter extraction methods. Moreover, PCE is tested using three different sources of data with good accuracy.

Organization of the remainder of the paper is as follows. For Section 2, solar cell identification is depicted. In Section 3, the SBMO algorithm is depicted. Section 4 specifies the implementation of our proposed PCE. In Section 5, PCE is estimated on 13 classic benchmark functions. Then, in Section 6, PCE is applied to extract the parameters of PV models. The conclusions are depicted in Section 7.

2. Problem Statement

2.1. Solar Cell Models

An accurate mathematical model describing the electrical characteristics of solar cells is needed in advance. Some equivalent circuit models are used to simulate the current-voltage () behavior for solar cells, but only two models are employed in practice: the double diode model and the single diode model. In this subsection, these models are tersely discussed.

2.1.1. Double Diode Model

Under the illumination, the ideal solar cell model is a photogenerated current source that is shunted by a rectifier diode [3, 13, 21]. Figure 1 shows the equivalent circuit of the double diode model. According to Kirchhoff’s law of electric current and the Shockley equation, the relationship is formulated aswhere is the terminal current; denotes the photogenerated current; and are the first and second diode currents; and is the shunt resistor current. and denote the diffusion and saturation currents, respectively; denotes the terminal voltage; and denote the series and shunt resistances, respectively; q is the electronic charge; (K) denotes the cell temperature; is the Boltzmann constant; and denote the diffusion and recombination diode ideality factors, respectively.

This double diode model includes seven unknown parameters (, , , , , , and ) to be estimated from (1). To reflect the solar cell performance as well as that of the real system, it is crucial to acquire an accurate parameters’ identification.

2.1.2. Single Diode Model

Figure 2 shows the single diode model that is widely employed for modeling solar cells due to its simplicity. It is calculated as follows:where is reverse saturation current of diode and is the diode ideality factor.

For this model, five parameters (, , , , and ) would be estimated in (2).

2.2. Objective Function

The unknown parameters are obtained from the I-V data with an optimization algorithm. In this optimization method, each solution is denoted by a vector, , where for the double diode model and for the single diode model. For expressing the objective function to be optimized, (1) and (2) are altered as follows:

During the optimization process, we adopt the RMSE as the objective function [1, 3] to reflect the difference between the real data and simulated data, which is defined bywhere N is the number of the simulated data.

For this optimization case, the objective function in (4) would be minimized.

3. The Simplified Bird Mating Optimizer

In SBMO [6], the birds are ranked according to their objective function values such that the bird with the best objective function value is ranked first. Then, these birds are divided into three types for breeding based on their rank.

Type 1. The birds of this type are called females that have better objective function values than others. The number of these birds () is determined by

For breeding, female birds employ the following expression based on the idea of parthenogenesis [6, 23–25]:where is the target vector related to the bird, is the mutant vector related to the bird’s brood, and is a random number within and it is worthwhile mentioning that the random numbers are different.

Type 2. The birds of this type are referred to as male birds. The number of these birds () is determined by

For breeding, male birds are interested in mating with one female bird:where is a target vector that is randomly selected from Type 1 for the interesting mate of the male bird.

Type 3. The birds of this type are referred to as male birds. The number of these birds () is determined by

For breeding, male birds are interested in mating with two female birds:where and are two target vectors which are randomly selected from Type 1 for the interesting mates of the male bird.

4. The Proposed Population Classification Evolution Algorithm

In PCE, all individuals in the population are ranked according to their objective function values. The population are divided into two types of evolution based on their rank as follows.

Type 1. The individuals of this type in the population are referred to as elite individuals that have better objective function values than others. The number of these elites () is determined by (5).

We employ the following expression for the evolution of elite individuals:

It is worthwhile mentioning that we modify (6) and the disturbance coefficient from (11) is larger than that of (6), which can expand the exploitation space. At the early stage of the optimization process, the larger search step would be faster to search a better solution, which can accelerate convergence.

Type 2. The individuals of this type are referred to as ordinary individuals. The number of these individuals () is determined by

The DE algorithm [26], which is primarily employed for numerical optimization problems, is a parallel direct search technology that uses NP D-dimensional vectors. In ordinary individuals, we employ the differential evolution “DE/best/1” mutation operator [27] that uses the information of the best individual in the population to guide an individual to be close to the global optimum, which helps to accelerate the convergence speed. The “DE/best/1” operator is as follows:where indexes and denote mutually different integers randomly generated from the range [1, NP]. is the best-so-far solution with the best fitness (i.e., lowest objective function value for a minimization problem) in the current population.

Although the “DE/best/1” operator can accelerate the convergence speed, another aspect should be considered. Playing a guiding role only through makes it easier to trap in a local optimum. Thus, a crossover operator following mutation is employed to increase the diversity of the population. The crossover operator is employed to generate the trial vector between and :where denotes the crossover rate, which is set from the user; denotes a uniform random number; and denotes a randomly generated index that insures that obtains at least one ingredient from .

In addition, because Type 3 plays a similar role to Type 2 in SBMO, we remove Type 3; then a random movement of small probability is added to further increase population diversity and strengthen the ability of jumping out of a local optimum for the ordinary evolution [28]. The expression of the random movement is defined as follows:where and are the initial lower bound and upper bound of the th dimension of the th vector, respectively.

Therefore, using (13), (14), and (15), the method of ordinary individuals evolution can be defined as follows:where denotes the probability of differential evolution in ordinary individuals. Here, is set to 0.9, which means the probability of the random movement is 0.1.

An optimization algorithm should be able to satisfactorily compromise between exploitation and exploration to effectively probe the search space [6]. In the proposed population classification evolution approach, the individuals in Type 1 are the neighborhood-based search known as the local search strategy to afford exploitation. Conversely, the other individuals (Type 2) of the population move through the search space with respect to memory and randomness known as the global search to afford exploration. The random movement in Type 2 is utilized to generate a new individual, which may explore a better solution to overcome the premature convergence.

The pseudocode of the proposed PCE algorithm is summarized in Algorithm 1.

Step 1 (Initialization)
() Randomly initialize the entire individuals of population within the upper
bound and lower bound;
() Evaluate fitness of the population according to the objective function.
Step 2 (The population classification evolution)
Rank the individuals according to their fitness, then determine the number of each individual
type and classify them, and obtain the best individual
for (all individuals in the population)
if individual th belongs to Type 1
(elite individuals evolution)
Produce the elite individual evolution with (11)
else
(ordinary individuals evolution)
Produce the ordinary individual evolution with (16)
end if
Evaluate whether the evolutionary individual can replace the previous individual using greedy
selection scheme based on the survival of the fittest idea in the nature.
end for
Step 3. If the termination criteria is satisfied, stop; otherwise go to Step 2.

5. Simulation Experiments on Benchmark Functions

5.1. Experimental Setup

To evaluate the optimal performance of PCE, 13 widely used standard benchmark functions are applied from [1, 29]. The search space, space dimension, and optimal value of the 13 functions are listed in Table 1. belong to unimodal functions, and belong to multimodal functions.

The proposed PCE algorithm is compared with six EAs, namely, SBMO [6], CS [30], ABC [31], IADE [17], jDE [29], and GOTLBO [1]. It is worthwhile mentioning that GOTLBO [1], recently proposed by Brest et al., is efficiently utilized to identify the parameters for PV models. Table 2 lists the configuration values of tunable parameters of the mentioned algorithms with reference to the relevant literature.

To simulate the optimization performance among the different algorithms, the performance criteria are employed as follows [1]:(i)ANFES. ANFES represents the average number of objective function evaluations. It is employed to store the number of objective function evaluations when a solution x satisfying is found for each run, where is the best value and is a rather small positive constant as the required accuracy for different issues. ANFES can evaluate the convergence speed for an optimization technology.(ii)SR (Successful Rate). SR represents the number of successful runs among all runs. The successful run signifies that the algorithm can achieve before the max. number of objective function evaluations (MaxNFES) condition terminates the optimization process.

Here, the results are obtained in 50 independent runs to ensure a fair comparison for all involved algorithms. For functions , MaxNFES = 10000D, and = 10⁻⁸ [1, 32].

5.2. Experimental Results

Table 3 demonstrates the experimental results of seven EAs on 13 standard benchmark functions. Best, Mean, Worst, and Std. signify the best objective function value, mean objective function value, worst objective function value, and standard deviation, respectively. Table 4 shows that six EAs achieve the number of the best performances on 13 benchmark functions.

For the unimodal functions , PCE yields the optimal results on all unimodal functions. GOTLBO yields the optimal results on 2 functions. jDE yields the optimal result on 1 function. The other four EAs do not obtain the optimal performance.

For the multimodal functions, PCE obtains the optimal result on 4 functions, . jDE also obtains the optimal results on 4 functions, and . GOTLBO obtains the optimal results on 2 functions, and , whereas the other four EAs do not obtain the optimal performance.

In general, on 13 benchmark functions, PCE is superior to the other six EAs, obtaining the best performance on 11 functions, .

The SR and ANFES are listed in Table 5. For the unimodal functions , PCE obtains optimal results compared to the other six EAs for the optimal SR on 6 functions . For function , only the SR of PCE can reach 100%. GOTLBO obtains the optimal SR on 5 functions, and . CS, ABC, and jDE obtain the optimal SR on 3 functions, and f₆. SBMO obtains the optimal SR on 4 functions, . IADE obtains the optimal SR on 2 functions, . For the ANFES, PCE exhibits a faster convergence speed than the other six EAs on 6 functions, .

For the multimodal functions, PCE, ABC, and jDE yield the optimal SR on 5 functions. GOTLBO obtains the optimal SR on 4 functions. For the ANFES values, PCE obtains the best results among seven EAs on 5 functions, whereas the other six EAs do not obtain the optimal ANFES.

5.3. Discussion

The common benchmark functions have been applied to estimate the optimization performance of PCE compared with six representative EAs. According to the experimental results, we can summarize the following:(i)PCE has a faster convergence speed than SBMO, CS, ABC, IADE, jDE, and GOTLBO on all unimodal functions. Additionally, PCE obtains the optimal performance on all unimodal functions when comparing it with these six EAs.(ii)On most multimodal functions, PCE has a faster convergence speed and higher accuracy than SBMO, CS, ABC, IADE, jDE, and GOTLBO.(iii)PCE is especially suitable to be used on unimodal functions.

On the whole, the proposed PCE algorithm has the best performance among all compared algorithms.

6. Parameter Extraction for Solar Cell Models Using PCE

The characteristics of a commercial silicon solar cell (RTC France) with 57 mm diameter are employed to test the performance of PCE for parameter extraction technology. The real data have been employed under 1 sun (1000 W/m²) at 33°C [1, 8]. The () characteristics of the extracted parameters by PCE are compared with the () characteristics which are obtained from [8]. The data are listed in Table 6. For the single and double diode models, the search spaces of each parameter are listed in Table 7 [1, 4].

6.1. Comparison with Other EAs

In this subsection, PCE is compared with six EAs for solar cell models to show its optimization performance.

For a single diode model, MaxNFES is 10,000, whereas, for a double diode model, MaxNFES is 20,000. The constant is set to be 0.002 for both the single diode model and the double diode model [1]. The configuration values of tunable parameters of the mentioned algorithms with reference to the relevant literature are presented in Table 8, and every algorithm is independently run 50 times.

Table 9 shows the comparative results for the single diode model. PCE obtains best results among the best, mean, worst, and Std. RMSE values. jDE obtains the best RMSE value the same as PCE with a value of . For the SR value, CS, jDE, GOTLBO, and PCE achieve a value of 100%. PCE obtains best value of 1380 in terms of ANFES. Obviously, PCE has a more stable performance compared with other six algorithms for the single diode model based on RMSE, SR, and ANFES.

For a single diode model, the convergence graph of different EAs is plotted in Figure 3. Figure 3 shows that in the whole stage PCE converges the fastest, followed by jDE. PCE is capable of successively converging toward the optimal solutions during the whole evolutionary process.

For the double diode model, the comparative data are shown in Table 10. PCE obtains best results among the best, mean, worst, and Std. RMSE values, SR, and ANFES compared with the other six EAs, which means PCE is superior to other six algorithms.

For a single diode model, the convergence graph of different EAs is plotted in Figure 4. Figure 4 shows that in the whole stage PCE converges the fastest. Therefore, PCE is capable of successively converging toward the optimal solutions during the whole evolutionary process.

6.2. Compared with the Results of the Literature

In this subsection, PCE are compared with -IJADE [4], ABSO [3], IGHS [21], and GOTLBO [1], in terms of the five parameters for the single diode model or the seven parameters for the double diode model. Additionally, the optimal RMSE value is also compared from the related literature. These algorithms are adopted for comparison because of their good performance.

Table 11 records the comparative results for a single diode model. PCE and -IJADE achieve the optimal RMSE value that is , which is better than other compared algorithms. The RMSE values from good to bad for GOTLBO, ABSO, and IGHS are , , and , respectively. The computational cost of an optimization algorithm adopts the NFES to characterization. NFES in the last row of Table 11 is the number of objective function evaluations for one run [1]. The NFES for PCE, -IJADE, and GOTLBO are set to be 10,000, whereas the NFES for ABSO and IGHS are set to be 150,000.

For the double diode model, the comparative results are recorded in Table 12. PCE and -IJADE achieve the optimal RMSE value, that is, , which is better than other compared algorithms. GOTLBO obtains the second best RMSE value (), which is rather close to the RMSE value of PCE and -IJADE. The RMSE values from good to bad for ABSO and IGHS are and , respectively. The NFES for PCE, -IJADE, and GOTLBO are set to be 20,000, whereas the NFES for ABSO and IGHS are set to be 150,000.

According to Tables 11 and 12, it is clear that the results of PCE are similar to those of -IJADE. Therefore, the convergence graphs of both PCE and -IJADE that are employed to further demonstrate the optimization performance are plotted in Figure 5. The convergence graph for the single diode model shows that PCE has a faster convergence speed than -IJADE. Since about 6700 NFEs, the convergence of PCE and -IJADE is almost consistent. The convergence graph for the double diode model shows that in the early stage PCE has faster convergence. Later, the convergence speeds of both PCE and -IJADE are very close and tend to be of a similar value. Therefore, PCE has a faster convergence speed than -IJADE for both the single and double diode model.

(a)

(b)

Figure 6 shows the behaviors obtained by PCE along with the real data for the single diode model and double diode model. The results explicitly manifest the simulated data obtained by PCE as being highly consistent with the real data, which indicates that the identified parameters with PCE are rather precise.

(a)

(b)

6.3. Results for PCE Tested with an Experimental Data from the Manufacturer’s Data Sheet

Here the proposed PCE technique is employed to extract the optimal parameters of the single diode model for three solar modules of different types (monocrystalline (SM55) [33], thin-film (ST40) [34], and multicrystalline (KC200GT) [35]). The () characteristics of the extracted parameters by PCE are compared with the () characteristics which are obtained from the manufacturer’s data sheets for the same modules and at the same environmental conditions. The real data was collected at five different irradiance levels of mainly 1000 W/m², 800 W/m², 600 W/m², 400 W/m², and 200 W/m², with constant temperature and at three different levels of temperatures, with constant irradiance.

The optimal parameters are extracted and illustrated in Tables 13–15 of the single diode model for the three types of the solar modules at different temperatures. Moreover, Table 16 is provided for the optimal extracted parameters at different levels of irradiance. The () characteristics are plotted for the three solar modules at different temperatures as shown in Figures 7–9 and at different irradiance levels as shown in Figures 10–12.

It can be observed that the estimated optimal parameters by PCE technique indicate a more accurate () curves over the entire ranges of the real data set with very low RMSE at all irradiance levels and temperature values under test. This also shows the good performance of the proposed PCE technique. Moreover, the new PCE technique achieves accurate extraction of the solar modules parameters at low irradiance which is very crucial when the module is subjected to certain mismatch conditions such as partial shading.

7. Conclusions

In this paper, inspired by the mating strategies, we develop a novel optimization method referred to as PCE to overcome the slow convergence of SBMO. In PCE, there are three adjustable parameters: (all individuals in the population), (the differential evolution probability), and (the crossover rate). In this study, the parameters are tuned to , , and .

To verify the optimization performance of PCE, we compare it with six EAs, that is, SBMO, CS, ABC, IADE, jDE, and GOTLBO. PCE is initially estimated on 13 classic benchmark functions. The simulated data indicate that PCE has a faster convergence speed and higher accuracy, and it has the best results on 11 functions among these six algorithms.

Then, PCE is applied to accurately estimate the parameter of solar cell models like the single and double diode model. PCE performs the best performance among the six algorithms. For the single diode model, PCE yields the best RMSE value of . For the double diode model, PCE yields the best RMSE value of . Compared with other optimization algorithms in the literature, such as IGHS, ABSO, -IJADE, and GOTLBO, the final convergence of PCE and -IJADE is almost consistent for both the single and double diode model. However, the convergence graphs for both the single and double diode models show that in the early stage PCE has a faster convergence speed compared with -IJADE. In addition, PCE is tested using three different sources of data at different irradiance levels with constant temperature and at three different temperatures, with constant irradiance. From the experiment results, RMSE for various weather conditions reached the value of 10⁻⁵. Therefore, the parameter extraction performance of the proposed PCE technique is verified with good accuracy.

Therefore, the proposed PCE technique provides a good balance between exploration and exploitation. The new technique provides another optional method to extract parameters of solar cell models. In the future research, by mathematical analysis using a dynamic system, such as the Markov chains, we are going to prove and explain the convergence of the proposed approach.

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This research was supported by the National Natural Science Foundation of China (no. 61574038), the Science Foundation of Fujian Education Department (no. JK2014003 and no. JA14038), the Science Foundation of Fujian Science & Technology Department (no. 2015H0021, nos. 2015J05124 and 2016H6012), and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry (no. LXKQ201504).

Supplementary Materials

In the Matlab code of the proposed PCE, the file of "pce_main.m" is the main function. It first calls the file of "INITIALIZE_sol_and_gBest.m" for the population initialization. Then, it calls the file of "pce.m" to update each invidual using the proposed strategy of Population Classification Evolution. In the code, according to the strategy, we made the corresponding notes.

Supplementary Material

References

X. Chen, K. Yu, W. Du, W. Zhao, and G. Liu, “Parameters identification of solar cell models using generalized oppositional teaching learning based optimization,” Energy, vol. 99, pp. 170–180, 2016.
View at: Publisher Site | Google Scholar
D. Oliva, E. Cuevas, and G. Pajares, “Parameter identification of solar cells using artificial bee colony optimization,” Energy, vol. 72, pp. 93–102, 2014.
View at: Publisher Site | Google Scholar
A. Askarzadeh and A. Rezazadeh, “Artificial bee swarm optimization algorithm for parameters identification of solar cell models,” Applied Energy, vol. 102, pp. 943–949, 2013.
View at: Publisher Site | Google Scholar
W. Gong and Z. Cai, “Parameter extraction of solar cell models using repaired adaptive differential evolution,” Solar Energy, vol. 94, pp. 209–220, 2013.
View at: Publisher Site | Google Scholar
K. Ishaque, Z. Salam, H. Taheri, and A. Shamsudin, “A critical evaluation of EA computational methods for photovoltaic cell parameter extraction based on two diode model,” Solar Energy, vol. 85, no. 9, pp. 1768–1779, 2011.
View at: Publisher Site | Google Scholar
A. Askarzadeh and L. dos Santos Coelho, “Determination of photovoltaic modules parameters at different operating conditions using a novel bird mating optimizer approach,” Energy Conversion and Management, vol. 89, pp. 608–614, 2015.
View at: Publisher Site | Google Scholar
W. Han, H.-H. Wang, and L. Chen, “Parameters identification for photovoltaic module based on an improved artificial fish swarm algorithm,” Scientific World Journal, vol. 2014, Article ID 859239, 12 pages, 2014.
View at: Publisher Site | Google Scholar
T. Easwarakhanthan, J. Bottin, I. Bouhouch, and C. Boutrit, “Nonlinear minimization algorithm for determining the solar cell parameters with microcomputers,” International Journal of Solar Energy, vol. 4, no. 1, pp. 1–12, 1986.
View at: Publisher Site | Google Scholar
A. Ortiz-Conde, F. J. G. Sánchez, and J. Muci, “New method to extract the model parameters of solar cells from the explicit analytic solutions of their illuminated I–V characteristics,” Solar Energy Materials and Solar Cells, vol. 90, no. 3, pp. 352–361, 2006.
View at: Publisher Site | Google Scholar
Q. Niu, L. Zhang, and K. Li, “A biogeography-based optimization algorithm with mutation strategies for model parameter estimation of solar and fuel cells,” Energy Conversion and Management, vol. 86, pp. 1173–1185, 2014.
View at: Publisher Site | Google Scholar
M. Ye, X. Wang, and Y. Xu, “Parameter extraction of solar cells using particle swarm optimization,” Journal of Applied Physics, vol. 105, no. 9, Article ID 094502, 2009.
View at: Publisher Site | Google Scholar
H. Wei, J. Cong, X. Lingyun, and S. Deyun, “Extracting solar cell model parameters based on chaos particle swarm algorithm,” in Proceedings of the International Conference on Electric Information and Control Engineering (ICEICE '11), pp. 398–402, IEEE, Wuhan, China, April 2011.
View at: Publisher Site | Google Scholar
J. A. Jervase, H. Bourdoucen, and A. Al-Lawati, “Solar cell parameter extraction using genetic algorithms,” Measurement Science and Technology, vol. 12, no. 11, pp. 1922–1925, 2001.
View at: Publisher Site | Google Scholar
M. Zagrouba, A. Sellami, M. Bouaïcha, and M. Ksouri, “Identification of PV solar cells and modules parameters using the genetic algorithms: application to maximum power extraction,” Solar Energy, vol. 84, no. 5, pp. 860–866, 2010.
View at: Publisher Site | Google Scholar
M. R. AlRashidi, M. F. AlHajri, K. M. El-Naggar, and A. K. Al-Othman, “A new estimation approach for determining the I-V characteristics of solar cells,” Solar Energy, vol. 85, no. 7, pp. 1543–1550, 2011.
View at: Publisher Site | Google Scholar
K. Ishaque and Z. Salam, “An improved modeling method to determine the model parameters of photovoltaic (PV) modules using differential evolution (DE),” Solar Energy, vol. 85, no. 9, pp. 2349–2359, 2011.
View at: Publisher Site | Google Scholar
L. L. Jiang, D. L. Maskell, and J. C. Patra, “Parameter estimation of solar cells and modules using an improved adaptive differential evolution algorithm,” Applied Energy, vol. 112, pp. 185–193, 2013.
View at: Publisher Site | Google Scholar
K. Ishaque, Z. Salam, S. Mekhilef, and A. Shamsudin, “Parameter extraction of solar photovoltaic modules using penalty-based differential evolution,” Applied Energy, vol. 99, pp. 297–308, 2012.
View at: Publisher Site | Google Scholar
M. F. AlHajri, K. M. El-Naggar, M. R. AlRashidi, and A. K. Al-Othman, “Optimal extraction of solar cell parameters using pattern search,” Renewable Energy, vol. 44, pp. 238–245, 2012.
View at: Publisher Site | Google Scholar
K. M. El-Naggar, M. R. AlRashidi, M. F. AlHajri, and A. K. Al-Othman, “Simulated Annealing algorithm for photovoltaic parameters identification,” Solar Energy, vol. 86, no. 1, pp. 266–274, 2012.
View at: Publisher Site | Google Scholar
A. Askarzadeh and A. Rezazadeh, “Parameter identification for solar cell models using harmony search-based algorithms,” Solar Energy, vol. 86, no. 11, pp. 3241–3249, 2012.
View at: Publisher Site | Google Scholar
A. Askarzadeh and A. Rezazadeh, “A new heuristic optimization algorithm for modeling of proton exchange membrane fuel cell: bird mating optimizer,” International Journal of Energy Research, vol. 37, no. 10, pp. 1196–1204, 2013.
View at: Publisher Site | Google Scholar
K. Katayama and H. Narihisa, “On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 356–363, May 2001.
View at: Google Scholar
M. Barukčić, S. Nikolovski, and F. Jovíc, “Hybrid evolutionary-heuristic algorithm for capacitor banks allocation,” Journal of Electrical Engineering, vol. 61, no. 6, pp. 332–340, 2010.
View at: Google Scholar
J. Wu and H. Wang, “A parthenogenetic algorithm for the founder sequence reconstruction problem,” Journal of Computers, vol. 8, no. 11, pp. 2934–2941, 2013.
View at: Publisher Site | Google Scholar
R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
View at: Publisher Site | Google Scholar | MathSciNet
S. Das, A. Abraham, U. K. Chakraborty, and A. Konar, “Differential evolution using a neighborhood-based mutation operator,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 526–553, 2009.
View at: Publisher Site | Google Scholar
W.-C. Yeh, “Orthogonal simplified swarm optimization for the series–parallel redundancy allocation problem with a mix of components,” Knowledge-Based Systems, vol. 64, pp. 1–12, 2014.
View at: Publisher Site | Google Scholar
J. Brest, S. Greiner, B. Bošković, M. Mernik, and V. Zumer, “Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 6, pp. 646–657, 2006.
View at: Publisher Site | Google Scholar
X.-S. Yang and S. Deb, “Cuckoo search via Lévy flights,” in Proceedings of the World Congress on Nature & Biologically Inspired Computing (NaBIC '09), pp. 210–214, Coimbatore, India, December 2009.
View at: Publisher Site | Google Scholar
D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007.
View at: Publisher Site | Google Scholar
P. N. Suganthan, N. Hansen, J. J. Liang et al., “Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization,” KanGAL Report 2005005, 2005.
View at: Google Scholar
SHELL, Shell SM55 photovoltaic solar module, http://www.solarquest.com/microsolar/suppliers/siemens/sm55.pdf.
Characteristics of a PV module PV module: shell solar, ST 40, http://ohodas.opx.pl/shell-st40-solar-panel.php.
Kyocera, KC200GT, high efficiency multicrystal photovoltaic module, 2012, http://www.kyocerasolar.com/assets/001/5195.pdf.

Copyright

Copyright © 2016 Yiqun Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1302

Downloads

1004

Citations