Abstract

Modeling solar photovoltaic (PV) systems accurately is based on optimal values of unknown model parameters of PV cells and modules. In recent years, the use of metaheuristics for parameter extraction of PV models gains more and more attentions thanks to their efficacy in solving highly nonlinear multimodal optimization problems. This work addresses a novel application of supply-demand-based optimization (SDO) to extract accurate and reliable parameters for PV models. SDO is a very young and efficient metaheuristic inspired by the supply and demand mechanism in economics. Its exploration and exploitation are balanced well by incorporating different dynamic modes of the cobweb model organically. To validate the feasibility and effectiveness of SDO, four PV models with diverse characteristics including RTC France silicon solar cell, PVM 752 GaAs thin film cell, STM6-40/36 monocrystalline module, and STP6-120/36 polycrystalline module are employed. The experimental results comparing with ten state-of-the-art algorithms demonstrate that SDO performs better or highly competitively in terms of accuracy, robustness, and convergence. In addition, the sensitivity of SDO to variation of population size is empirically investigated. The results indicate that SDO with a relatively small population size can extract accurate and reliable parameters for PV models.

1. Introduction

Rising energy costs, losses in the present-day electricity grid, risks from nuclear power generation, and global environmental changes highlight the increasing significance of renewable energy resources for electricity generation [1]. Among renewable energy resources, solar energy is the most abundant natural resource with many advantages such as easily exploitable, clean, discreet, inexhaustible, long lasting, and reliable [2, 3]. It has made a leap forward in recent years. According to the International Energy Agency (IEA) [4], renewable energy resources will have the fastest growth in the electricity sector, providing almost 30% of power demand in 2023, up from 24% in 2017. During this period, solar photovoltaic (PV) contributes the most with expected 575 GW of new installed capacity. Owing to the ever-growing capacity of PV in power systems, PV brings about great changes to power system planning and operating. In such a context, optimal PV models appear especially important to analyze their dynamic conversion behaviors under diverse environmental conditions. Electrical equivalent circuit models are the most popular tools to describe the input-output characteristics of PV cells and modules. Among them, the single diode model (SDM) and the double diode model (DDM) are the most commonly used models [5]. The SDM and DDM have five and seven unknown model parameters, respectively. Extracting accurate values for these unknown parameters is the premise and promise of optimal PV models.

Up to now, a great number of parameter extraction methods for PV models have been elaborated. They can be broken down into two categories from solution principles: analytical methods and optimization methods. The analytical methods are a “taking a part for the whole” methodology. Namely, they mainly rely highly on several key data points provided by the manufacturer. These data points such as short-circuit point, open-circuit point, and maximum power point of the current-voltage (I-V) characteristic curve are nameplate rating data measured under standard test condition (STC). They will change over time due to PV degradation [6]. In addition, some assumptions and approximations are introduced to simplify the established mathematical models. In such contexts, the analytical methods will result in inaccuracy in the involved model parameters.

Unlike the analytical methods, the optimization methods are a “taking all actual measured data for the whole” methodology. They are no longer confined to several key data points under the STC provided by the manufacturer but extended to depending on a large number of data points measured under actual operating conditions. These data points cover a wide range of the I-V characteristic curve and thereby can reflect the actual relationship between inputs and outputs of a PV model. The optimization methods firstly construct an objective function to reflect the difference between the measured data and the calculated data based on the idea of curve fitting and then minimize the resultant objective function to obtain values for the unknown model parameters. The optimization methods consist of deterministic methods and metaheuristic methods. The former, including Newton method [7], Newton–Raphson method [8], iterative curve fitting [9], and Levenberg–Marquardt algorithm [10], are considerably dependent on the gradient information and subjected to initial conditions. Therefore, they easily plunge into local minima leading to inaccurate and unreliable solutions especially for complicated multimodal problems such as the parameter extraction problem of PV models.

