Next Article in Journal
A Quantum Language-Inspired Tree Structural Text Representation for Semantic Analysis
Next Article in Special Issue
Robust Nonsmooth Interval-Valued Optimization Problems Involving Uncertainty Constraints
Previous Article in Journal
Total Coloring of Dumbbell Maximal Planar Graphs
Previous Article in Special Issue
An Eagle Strategy Arithmetic Optimization Algorithm for Frequency Stability Enhancement Considering High Renewable Power Penetration and Time-Varying Load
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Efficient Electric Charged Particles Optimization Algorithm for Numerical Optimization and Optimal Estimation of Photovoltaic Models

1
Department of Electrical Engineering, Faculty of Engineering, Aswan University, Aswan 81542, Egypt
2
Faculty of Computers and Information, Minia University, Minia 61519, Egypt
3
Wolfson Centre for Magnetics, School of Engineering, Cardiff University, Cardiff CF24 3AA, UK
4
Faculty of Engineering, Helwan University, Cairo 11795, Egypt
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 913; https://doi.org/10.3390/math10060913
Submission received: 10 February 2022 / Revised: 8 March 2022 / Accepted: 9 March 2022 / Published: 13 March 2022
(This article belongs to the Special Issue Systems Modeling, Analysis and Optimization)

Abstract

:
The electric charged particles optimization (ECPO) technique is inspired by the interaction (exerted forces) between electrically charged particles. A developed version of ECPO called MECPO is suggested in this article to enhance the capability of searching and balancing the exploitation and exploration phases of the conventional ECPO. To let the search agent jumps out from the local optimum and avoid stagnation in the local optimum in the proposed MECPO, three different strategies in the interaction between ECPs are modified in conjunction with the conventional ECPO. Therefore, the convergence rate is enhanced and reaches rapidly to the optimal solution. To evaluate the effectiveness of the MECPO, it is executed on the test functions of the CEC’17. Furthermore, the MECPO technique is suggested to estimate the parameters of different photovoltaic models, such as the single-diode model (SDM), the double-diode model (DDM), and the triple-diode model (TDM). The simulation results illustrate the validation and effectiveness of MECPO in extracting parameters from photovoltaic models.

1. Introduction

To deal with the increase in energy shortage as well as the several disadvantages of fossil fuels, increased research studies on renewable energy sources (RES) are urgently required [1,2]. Solar energy is one of the most important RES that researchers focus on due to its many advantages such as cleanness, safeness, and abundance [3]. The principal kind of solar energy is photovoltaic power generation [4]. PV solar installations around the world increased from about 217 GW in 2015 to just over 707 GW in 2020 [5]. However, using photovoltaic systems to produce electric energy is a big challenge because of their reliance on the climate and other factors [1]. Consequently, a precise model that almost represents the non-linear current–voltage (I–V) and the power–voltage (P–V) output characteristics of the PV model under normal operation is required for simulation and evaluation of photovoltaic systems [6]. These non-linearity challenges are difficult for any possibility and approximation to boost efficiency [7].
A solar PV cell is the main unit of the photovoltaic system. Therefore, it is important to estimate its unknown parameters to acquire a relative analysis of the PV panel performance. The equivalent circuits for the single-, double- and triple-diode model for parameter identification are well-known and most extensively used ways [8,9]. There are five parameters required in the single-diode model (SDM), while there are seven unknown parameters in the double-diode model (DDM) and nine unknown parameters in the triple-diode model (TDM). In many works of literature, the SDM and DDM are generally employed, in which the researchers have used several techniques to estimate the parameters of the PV model based on analytical and numerical methods and optimization techniques [10,11]. Despite the analytical approaches are the simplest and they reach the result rapidly, they do not have the precision under normal conditions [7].
Several metaheuristic techniques have been improved and employed to reach the optimum solution for the PV parameters extraction problem. An artificial electric field algorithm (AEFA) was proposed to extract nine parameters of the triple-diode photovoltaic model [12]. Meiying Ye employed the particle swarm algorithm (PSO) to solve the solar cell parameters [13]. In [14], the direction of movement (DM) in the gradient-based optimizer (GBO) algorithm is used to converge around the area of the solution, and it was suggested to change the DM value gradually in the modified gradient-based optimizer (MGBO) to improve the balancing between exploration and exploitation phases in the search process. The flower pollination algorithms (FPA) were used to extract the global parameters of both the single-diode and the double-diode models based on the experimental data [15]. Additionally, other recent optimization algorithms were used to find the best values of PV parameters, including transient search optimization (TSO) [16], cuckoo search (CS) [17], whale optimization algorithm (WOA) [18], supply demand-based optimization (SDO) [19], salp swarm algorithm (SSA) [20], improved bonobo optimizer (IBO) [21], multiverse optimizer (MVO) [22], tree growth algorithm (TGA) [23], grey wolf optimization (GWO) [24], triple-phase teaching-learning-based optimization (TPTLBO) [25], ant lion optimization (ALO) [26], chaos game optimization (CGO) [27], Harris hawk optimization (HHO) [28], Rao algorithm [29], slime mould algorithm (SMA) [30], and hybrid techniques, such as hybrid adaptive TLBO with DE algorithm (ATLDE) [31], GWOCS [1], PSOGWO [32], Marine predator algorithm (MPA) [33], Coyote optimization [34], and Jaya algorithm and its variants [35]. Each technique has various strategies to achieve a certain objective, and the power of each technique depends on the precision of the estimated parameters, computation time, and computational complexity.
In this article, a development version of ECPO called MECPO is suggested to enhance the search capability of searching and to increase the balance between the exploitation and exploration for the conventional ECPO. In addition, this new algorithm is utilized for extracting the PV module parameters. The performance of the MECPO technique is compared with the recent techniques, such as COOT [36], equilibrium optimizer (EO) [37], Giza pyramids construction (GPC) [38], and MPA [39] algorithms, as well as the original ECPO algorithm [40]. However, the major contributions of this paper are summarized as follows:
  • Proposing an effective optimizer called MECPO with the aim of improving the performance of the original algorithm.
  • The CEC’17 test suite is used to assess the MECPO efficiency.
  • The proposed MECPO algorithm is employed for the PV models: SDM, DDM, and TDM of PV modules.
  • The obtained statistical results using the proposed algorithm are compared with state-of-the-art techniques.
  • The superiority and reliability of the MECPO-based methodology in solving the parameter estimating for the PV model’s problem are verified.
The rest of the article is organized as follows: Section 2 of the paper analyzes the problem formulation, including SDM, DDM, and TDM, and presents the objective function for identifying the parameters of the solar PV module. Section 3 presents an overview of the ECPO technique and the proposed MECPO technique. Section 4 describes the results, discussions, and comparisons. Section 5 gives the conclusion of this article with the final remarks.

2. PV Models

In this section, the PV models are presented. The PV models include the single-diode model (SDM), the double-diode model (DDM), and the triple-diode model (TDM).

2.1. Single-Diode Model (SDM)

SDM is simple, and Figure 1 illustrates its equivalent circuit diagram. In this figure, there are many significant parameters such as photocurrent I P h , the current of diode I D 1 , shunt resistance R s h , series resistance R s , and output current I . It is observed from Figure 1 that it is easy to compute the output current for this model as follows:
I = I P h I D 1 I s h
where I s h is the shunt resistor current.
The modeling of SDM is represented in the following equation:
I = I P h I s d [ exp ( q ( V + I R S ) N K T ) 1 ] V + I R s R s h
where
I s d is the reverse saturation current of D1.
The variable q = 1.60217646 × 10 19   C is the charge of the electron.
V is the total voltage.
K = 1.3806503 × 10 23 (J/k) is the Boltzmann’s constant.
T is the temperature in Kelvin.
N is the ideality factor of D1.

2.2. The Double-Diode Model (DDM)

Compared to the first case (SDM), the impact of compound current loss is taken into consideration in the DDM. Figure 2 displays the structure of DDM. It can be seen from this figure that there are two diodes, in this case, in parallel with the source of current. The output current of the DDM is calculated from the following equation:
I = I P h I D 1 I D 2 I s h
I = I P h I s d 1 [ exp ( q ( V + I R S ) N 1 K T ) 1 ] I s d 2 [ exp ( q ( V + I R S ) N 2 K T ) 1 ] V + I R s R s h
where
I s d 1 and I s d 2 are the reverse saturation current of D1 and D2, respectively.
N1, and N2 are the ideality factor of D1 and D2, respectively.

2.3. The Triple-Diode Model (TDM)

TDM has three diodes in parallel with the current source, as shown in Figure 3. Therefore, the output current can be given by the following equations:
I = I P h I D 1 I D 2 I D 3 I s h
I = I P h I s d 1 [ exp ( q ( V + I R S ) N 1 K T ) 1 ] I s d 2 [ exp ( q ( V + I R S ) N 2 K T ) 1 ] I s d 3 [ exp ( q ( V + I R S ) N 3 K T ) 1 ] V + I R s R s h
where
I s d 1 , I s d 2 , and I s d 3 are the reverse saturation current of D1, D2, and D3, respectively.
N1, N2, and N3 are the ideality factor of D1, D2, and D3, respectively.

2.4. The Objective Function