Different from the deterministic methods, the metaheuristic methods do not need the gradient information. They have no requirements on the specific search domain information or the continuity/convexity of objective functions and exhibit the merits of robustness, simplicity, ease of implementation, etc. [1113]. Consequently, they are considered global optimization algorithms and have received increasing interests in recent years. The parameter extraction problem of PV models is highly nonlinear, nonconvex, and has many local minima. Under this circumstance, the use of metaheuristic methods for this problem seems to be a promising alternative. Up to now, many metaheuristic methods have been applied to solve this problem. For example, Ismail et al. [14] applied the genetic algorithm (GA) to compute the parameters of both SDM and DDM. Chellaswamy and Ramesh [15] proposed a differential evolution (DE) technique with adaptive mutation factor and crossover rate to different solar cell types. Biswas et al. [16] implemented a linear population size reduction technique of success history-based adaptive DE to estimate parameters for PV models. Jordehi [17] developed a five-staged successive mutation strategy to construct a high-quality leader to pull all particles in particle swarm optimization (PSO) and applied the resultant improved algorithm to three PV models. Merchaoui et al. [18] introduced an adaptive mutation to alleviate the premature convergence of PSO. Askarzadeh and Leandro [19] simplified the original bird mating optimizer (BMO) and used the improved algorithm to an amorphous silicon PV module at different operating conditions. Ali et al. [20] applied multiverse optimization (MVO) to extract five parameters for the SDM. Oliva et al. [21] utilized the chaotic maps to improve the performance of the whale optimization algorithm (WOA) and applied the improved algorithm to different PV models. Chen et al. [22] employed generalized opposition-based learning to enhance teaching-learning-based optimization (TLBO) and applied the modified algorithm to two PV models. Yu et al. [23] obtained parameters for three PV models by an improved JAYA algorithm with three strategies including self-adaptive weight, experience-based learning strategy, and chaotic elite learning method. Xiong et al. solved the parameter extraction problem of different PV models by using several metaheuristics including symbiotic organisms search (SOS) algorithm [24], improved WOA based on two modified prey searching strategies [25], and hybrid DE with WOA [26]. In addition to the aforementioned metaheuristics, many more [2740] have also been presented to solve the important problem.

The abovementioned metaheuristics have, to some extent, proven themselves promising methods for the parameter extraction problem of PV models. Their performances are largely attributed to their own well-tuned parameters and well-designed search strategies for balancing the exploration and exploitation. According to the famous no-free-launch theorem [41], there is no “one size fits all” approach for solving all optimization problems. Similarly, there is no “one size fits all” metaheuristic for extracting accurate parameters for all PV models, which highly motivates the authors to attempt new ones for the purpose of achieving optimal or suboptimal solutions for the problem considered here.

In this paper, a very young and effective metaheuristic named supply-demand-based optimization (SDO) [42] developed in 2019 is first applied to the parameter extraction problem of PV models. SDO mathematically mimics both the demand relation of consumers and supply relation of producers described by the famous cobweb theory in economics. According to the cobweb model [43, 44], markets have three dynamic modes, i.e., convergent mode, divergent mode, and closed mode. They correspond to the exploitation, exploration, and demarcation between them in SDO, respectively. SDO can incorporate these three modes organically. It has shown high competition in solving some benchmark test functions and mechanical engineering optimization problems compared with some popular metaheuristics such as PSO, DE, GA, and TLBO. In this paper, the SDO is applied to four PV models with diverse characteristics, i.e., the RTC France silicon solar cell, PVM 752 GaAs thin film cell, STM6-40/36 monocrystalline module, and STP6-120/36 polycrystalline module. Ten state-of-the-art metaheuristics are employed to verify the feasibility and effectiveness of SDO. Besides, the sensitivity of SDO to variation of population size is also empirically investigated.

The rest of this paper is organized as follows. Section 2 describes the mathematical formulation of parameter extraction problem of PV models. Section 3 introduces the supply and demand mechanism of the cobweb model. The SDO is detailed in Section 4. Section 5 presents the experimental results and comparisons. Finally, the paper is concluded in Section 6.

2. Problem Formulation

2.1. Single Diode Model (SDM)

The output current of the SDM shown in Figure 1 is calculated as follows:where , , and denote the photogenerated current, shunt resistor current, and diode current, respectively. and are formulated as follows [5, 4547]:where is the saturation current, is the output voltage, and are the series resistance and shunt resistance, respectively, is the diode ideal factor, is the Boltzmann constant (1.3806503 × 10−23 J/K), is the electron charge (1.60217646 × 10−19 C), and is the cell temperature (K).

By incorporating equations (2)–(4) into (1), the output current can be yielded as follows:

It is obvious that the SDM has five unknown parameters (i.e., ) that need to be extracted.

2.2. Double Diode Model (DDM)

The DDM considers the effect of recombination current loss in the depletion region and therefore performs well in some applications especially for thin films at low irradiance [46]. The output current of the DDM in Figure 2 is formulated as follows [5, 46]:where and are diode currents and and are diode ideal factors. The DDM has seven unknown parameters (i.e., ) that need to be extracted.

2.3. PV Module Model

The output current of a PV module with solar cells in series and/or in parallel can be calculated as follows.

For the SDM-based PV module,

For the DDM-based PV module,

2.4. Objective Function

In general, the root mean square error (RMSE) between the measured current and the calculated current is used as the objective function [15, 1719, 2123]:where is the number of measured data and is the vector of unknown parameters.

3. Supply and Demand Mechanism of the Cobweb Model

The cobweb model [43, 44] is a famous economic theory used to study the fluctuation relationship between the price and quantity of a commodity in a perfectly competitive market. It was apparently first named by Nicholas Kardor in 1934. The cobweb model is a dynamic equilibrium analysis theory based on elastic principle. According to this theory, for a given commodity, its quantity in the next time reacts to its current price with an increasing supply function due to production lags, while its price in the next time depends only on its corresponding quantity at the same time with a decreasing demand function . Generally, both functions and are assumed to be linear as follows for the sake of simplification:where and are the supply slop and demand slop, respectively, and is an equilibrium point.

By substituting equation (10) into equation (11), the following formulation is yielded:

Consequently, we can obtain the following equation (13) easily by using recursion:

It can be seen from (13) that markets have the following three dynamic modes:(i)Convergent mode: If , then ; therefore, this market is stable and the price and quantity tend to spiral inwards with time as shown in Figure 3(a).(ii)Divergent mode: If , then , which means that this market is divergent and the price and quantity tend to spiral outwards with time as shown in Figure 3(b).(iii)Closed mode: If , when the time is even, ; when is odd, . Hence, this market is oscillating and the price has the same impact on the supply and demand of the market as shown in Figure 3(c).

4. Supply-Demand-Based Optimization (SDO)

SDO [42] is a very young and effective metaheuristic algorithm inspired by the cobweb theory about the supply and demand mechanism. In SDO, there are markets and each market is considered a solution for a given optimization problem. Each market has commodities corresponding to variables of the problem. Each commodity has a certain price and quantity at a given time. Therefore, each market actually has two solutions where one is a candidate solution represented by the prices of commodities and the other is a possible solution composed by the quantities of commodities, where , , is the maximum number of iterations. Each price solution and quantity solution are associated with the fitness values and , respectively. The fitness value is directly analogous to the rationality of a market. The price solution will be replaced by the quantity solution if is more rational, i.e., is smaller than for a minimization optimization problem.

Although both the price solution and quantity solution serve as solutions, they have different updating strategies. It can be seen from equations (10) and (11) that the prerequisite of obtaining the prices and quantities of a market is getting the position of the equilibrium point . However, the equilibrium point is not known a priori during the iterations. In this context, SDO adopts the following methods to determine the equilibrium point at each iteration. For the quantity, each market chooses a quantity solution probabilistically as its quantity equilibrium vector using fitness value-based roulette wheel selection as follows:where .

Concerning the price, each market chooses either a price solution probabilistically using fitness value-based roulette wheel selection or the average price vector of all markets as its quantity equilibrium vector . and are chosen with the same probability:where , , , , and and are random real numbers in (0, 1).

After getting the position of the equilibrium point , the quantity and price adopt the following strategies to generate their corresponding trial vectors and , respectively:where , and and denote the supply weight and demand weight, respectively. They are determined as follows:where and are random real numbers in (0, 1).

Thereafter, a selection is implemented to choose a fitter one as follows:

It can be seen that if , then the corresponding market is stable or convergent, which means the supply and demand mechanism defines a search space in the neighborhood of the equilibrium point and allows the market to exploit its prices inside that domain. If , the corresponding market is divergent, indicating that the supply and demand mechanism defines a large search space far away from the equilibrium point and allows the market to explore its prices in new promising areas. corresponds to the critical point between the exploration and exploitation. In addition, equations (17) and (18) enable SDO a smooth transition from exploration to exploitation as the iterations progress. Therefore, SDO exhibits exploration and exploitation and possesses an ability to balance them. The flowchart of SDO is shown in Figure 4.

5. Experimental Results