The objective function is to extract the best parameter values of the PV models by reducing the variance between the estimated data and the measured data. The objective function of SDM, DDM, and TDM is given as follows [33]:
  • The objective function of SDM is given as:
    f S D ( V , I , x ) = I x 3 + x 4 [ exp ( q ( V + I x 1 ) x 5 K T ) 1 ] V + I x 1 x 2
  • The objective function of DDM is given as:
    f D D ( V , I , x ) = I x 3 + x 4 [ exp ( q ( V + I x 1 ) x 6 K T ) 1 ] + x 5 [ exp ( q ( V + I x 1 ) x 7 K T ) 1 ] V + I x 1 x 2
  • The objective function of TDM is given as:
    f T D ( V , I , x ) = I x 3 + x 4 [ exp ( q ( V + I x 1 ) x 6 K T ) 1 ] + x 5 [ exp ( q ( V + I x 1 ) x 7 K T ) 1 ] + x 8 [ exp ( q ( V + I x 1 ) x 9 K T ) 1 ] V + I x 1 x 2
    where
    V and I values can be given from a solar cell.
    x = [ x 1 , x 2 , … x n ] is the estimating parameters vector for n-parameters for each solar cell model and can be defined as:
    (1)
    x = [ R s , R s h , I p h , I s d ,   n ] for SDM.
    (2)
    x = [ R s , R s h , I p h , I s d 1 , I s d 2 , n 1 , n 2 ] for DDM.
    (3)
    x = [ R s , R s h , I p h , I s d 1 , I s d 2 , I s d 3 , n 1 , n 2 , n 3 ] for TDM.
The lower and upper boundaries of the unknown parameters are presented in Table 1.
In this paper, the root mean square error (RMSE) is the error between the estimated and the measured data of the diode model. Therefore, The RMSE can be calculated from the following equation [41]:
R M S E = 1 N i = 1 N ( f h ( V , I , x ) ) 2
where
h is the solar cell model to be used.
N identifies a set of samples is employed to verify the best optimum.

3. The Proposed MECPO

In this section, an overview of the MECPO algorithm is presented in detail, which improves the original ECPO as (1) a new parameter called transfer factor (TF) is added to transfer from exploration to exploitation and vice versa; (2) the three different strategies in the interaction between ECPs are modified to avoid gradually move closer to better individuals who easily make the algorithm stagnation in local optimum and convergence prematurely, and (3) the diversification phase is modified to let the search agent jumps out from local optimum and avoid stagnation in local optimum efficiently.

3.1. Advanced Transfer Factor (TF)

The balance between the exploration and exploitation phases is regarded as the major process to the success of any optimization algorithm and is controlled by a specific parameter. The performance of ECPO is affected by the transferring parameter from exploration to exploitation, which is missing. To resolve this issue, the non-linear parameter called transfer factor (TF) is injection into ECPO as follows:
T F = C 1 × c o s ( 1 t T ) C 2
where C 1 and C 2 are constant 3 and 0.25, respectively.
This enhances the switching phase between exploration and exploitation in a proper manner and maintains the diversity of the solutions.

3.2. Modified Interaction Phase

In this subsection, some setting will be proposed to avoid gradually moving closer to better individuals, which easily make the algorithm stagnation in local optimum and convergence prematurely.

3.2.1. Strategy 1

In this strategy, two new ECPs are created, called ECP inew 1 and ECP inew 2 , while i denotes the index of the chosen ECP). This results from three interacting ECPs.
For E C P 1   , E C P 2 ,   and   E C P 3 :
Where ECP1 is the best agent, ECP2 is the second-best agent, and ECP3 is the third-best agent.
E C P 1   is   affected   by   E C P 2 and E C P b e s t to move from E C P to ECP 1 new 1 . The total force exerts on E C P 1 become:
F = F 21 + D × F b e s t 1
D = ± 1 —this parameter is proposed to give high opportunities with different values on resulting F to give high opportunities to change the direction of agents that results in a good scan of the given search space in all possible directions.
The total force that pushes ECP1 to the move to ECP1new1 and it illustrates as below:
ECP 1 new 1 = E C P 1 + F = E C P 1 + F b e s t 1 + F 21 = E C P 1 + D × T F × β × ( E C P b e s t E C P 1 ) + β × ( E C P 1 E C P 2 )
where β is a random number. F21 refers to the force on ECP1 of ECP2 and Fbest1 is the force on ECP1 of ECPbest.
Then, ECP1 is affected simultaneously by ECP3 and ECPbest to move to ECP1new2.
ECP 1 new 2 = E C P 1 + D × T F × β × ( E C P b e s t E C P 1 ) + β × ( E C P 1 E C P 3 )

3.2.2. Strategy 2

To resolve the issue of the lack of interaction between ECPbest and the rest of ECPs, in the proposed method of three interacting ECPs, each ECP creates one new ECP called ECPinew.
ECP 1 new 1 = E C P 1 + F = E C P 1 + F 21 + F 31 = E C P 1 + D × T F × β × ( E C P 1 E C P 2 ) + β × ( E C P 1 E C P 3 )
For E C P 2 : The second particle ECP2 is influenced at the same time by the first and third particles (i.e., ECP1 and ECP3), which moves to ECP2new. The resulting force to move ECP1 to ECP1new can be defined as:
F = F 12 + F 32 ECP 2 new 1 = E C P 2 + F = E C P 2 + F 12 + F 32 = E C P 2 + D × T F × β × ( E C P 2 E C P 1 ) + β × ( E C P 2 E C P 3 )
where F12 is the force of ECP1 on ECP2, and F32 is the force of ECP3 on ECP2.
For E C P 3 :
The ECP3 is affected by ECP1 and ECP2 at the same time with the force given by:
F = F 13 + F 23 ECP 3 new 1 = E C P 3 + F = E C P 3 + F 13 + F 23 = E C P 3 + D × T F × β × ( E C P 3 E C P 1 ) + β × ( E C P 2 E C P 3 )
where F13 is the force of ECP1 on ECP3 and F23 is the force of ECP2 on ECP3.

3.2.3. Strategy 3

In the previous strategies, new ECPs are generated. Illustratively, the three interacting ECPs (nECPI = 3) will generate nine new ECPs (six ECPs from strategy 1 and three from strategy 2). In strategy 3, the equations defined in the previous two strategies are used.

3.3. Modified Diversification