To validate the performance of SDO in solving the parameter extraction problem of PV models, SDO is applied to the following four different PV models with diverse characteristics:(i)RTC France silicon solar cell [48]: contains 26 pairs of I-V data points measured at 33°C under 1000 W/m2 irradiance(ii)PVM 752 GaAs thin film cell [17]: contains 44 pairs of I-V data points measured at 25°C under 1000 W/m2 irradiance(iii)STM6-40/36 monocrystalline module [30, 49]: composed of 36 cells in series with 20 pairs of I-V data points measured at 51°C(iv)STP6-120/36 polycrystalline module [30, 49]: composed of 36 cells in series with 24 pairs of I-V data points measured at 55°C

The search ranges for the involved parameters are presented in Table 1. In this work, both the SDM and DDM are used to model all of these four PV models. In addition, ten state-of-the-art algorithms including comprehensive learning particle swarm optimizer (CLPSO) [50], hybrid differential evolution with biogeography-based optimization (DE/BBO) [51], generalized oppositional teaching-learning-based optimization (GOTLBO) [22], improved JAYA optimization algorithm (IJAYA) [23], improved whale optimization algorithm (IWOA) [25], teaching-learning-based optimization with learning experience of other learners (LETLBO) [52], modified artificial bee colony algorithm (MABC) [53], opposition-based differential evolution (ODE) [54], teaching-learning-based artificial bee colony (TLABC) [55], and self-adaptive teaching-learning-based optimization (SATLBO) [56] are employed to verify SDO. The parameter settings for these ten compared algorithms are kept the same as those in their original literature and summarized in Table 2. The maximum number of fitness evaluations (Max_FEs) setting as 50000 [23, 24, 26, 30, 55, 56] serves as the stopping condition for fair comparison. In addition, for each algorithm, 50 independent runs are executed in MATLAB 2017a.

5.1. Results on the RTC France Silicon Solar Cell

The experimental results including the minimum (Min), maximum (Max), mean (Mean), and standard deviation (Std Dev) values of the RMSE values over 50 independent runs are recorded. Because the actual values for the involved parameters are not known a priori, so the RMSE values can be used as an index to weigh the extraction accuracy.

For the RTC France silicon solar cell, the experimental results are summarized in Table 3. The best results are highlighted in boldface. It can be seen that, for the SDM, five algorithms including SDO, DE/BBO, ODE, SATLBO, and TLABC achieve the smallest RMSE value (9.8602E − 04). Even so, SDO gets better results in terms of the maximum RMSE, mean RMSE, and standard deviation values, indicating that it is more robust and can obtain more reliable and accurate values for the unknown parameters. For the DDM, SDO performs the best in all terms of RMSE values, demonstrating its robustness and accuracy again. In addition, Wilcoxon’s rank sum test at confidence level 0.05 is used to compare the significance between SDO and other algorithms. The marks “,” “,” and “≈” denote that SDO is better than, worse than, and similar to the compared algorithm, respectively. It is clear that SDO is significantly better than all of the other ten compared algorithms on the SDM. With regards to the DDM, SDO wins other nine algorithms except ODE while both SDO and ODE get the similar results statistically. Moreover, the convergence curves illustrated in Figure 5 are provided to study the convergence property of SDO. It shows that IJAYA converges the fastest at the large part of evolutionary process. Nevertheless, it is gradually overtaken and finally surpassed by SDO after about 35000 and 34000 fitness evaluations for the SDM and DDM, respectively, indicating that SDO has a relatively fast convergence speed throughout the evolutionary process.

The extracted values obtained by SDO for the involved unknown parameters corresponding to the minimum RMSE are listed in Table 4. With these extracted parameters, the I-V and P-V characteristic curves can be reconstructed easily as shown in Figure 6. It is obvious that the calculated data achieved by SDO agree with the measured data well throughout the entire voltage range. In addition, the individual absolute error (IAE) between the calculated current and measured current is recorded in Table 5. All of the IAE values are smaller than 0.0016, meaning that the values extracted by SDO for the involved parameters of both the SDM and DDM are very accurate.

Additionally, comparing the results of the SDM and DDM, we can find that the minimum RMSE value provided by the DDM is lower than that given by the SDM. The sum of IAE obtained by the DDM is 0.01730620 which is smaller than that (0.1770381) given by SDM, indicating that the DDM may be more suitable for the RTC France silicon solar cell. On the other side, we also observe that the SDM is better than the DDM in terms of the maximum RMSE, mean RMSE, and standard deviation values. This is mainly because the DDM has seven unknown parameters that need to be extracted while the SDM only has five. Therefore, the DDM is more complex with more local minima and the solution algorithms are more likely to get into them.

5.2. Results on PVM 752 GaAs Thin Film Cell

For the PVM 752 GaAs thin film cell, the RMSE values are presented in Table 6. It is clear that IJAYA achieves the best values in all terms of RMSE for the SDM while SDO gets the second best minimum RMSE value. Considering the maximum RMSE and mean RMSE, besides IJAYA, both SATLBO and TLABC are also better than SDO while SDO performs better than the rest seven algorithms, which is also verified by Wilcoxon’s rank sum test results. For the DDM, IJAYA still performs well but it is worse than SDO in terms of minimum RMSE where IWOA gets the least value. In addition, SDO beats both SATLBO and TLABC for the DDM, indicating SDO is more effective in solving this complex model. The test results show SDO is better than the nine algorithms except IJAYA. The convergence curves in Figure 7 show that IJAYA is the fastest while SDO maintains a relatively fast speed even at the later stage.

The extracted optimal parameters obtained by SDO are tabulated in Table 7, and the reconstructed I-V and P-V characteristic curves corresponding to these optimal parameters are presented in Figure 8. Figure 8 shows that the calculated data achieved by SDO with both the SDM and DDM are in good coincidence with the measured data. The IAE values in Table 8 are all smaller than 0.0004, which demonstrates the good accuracy of SDO again. Table 8 also reveals that the DDM provides a smaller value of the sum of IAE than the SDM, which results in an inference of good adaptability of the DDM for the PVM 752 GaAs thin film cell.

5.3. Results on the STM6-40/36 Monocrystalline Module

Table 9 presents the experimental results on the STM6-40/36 monocrystalline module. It clearly shows that SDO provides the least values in all terms of RMSE for both the SDM and DDM. In addition, the standard deviation values of SDO for both the SDM and DDM are at least one order of magnitude lower than those of the other compared algorithms, indicating its good robustness on this PV module. Wilcoxon’s rank sum test results demonstrate that SDO is significantly better than ten and nine algorithms for the SDM and DDM, respectively. Both IJAYA and SDO get the similar result for the DDM statistically. The convergence curves in Figure 9 manifest that IJAYA still performs well but it is surpassed by SDO after about 43000 and 31000 fitness evaluations for the SDM and DDM, respectively, indicating that SDO performs highly competitively at the later stage.

Table 10 reports the extracted optimal parameters yielded by SDO, and Figure 10 illustrates the reconstructed I-V and P-V characteristic curves. We can see that the calculated data achieved by SDO are in good agreement with the measured data over the entire voltage range. Besides, Table 11 shows that all of the IAE values are less than 0.00607. Table 11 also testifies to that both the SDM and DDM obtain a comparable sum of IAE value, indicating that the DDM brings no benefit in terms of accuracy for the STM6-40/36 monocrystalline module. Moreover, Table 9 shows that the DDM gives larger values in all terms of RMSE except the minimum RMSE, meaning that the DDM is more complex and the solution algorithms are harder to get comparable results as those given by the SDM under the same considered condition (i.e., with the same Max_FEs).

5.4. Results on the STP6-120/36 Polycrystalline Module

With regards to the STP6-120/36 polycrystalline module, the experimental results tabulated in Table 12 show that ODE and SDO achieve the same least values (1.6601E − 02) for both the SDM and DDM. However, SDO beats ODE in the rest terms of RMSE. Actually, Wilcoxon’s rank sum test results also declare that SDO is significantly better than all of the other algorithms including ODE. The convergence curves in Figure 11 demonstrate that although SDO is relatively slow at the first stage, it has the ability of jumping out of local optima and keeping a relatively fast speed to search more promising areas at the later stage. Finally, it surpasses all compared algorithms after about 43000 and 46000 fitness evaluations for the SDM and DDM, respectively.

The extracted optimal parameters obtained by SDO are provided in Table 13. Using these parameters, the output currents and powers corresponding to the measured voltages can be calculated easily and they are summarized in Table 14. It can be seen that all IAE values are less than 0.0375. The reconstructed I-V and P-V characteristic curves presented in Figure 12 show again that the calculated data acquired by SDO with both the SDM and DDM all fit with the measured data well. Besides, although the value of sum of IAE given by the DDM in Table 14 is slightly smaller than that of the SDM, the difference (0.00000089) is in practice very small, which concludes that both the SDM and DDM provide a similar accuracy for the STP6-120/36 polycrystalline module. Furthermore, Table 12 also proves that optimizing the DDM is more difficult than optimizing the SDM.