The diversification phase updates the portion of ECPs population based on a variable called probability of diversification (Pd = 0.2). The new ECPs update their positions by selecting a random archive pool previously created. In the proposed enhancement, the new ECPs update their positions with five cases, including selecting a random archive pool, the remaining proposed four cases are (1) new ECPs update their positions based on boundary constraints to create new ECPS in new regions that may be not visited before; (2) new ECPs update their position with the best ECP in the population; (3) new ECPs update based on information from the archive and random ECPs with controlling parameter a j that initializes with a random value and decreases with problem size by multiplying it with another random number [0, 1]; (4) the new ECPS will equal the old ECPs (no change).
The proposed diversification phase jumps out from the local optimum and avoids stagnation in the local optimum.
For i = 1: newECP
a j = r a n d
For j = 1: ProblemSize
newEPC i , j = { newEPC i , j = L j + r 1 × ( U j L j ) r 2 < 0.3 newEPC i , j = E C P b e s t , j r 2 < 0.4 ( 1 a j ) × archiveECP K , j + a j × randECP j r 2 < 0.5   w h e r e   a j = a j r a n d newEPC i , j = archiveECP K , j r 2 < 0.8 newEPC i , j = EPC i , j o t h e w i s e
End If;
End For;
Eventually, the pseudo-code of the MECPO method is reported in Algorithm 1, while Figure 4 illustrates the flowchart.
Algorithm 1: Pseudo-code of the MECPO technique
  • Randomly initialize an nECP charged particles (solutions) using normal distribution
  • Calculate the fitness and sort them from the best to the worst
  • Create Archive pool with the best ECPs
  • Update transfer factor (TF) using Equation (11)
  • Selection: nECPI particles are randomly selected
  • Interaction: based on the specified strategy
    • Strategy 1 using Equations (12)–(14)
    • Strategy 2 using Equations (15)–(17)
    • Strategy 3 using both of Strategy 1 and Strategy 2
  • For each individual Xi
    • if (Xi < Xmin)
    • Xi = Xmin
    • else if (Xmax < Xi)
    • Xi = Xmax
    • End If
    • End For
  • Diversification
    • For individual newECP (using Equation (19))
      If r < 0.3 then update its solution
      Else If r < 0.4 then update its solution
      Else If r < 0.5 then update its solution
      Else If r < 0.8 then update its solution
      Else update its solution
      End If
End for
9.
Termination criterion

4. Performance Evaluation of MECPO

To assess the performance of the MECPO technique, the 2017 IEEE Congress on Evolutionary Computation (CEC’17) test suite [42] is solved. In addition, several statistical metrics are extracted, including mean value and standard deviation (STD) for optimal values achieved. The achieved results are compared with seven recent metaheuristic techniques, for instance, gravitational search algorithm (GSA) [43], grey wolf optimizer (GWO) [44], WOA [45], sine cosine algorithm (SCA) [46], EO [37], HHO [47], and the original electric charged particles optimization (ECPO) [40].

4.1. Parameter Settings Values

Table 2 reports the parameters setting values; all the counterparts are evaluated on 30 independent runs and 1000 iterations (max_Itr) for every function for fair benchmarking comparison. We choose the default parameters values for the counterparts to decrease the risk of bias in the comparison, as illustrated in [48].

4.2. Definition of CEC’17 Benchmark Functions

CEC’17 test suite [42] including 29 functions is divided into three categories: (1) unimodal functions (F1–F3) has a single optimum solution and is used to evaluate the exploitation capability; (2) multimodal functions, which are from function F4 to function F10, have multiple local minima, and are employed to test the exploration capability; (3) hybrid functions from F11 to F20, and finally, the composition functions, which are from function F21 to function F30, have a huge number of local minima and are employed to evaluate the capability of the technique to avoid the local minima and try to maintain the stability between exploitation and exploration stages.

4.3. Statistical Results

The mean and STD of the optimum value acquired by the MECPO method and the counterparts are reported in Table 3 for each CEC’17 function; the optimal results are highlighted in boldface. The obtained results proved that the MECPO technique is achieved the best values in solving 21 of CEC’17 functions. Moreover, MECPO gained the first rank.

4.4. Convergence Analysis

The convergence characteristics curves analysis of the MECPO technique and the other recent techniques over the CEC’17 functions are illustrated in Figure 5. It is clear from the charts that the proposed MECPO reached a stable point; therefore, it reaches the lowest average of the best so-far solutions on all functions. The achieved fast convergence qualifies the proposed MECPO to be in the first rank and solves problems that require fast computation.

4.5. Boxplot’s Analysis

Hence, the CEC’17 test suite has many local optima, so to know the distribution of best fitness, the boxplot analysis is drawn to describe data distributions into quartiles for each technique and each function in Figure 6. The box plots of the MECPO technique are very narrow for most functions compared to various recent methods distributions and, therefore, with the best values. In fact, the MECPO technique performs better than the other methods in most test functions.

4.6. The Wilcoxon Signed-Rank Test

Although metaheuristics are stochastic methods, the predicted performance should be more accurate. To verify the obtained statistical results and evaluate the significance, Wilcoxon’s rank-sum test was performed. More details about Wilcoxon’s test are given in [49]. The average pair-wise comparison of the optimal solutions with a significance level equal to 5% is reported in Table 4. In the same context, the results are statistically significant for all CEC’17 functions for most functions. The obtained results in Table 4 reveal that the performance of MECPO is superior over the other counterparts.

5. The Results and Discussion of Real-World Application

The numerical simulation of the proposed MECPO algorithm for identifying parameters of SDM, DDM, and TDM is illustrated in this section. Figure 7 displays the estimation process for the PV models and their validation procedure. The seven recent techniques COOT, EO, GPC, and MPA, as well as the conventional ECPO, are used in the comparison. Table 5 presents the parameter settings of the selected algorithms. All mentioned techniques have been executed for 20 independent runs using MATLAB 2016a platform with an Intel® core TM i5-4210U CPU, 1.70 GHz, 8 GB RAM Laptop.

5.1. Case 1: Single-Diode Model (SDM)

In the first case, Table 6 tabulated the optimal parameter values and the fitness values obtained by the MECPO algorithm, original ECPO, and four well-known algorithms for the SDM. The convergence characteristics for all techniques are displayed in Figure 8. The value of the parameters in the case of the SDM achieved using the five algorithms are presented in Table 6. Moreover, Figure 9 presents the boxplot of COOT, ECPO, EO, GPC, MPA, and the proposed MECPO techniques for the single diode, which illustrates the distribution of results achieved by various techniques in 20 trails. Table 6 tabulates the measured data’s voltage and current values and the simulated current value, simulated power value, relative error, and absolute error using the proposed MECPO for SDM.
In Table 7, the fitness value (9.86 × 10−4) obtained by the proposed MECPO technique is less than any other algorithm. As shown in Figure 8, The MECPO algorithm has a high convergence speed compared with the other recent algorithms from the initial search stage to the end of iterations, and this confirms the high precision of the proposed algorithm. The five metrics results after 20 independent runs of all algorithms in Table 7 indicate that the effectiveness and robustness of the proposed algorithm are better than other techniques.
According to the comparisons on the solution distribution in Figure 9, it can be seen that the MECPO technique gives the best performance compared with the other techniques in terms of precision and strength. As can be seen from Table 8, the calculated data of the SDM obtained by the proposed MECPO technique are compatible with the measured data.
Figure 10 displays the individual absolute error for the current and power of the SDM using the proposed technique. Furthermore, the characteristics curve of I–V and P–V for SDM is redrawn according to the best-optimized parameters obtained by executing the proposed MECPO algorithm and presented in Figure 11. This figure confirms that our algorithm could significantly estimate the parameter values that could concretely predict the curve of experimental data.

5.2. Case 2: Double-Diode Model (DDM)

In the second case, Table 9 presents the best values of the control variables regarding the optimal performance for the compared techniques. As shown, MECPO reaches the lowest RMSE of 0.000977 compared to the other algorithms. According to the results of the proposed MECPO algorithm, the series resistance is 0.03687 Ω; shunt resistance is 57.12581 Ω; the photo-generated current is 0.760789 A; the reverse saturation currents of D1 and D2 are 3.07 and 0.231 µA, respectively; the ideality factor of the diode of D1 and D2 is 2.190954. Figure 12 shows the convergence characteristics curves of the algorithms and demonstrates that the capability of the MECPO technique to obtain the smallest RMSE is the fastest.
Apparently, it is seen in Table 10 that MECPO reaches the minimum STD of 4.26 × 10−6, which is less than ECPO, COOT, GPC, EO, and MPA that acquired STD of 0.404779, 0.002359, 0.023745, 0.000674, and 0.002805, respectively. Figure 13 shows the box plot of the RMSE values for DDM in 20 individual runs using the MECPO and other recent algorithms.
Table 11 shows the values of measured, simulated current and the absolute errors between them (IAEI). Furthermore, it displays the values of measured, simulated power, and the absolute errors between them (IAEP) when applying the proposed MECPO on DDM. Moreover, Figure 14 illustrates the absolute errors of measured and simulated current and the absolute errors of experimental and simulated power using the MECPO for the DDM. Figure 15 presents the estimated parameters obtained by the proposed algorithm for the DDM that lead to the high closeness between the estimated I–V and P–V characteristics.

5.3. Case 3: Triple-Diode Model (TDM)

In this case, in the case of the TDM, RMSE and the extracted nine parameters’ values are displayed in Table 12. It can be clearly seen from this table that the MECPO algorithm achieves the optimal RMSE value (0.00097) among the five algorithms; further, the EO algorithm acquires the second-best RMSE value (0.001031), followed by MPA, COOT, GPC, and ECPO. Figure 16 presents the convergence curve for this case study using MECPO and other algorithms for the TDM. It is obvious that MECPO has a faster convergence rate than other techniques for single-, double-, and triple-diode models.
Table 13 gives the statistical results for the TDM. We can conclude that our algorithm can achieve the best RMSE statistical values (Min, Mean, Median, Max, and STD) in the case of the TDM compared with the other recent techniques. Moreover, to display the distribution results obtained from various algorithms, the boxplot of TDM is presented in Figure 17. It can be seen that MECPO achieves superior performance in terms of precision and robustness. The statistical results of the IAE values based on the current and power for the measured and simulated data on TDM are tabulated in Table 14. In addition, the IAEs for current and power using MECPO for TDM are displayed in Figure 18.
The I–V and P–V characteristics achieved by the proposed technique between the measured data and simulated data are shown in Figure 19. The results obviously show that the simulated data achieved by the MECPO algorithm extremely coincide with the measured data in the different PV models, which means that the identified parameters of the proposed MECPO are highly precise. The above-mentioned comparisons illustrate that the MECPO algorithm has better searching precision, reliability, and more speed convergence rate for determining the parameters extraction problems of various PV models (SDM, DDM, TDM), and its performance is outstanding or competitive in contrast with all other recent techniques.

6. Conclusions

This paper has proposed an improved version of the ECPO called MECPO to solve global optimization problems well. This modification has been implemented to escape dropping on the local minima in the conventional ECPO. Therefore, the convergence speed is improved. First, the proposed MECPO’s effectiveness has been tested on the different functions of the CEC’17 test suite. The MECPO achieved better performance compared with seven recent optimization algorithms, including GSA, GWO, WOA, SCA, EO, HHO, and the original ECPO. Following that, the suggested strategy based on MECPO has been employed to extract the many parameters of three models of PV cells. An evaluation study is used to test the ability of the MECPO compared with the other optimizers. The comparative study was carried out for the same data set. The statistical results were employed to analyze the efficacy of the MECPO technique. The greatest proximity between the simulated P–V and I–V curves was obtained by the MECPO algorithm in comparison with the measured data. Furthermore, the proposed technique has strong performance and better convergence rates for all tested cases. In future work, the uncertainty of the climate condition as well as the shading effect will be incorporated in the PV models. Additionally, the proposed algorithm is planned to be applied to other fields of energy such as maximum power point tracking (MPPT) and the energy scheduling problem of PV systems.

Author Contributions

Conceptualization, S.K., E.H.H. and M.H.H.; Data curation, M.S. and F.A.H.; Formal analysis, S.K., E.H.H. and M.H.H.; Software, M.S. and F.A.H.; Investigation, S.K., E.H.H. and M.H.H.; Methodology, S.K., E.H.H. and M.H.H.; Project administration, M.S. and F.A.H.; Resources, M.S. and F.A.H.; Software S.K., E.H.H. and M.H.H.; Supervision, E.H.H., M.S. and F.A.H.; Validation, E.H.H. and S.K.; Visualization, M.S. and F.A.H.; Writing original draft, S.K., E.H.H. and M.H.H.; Writing—review & editing, M.S. and F.A.H. All authors have read and agreed to the published version of the manuscript.

Funding

The research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank Cardiff University/School of Engineering for accepting to pay the APC towards publishing this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Long, W.; Cai, S.; Jiao, J.; Xu, M.; Wu, T. A new hybrid algorithm based on grey wolf optimizer and cuckoo search for parameter extraction of solar photovoltaic models. Energy Convers. Manag. 2020, 203, 112243. [Google Scholar] [CrossRef]
  2. Gnetchejo, P.J.; Essiane, S.N.; Ele, P.; Wamkeue, R.; Wapet, D.M.; Ngoffe, S.P. Enhanced Vibrating Particles System Algorithm for Parameters Estimation of Photovoltaic System. J. Power Energy Eng. 2019, 7, 94446. [Google Scholar] [CrossRef] [Green Version]
  3. Deaconu, A.M.; Cotfas, D.T.; Cotfas, P.A. Calculation of Seven Photovoltaic Cells Parameters Using Parallelized Successive Discretization Algorithm. Int. J. Photoenergy 2020, 2020, 6669579. [Google Scholar] [CrossRef]
  4. Yeh, W.; Huang, C.; Lin, P.; Chen, Z.; Jiang, Y.; Sun, B. Simplex simplified swarm optimisation for the efficient optimisation of parameter identification for solar cell models. IET Renew. Power Gener. 2018, 12, 45–51. [Google Scholar] [CrossRef]
  5. Renewable-Capacity-Statistics. 2021. Available online: https://www.irena.org/publications/2021/March/Renewable-Capacity-Statistics-2021 (accessed on 9 February 2022).
  6. Batzelis, E.I.; Kampitsis, G.E.; Papathanassiou, S.A.; Manias, S.N. Direct MPP Calculation in Terms of the Single-Diode PV Model Parameters. IEEE Trans. Energy Convers. 2015, 30, 226–236. [Google Scholar] [CrossRef]
  7. Sharma, A.; Sharma, A.; Averbukh, M.; Jately, V.; Azzopardi, B. An Effective Method for Parameter Estimation of a Solar Cell. Electronics 2021, 10, 312. [Google Scholar] [CrossRef]
  8. AlHajri, M.F.; El-Naggar, K.M.; AlRashidi, M.R.; Al-Othman, A.K. Optimal extraction of solar cell parameters using pattern search. Renew. Energy 2012, 44, 238–245. [Google Scholar] [CrossRef]
  9. Chellaswamy, C.; Ramesh, R. Parameter extraction of solar cell models based on adaptive differential evolution algorithm. Renew. Energy 2016, 97, 823–837. [Google Scholar] [CrossRef]
  10. Louzazni, M.; Aroudam, E.H. An analytical mathematical modeling to extract the parameters of solar cell from implicit equation to explicit form. Appl. Sol. Energy 2015, 51, 165–171. [Google Scholar] [CrossRef]
  11. Tao, Y.; Bai, J.; Pachauri, R.K.; Sharma, A. Parameter extraction of photovoltaic modules using a heuristic iterative algorithm. Energy Convers. Manag. 2020, 224, 113386. [Google Scholar] [CrossRef]
  12. Selem, S.I.; El-Fergany, A.A.; Hasanien, H.M. Artificial electric field algorithm to extract nine parameters of triple-diode photovoltaic model. Int. J. Energy Res. 2021, 45, 590–604. [Google Scholar] [CrossRef]
  13. Ye, M.; Wang, X.; Xu, Y. Parameter extraction of solar cells using particle swarm optimization. J. Appl. Phys. 2009, 105, 094502. [Google Scholar] [CrossRef]
  14. Hassan, M.H.; Kamel, S.; El-Dabah, M.A.; Rezk, H. A Novel Solution Methodology Based on a Modified Gradient-Based Optimizer for Parameter Estimation of Photovoltaic Models. Electronics 2021, 10, 472. [Google Scholar] [CrossRef]
  15. Alam, D.F.; Yousri, D.A.; Eteiba, M.B. Flower Pollination Algorithm based solar PV parameter estimation. Energy Convers. Manag. 2015, 101, 410–422. [Google Scholar] [CrossRef]
  16. Qais, M.H.; Hasanien, H.M.; Alghuwainem, S. Transient search optimization for electrical parameters estimation of photovoltaic module based on datasheet values. Energy Convers. Manag. 2020, 214, 112904. [Google Scholar] [CrossRef]
  17. Ma, J.; Ting, T.O.; Man, K.L.; Zhang, N.; Guan, S.-U.; Wong, P.W.H. Parameter Estimation of Photovoltaic Models via Cuckoo Search. J. Appl. Math. 2013, 2013, 362619. [Google Scholar] [CrossRef]
  18. Oliva, D.; Abd El Aziz, M.; Ella Hassanien, A. Parameter estimation of photovoltaic cells using an improved chaotic whale optimization algorithm. Appl. Energy 2017, 200, 141–154. [Google Scholar] [CrossRef]
  19. Xiong, G.; Zhang, J.; Shi, D.; Yuan, X. Application of Supply-Demand-Based Optimization for Parameter Extraction of Solar Photovoltaic Models. Complexity 2019, 2019, 3923691. [Google Scholar] [CrossRef] [Green Version]
  20. Messaoud, R. Ben Extraction of uncertain parameters of single and double diode model of a photovoltaic panel using Salp Swarm algorithm. Measurement 2020, 154, 107446. [Google Scholar] [CrossRef]
  21. Abdelghany, R.Y.; Kamel, S.; Sultan, H.M.; Khorasy, A.; Elsayed, S.K.; Ahmed, M. Development of an Improved Bonobo Optimizer and Its Application for Solar Cell Parameter Estimation. Sustainability 2021, 13, 3863. [Google Scholar] [CrossRef]
  22. Ali, E.E.; El-Hameed, M.A.; El-Fergany, A.A.; El-Arini, M.M. Parameter extraction of photovoltaic generating units using multi-verse optimizer. Sustain. Energy Technol. Assess. 2016, 17, 68–76. [Google Scholar] [CrossRef]
  23. Diab, A.A.Z.; Sultan, H.M.; Aljendy, R.; Al-Sumaiti, A.S.; Shoyama, M.; Ali, Z.M. Tree Growth Based Optimization Algorithm for Parameter Extraction of Different Models of Photovoltaic Cells and Modules. IEEE Access 2020, 8, 119668–119687. [Google Scholar] [CrossRef]
  24. Darmansyah; Robandi, I. Photovoltaic parameter estimation using Grey Wolf Optimization. In Proceedings of the 2017 3rd International Conference on Control, Automation and Robotics (ICCAR), Nagoya, Japan, 24–26 April 2017; IEEE: New York, NY, USA, 2017; pp. 593–597. [Google Scholar]
  25. Liao, Z.; Chen, Z.; Li, S. Parameters Extraction of Photovoltaic Models Using Triple-Phase Teaching-Learning-Based Optimization. IEEE Access 2020, 8, 69937–69952. [Google Scholar] [CrossRef]
  26. Kanimozhi, G.; Kumar, H. Modeling of solar cell under different conditions by Ant Lion Optimizer with LambertW function. Appl. Soft Comput. 2018, 71, 141–151. [Google Scholar] [CrossRef]
  27. Ramadan, A.; Kamel, S.; Hussein, M.M.; Hassan, M.H. A New Application of Chaos Game Optimization Algorithm for Parameters Extraction of Three Diode Photovoltaic Model. IEEE Access 2021, 9, 51582–51594. [Google Scholar] [CrossRef]
  28. Jiao, S.; Chong, G.; Huang, C.; Hu, H.; Wang, M.; Heidari, A.A.; Chen, H.; Zhao, X. Orthogonally adapted Harris hawks optimization for parameter estimation of photovoltaic models. Energy 2020, 203, 117804. [Google Scholar] [CrossRef]
  29. Premkumar, M.; Babu, T.S.; Umashankar, S.; Sowmya, R. A new metaphor-less algorithms for the photovoltaic cell parameter estimation. Optik 2020, 208, 164559. [Google Scholar] [CrossRef]
  30. Kumar, C.; Raj, T.D.; Premkumar, M.; Raj, T.D. A new stochastic slime mould optimization algorithm for the estimation of solar photovoltaic cell parameters. Optik 2020, 223, 165277. [Google Scholar] [CrossRef]
  31. Li, S.; Gong, W.; Wang, L.; Yan, X.; Hu, C. A hybrid adaptive teaching–learning-based optimization and differential evolution for parameter identification of photovoltaic models. Energy Convers. Manag. 2020, 225, 113474. [Google Scholar] [CrossRef]
  32. Şenel, F.A.; Gökçe, F.; Yüksel, A.S.; Yiğit, T. A novel hybrid PSO–GWO algorithm for optimization problems. Eng. Comput. 2019, 35, 1359–1373. [Google Scholar] [CrossRef]
  33. El Sattar, M.A.; Al Sumaiti, A.; Ali, H.; Diab, A.A.Z. Marine predators algorithm for parameters estimation of photovoltaic modules considering various weather conditions. Neural Comput. Appl. 2021, 33, 11799–11819. [Google Scholar] [CrossRef]
  34. Diab, A.A.Z.; Sultan, H.M.; Do, T.D.; Kamel, O.M.; Mossa, M.A. Coyote Optimization Algorithm for Parameters Estimation of Various Models of Solar Cells and PV Modules. IEEE Access 2020, 8, 111102–111140. [Google Scholar] [CrossRef]
  35. Premkumar, M.; Jangir, P.; Sowmya, R.; Elavarasan, R.M.; Kumar, B.S. Enhanced chaotic JAYA algorithm for parameter estimation of photovoltaic cell/modules. ISA Trans. 2021, 116, 139–166. [Google Scholar] [CrossRef]
  36. Naruei, I.; Keynia, F. A New Optimization Method Based on Coot Bird Natural Life Model. Expert Syst. Appl. 2021, 183, 115352. [Google Scholar] [CrossRef]
  37. Faramarzi, A.; Heidarinejad, M.; Stephens, B.; Mirjalili, S. Equilibrium optimizer: A novel optimization algorithm. Knowl. Based Syst. 2020, 191, 105190. [Google Scholar] [CrossRef]
  38. Harifi, S.; Mohammadzadeh, J.; Khalilian, M.; Ebrahimnejad, S. Giza Pyramids Construction: An ancient-inspired metaheuristic algorithm for optimization. Evol. Intell. 2020, 14, 1743–1761. [Google Scholar] [CrossRef]
  39. Faramarzi, A.; Heidarinejad, M.; Mirjalili, S.; Gandomi, A.H. Marine Predators Algorithm: A nature-inspired metaheuristic. Expert Syst. Appl. 2020, 152, 113377. [Google Scholar] [CrossRef]
  40. Bouchekara, H.R.E.H. Electric Charged Particles Optimization and its application to the optimal design of a circular antenna array. Artif. Intell. Rev. 2021, 54, 1767–1802. [Google Scholar] [CrossRef]
  41. Ismaeel, A.A.K.; Houssein, E.H.; Oliva, D.; Said, M. Gradient-Based Optimizer for Parameter Extraction in Photovoltaic Models. IEEE Access 2021, 9, 13403–13416. [Google Scholar] [CrossRef]
  42. Awad, N.H.; Ali, M.Z.; Liang, J.J.; Qu, B.Y.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Bound Constrained Real-Parameter Numerical Optimization: Technical Report; Nanyang Technological University: Singapore, 2016. [Google Scholar]
  43. Rashedi, E.; Nezamabadi-Pour, H.; Saryazdi, S. GSA: A Gravitational Search Algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  44. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey Wolf Optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef] [Green Version]
  45. Mirjalili, S.; Lewis, A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  46. Mirjalili, S. SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl. Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  47. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  48. Arcuri, A.; Fraser, G. Parameter tuning or default values? An empirical investigation in search-based software engineering. Empir. Softw. Eng. 2013, 18, 594–623. [Google Scholar] [CrossRef]
  49. Wilcoxon, F. Individual Comparisons by Ranking Methods. In Breakthroughs in Statistics; Springer: New York, NY, USA, 1992; pp. 196–202. [Google Scholar]