5.5. Overall Performance

In the above four sections, only the single-model statistical analysis by Wilcoxon’s rank sum test is implemented to compare SDO with the other algorithms. As recommended in [57], the multiple-model statistical analysis that considers all the involved models simultaneously is also very momentous to verify the performance of SDO. In this section, the popular Friedman test at confidence level 0.05 is used to check the overall behavior of SDO in solving the problem concerned here. The test result is given in Figure 13. Clearly, SDO obtains the first overall best ranking, followed by IJAYA, TLABC, SATLBO, LETLBO, ODE, GOTLBO, DE/BBO, IWOA, CLPSO, and MABC. In conclusion, it can be confirmed by combining the single-model statistical analysis results in Tables 3, 6, 9, and 12 with the multiple-model statistical analysis result in Figure 13 that the overall performance of SDO is the best among all of involved algorithms in terms of the final solution quality, i.e., extraction accuracy.

5.6. Influence of Population Size on SDO

Population size is always a key parameter in metaheuristics and choosing an appropriate value is very important in solving different problems [58, 59]. In this section, the influence of on SDO in solving the parameter extraction problem of PV models is investigated. Five values of from 10 to 50 with an interval of 10 are tested. The value of Max_FEs is kept the same as that in Section 5.1. The experimental results over 50 independent runs are illustrated in Figure 14. It is obvious that does affect the performance of SDO. Specifically, a smaller value (e.g. ≤20) is beneficial to SDO. When the value of exceeds 20, the larger the value of , the worser the performance of SDO. In addition, SDO obtains the best mean RMSE values with on three PV models including the RTC France silicon solar cell, STM6-40/36 monocrystalline module, and STP6-120/36 polycrystalline module. While on the PVM 752 GaAs thin film cell, SDO with is slightly better than that with . The main reasons are as follows:(i)The parameter extraction problem of PV models belongs to a low-dimensional optimization problem. There is no need to set a relatively large population. Notwithstanding enriching the population diversity with a large population, all markets (i.e., individuals) scatter in the whole search domain, which is not good for the convergence. Additionally, a large population means that a considerable number of fitness evaluations will be expended, especially that SDO expends fitness evaluations at each iteration. In this context, the number of iterations will be decreased significantly under a given Max_FEs, which is not conducive to low-dimensional optimization problems.(ii)The problem considered here is a typical multimodal optimization problem with many local minima. Although a very small population size can increase the number of iterations, the population diversity is low, resulting in poor possible movements of individuals. All individuals are easy to swarm towards a certain local optima and thereby suffer from premature convergence. For example, we can see from Figure 14 that SDO with suffers from premature convergence frequently leading to relatively large values of RMSE over 50 runs on many cases such as Figures 14(a), 14(b), 14(f), and 14(g).

In fact, there is no axiom or rule that can be used to determine a proper population size for different optimization problems so far. With regards to the problem considered in this work, it is recommended to set a moderate value with for SDO.

5.7. Comparison with Reported Results

In order to further verify the performance of SDO in solving the parameter extraction problem of PV models, its results are compared with the reported results of some well-designed parameter extraction algorithms on the RTC France silicon solar cell. The comparison results are presented in Table 15. It shows that SDO is highly competitive. For the SDM, although it is worse than RF, RSS, and TSLLS, it is better than or similar to other algorithms in terms of the minimum RMSE value. For the DDM, SDO achieves a very competitive minimum RMSE value that is only slightly larger than that of ABC-TRR. Additionally, in terms of other RMSE values, SDO also yields comparable performance. In summary, the comparison demonstrates the good performance of SDO once again.

6. Conclusions and Future Work

SDO is a very new and effective metaheuristic. In this paper, SDO is first applied to the parameter extraction problem of PV models. Its feasibility and effectiveness are experimentally verified via four PV models including cells and modules with different characteristics. The experimental results summarize that(i)SDO performs better or competitively compared with other well-designed algorithms according to both simulation results and Wilcoxon’s rank sum test results. It, overall, obtains the first ranking according to the Friedman test.(ii)SDO exhibits good convergence property especially at the later stage of evolutionary process, indicating it is with the capability of jumping out of local optima and exploring more promising regions.(iii)The population size affects the performance of SDO significantly. In general, a small size is relatively safe for low-dimensional optimization problems. For the problem considered in this work, the size setting as 20 is recommended for SDO.

The experimental results and comparisons demonstrate that SDO can serve as a promising alternative to extract accurate and reliable parameters for PV models. In future work, on one hand, local search methods and adaptive learning strategies will be employed to accelerate SDO’s convergence rate especially at the early stage and to choose appropriate population sizes for SDO in solving different optimization problems, respectively. On the other hand, attempts will be made to apply SDO to other electrical engineering problems such as MPPT, economic dispatch, and optimal power flow.

Nomenclature

Id:Diode current (A)
IL:Output current (A)
Iph:Photogenerated current (A)
Isd, Isd1, and Isd2:Saturation currents (A)
Ish:Shunt resistor current (A)
k:Boltzmann constant
n, n1, and n2:Diode ideality factors
Np:Number of cells in parallel
Ns:Number of cells in series
q:Electron charge
Rs:Series resistance (Ω)
Rsh:Shunt resistance (Ω)
T:Cell temperature (K)
VL:Output voltage (V)
Vt:Diode thermal voltage (V)
I-V:Current-voltage
P-V:Power-voltage
PV:Photovoltaic
N:Number of experimental data
x:Extracted parameters vector
SDM:Single diode model
DDM:Double diode model
IAE:Individual absolute error
RMSE:Root mean square error
Min:Minimum RMSE
Max:Maximum RMSE
Mean:Mean RMSE
Std. Dev:Standard deviation
D:Dimension of extracted parameters vector
ps:Size of population
t:Current iteration
tmax:Maximum number of iterations
Max_FEs:Maximum number of fitness evaluations
Ee:Equilibrium point
Pi:ith price solution
Pbest:Best price solution found so far
Qi:ith quantity solution
TPi:ith trial price solution
TQi:ith trial quantity solution
Kg:Supply slop
Kf:Demand slop
α:Supply weight
β:Demand weight
r1, r2, r3, and r4:Random real numbers in (0, 1)
ABSO:Artificial bee swarm optimization
ABC-TRR:Hybrid trust-region reflective algorithm
BBO-M:Biogeography-based optimization with mutation strategies
CARO:Chaotic asexual reproduction optimization
CLPSO:Comprehensive learning particle swarm optimizer
CSO:Cat swarm optimization
CWOA:Improved chaotic whale optimization algorithm
DE/BBO:Hybrid differential evolution with biogeography-based optimization
EO-Jaya:Elite opposition-based Jaya algorithm
EVPS:Enhanced vibrating particles system
FPSO:Flexible particle swarm optimization
GGHS:Grouping-based global harmony search
GOTLBO:Generalized oppositional teaching-learning-based optimization
IGHS:Innovative global harmony search
IJAYA:Improved Jaya optimization algorithm
ILCOA:Improved Lozi map-based chaotic optimization
IWOA:Improved whale optimization algorithm
LETLBO:Teaching-learning-based optimization with learning experience of other learners
LI:Linear identification method
MABC:Modified artificial bee colony algorithm
MADE:Memetic adaptive differential evolution
MSSO:Modified simplified swarm optimization
NM-MPSO:Hybrid nelder–mead and modified particle swarm optimization
OBWOA:Improved opposition-based whale optimization algorithm
ODE:Opposition-based differential evolution
PGJAYA:Performance-guided Jaya algorithm
RF:Reduced form method
RSS:Reduced-space search
SATLBO:Self-adaptive teaching-learning-based optimization
SDO:Supply-demand-based optimization
SOS:Symbiotic organisms search
Tayyan:Tayyan’s method
TLABC:Teaching-learning-based artificial bee colony
Tong and Pora:Tong and Pora’s method
TSLLS:Two-step linear least-squares method.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The authors would like to thank Dr. Weiguo Zhao for providing the original code of SDO. This work was supported by the National Natural Science Foundation of China (Grant nos. 51907035, 51867005, and 51667007), the Scientific Research Foundation for the Introduction of Talent of Guizhou University (Grant no. [2017]16), the Guizhou Province Science and Technology Innovation Talent Team Project (Grant no. [2018]5615), the Guizhou Education Department Growth Foundation for Youth Scientific and Technological Talents (Grant no. QianJiaoHe KY Zi [2018]108), and the Science and Technology Foundation of Guizhou Province (Grant no. QianKeHe Platform Talents [2018]5781).