Figure 1. SDM mathematical model.
Figure 1. SDM mathematical model.
Mathematics 10 00913 g001
Figure 2. DDM mathematical model.
Figure 2. DDM mathematical model.
Mathematics 10 00913 g002
Figure 3. TDM mathematical model.
Figure 3. TDM mathematical model.
Mathematics 10 00913 g003
Figure 4. Flowchart of MECPO method.
Figure 4. Flowchart of MECPO method.
Mathematics 10 00913 g004
Figure 5. The convergence curves of the MECPO and the counterparts achieved on CEC’17 functions with Dim = 30.
Figure 5. The convergence curves of the MECPO and the counterparts achieved on CEC’17 functions with Dim = 30.
Mathematics 10 00913 g005aMathematics 10 00913 g005bMathematics 10 00913 g005c
Figure 6. The boxplot curves of the MECPO technique and the other techniques achieved for CEC’17 functions with dimension = 30.
Figure 6. The boxplot curves of the MECPO technique and the other techniques achieved for CEC’17 functions with dimension = 30.
Mathematics 10 00913 g006aMathematics 10 00913 g006bMathematics 10 00913 g006c
Figure 7. Global parameter estimation representation based on MECPO optimization algorithm.
Figure 7. Global parameter estimation representation based on MECPO optimization algorithm.
Mathematics 10 00913 g007
Figure 8. Convergence curve of the MECPO and other recent algorithms for the SDM.
Figure 8. Convergence curve of the MECPO and other recent algorithms for the SDM.
Mathematics 10 00913 g008
Figure 9. Best RMSE boxplot in 20 runs of the MECPO and other recent algorithms for the SDM.
Figure 9. Best RMSE boxplot in 20 runs of the MECPO and other recent algorithms for the SDM.
Mathematics 10 00913 g009
Figure 10. Individual absolute errors for current and power by the MECPO for SDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Figure 10. Individual absolute errors for current and power by the MECPO for SDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Mathematics 10 00913 g010
Figure 11. Comparisons between measured data and data achieved using the MECPO method for SDM (a) I–V characteristics and (b) P–V characteristics.
Figure 11. Comparisons between measured data and data achieved using the MECPO method for SDM (a) I–V characteristics and (b) P–V characteristics.
Mathematics 10 00913 g011
Figure 12. Convergence curve of the MECPO and other recent algorithms for the DDM.
Figure 12. Convergence curve of the MECPO and other recent algorithms for the DDM.
Mathematics 10 00913 g012
Figure 13. Best RMSE boxplot in 20 individual runs of the MECPO and other recent algorithms for the DDM.
Figure 13. Best RMSE boxplot in 20 individual runs of the MECPO and other recent algorithms for the DDM.
Mathematics 10 00913 g013
Figure 14. Individual absolute errors for current and power by the MECPO for DDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Figure 14. Individual absolute errors for current and power by the MECPO for DDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Mathematics 10 00913 g014
Figure 15. Comparisons between measured data and data achieved using the MECPO method for DDM (a) I–V characteristics and (b) P–V characteristics.
Figure 15. Comparisons between measured data and data achieved using the MECPO method for DDM (a) I–V characteristics and (b) P–V characteristics.
Mathematics 10 00913 g015
Figure 16. Convergence curve of the MECPO and other recent algorithms for the TDM.
Figure 16. Convergence curve of the MECPO and other recent algorithms for the TDM.
Mathematics 10 00913 g016
Figure 17. Best RMSE boxplot in 20 individual runs of the MECPO and other recent algorithms for the TDM.
Figure 17. Best RMSE boxplot in 20 individual runs of the MECPO and other recent algorithms for the TDM.
Mathematics 10 00913 g017
Figure 18. Individual absolute errors for current and power by the MECPO for TDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Figure 18. Individual absolute errors for current and power by the MECPO for TDM. (a) Individual absolute errors for current. (b) Individual absolute errors for power.
Mathematics 10 00913 g018
Figure 19. Comparisons between measured data and data achieved using the MECPO method for TDM (a) I–V characteristics and (b) P–V characteristics.
Figure 19. Comparisons between measured data and data achieved using the MECPO method for TDM (a) I–V characteristics and (b) P–V characteristics.
Mathematics 10 00913 g019
Table 1. The limits of extracted photovoltaic parameters.
Table 1. The limits of extracted photovoltaic parameters.
ParameterLower LimitUpper Limit
I p h (A)01
I s d 1 ,   I s d 2 ,   I s d 3 (μA)01
R s (Ω)00.5
R s h (Ω)0100
n 1 ,   n 2 ,   n 3 12
Table 2. The settings of the parameter for the MECPO technique and the counterparts.
Table 2. The settings of the parameter for the MECPO technique and the counterparts.
TechniquesThe Setting of Parameters
Public settingsNumber of independent runs: 30
Maximum iterations: 1000
Population size: N = 30
Dim = 30,
GSAα = 20, G0 = 100, Rnorm = 2, Rpower = 1
GWOa linearly decrease from 2 to 0
WOAa2 linearly decreases from −1 to −2
α variable decreases linearly from 2 to 0
SCAA = 2
EOa_1 = 2, a_2 = 1, GP = 0.5
HHOE0 ∈ [−1, 1], β = 1.5
ECPOStrategy = 1, archSize = 30 and NPI = 2
MECPO Strategy = 1 ,   archSize = 30 ,   NPI = 2 ,   C 1 = 3 ,   C 2 = 0.25 ,   and   β = r a n d o m   n u m b e r
Table 3. The mean and STD of optimal values of the OF for thirty trials achieved with the various techniques on the CEC’17 benchmark with dimension = 30.
Table 3. The mean and STD of optimal values of the OF for thirty trials achieved with the various techniques on the CEC’17 benchmark with dimension = 30.
#MeasureGSAGWOWOASCAEOHHOEPCOMEPCO
1Mean7.46 × 1071.99 × 1091.08 × 1091.84 × 10106.40 × 1033.17 × 1077.14 × 1083.78 × 103
STD1.57 × 1081.30 × 1093.15 × 1083.07 × 1096.54 × 1037.47 × 1061.31 × 1094.94 × 103
3Mean9.62 × 1045.33 × 1042.95 × 1056.66 × 1042.69 × 1043.99 × 1042.23 × 1041.06 × 105
STD1.10 × 1041.32 × 1047.46 × 1041.33 × 1048.38 × 1036.79 × 1032.29 × 1042.52 × 104
4Mean6.54 × 1025.96 × 1028.74 × 1022.35 × 1034.99 × 1025.55 × 1025.18 × 1024.90 × 102
STD1.25 × 1025.81 × 1014.64 × 1016.92 × 1022.48 × 1011.46 × 1014.36 × 1013.48 × 101
5Mean7.39 × 1026.16 × 1028.58 × 1028.14 × 1026.77 × 1027.40 × 1026.16 × 1025.55 × 102
STD2.43 × 1012.30 × 1015.22 × 1012.64 × 1012.44 × 1014.90 × 1012.55 × 1015.50 × 101
6Mean6.58 × 1026.11 × 1026.91 × 1026.60 × 1026.01 × 1026.73 × 1026.19 × 1026.00 × 102
STD3.994.341.52 × 1016.288.31 × 10−19.366.711.88 × 10−1
7Mean9.62 × 1028.86 × 1021.29 × 1031.21 × 1038.40 × 1021.30 × 1039.68 × 102 8.40 × 102
STD5.50 × 1015.02 × 1015.18 × 1014.61 × 1013.33 × 1015.43 × 1017.65 × 1016.25 × 101
8Mean9.63 × 1028.96 × 1021.07 × 1031.09 × 1038.86 × 1029.68 × 1029.01 × 1028.35 × 102
STD1.64 × 1011.56 × 1014.81 × 1012.13 × 1011.81 × 1013.46 × 1012.20 × 1012.73 × 101
9Mean4.17 × 103 2.26 × 1031.16 × 1047.92 × 1031.26 × 1037.55 × 1032.28 × 1039.48 × 102
STD4.17 × 1026.75 × 1025.87 × 1031.54 × 1034.48 × 1021.90 × 1031.01 × 1034.73 × 101
10Mean5.39 × 1034.80 × 1036.73 × 1038.66 × 1035.21 × 1036.14 × 1034.68 × 1038.04 × 103
STD4.92 × 1021.15 × 1039.07 × 1023.33 × 1027.53 × 1023.57 × 1027.77 × 1025.16 × 102
11Mean3.97 × 1032.04 × 1036.90 × 1033.45 × 1031.29 × 1031.29 × 1034.04 × 1011.17 × 103
STD1.12 × 1038.34 × 1023.18 × 1031.08 × 1034.29 × 1013.41 × 1017.49 × 1021.68 × 103
12Mean1.25 × 1081.34 × 1083.17 × 1082.15 × 1097.58 × 1053.69 × 1072.99 × 1061.23 × 106
STD1.29 × 1082.48 × 1081.29 × 1085.75 × 1087.77 × 1052.63 × 1073.71 × 1066.53 × 105
13Mean3.40 × 1043.51 × 1051.21 × 1069.15 × 1081.79 × 1046.68 × 1052.16 × 1051.39 × 104
STD9.35 × 1036.03 × 1053.84 × 1054.21 × 1081.68 × 1044.26 × 1058.31 × 1051.37 × 104
14Mean1.03 × 1065.06 × 1053.17 × 1064.70 × 1055.14 × 1044.12 × 1051.19 × 1059.76 × 104
STD3.52 × 1054.37 × 1052.59 × 1063.85 × 1053.70 × 1042.54 × 1054.22 × 1058.76 × 104
15Mean1.78 × 1045.95 × 1052.27 × 1064.26 × 1076.10 × 1031.11 × 1051.08 × 1046.10 × 103
STD5.93 × 1031.23 × 1063.67 × 1063.22 × 1075.89 × 1031.13 × 1059.09 × 1035.50 × 103
16Mean3.47 × 1032.53 × 1034.06 × 1033.95 × 1032.41 × 1033.23 × 1032.65 × 1032.57 × 103
STD3.34 × 1022.52 × 1021.09 × 1032.38 × 1023.42 × 1022.66 × 1022.89 × 1025.61 × 102
17Mean2.88 × 1032.07 × 1032.91 × 1032.64 × 1032.12 × 1032.50 × 1032.26 × 1031.93 × 103
STD2.44 × 1022.00 × 1023.23 × 1022.88 × 1022.19 × 1023.09 × 1022.51 × 1022.20 × 102
18Mean5.16 × 1052.43 × 1061.24 × 1079.49 × 1067.54 × 1052.54 × 1061.95 × 1051.88 × 106
STD4.03 × 1055.15 × 1066.47 × 1064.99 × 1065.47 × 1051.02 × 1062.42 × 1052.75 × 106
19Mean1.35 × 1053.06 × 1066.09 × 1067.10 × 1075.99 × 1038.94 × 1051.19 × 1049.67 × 103
STD1.08 × 1058.77 × 1065.06 × 1064.12 × 1072.03 × 1035.59 × 1051.16 × 1041.15 × 104
20Mean3.07 × 1032.45 × 1032.82 × 1032.90 × 1032.29 × 1032.85 × 1032.49 × 1032.21 × 103
STD2.66 × 1021.73 × 1021.98 × 1021.43 × 1021.26 × 1021.86 × 1022.40 × 1021.85 × 102
21Mean2.62 × 1032.40 × 1032.60 × 1032.59 × 1032.437 × 1032.61 × 1032.40 × 1032.36 × 103
STD3.59 × 1012.46 × 1012.00 × 1012.62 × 1012.02 × 1014.52 × 1012.44 × 1015.82 × 101
22Mean7.25 × 1034.99 × 1036.55 × 1039.01 × 1033.51 × 1035.77 × 1034.53 × 1037.79 × 103
STD5.08 × 1021.84 × 1032.45 × 1032.49 × 1031.97 × 1032.99 × 1031.88 × 1033.09 × 103
23Mean3.80 × 1032.80 × 1033.07 × 1033.05 × 1032.73 × 1033.25 × 1032.81 × 1032.68 × 103
STD1.85 × 1026.09 × 1011.06 × 1022.96 × 1011.92 × 1016.49 × 1014.82 × 1018.28
24Mean3.44 × 1032.94 × 1033.23 × 1033.24 × 1032.99 × 1033.43 × 1032.96 × 1033.00 × 103
STD1.32 × 1025.36 × 1016.98 × 1013.01 × 1012.34 × 1011.17 × 1023.88 × 1011.47 × 101
25Mean2.99 × 1033.01 × 1033.10 × 1033.48 × 1032.95 × 1032.94 × 1032.93 × 1032.89 × 103
STD2.57 × 1014.51 × 1013.28 × 1011.43 × 1022.731.62 × 1013.42 × 1011.27 × 101
26Mean7.85 × 1034.90 × 1039.31 × 1037.60 × 1035.87 × 1038.21 × 1035.21 × 1034.08 × 103
STD6.30 × 1023.12 × 1021.01 × 1033.93 × 1027.24 × 1021.18 × 1038.11 × 1021.79 × 102
27Mean5.10 × 1033.25 × 1033.48 × 1033.51 × 1033.22 × 1033.65 × 1033.27 × 1033.22 × 103
STD4.19 × 1021.78 × 1018.82 × 1014.41 × 1019.773.28 × 1023.14 × 1011.33 × 101
28Mean3.56 × 1033.51 × 1033.56 × 1034.23 × 1033.22 × 1033.35 × 1033.30 × 1033.23 × 103
STD2.08 × 1021.98 × 1021.50 × 1022.36 × 1021.93 × 1013.48 × 1018.87 × 1012.34 × 101
29Mean5.28 × 1033.95 × 1035.42 × 1035.05 × 1033.68 × 1034.90 × 1033.94 × 1033.46 × 103
STD3.33 × 1021.80 × 1023.70 × 1021.93 × 1022.27 × 1026.31 × 1022.23 × 1021.43 × 102
30Mean3.18 × 1069.29 × 1063.98 × 1071.41 × 1089.95 × 1037.82 × 1062.52 × 1049.01 × 103
STD4.09 × 1068.10 × 1063.06 × 1074.86 × 1073.45 × 1033.85 × 1065.26 × 1042.89 × 103
The optimal values obtained are in bold.
Table 4. Results of Wilcoxon’s test (p ≥ 0.05) between the MECPO technique and the various recent techniques for the CEC’17 functions with Dim = 30.
Table 4. Results of Wilcoxon’s test (p ≥ 0.05) between the MECPO technique and the various recent techniques for the CEC’17 functions with Dim = 30.
#GSA vs. MECPOGWO vs. MECPOWOA vs. MECPOSCA vs. MECPOEO vs. MECPOHHO vs. MECPOEPCO vs. MECPO
10.00303.0199 × 10−113.0199 × 10−113.0199 × 10−110.22263.0199 × 10−118.9934 × 10−11
30.07487.3891 × 10−115.0723 × 10−108.4848 × 10−93.0199 × 10−113.0199 × 10−111.4643 × 10−10
46.6955 × 10−114.1997 × 10−103.0199 × 10−113.0199 × 10−110.50113.1967 × 10−9 0.0251
53.0199 × 10−114.2175 × 10−43.0199 × 10−113.0199 × 10−110.00253.0199 × 10−114.2175 × 10−4
63.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−110.00133.0199 × 10−113.0199 × 10−11
73.4971 × 10−90.00173.0199 × 10−113.0199 × 10−110.88833.0199 × 10−116.0459 × 10−7
87.7725 × 10−99.0632 × 10−84.5043 × 10−113.0199 × 10−119.0632 × 10−88.8910 × 10−107.6950 × 10−8
93.0199 × 10−113.6897 × 10−113.0199 × 10−113.0199 × 10−110.25193.0199 × 10−113.3384 × 10−11
101.6132 × 10−106.5183 × 10−98.1200 × 10−49.8329 × 10−81.2057 × 10−108.1014 × 10−108.1527 × 10−11
113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−116.9125 × 10−41.6132 × 10−106.6955 × 10−11
122.1544 × 10−106.0658 × 10−113.0199 × 10−113.0199 × 10−110.11203.0199 × 10−110.0339
134.3106 × 10−83.6897 × 10−113.0199 × 10−113.0199 × 10−110.02923.0199 × 10−110.0850
146.6955 × 10−11 0.01917.7725 × 10−92.3897 × 10−80.00302.6784 × 10−68.8411 × 10−7
151.3111 × 10−88.9934 × 10−113.0199 × 10−113.0199 × 10−110.80733.6897 × 10−110.0117
163.4971 × 10−9 0.19076.0658 × 10−113.0199 × 10−110.58952.0283 × 10−70.5493
173.0199 × 10−116.0459 × 10−74.0772 × 10−113.0199 × 10−115.8587 × 10−64.0772 × 10−112.1947 × 10−8
182.8389 × 10−40.31833.5708 × 10−62.9215 × 10−96.3560 × 10−50.05012.1947 × 10−8
196.6955 × 10−118.1014 × 10−103.0199 × 10−113.0199 × 10−110.18093.0199 × 10−110.7731
204.0772 × 10−115.9706 × 10−56.0658 × 10−119.9186 × 10−110.00809.7555 × 10−101.6062 × 10−6
213.0199 × 10−116.9125 × 10−43.0199 × 10−113.0199 × 10−110.01764.9752 × 10−110.0014
220.00800.00800.15805.5329 × 10−85.8737 × 10−40.01700.0080
233.0199 × 10−112.6695 × 10−93.0199 × 10−113.0199 × 10−112.1540 × 10−63.0199 × 10−115.5727 × 10−10
243.0199 × 10−111.7836 × 10−43.0199 × 10−113.0199 × 10−113.0199 × 10−113.3384 × 10−116.2027 × 10−4
253.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−110.05199.7555 × 10−102.1540 × 10−6
263.0199 × 10−116.1210 × 10−103.0199 × 10−113.0199 × 10−114.4592 × 10−41.8731 × 10−71.0666 × 10−7
273.0199 × 10−111.1058 × 10−43.0199 × 10−113.0199 × 10−110.14533.0199 × 10−111.2860 × 10−6
283.0199 × 10−113.3384 × 10−113.0199 × 10−113.0199 × 10−110.00535.4941 × 10−118.3520 × 10−8
293.0199 × 10−111.8500 × 10−83.0199 × 10−113.0199 × 10−110.00183.0199 × 10−118.1014 × 10−10
303.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−110.03153.0199 × 10−116.2828 × 10−6
Table 5. Parameter settings of the selected techniques.
Table 5. Parameter settings of the selected techniques.
AlgorithmsParameters Setting
Common settingsPopulation size: nPop = 100 for SDM and nPop = 200 for DDM and TDM
Maximum iterations: Max_iter = 1000
Number of independent runs: 20
GPCG = 9.8, Tetha = 14, MuMin = 1, MuMax = 10, pSS = 0.5
EO a 1 = 2 ,   a 2 = 1
MPAFADs = 0.2, P = 0.5, C = 0.05, e = 0.25
Table 6. Calculated parameter in case of the SDM obtained by the proposed algorithm and other recent techniques.
Table 6. Calculated parameter in case of the SDM obtained by the proposed algorithm and other recent techniques.
AlgorithmMECPOECPOCOOTGPCEOMPA
R s (Ω)0.0363770.1517670.0335740.0007480.0271510.038619
R s h (Ω)53.7185235.5300610017.9712899.5247740.87662
I p h (A)0.7607760.6776480.7604760.7767920.7619990.761135
I s d (A)3.23 × 10−70.0001556.57 × 10−71.87 × 10−52.07 × 10−61.79 × 10−7
n 1.2156721.9845961.2771621.6848061.392141.168594
R M S E 9.86 × 10−40.7173560.0017310.0188060.0041470.00149
Table 7. Statistical results of the proposed MECPO algorithm and other recent algorithms in the case of the SDM.
Table 7. Statistical results of the proposed MECPO algorithm and other recent algorithms in the case of the SDM.
AlgorithmBestMeanMedianWorstSTD
MECPO0.0009860.0009860.0009860.0009862.31 × 10−16
ECPO0.7173561.3958991.3901791.9854810.316597
COOT0.0017310.0041350.0044340.0058510.001238
GPC0.0188060.0811210.0767390.1717430.035797
EO0.0041470.2119260.2228610.2228610.048906
MPA0.001490.0099370.0117360.0126070.003505
The optimal values obtained are in bold.
Table 8. Measured and simulated data of voltages, currents, and power and the absolute errors values using MECPO for SDM.
Table 8. Measured and simulated data of voltages, currents, and power and the absolute errors values using MECPO for SDM.
RankExperimental DataSimulated Current DataSimulated Power Data
V (V)I (A)P (W)Isim (A)IAEI (A)Psim (W)IAEP (W)
1−0.20570.764−0.1571550.764098.80 × 10−5−0.157172.00 × 10−5
2−0.12910.762−0.0983740.762666.63 × 10−4−0.098469.00 × 10−5
3−0.05880.7605−0.0447170.761368.55 × 10−4−0.044775.00 × 10−5
40.00570.76050.0043350.760153.46 × 10−40.004330.00 × 10+00
50.06460.760.0490960.759069.45 × 10−40.049036.00 × 10−5
60.11850.7590.0899420.758049.58 × 10−40.089831.10 × 10−4
70.16780.7570.1270250.757099.20 × 10−50.127042.00 × 10−5
80.21320.7570.1613920.756148.59 × 10−40.161211.80 × 10−4
90.25450.75550.1922750.755094.13 × 10−40.192171.10 × 10−4
100.29240.7540.220470.753663.36 × 10−40.220371.00 × 10−4
110.32690.75050.2453380.751398.91 × 10−40.245632.90 × 10−4
120.35850.74650.267620.747358.54 × 10−40.267933.10 × 10−4
130.38730.73850.2860210.740121.62 × 10−30.286656.30 × 10−4
140.41370.7280.3011740.727386.18 × 10−40.300922.60 × 10−4
150.43730.70650.3089520.706974.73 × 10−40.309162.10 × 10−4
160.4590.67550.3100550.675282.20 × 10−40.309951.00 × 10−4
170.47840.6320.3023490.630761.24 × 10−30.301755.90 × 10−4
180.4960.5730.2842080.571931.07 × 10−30.283685.30 × 10−4
190.51190.4990.2554380.499616.07 × 10−40.255753.10 × 10−4
200.52650.4130.2174450.413656.49 × 10−40.217793.40 × 10−4
210.53980.31650.1708470.317511.01 × 10−30.171395.50 × 10−4
220.55210.2120.1170450.212151.55 × 10−40.117139.00 × 10−5
230.56330.10350.0583020.102251.25 × 10−30.05767.00 × 10−4
240.5736−0.0100−0.005736−0.008721.28 × 10−3−0.0057.40 × 10−4
250.5833−0.1230−0.071746−0.125512.51 × 10−3−0.073211.46 × 10−3
260.59−0.2100−0.1239−0.208471.53 × 10−3−0.1239.00 × 10−4
Table 9. Calculated parameter in case of the DDM obtained by the proposed algorithm and other recent techniques.
Table 9. Calculated parameter in case of the DDM obtained by the proposed algorithm and other recent techniques.
AlgorithmMECPOECPOCOOTGPCEOMPA
R s (Ω)0.036870.2298840.03890.0002060.0370220.042933
R s h (Ω)57.1258173.6835572.8567510052.1131737.18875
I p h (A)0.7607890.2336820.7607670.7125330.760820.76005
I s d 1 (A)3.07 × 10−60.4335245.79 × 10−61.28 × 10−103.41 × 10−72.84 × 10−19
I s d 2 (A)2.31 × 10−70.915533.76 × 10−81.47 × 10−51.36 × 10−95.55 × 10−8
n 1 21.9327541.75474411.2288651.00292
n 2 1.1909541.9120911.0738281.6597711.0000021.085403
R M S E 0.0009771.5150620.0011150.0413770.0010010.003574
Table 10. Statistical results of the MECPO technique and other recent techniques in the case of the DDM.
Table 10. Statistical results of the MECPO technique and other recent techniques in the case of the DDM.
AlgorithmBestMeanMedianWorstSTD
MECPO0.0009770.000980.0009770.0009894.26 × 10−6
ECPO1.5150622.2857282.3432093.0696710.404779
COOT0.0011150.0045340.0044410.0093030.002359
GPC0.0413770.0804750.0724820.1316870.023745
EO0.0010010.001410.0011380.0032640.000674
MPA0.0035740.0110050.0122110.0129640.002805
The optimal values obtained are in bold.
Table 11. Experimental and simulated data of voltages, currents, and power and the absolute errors values using MECPO for DDM.
Table 11. Experimental and simulated data of voltages, currents, and power and the absolute errors values using MECPO for DDM.
RankExperimental DataSimulated Current DataSimulated Power Data
V (V)I (A)P (W)Isim (A)IAEI (A)Psim (W)IAEP (W)
1−0.20570.764−0.1571550.76391.00 × 10−4−0.157132.10 × 10−5
2−0.12910.762−0.0983740.762565.60 × 10−4−0.098457.20 × 10−5
3−0.05880.7605−0.0447170.761338.30 × 10−4−0.044774.90 × 10−5
40.00570.76050.0043350.76023.00 × 10−40.0043332.00 × 10−6
50.06460.760.0490960.759168.40 × 10−40.0490415.50 × 10−5
60.11850.7590.0899420.758198.10 × 10−40.0898459.60 × 10−5
70.16780.7570.1270250.757262.60 × 10−40.1270694.40 × 10−5
80.21320.7570.1613920.756326.80 × 10−40.1612461.46 × 10−4
90.25450.75550.1922750.755232.70 × 10−40.1922076.80 × 10−5
100.29240.7540.220470.753752.50 × 10−40.2203967.40 × 10−5
110.32690.75050.2453380.751398.90 × 10−40.2456282.90 × 10−4
120.35850.74650.267620.747257.50 × 10−40.2678892.69 × 10−4
130.38730.73850.2860210.739931.43 × 10−30.2865765.55 × 10−4
140.41370.7280.3011740.727168.40 × 10−40.300827−3.47 × 10−4
150.43730.70650.3089520.706782.80 × 10−40.3090761.24 × 10−4
160.4590.67550.3100550.675183.20 × 10−40.3099081.47 × 10−4
170.47840.6320.3023490.630771.23 × 10−30.3017615.87 × 10−4
180.4960.5730.2842080.572049.60 × 10−40.2837314.77 × 10−4
190.51190.4990.2554380.499767.60 × 10−40.2558283.90 × 10−4
200.52650.4130.2174450.413787.80 × 10−40.2178534.08 × 10−4
210.53980.31650.1708470.317561.06 × 10−30.1714195.72 × 10−4
220.55210.2120.1170450.21211.00 × 10−40.1171015.60 × 10−5
230.56330.10350.0583020.102121.38 × 10−30.0575227.80 × 10−4
240.5736−0.0100−0.005736−0.008831.17 × 10−3−0.005076.70 × 10−4
250.5833−0.1230−0.071746−0.125562.56 × 10−3−0.073241.49 × 10−3
260.59−0.2100−0.1239−0.208321.68 × 10−3−0.122919.90 × 10−4
Table 12. Calculated parameter in case of the TDM obtained by the proposed algorithm and other recent techniques.
Table 12. Calculated parameter in case of the TDM obtained by the proposed algorithm and other recent techniques.
AlgorithmMECPOECPOCOOTGPCEOMPA
R s (Ω)0.036870.043030.0400510.0018540.0377810.03846
R s h (Ω)57.1257910099.8958310.5288154.9181985.03041
I p h (A)0.7607890.7217680.7604340.7762970.7608720.76019
I s d 1 (A)6.97 × 10−200.4621819.59 × 10−91.23 × 10−56.19 × 10−77.53 × 10−8
I s d 2 (A)3.07 × 10−60.2888115.14 × 10−61 × 10−98.63 × 10−91.4 × 10−8
I s d 3 (A)2.31 × 10−70.9923762.08 × 10−71 × 10−99.67 × 10−91.85 × 10−6
n 1 1.22083521.0001051.6500691.3220861.982829
n 2 21.8867281.66452511.8360141.030268
n 3 1.19095421.99956411.0312541.486103
R M S E 0.0009771.3603410.0013110.0270750.0010130.001181
Table 13. Statistical results the MECPO technique and other recent algorithms in the case of the TDM.
Table 13. Statistical results the MECPO technique and other recent algorithms in the case of the TDM.
AlgorithmBestMeanMedianWorstSTD
MECPO0.0009770.0009790.0009770.0009975.1 × 10−6
ECPO1.3603411.9783152.0197032.8956470.551247
COOT0.0013110.0042470.0044080.008840.001786
GPC0.0270750.1010530.0780460.4108510.085461
EO0.0010130.0016310.0012670.0030460.000735
MPA0.0011810.0096820.0113120.0121310.003687
The optimal values obtained are in bold.
Table 14. Measured and simulated data of voltages, currents, and power and the absolute errors values using MECPO for TDM.
Table 14. Measured and simulated data of voltages, currents, and power and the absolute errors values using MECPO for TDM.
RankExperimental DataSimulated Current DataSimulated Power Data
V (V)I (A)P (W)Isim (A)IAEI (A)Psim (W)IAEP (W)
1−0.20570.764−0.1571550.76398.30 × 10−4−0.157132.00 × 10−5
2−0.12910.762−0.0983740.762563.00 × 10−4−0.098457.00 × 10−5
3−0.05880.7605−0.0447170.761338.40 × 10−4−0.044775.00 × 10−5
40.00570.76050.0043350.76028.10 × 10−40.004330.00 × 10+00
50.06460.760.0490960.759162.60 × 10−40.049045.00 × 10−5
60.11850.7590.0899420.758196.80 × 10−40.089851.00 × 10−4
70.16780.7570.1270250.757262.70 × 10−40.127074.00 × 10−5
80.21320.7570.1613920.756322.50 × 10−40.161251.50 × 10−4
90.25450.75550.1922750.755238.90 × 10−40.192217.00× 10−5
100.29240.7540.220470.753757.50 × 10−40.22047.00× 10−5
110.32690.75050.2453380.751391.43 × 10−30.245632.90× 10−4
120.35850.74650.267620.747258.40 × 10−40.267892.70× 10−4
130.38730.73850.2860210.739932.80 × 10−40.286585.50× 10−4
140.41370.7280.3011740.727163.20 × 10−40.300833.50× 10−4
150.43730.70650.3089520.706781.23 × 10−30.309081.20× 10−4
160.4590.67550.3100550.675189.60 × 10−40.309911.50× 10−4
170.47840.6320.3023490.630777.60 × 10−40.301765.90× 10−4
180.4960.5730.2842080.572047.80 × 10−40.283734.80× 10−4
190.51190.4990.2554380.499761.06 × 10−40.255833.90× 10−4
200.52650.4130.2174450.413781.00 × 10−40.217854.10× 10−4
210.53980.31650.1708470.317561.38 × 10−40.171425.70× 10−4
220.55210.2120.1170450.21211.17 × 10−40.11716.00× 10−5
230.56330.10350.0583020.102122.56 × 10−40.057527.80× 10−4
240.5736−0.0100−0.005736−0.008831.68 × 10−3−0.005076.70× 10−4
250.5833−0.1230−0.071746−0.125568.30 × 10−4−0.073241.49× 10−3
260.59−0.2100−0.1239−0.208323.00 × 10−4−0.122919.90× 10−4
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kamel, S.; Houssein, E.H.; Hassan, M.H.; Shouran, M.; Hashim, F.A. An Efficient Electric Charged Particles Optimization Algorithm for Numerical Optimization and Optimal Estimation of Photovoltaic Models. Mathematics 2022, 10, 913. https://doi.org/10.3390/math10060913

AMA Style

Kamel S, Houssein EH, Hassan MH, Shouran M, Hashim FA. An Efficient Electric Charged Particles Optimization Algorithm for Numerical Optimization and Optimal Estimation of Photovoltaic Models. Mathematics. 2022; 10(6):913. https://doi.org/10.3390/math10060913

Chicago/Turabian Style

Kamel, Salah, Essam H. Houssein, Mohamed H. Hassan, Mokhtar Shouran, and Fatma A. Hashim. 2022. "An Efficient Electric Charged Particles Optimization Algorithm for Numerical Optimization and Optimal Estimation of Photovoltaic Models" Mathematics 10, no. 6: 913. https://doi.org/10.3390/math10060913

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop