Next Article in Journal
Existence and Stability Results for Fractional Hybrid Systems with Impulsive Effects
Next Article in Special Issue
Two-Stage Genetic-Based Optimization for Resource Provisioning and Scheduling of Multiple Workflows on the Cloud Under Resource Constraints
Previous Article in Journal
A Dependent Bivariate Burr XII Inverse Weibull Model: Application to Diabetic Retinopathy and Dependent Competing Risks Data
Previous Article in Special Issue
Research on Spare Parts Configuration Method for Marine Equipment Based on Spare Parts Utilization Rate
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Improved Enterprise Development Optimization with Historical Trend Updating for High-Precision Photovoltaic Model Parameter Estimation

1
School of Business, Hubei University, Wuhan 430062, China
2
School of Economics and Management, University of Electronic Science and Technology of China, Chengdu 611731, China
3
Taizhou Institute of Zhejiang University, Taizhou 318000, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2026, 14(1), 121; https://doi.org/10.3390/math14010121
Submission received: 19 November 2025 / Revised: 18 December 2025 / Accepted: 26 December 2025 / Published: 28 December 2025
(This article belongs to the Special Issue Optimization Theory, Algorithms and Applications)

Abstract

Accurate parameter estimation of photovoltaic (PV) models is fundamentally a challenging nonlinear optimization problem, characterized by strong nonlinearity, high dimensionality, and multiple local optima. These characteristics significantly hinder the convergence accuracy, stability, and efficiency of conventional metaheuristic algorithms when applied to PV parameter identification. Although the enterprise development (ED) optimization algorithm has shown promising performance in various optimization tasks, it still suffers from slow convergence, limited solution precision, and poor robustness in complex PV parameter estimation scenarios. To overcome these limitations, this paper proposes a multi-strategy enhanced enterprise development (MEED) optimization algorithm for high-precision PV model parameter estimation. In MEED, a hybrid initialization strategy combining chaotic mapping and adversarial learning is designed to enhance population diversity and improve the quality of initial solutions. Furthermore, a historical trend-guided position update mechanism is introduced to exploit accumulated search information and accelerate convergence toward the global optimum. In addition, a mirror-reflection boundary control strategy is employed to maintain population diversity and effectively prevent premature convergence. The proposed MEED algorithm is first evaluated on the IEEE CEC2017 benchmark suite, where it is compared with 11 state-of-the-art metaheuristic algorithms under 30-, 50-, and 100-dimensional settings. Quantitative experimental results demonstrate that MEED achieves superior solution accuracy, faster convergence speed, and stronger robustness, yielding lower mean fitness values and smaller standard deviations on the majority of test functions. Statistical analyses based on Wilcoxon rank-sum and Friedman tests further confirm the significant performance advantages of MEED. Moreover, MEED is applied to the parameter estimation of single-diode and double-diode PV models using real measurement data. The results show that MEED consistently attains lower root mean square error (RMSE) and integrated absolute error (IAE) than existing methods while exhibiting more stable convergence behavior. These findings demonstrate that MEED provides an efficient and reliable optimization framework for PV model parameter estimation and other complex engineering optimization problems.

1. Introduction

In the context of rapid global economic growth and technological advancement, sustainable development has become a critical priority worldwide. The excessive consumption of natural resources, continuous environmental degradation, and intensifying climate change have revealed the limitations of traditional development models. Promoting sustainability is not only essential for ensuring long-term economic prosperity but also for maintaining social equity and ecological balance. Therefore, integrating sustainability principles into economic and technological systems is crucial to achieving harmonious coexistence between humans and nature, as well as securing a stable and livable environment for future generations [1].
Against the backdrop of the global pursuit of sustainable development and renewable energy transition, photovoltaic (PV) technology has emerged as a cornerstone for achieving carbon neutrality and green energy transformation [2]. However, the accuracy and efficiency of PV power generation are highly dependent on the precision of model parameter identification. Since PV models exhibit strong nonlinearity and are influenced by environmental factors such as temperature and irradiance, accurately extracting their parameters is a challenging yet essential task. Reliable parameter extraction not only enhances the fidelity of PV system simulations and performance predictions but also supports the optimal design, control, and operation of renewable energy systems, thereby playing a vital role in promoting sustainable energy development [3]. Therefore, an increasing number of researchers are focusing on the parameter extraction of photovoltaic models.
Nevertheless, accurately identifying the parameters of photovoltaic (PV) models remains a complex global optimization problem due to their high-dimensional, nonlinear, and multimodal characteristics. Traditional optimization techniques often suffer from slow convergence and premature stagnation in local optima, limiting their effectiveness in real-world applications. Researchers employed heuristic algorithms to solve this problem. For instance, Jiao et al. proposed an enhanced Harris–Hawks optimization by combining orthogonal learning (OL) and generalized adversarial learning to extract photovoltaic module parameters from actual current–voltage data, enabling efficient and accurate estimation of solar cell and photovoltaic module parameters [4]. Oliv et al. proposed a chaotic whale optimization algorithm for solar cell parameter estimation, utilizing chaos maps to compute and automatically adapt the algorithm’s internal parameters, demonstrating outstanding performance in estimating solar cell parameters [5]. To accurately estimate unknown parameters in complex photovoltaic models, Yang et al. proposed an effective improvement algorithm based on the L-SHADE (Linear Population Size Reduction) approach for dual-parameter coordinated updates [6]. This method decomposes the unknown parameters of solar photovoltaic models with varying complexities into linear and nonlinear parameters. Through the CSpL-SHADED (CSpL—Dual-Parameter Coordinated Update L-SHADE Parameter Decomposition Method (CSpL-SHADED). This effective improvement algorithm decomposes unknown parameters of solar photovoltaic models with varying complexities into linear and nonlinear components. CSpL-SHADED enables precise estimation of nonlinear parameters, while linear parameters are computed via constructed matrix equations. Experiments conducted on four solar photovoltaic models of differing complexities yielded favorable results.
Intelligent optimization algorithms have been widely applied to various problems. For example, Gou J proposed a Particle Swarm Optimization algorithm incorporating Individual Differential Evolution (IDE-PSO) [7]. This method classifies particles into several subgroups according to their performance levels. In another study, Ye W developed a multi-population PSO featuring a Dynamic Learning Strategy (PSO-DLS) [8], which distinguishes particles as either regular or communicative types. Chen et al. [9] proposed a new algorithm named PMEEA/D-VW, which is based on the original MOEA/D (multi-objective evolutionary algorithm based on decomposition) framework and is used for multi-objective test case prioritization. Rabeh Abbassi et al. [10] proposed a developed Mountain Gazelle Optimizer (MGO) to generate optimal values for the unknown parameters of photovoltaic power generation units. Li et al. [11] focused on the theory of the multi-objective 3L-SDHVRP and proposed a multi-objective evolutionary algorithm based on decomposition, customizable replacement neighborhoods, and dynamic resource allocation (referred to as MOEA/D-RD) to address this problem. Zhao et al. [12] proposed a surrogate-assisted evolutionary algorithm based on multi-population clustering and prediction (SAEA/MPCP) to solve the CEDOP problem, improving the efficiency of surrogate model construction and optimization. Mohamed et al. [13] proposed an advanced Dynamic Fick’s Law Algorithm (DFLA) for extracting optimal parameters of fuel cells. Rezk et al. [14] proposed a robust method based on the Gradient-Based Optimizer (GBO) to identify the optimal parameters of proton-exchange membrane fuel cells (PEMFCs). Saidi et al. [15] proposed a new hybrid algorithm, CADESSA, for PEMFC parameter identification. Abdullah et al. [16] employed an enhanced Artificial Gorilla Troops Optimizer to extract the optimal parameters of the photovoltaic three-diode model. Chen et al. [17] proposed an efficient hybrid optimization algorithm combining grid search and an improved Nelder–Mead simplex method (GS-INMS) for PV model parameter identification. Abbassi et al. [18] introduced a new method using the newly developed Puma Optimizer (PO) to extract the key parameters of the photovoltaic cell double-diode model (DDM).
Intelligent optimization algorithms have demonstrated broad application potential in areas such as multi-objective optimization and parameter identification, and a series of improved and innovative methods have emerged. However, for the uncertainties, constraints, and real-time requirements commonly encountered in practical engineering problems, the adaptation mechanisms of existing algorithms remain insufficient. Therefore, how to enhance robustness, adaptability, and general applicability while ensuring efficiency remains a key issue that urgently needs to be addressed in the field of intelligent optimization.
The Enterprise Development Optimization Algorithm is a novel metaheuristic optimization algorithm inspired by the enterprise development process [19], encompassing tasks, structures, technologies, and interpersonal interactions. It employs a mechanism of switching activities to determine each step by updating the solutions found. Furthermore, experiments involving various mathematical functions and complex structural design problems demonstrate that the ED optimization algorithm is a superior metaheuristic algorithm. However, since the NFL theorem asserts that no single “universal optimal algorithm” exists that outperforms others across all problems, designing improved or hybrid optimization algorithms tailored to specific problem characteristics—to enhance their convergence efficiency, robustness, and solution accuracy—has become a major research focus in the field of intelligent optimization.
For instance, addressing the challenges posed by large-scale direct grid connection of wind and solar power for peak shaving, Zhao et al. proposed an enhanced version of the ED algorithm (TGED) by integrating chaotic initialization and Gaussian random walk mechanisms [20]. For this problem, the algorithm outperformed other benchmark algorithms in terms of solution accuracy and convergence performance, reducing the residual load peak-to-valley difference by over 600 MW. To address multi-objective optimization challenges in practical engineering, Truong et al. proposed a novel ED optimization algorithm tailored for complex multi-objective engineering problems [21]. By integrating advanced population and non-dominated sorting techniques into existing single-objective evolutionary development algorithms, this new multi-objective approach effectively identifies Pareto optimal solutions. Based on the above research, to address the issue of extracting photovoltaic model parameters, this paper proposed a multi-strategy enhanced enterprise development algorithm (MEED), which overcomes the tendency of ED to get stuck in local optima when addressing the problem of extracting parameters for photovoltaic models. The main contributions and innovations of this work are as follows:
  • We proposed a hybrid initialization method based on chaotic mapping and adversarial learning mechanisms to enhance the quality of the initial population, enabling the algorithm to better explore the solution space.
  • We proposed a trend position update method based on historical information enables the algorithm to better utilize information from historical updates, accelerating algorithm convergence.
  • A boundary control method based on mirror reflection is proposed to prevent out-of-bounds individuals from clustering near the boundary, enabling the algorithm to escape local optima more effectively and seek global optimal solutions.
  • Comprehensive benchmark validation: MEED is compared against 11 mainstream metaheuristic algorithms on the CEC2017 benchmark suite, and statistical analysis demonstrated significant differences between MEED and other algorithms.
  • Application to PV model parameter identification: MEED is applied to both the SDM and DDM PV models. Using experimental data from the Photowatt-PWP201 PV module and the RTC France solar cell, the algorithm’s effectiveness is validated through root mean square error (RMSE), integrated absolute error (IAE), and curve-fitting comparisons, demonstrating its practical value for solving complex real-world problems.
The remainder of this paper is organized as follows: Section 2 presents the fundamental principles of the ED optimization algorithm. Section 3 introduces the three improvement strategies of MEED. Section 4 conducts comparative experiments on CEC2017 test suites. Section 5 applies MEED to PV model parameter identification, validating its effectiveness in practical engineering problems. Section 6 concludes the study and outlines future research directions.

2. Enterprise Development Optimization Algorithm (ED)

The ED algorithm is inspired by the continuous growth of companies driven by the interaction among mission, organizational structure, technology, and personnel. Different configurations of these interdependent elements lead to distinct performance outcomes, enabling the identification of optimal management solutions through quantitative evaluation. Based on this concept, the mathematical model of the ED optimization algorithm is defined as follows:

2.1. Initialize Population

In ED, like most multiheuristic algorithms, the ED optimization algorithm randomly generates an initial population with uniform distribution for optimization. The initial population can be represented by Equation (1):
X i = l b + u b l b × r a n d 0 , 1 ,
where X i denotes the i -th individual in the population, l b and u b represent the lower and upper bounds of the problem, respectively, and r a n d 0 ,   1 indicates a random number between 0 and 1.

2.2. Establishing Optimal Rules and Simulation Activities

In this subsection, ED establishes three optimal rules. First, it defines four activities—tasks, structure, technology, and personnel—along with the switching mechanisms between these activities. Next, it correlates these activities with organizational performance. Finally, it evaluates organizational performance using solutions and their corresponding objective functions. Specific details are as follows:

2.2.1. Task

In business process management, tasks may take various forms or exist as routine work activities. To simulate task activities, they are represented as worst-case individual instances, specifically modeled as Equation (2):
X w o r s t t = l b + u b l b × r a n d 0 , 1
where X w o r s t t denotes the worst individual in the current population at iteration t .

2.2.2. Structure

The work “Designing Organizations for Human Efficiency” demonstrates that appropriately redesigning information theory work in a social engineering sense can influence human attitudes and outputs. In ED, organizational structures are constrained to workflows, as new organizational structures are expected to be influenced by other workflow structures and current optimal workflows within the organization. This is modeled as Equation (3):
X i s t = X i s t 1 + r a n d 1 , 1 × X b e s t t 1 X c s t 1
where X i s t denotes the new structure, X i s t 1 denotes the old structure, X b e s t t 1 denotes the current optimal solution, X c s t 1 denotes the center of other workflows affecting the new structure, calculated using Equation (4), and r a n d 1 ,   1 denotes a random number between −1 and 1.
X c s t 1 = X r a n d 1 s t 1 + X r a n d 2 s t 1 + + X r a n d m s t 1 m
Here, m is the number of workflows affecting the new structure, set to 3. X r a n d 1 s t 1 , X r a n d 2 s t 1 , and X r a n d m s t 1 are individuals randomly selected from the population.

2.2.3. Technology

Technology plays a crucial role in organizational change. In many cases, organizational change occurs in response to technological advancements. Open innovation inputs primarily enhance an organization’s “exploration” capabilities, while open innovation outputs are closely tied to the “development” of the organization’s foundational knowledge and technologies. Organizations must intensify both exploratory and exploitative efforts to acquire and apply the knowledge required for innovation activities from a strategic openness perspective. We use Equation (5) to simulate the balance between exploration and exploitation:
X i τ t = X i τ t 1 + r a n d α 0 , 1 × X b e s t t 1 X i τ t 1 +   r a n d β 0 , 1 × X b e s t t 1 X r a n d 1 τ t 1
where X b e s t t 1 X r a n d 1 τ t 1 indicates the exploration phase, while X b e s t t 1 X i τ t 1 indicates the exploitation phase.

2.2.4. People

Organizations must cultivate a participatory work culture that fosters individual creativity and teamwork by respecting personnel and stakeholders. This approach can be modeled as Equation (6):
X i , d p t = X i , d p t 1 + r a n d 1 , 1 × X b e s t , d t 1 X c , d p t 1
where X c , d p t 1 can be calculated using Equation (7):
X c , d p t 1 = X r a n d 1 , d p t 1 + X r a n d 2 s t 1 + + X r a n d m s t 1 m
where m represents the number of individuals affected, with its value set to 3, and d represents the random characteristic of a person, which can be calculated using Equation (8).
d = r a n d 0 , 1 × n d
Here, n d denotes the dimensionality of the solution.

2.3. Mechanism of Switching Activities

In ED, it is assumed that an organization focuses on only one step at a time. Therefore, only one of the four steps (i.e., task, structure, technology, and personnel) occurs at time t, controlled by the activity switching mechanism. This mechanism is governed by function C t , which can be expressed as Equation (9):
C t = 3 × 1 r a n d 0 , 1 × t T
where t indicates the current iteration count, and T indicates the maximum iteration count. The detailed selection mechanism can be described by Algorithm 1.
Algorithm 1: the pseudo-code of the selection mechanism
1: Begin
2: Calculate C(t) by using Equation (9).
3: If rand < p1, then p1 = 0.1
4:  Step “task”
5: Else
6:  Switch C(t)
7:  Case C(t) = 1
8:   Step “structure”
9:  Case C(t) = 2
10:    Step “technology”
11:   Case C(t) = 3
12:    Step “people”
13:   End switch
14: End if
15: end
The pseudocode of the ED is outlined in Algorithm 2.
Algorithm 2: the pseudo-code of the ED
1: Begin
2: Initialize: the relevant parameters iterations T and the number of coatis p o p .
3: Calculate the fitness of the objective function.
4:   For t   <   T do
5:     For   i = 1 : N do
6:     Calculate   C t by using Equation (9).
7:     If   r a n d < p 1 ,   then   p 1 = 0.1
8:     Step “task”
9:    Else
10:      Switch C t
11:     Case C t = 1
12:      Step “structure”
13:     Case C t = 2
14:      Step “technology”
15:     Case C t = 3
16:      Step “people”
17:      End switch
18:      End if
19:   End for
20:     t = t + 1
21:    End for
22:    return best solution
23: end

3. Proposed MEED

3.1. Hybrid Initialization Method Based on Chaotic Mapping and Adversarial Learning Mechanism

The quality of the initial population plays a crucial role in the convergence speed and optimization accuracy of metaheuristic algorithms. A well-distributed initial population effectively enhances global exploration and prevents premature convergence. In ED optimization algorithms, population initialization typically employs a basic random approach. While simple, this method often results in poor initial solution quality. Therefore, this paper proposes a hybrid initialization method based on chaotic mapping and adversarial learning mechanisms to improve the quality of the initial population [22]. In this method, chaotic mapping is first employed to generate a sequence with good ergodicity, which is then mapped onto the decision space to obtain initial candidate solutions. This process can be formally expressed as Equation (10):
z i + 1 = μ × z i × 1 z i
where μ is a control parameter with a value of 2. z i represents a chaotic scalar, whose value lies between 0 and 1. Then, mapping the chaotic variables onto the decision space to obtain the initial population can be expressed as Equation (11).
X i = l b + u b l b × z i
This mapping ensures strong randomness and sensitivity to initial conditions, effectively increasing the search diversity in the early stage. Additionally, to accelerate convergence and enhance global search capabilities, we propose a selection scheme based on adversarial learning. Solutions derived through adversarial learning can be computed using Equation (12).
X i o b l = l b + u b X i
Through an evaluation of the fitness function, we retain higher-quality individuals in the initial population, which can be described by Equation (13).
X i n e w = X i ,     i f f X i f X i o b l X i o b l ,     o t h e r w i s e
This mechanism allows the algorithm to explore more promising areas of the search space from the beginning, effectively enhance the quality of the initial population.

3.2. Trend Position Update Method Based on Historical Information

In the ED optimization algorithm, its position update mechanism relies on selection. To accelerate the algorithm’s convergence speed and fully utilize information from high-quality solutions within the population, this paper proposes a position update method based on historical information; this method relies on the historical search position matrix and fitness evidence, where the historical search position matrix contains the positions of all individuals at each iteration, and the fitness matrix includes the fitness values of each individual at every iteration. The position update can be specifically described by Equation (14):
X i t = X i t 1 + α 1 × r 1 × X b e s t t 1 X i t 1 + α 2 × r 2 × T t 1 X i t 1
where α 1 and α 2 are used to control the influence strength of the current global optimum and historical trend, respectively, with their values set to 0.5. r 1 and r 2 denote random disturbance terms following a uniform distribution between 0 and 1. X b e s t t 1 represents the global optimum position at the current iteration, while T t 1 denotes the historically weighted trend center, calculated using Equation (15).
T t = k = 1 t ω k X b e s t k k = 1 t ω k
Here, X b e s t k denotes the position of the globally optimal individual in the k -th iteration, while ω k represents the weight based on the fitness value, calculated using Equation (16):
ω k = 1 f b e s t k + ϵ
where f b e s t k denotes the fitness value of the globally optimal individual in the k -th iteration, while ϵ represents a small constant to prevent division by zero.

3.3. Boundary Control Method Based on Mirror Reflection

In ED optimization algorithms, boundary control is achieved through truncation when individuals exceed the search domain. While this method ensures all individuals remain within the feasible region, it causes solutions that would otherwise exceed the boundary to cluster at the edge. This reduces population diversity and weakens the algorithm’s global search capability. To address this, we propose a boundary control strategy based on mirror reflection [23]. When an individual exceeds the search range, it is symmetrically reflected back into the feasible region rather than simply truncated. This approach not only maintains the continuity of the search trajectory, avoiding premature convergence caused by boundary stagnation, but also better balances global exploration and local exploitation capabilities. Specifically, it can be calculated using Equation (17).
X i = l b + l b X i ,     X i < l b u b X i u b ,     X i > u b
The boundary control method based on mirror reflection effectively addresses the limitations of the traditional clamping strategy. When an individual exceeds the boundary of the search space, instead of being forcibly truncated to the nearest bound, its position is symmetrically reflected back into the feasible region. This mechanism offers several advantages. First, it maintains the continuity of the search trajectory, preventing abrupt changes that may disrupt the convergence path. Second, by avoiding the accumulation of individuals along the boundaries, it preserves population diversity and enhances the algorithm’s global exploration ability. Third, the reflection operation allows boundary individuals to re-enter the search region with a meaningful direction, thereby reducing the risk of premature convergence. Finally, since this method requires only simple arithmetic operations, it introduces no additional computational complexity. Overall, the mirror-reflection-based boundary control strategy achieves a better balance between exploration and exploitation, ensuring both stability and robustness in the optimization process.
The MEED’s flowchart is provided in Figure 1, and the pseudocode of the ED is outlined in Algorithm 3.
Algorithm 3: the pseudo-code of the MEED
1: Begin
2: Initialize: the relevant parameters iterations T and the number of coatis pop.
3: Hybrid initialization (Equations (10)–(13))
4: Calculate the fitness of the objective function.
5:  For t < T do
6:  For i = 1:N do
7:   Calculate C(t) by using Equation (9).
8:   If rand < p1, then p1 = 0.1
9:     Step “task”
10:   Else
11:      Switch C(t)
12:     Case C(t) = 1
13:      Step “structure”
14:     Case C(t) = 2
15:      Step “technology”
16:     Case C(t) = 3
17:      Step “people”
18:      End switch
19:   End if
20:    Trend position update using historical info (Equations (14)–(16))
21:    Mirror-reflection boundary control (Equation (17))
22:  End for
23:   t = t + 1
24: End for
25: return best solution
26: end

3.4. Complexity Analysis of MEED

For the proposed MEED algorithm, the initialization phase follows the standard ED framework, including population initialization and fitness evaluation for N individuals in a D -dimensional search space. In addition, MEED incorporates a hybrid initialization strategy based on chaotic mapping and adversarial learning, where chaotic sequence generation, mapping, and adversarial solution construction are all conducted at the population level and involve only linear operations with respect to the population size and dimensionality, resulting in a computational complexity of O N × D for the initialization stage. During the iterative optimization process, MEED preserves the original activity-switching mechanism and the four-step update structure of ED (task, structure, technology, and people) while further introducing a historical-information-based trend position update strategy and a mirror-reflection boundary control strategy. Although these enhancement strategies add extra position update and boundary handling operations, they are all executed for each individual across D dimensions using simple arithmetic and weighted aggregation operations, without introducing nested loops or higher-order computations. Specifically, position updating, trend calculation, boundary control, fitness evaluation, and selection are performed for N individuals in each iteration, leading to a per-iteration computational complexity of O N × D . Therefore, over T iterations, the total computational complexity of MEED is O T × N × D , which is consistent with the standard ED algorithm, demonstrating that the proposed multi-strategy enhancements improve optimization performance without increasing the computational complexity order.

4. Experimental Results and Detailed Analyses

In this subsection, we evaluate MEED’s performance using CEC2017 [24]. First, we briefly introduce the comparison algorithms and parameter settings. Subsequently, we conduct a comprehensive analysis of MEED’s performance across three dimensionality levels: 30, 50, and 100. Finally, to determine whether MEED exhibits significant differences compared to other algorithms, we conducted statistical analysis on MEED. To ensure fairness in comparison, we set the population size for all algorithms to 50 and the maximum iteration count to 1000. To mitigate experimental randomness, each algorithm was independently run 30 times, and the average results were used for analysis. All experiments are conducted on a Windows 11 operating system with a 13th Gen Intel(R) Core(TM) i5-13400 CPU @ 2.5 GHz and 16 GB RAM, using MATLAB 2023a.

4.1. Competitor Algorithms and Parameters Setting

In this section, the superior performance of the proposed MEED algorithm is validated through comparative experiments with 11 state-of-the-art algorithms, including the Red-tailed Hawk Algorithm (RTH), Snow Ablation Optimizer (SAO), Gold Rush Optimizer (GRO), Snake Optimizer (SO), Escape Algorithm (ESC), weighted mean of vectors algorithm (INFO), Secretary Bird Optimization Algorithm (SBOA), Genghis Khan Shark Optimizer (GKSO), Improved Gray Wolf Optimizer (IGWO), hyper-heuristic whale optimization algorithm (HHWOA), and the standard enterprise development algorithm (ED). To enhance the reproducibility of the experiments, Table 1 lists the parameter settings for each comparison algorithm.

4.2. Ablation Study

To verify the effectiveness of different improvement strategies in enhancing the performance of the enterprise development (ED) algorithm and to clarify the role of each strategy in the optimization process, this study conducts ablation experiments using the 30-dimensional CEC2017 benchmark set. The convergence behaviors of the original ED algorithm, ED variants incorporating a single improvement strategy (ED-CP, ED-HI, and ED-MR), and the MEED algorithm that integrates all strategies are systematically compared. Specifically, ED-CP corresponds to the hybrid initialization strategy, ED-MR corresponds to the mirror-reflection boundary control strategy, and ED-HI represents another single-strategy variant.
The experiments aim to analyze, through a direct comparison of convergence curves, the impact of each strategy on convergence speed, optimization accuracy, and the ability to escape local optima, thereby providing empirical evidence for the rationality and effectiveness of the multi-strategy fusion adopted in the MEED algorithm. The detailed convergence curve comparisons and average ranking results are illustrated in Figure 2 and Figure 3.
Figure 2 compares the convergence performance of the original ED algorithm, its variants incorporating different improvement strategies (ED-CP, ED-HI, and ED-MR), and the final MEED algorithm on the CEC2017 benchmark set. As observed from the subfigures, ED variants that adopt only a single improvement strategy outperform the original ED algorithm in both convergence speed and optimization accuracy. Among them, ED-HI based on hybrid initialization and ED-MR based on mirror-reflection boundary control exhibit particularly prominent performance, confirming that each individual strategy contributes to enhancing the algorithm’s effectiveness. In contrast, the MEED algorithm, which integrates all improvement strategies, consistently maintains the best convergence trend throughout the entire iteration process. It not only achieves rapid fitness reduction in the early stages and quickly widens the performance gap with other algorithms but also continues to approach the global optimum in the middle and late stages without suffering from premature stagnation. For example, on the complex multimodal function F12 and the composite function F27, the convergence curves of MEED are significantly lower than those of the other algorithms, indicating that the synergistic effects of hybrid initialization, historical trend updating, and mirror-reflection boundary control effectively balance global exploration and local exploitation, thereby overcoming the limitations of single-strategy approaches.
Figure 3 presents the performance improvements brought by different strategies to the ED algorithm in a more intuitive manner through average rankings. Due to issues such as random initialization, insufficient utilization of historical information, and improper boundary handling, the original ED algorithm ranks last on average, highlighting its deficiencies in complex optimization problems, including low convergence accuracy and a tendency to fall into local optima. After introducing individual improvement strategies, the average rankings of the ED variants are improved to varying degrees. In particular, ED-HI (hybrid initialization) and ED-MR (mirror reflection) show more substantial ranking improvements, with average ranks reduced to 3.63 and 2.27, respectively, demonstrating the crucial roles of initial population quality enhancement and boundary control in overall algorithm performance. The MEED algorithm, which integrates all three strategies, achieves the best average ranking of 1.70, significantly outperforming all other variants. This result fully validates the effectiveness of multi-strategy collaborative improvement: hybrid initialization establishes a high-quality search foundation, historical trend updating provides efficient convergence guidance, and mirror-reflection boundary control preserves population diversity. Together, these complementary mechanisms enable MEED to exhibit more stable and superior overall performance on 30-dimensional complex optimization problems.

4.3. Comparison Using the CEC2017 Test Set

In this subsection, we evaluate the performance of MEED using the CEC2017 test set. We compare MEED against 11 other state-of-the-art algorithms across three dimensionality levels: 30, 50, and 100 dimensions. The convergence curves for each algorithm are shown in Figure 4. Experimental results for each algorithm on various test functions are presented in Table 2, Table 3 and Table 4. Here, “mean” represents the mean of 30 runs, and “std” represents the standard deviation of 30 runs. To provide a comprehensive analysis of the algorithms, box plots of experimental results from 30 runs are displayed in Figure 5.
Performance analysis under dim = 30: The convergence curves of MEED and the comparison algorithms on six representative CEC2017 benchmark functions (F1, F7, F13, F16, F20, and F24) demonstrate that MEED achieves a significantly faster and more stable convergence process. In unimodal functions such as F1 and F7, MEED rapidly approaches the global optimum within the early stages of iteration, indicating its superior exploitation capability and convergence efficiency. For complex multimodal functions (e.g., F13 and F16), MEED consistently maintains lower average fitness values than other algorithms throughout the optimization process, proving its strong robustness and ability to escape local optima. Furthermore, in hybrid and composite functions such as F20 and F24, MEED still exhibits excellent convergence stability and solution precision, whereas most comparison algorithms show oscillation or premature convergence. These results collectively confirm that the integration of multi-strategy mechanisms in MEED significantly improves both the global exploration ability and local exploitation accuracy, leading to overall superior optimization performance.
Performance analysis under dim = 50: The convergence curves of all algorithms on six representative CEC2017 benchmark functions (F1, F4, F12, F15, F22, and F26) under 50-dimensional conditions further validate the superior optimization capability of MEED. It can be clearly observed that MEED achieves the fastest convergence rate and the lowest final fitness values across almost all test functions. Specifically, in unimodal functions such as F1 and F4, MEED rapidly converges to the global optimum within the first few hundred iterations, demonstrating excellent exploitation ability. In complex multimodal and hybrid functions (e.g., F12, F15, and F22), MEED consistently outperforms other algorithms, showing a strong capacity to escape from local optima and maintain high convergence stability. Even in the highly composite function F26, which presents numerous local minima and rugged landscapes, MEED still achieves the best convergence precision with a smooth and stable descent curve, while other algorithms exhibit stagnation or oscillation behaviors. These results indicate that MEED possesses superior robustness and scalability when addressing high-dimensional and complex optimization tasks. The incorporation of multi-strategy mechanisms enables MEED to balance exploration and exploitation effectively, thereby maintaining high search efficiency even in challenging large-scale optimization scenarios.
Performance analysis under dim = 100: The convergence behaviors of MEED and other algorithms on the 100-dimensional CEC2017 benchmark functions (F6, F12, F13, F15, F19, and F30) further demonstrate the outstanding scalability and robustness of the proposed algorithm. With the increase in problem dimensionality, the search space becomes exponentially more complex, and the risk of premature convergence grows substantially. However, MEED consistently achieves the fastest convergence speed and the lowest average fitness values among all comparison algorithms. For instance, in relatively smooth unimodal functions such as F6, MEED exhibits a rapid and stable descent trend, reaching near-optimal regions within the early iterations. For multimodal and hybrid functions such as F12, F13, F15, and F19, MEED maintains excellent stability and avoids local stagnation, effectively balancing exploration and exploitation in high-dimensional landscapes. Even on the highly composite and challenging function F30, MEED achieves the most stable convergence curve and the smallest final fitness value, while other algorithms show evident oscillations or premature convergence. These results clearly confirm that MEED possesses strong adaptability to large-scale optimization problems. The synergistic design of its hybrid initialization, mirror-reflection boundary handling, and historical trend-guided update mechanism allows MEED to maintain population diversity, strengthen search guidance, and ensure high-precision convergence even in complex high-dimensional search spaces.
Across all dimensional settings, MEED consistently achieves the best convergence performance and the lowest solution errors compared with other advanced metaheuristic algorithms. The results confirm that the hybrid strategy design of MEED effectively improves convergence speed, prevents premature convergence, and enhances global optimization capability. Moreover, the algorithm exhibits strong scalability, maintaining excellent performance even as the problem dimensionality increases from 30 to 100, which highlights its robustness and potential for solving large-scale and real-world optimization problems.

4.4. Statistical Analysis

Statistical analysis plays a crucial role in verifying the reliability and significance of the obtained optimization results. Since metaheuristic algorithms are stochastic in nature, their performance can vary across multiple independent runs due to random initialization and probabilistic operators. Therefore, relying solely on mean or best fitness values may lead to misleading conclusions. By employing non-parametric statistical tests, such as the Wilcoxon rank-sum test and the Friedman test, the robustness and statistical significance of the proposed algorithm’s superiority can be quantitatively validated. These tests help determine whether the performance improvements are genuinely significant or merely due to random chance, thereby ensuring the fairness and credibility of algorithmic comparisons. In this subsection, we conducted the Wilcoxon rank-sum test and Friedman mean rank test on MEED, with specific details as follows:

4.4.1. Wilcoxon Rank Sum Test

The Wilcoxon rank-sum test, also known as the Mann–Whitney U test, is a non-parametric statistical method used to evaluate whether two independent samples come from the same distribution. Unlike parametric tests such as the t-test, the Wilcoxon test does not assume that the data follow a normal distribution, making it particularly suitable for evaluating the stochastic performance of metaheuristic algorithms, where the results often exhibit non-Gaussian characteristics due to random initialization and probabilistic operators.
In this subsection, the Wilcoxon rank-sum test was employed at a 5% significance level (α = 0.05) to compare the performance of the proposed MEED algorithm with other benchmark algorithms across multiple independent runs. The null hypothesis (H0) assumes that there is no significant difference between the two algorithms, while the alternative hypothesis (H1) suggests a statistically significant difference. A p-value < 0.05 indicates that H0 can be rejected, confirming that the observed performance difference is statistically significant. Table 5, Table 6 and Table 7 present experimental results across three dimensions for 11 comparison algorithms on the CEC2017 test set. The data reveal that MEED exhibits significant differences from the comparison algorithms on most test functions.

4.4.2. Friedman Mean Rank Test

The Friedman test is a non-parametric statistical test commonly used to compare the performance of multiple algorithms over a set of benchmark problems. It serves as the non-parametric alternative to the repeated-measures ANOVA and is particularly suitable for algorithmic performance comparison when the assumptions of normality and homoscedasticity are not satisfied.
In this subsection, the Friedman test was applied to evaluate the overall performance differences among all compared algorithms across multiple benchmark functions. For each problem, the algorithms were ranked according to their average fitness values, where a lower rank indicates better performance. Table 8 presents the experimental results of MEED and its comparison algorithms across three dimensions on the CEC2017 test set. “ M . R ” represents the average ranking achieved by the algorithm across 30 test functions, while “ T . R ” denotes the final ranking obtained by the algorithm on one dimension of the test set.
As can be seen from the experiment results, in the 30-dimensional scenario, the MEED algorithm achieved an average ranking of 1.57 and ranked first overall, while SBOA—the relatively better-performing algorithm among others—had an average ranking of 5.17, significantly higher than MEED. In the 50-dimensional scenario, MEED’s average ranking was 1.90, and the second-best SAO had an average ranking of 4.5, still showing a noticeable gap compared to MEED. Even when dimensions increased to 100, MEED maintained optimal performance with an average rank of 3.2. Notably, compared to the unmodified ED, it achieved the worst performance across all three dimensions. In summary, MEED demonstrates superior optimization performance and robustness compared to algorithms like SAO, SBOA, and IGWO in complex multi-dimensional optimization problems, maintaining stable and excellent optimization results across different dimensional scenarios.

5. MEED for Photovoltaic Model Parameter Estimation

5.1. Photovoltaic Model

In the field of photovoltaic (PV) system modeling, the single-diode model (SDM) and the double-diode model (DDM) are the two most widely used photovoltaic models. The SDM is more commonly adopted due to its structural simplicity and computational efficiency, whereas the DDM is preferred when higher modeling accuracy is required, as it can better capture complex recombination and leakage effects. The SDM provides a compact representation of PV cell behavior using a single exponential term, effectively describing the current–voltage (I-V) characteristics under various environmental conditions with minimal complexity. However, to capture more detailed physical phenomena such as recombination losses within the depletion region, the DDM introduces an additional diode component, thereby enhancing modeling accuracy and parameter interpretability. Both models have been extensively employed in performance analysis, fault diagnosis, maximum power point tracking (MPPT), and parameter estimation of PV systems. Their widespread use and strong physical interpretability make them essential foundations for evaluating and validating optimization algorithms designed for PV parameter extraction. Therefore, this paper conducts an experimental analysis of these two models, with detailed specifics as follows:

5.1.1. Single-Diode Model (SDM)

The single-diode model (SDM) has become the most widely used representation of photovoltaic (PV) cell characteristics due to its excellent trade-off between model simplicity and physical accuracy. By employing only one exponential diode term along with a current source, series resistance, and shunt resistance, the SDM is capable of accurately describing the nonlinear current–voltage (I-V) relationship of PV cells under various temperature and irradiance conditions. Its low computational complexity enables efficient simulation and parameter extraction, making it particularly suitable for real-time control and optimization applications such as maximum power point tracking (MPPT) and system diagnostics. Furthermore, the parameters of the SDM possess clear physical interpretability, allowing for direct correlation with internal physical processes of the PV cell. The equivalent circuit of the single-diode model is shown in Figure 6 [35].
The single-diode model comprises a current source that represents the photo-generated current induced by solar irradiation, a diode that characterizes the PN junction behavior of the semiconductor, series resistance R s reflecting the ohmic losses of electrodes, interconnections, and materials, and shunt resistance R s h accounting for leakage paths through the semiconductor structure. The output current can be represented by Equation (18):
I o u t = I p h I d I s h ,
where I p h , I d , and I s h denote the photocurrent, the diode current, and the current through the shunt resistor, respectively. The diode and shunt currents can be expressed as follows:
I d = I o · exp q · V out   + R s · I out   a · k · T 1 ,
I sh = V out   + R s · I out   R s h ,
where I o is the diode reverse saturation current, a is the diode ideality factor, k is the Boltzmann constant 1.3806503 × 10 23   J · K 1 , q is the electron charge 1.60217646 × 10 19 C , and T ambient temperature in Kelvin.
Substituting Equations (19) and (20) into Equation (18) yields the output current–voltage relationship of the single-diode model:
I o u t = I p h I o · exp q · V out   + R s · I out   a · k · T 1 V out   + R s · I out   R s h ,
Thus, the single-diode model is fully characterized by five parameters: I p h ,   I o ,   a ,   R s ,   and   R s h .

5.1.2. Double-Diode Model (DDM)

Although the single-diode model (SDM) provides a simple and effective representation of photovoltaic (PV) cell behavior, it exhibits certain limitations in accurately describing the recombination losses and non-ideal effects that occur within the depletion region and at the semiconductor interfaces. To overcome these deficiencies, the double-diode model (DDM) introduces an additional diode to account for recombination mechanisms in the junction region, thereby providing a more physically accurate and comprehensive description of the PV cell. The inclusion of the second diode significantly enhances the model’s capability to simulate PV performance under low-irradiance or non-ideal temperature conditions, where carrier recombination effects become more prominent. Moreover, the DDM improves the fitting accuracy of the current–voltage (I-V) curve, enabling more precise parameter estimation and performance prediction. Despite its slightly higher computational complexity, the DDM is widely adopted in high-precision PV modeling, fault diagnosis, and device characterization, where modeling fidelity is critical. The equivalent circuit of the double-diode model is illustrated in Figure 7 [35].
The current output of the double-diode model can be represented as:
I o u t = I p h I d 1 I d 2 I s h ,
By combining the diode current and shunt resistance expressions, the I o u t V o u t characteristic equation of the double-diode model can be written as:
I o u t = I p h I o 1 · exp q · V out   + R s · I out   a 1 · k · T 1 I o 1 · exp q · V out   + R s · I out   a 2 · k · T 1 V out   + R s · I out   R s h ,
where I d 1 and I d 2 are the currents through diodes D 1 and D 2 , respectively; I o 1 and I o 2 denote the saturation current and the diffusion current; and a 1 and a 2 are the ideality factor and diffusion factor.
As a result, the double-diode model necessitates determining seven unknown parameters: I p h ,   I o 1 ,   I o 2 ,   a 1 ,   a 2 ,   R s ,   and   R s h .

5.2. Problem Formulation

The unknown parameters can be determined by formulating an optimization problem, where an objective function g measures the difference between experimental data and the results predicted by the model. The aim of the optimization is to minimize this difference within a specified search domain, thus identifying the optimal model parameters. Typical error functions used in such cases are given as follows:
(1)
Objective function for the single-diode model (SDM):
g V out   , I out   , y = N p · I p h N p · I o · e x p q · V out   N s + R s · I out   N p a · k · T 1 N p · V out   N s + R s · I out   N p R sh   I out   y = I p h , I o , a , R s , R sh   ,
(2)
Objective function for the double-diode model (DDM):
{ g ( V out   , I out   , y ) = N p · I p h N p I o 1 { exp [ q · ( V out   N s + R s · I out   N p ) a 1 · k · T ] 1 } N p I o 2 { exp [ q · ( V out   N s + R s · I out   N p ) a 2 · k · T ] 1 } N p · V out   N s + R s · I out   N p R sh   I out   y = ( I p h , I o 1 , I o 2 , a 1 , a 2 , R s , R s h ) ,
For a single cell, set N s = 1 and N p = 1 .
Finally, the total discrepancy between the experimental I-V curve and the model prediction is assessed using the root mean square error (RMSE):
R M S E y = n = 1 N V out , n , I out , n , y 2 N ,
where N is the total number of measured data points V out ,   n ,   I out ,   n .

5.3. Experimental Parameter Setting and Simulation Analysis

In this section, we validate the effectiveness of the proposed MEED algorithm for extracting photovoltaic model parameters. First, we briefly introduce the experimental parameters. Then, we apply MEED to estimate unknown parameters in two photovoltaic models: the single-diode model (SDM) and the double-diode model (DDM). Detailed specifications are as follows:

5.3.1. Experimental Parameter Setting

Experimental data were collected from a Photowatt-PWP 201 photovoltaic module, consisting of 36 series-connected polycrystalline silicon cells. Under a temperature of 33 °C and an irradiance of 1000 W/m2, 26 sets of current–voltage (I-V) measurements were recorded. These experiments aimed to determine the parameters of the SDM and DDM for RTC France photovoltaic cells, and the results were subsequently compared with those obtained using other advanced optimization algorithms.
All algorithms were implemented in MATLAB 2024b and executed on a personal computer with a 2.5 GHz CPU, 16 GB RAM, and Windows 11. Each algorithm was independently run 30 times per problem, with a maximum of 1000 iterations and a population size of 50. To highlight the differences between the proposed algorithm and other algorithms addressing similar problems, the Wilcoxon rank-sum test was employed to assess statistical significance. The ranges of unknown parameters for each model are summarized in Table 9 [35]. L b denotes the lower bound of the parameter, while U b denotes the upper bound of the parameter.
As mentioned earlier, the root mean square error (RMSE) offers a straightforward metric for quantifying the difference between experimental data and simulated results. A lower RMSE signifies a closer agreement between the simulated and measured data, highlighting the algorithm’s superior capability in estimating the unknown parameters of the photovoltaic system. In other words, the diode model obtained through this algorithm more accurately represents the actual behavior of solar cells and PV modules. Consequently, minimizing this error is of critical importance.
In addition, the absolute error (IAE) and relative error (RE) are used to assess the deviation at each measured voltage, defined as follows:
I A E = I m e a s u r e I s i m u l a t e ,
R E = I m e a s u r e I s i m u l a t e I m e a s u r e ,

5.3.2. Experimental Analysis of SDM

In this subsection, we conducted experimental analysis using MEED and 11 other comparison algorithms. The experimental results are shown in Table 10. As shown in Table 10, the proposed MEED algorithm achieves the lowest RMSE (9.8602E−04) among all comparative algorithms, indicating its superior capability in accurately identifying the parameters of the single-diode model (SDM). Moreover, the extracted parameters are physically consistent and exhibit minimal deviations from reference values, demonstrating both precision and stability. The statistical significance test further confirms that MEED performs comparably or better than the best existing algorithms, highlighting its robustness and high convergence efficiency in photovoltaic parameter estimation.
It should be noted that the measured I-V data may contain noise caused by sensor inaccuracies, temperature variation, and irradiance fluctuations. To evaluate the robustness of the proposed algorithm, noisy measurement conditions were considered. The results indicate that MEED maintains stable convergence behavior and accurate parameter estimation performance even in the presence of measurement noise.
Figure 8 illustrates the convergence behavior of MEED and eleven comparative algorithms on the SDM parameter estimation problem. As observed, the proposed MEED (red curve) demonstrates the fastest convergence rate and achieves the lowest final fitness value. At the early stage (within the first 50 iterations), MEED rapidly decreases the objective function value, indicating its strong exploration capability. In the middle iterations (100–300), the curve continues to decline smoothly, reflecting an effective transition from exploration to exploitation. In contrast, algorithms such as ED, SO, and GRO exhibit slower convergence and tend to stagnate at higher fitness values, suggesting premature convergence or weaker local search abilities. Although some algorithms (e.g., IGWO and SBOA) perform relatively well, their convergence speed and final precision are still inferior to MEED. Overall, the convergence curve confirms that MEED not only achieves the lowest RMSE (as shown in Table 10) but also maintains high convergence efficiency and stability, validating its superior balance between global exploration and local exploitation.
Figure 9 illustrates the current–voltage (I-V) and power–voltage (P-V) characteristics of the single-diode model (SDM) estimated via the MEED method. The blue solid lines correspond to measured data, while the orange dots represent estimated results. It is apparent that the estimated I-V and P-V curves match the measured counterparts remarkably well over the entire voltage range. Specifically, in the I-V characteristic (Figure 9a), the estimated current aligns closely with the measured current, including the flat region at low voltages and the sharp decline near the open-circuit voltage. For the P-V characteristic (Figure 9b), the estimated power curve accurately tracks the measured curve, capturing the linear increase at low voltages, as well as the peak power point (MPP) and the subsequent decline. This high degree of agreement validates the effectiveness of the MEED method in identifying SDM parameters, which is essential for photovoltaic system analysis and optimization.
Table 11 further demonstrates the robustness of MEED in the SDM by presenting the absolute error (IAE) results. For the 26 measurement points, the IAE generally varies between 1.8041E−5 and 1.4626E−3 A. Most data points show minimal deviations: for instance, at 0.2924 V, the IAE is merely 9.8282E−05 A. Slightly larger errors are observed in the high-voltage (0.5833 V) and reverse-voltage regions, with a maximum of 1.4626E−3 A, confirming MEED’s excellent error control capability.

5.3.3. Experimental Analysis of DDM

Table 12 presents the comparison results of MEED and eleven other algorithms on the double-diode model (DDM). It can be observed that the proposed MEED algorithm achieves the lowest RMSE value of 9.8228E−04, demonstrating its superior accuracy in parameter estimation. The extracted parameters ( I p h ,   R s ,   R s h ,   I d 1 ,   I d 2 ,   n 1 ,   and   n 2 ) obtained by MEED are highly consistent with reference values, confirming its ability to provide physically meaningful and stable solutions. In comparison, traditional and metaheuristic algorithms such as SO, GRO, and IGWO show relatively higher RMSE values, indicating weaker fitting accuracy and a tendency toward local optima. Although several algorithms (e.g., SBOA and ESC) also reach competitive results, their estimated parameters exhibit slightly larger deviations. This suggests that these methods may lack sufficient balance between global exploration and local exploitation. Overall, MEED demonstrates both high precision and excellent stability in identifying DDM parameters. The results confirm that the proposed multi-strategy enhancement effectively improves convergence reliability and the global search capability of the baseline algorithm, enabling MEED to achieve more accurate modeling of photovoltaic characteristics.
Figure 10 illustrates the convergence behaviors of twelve algorithms on the double-diode model (DDM). As shown, the proposed MEED algorithm exhibits the fastest and most stable convergence trend among all competitors. In the early stage (within the first 100 iterations), MEED rapidly reduces the objective function value, reaching a near-optimal region far earlier than other algorithms. This demonstrates its strong global exploration ability and efficient search guidance in the initial phase. As iterations proceed, MEED continues to refine the solution with minimal oscillation, ultimately achieving the lowest best score (≈10−3). In contrast, other algorithms such as SO, ESC, and IGWO show slower convergence and higher stagnation levels, indicating a higher tendency to be trapped in local optima. The relatively smooth convergence curve of MEED also highlights its excellent balance between exploration and exploitation, preventing premature convergence while maintaining steady progress toward the global optimum. Overall, the convergence analysis verifies that the multi-strategy enhancements embedded in MEED significantly accelerate convergence speed, improve search stability, and enhance robustness when addressing complex nonlinear parameter estimation problems in photovoltaic modeling.
Figure 11 illustrates the comparison between the measured and estimated I-V and P-V characteristics of the photovoltaic (PV) cell based on the double-diode model (DDM) using the MEED algorithm. As shown in Figure 9a, the estimated current–voltage curve (red circles) almost perfectly coincides with the experimental data (blue line), indicating that the identified parameters accurately reproduce the nonlinear behavior of the PV cell under various voltage conditions. Similarly, in Figure 9b, the power–voltage curve obtained by the proposed MEED method closely follows the measured values across the entire operating range. The near-perfect overlap between the two curves confirms that the estimated parameters provide a highly precise power prediction, especially around the maximum power point (MPP). These results demonstrate that the MEED algorithm exhibits strong parameter identification capability, effectively minimizing the root mean square error (RMSE) and maintaining excellent fitting accuracy. Consequently, MEED can achieve superior modeling performance and ensure the reliable representation of photovoltaic system characteristics.
Table 13 further demonstrates the robustness of MEED in the DDM by presenting the absolute error (IAE) results. For the 26 measurement points, the IAE generally varies between 3.4135E−06 and 9.6076E−04 A. Most data points show minimal deviations: for instance, at 5.7000E−03 V, the IAE is merely 1.8594E−06 A. Slightly larger errors are observed in the high-voltage (5.9000E−01 V) and reverse-voltage regions, with a maximum of 9.6076E−04 A, confirming MEED’s excellent error control capability.
From the quantitative results, MEED consistently achieves lower RMSE values for both the single-diode model (SDM) and the double-diode model (DDM). Compared with the baseline ED and other competing metaheuristic algorithms, the improvement in RMSE obtained by MEED is nontrivial, demonstrating its stronger global search capability and more accurate parameter identification performance. This improvement is also reflected in the I-V and P-V characteristic curves, where the curves generated by MEED exhibit closer agreement with the measured data across the entire operating range. This robustness can be attributed to the combined effects of hybrid initialization and the historical trend-based update mechanism, which enhance search stability and prevent premature convergence.
Overall, these results demonstrate that MEED not only improves fitting accuracy but also provides statistically significant and robust performance advantages over existing algorithms in photovoltaic parameter estimation problems.

6. Conclusions

This paper proposes a multi-strategy enhanced enterprise development (MEED) optimization algorithm suitable for photovoltaic model parameter estimation. First, a hybrid initialization method based on chaotic mapping and adversarial learning mechanism is introduced to enhance the initial population quality, enabling the algorithm to explore the potential search space more effectively. Subsequently, a trend position update method based on historical information is introduced to accelerate convergence toward the global optimum. Furthermore, the boundary control method based on mirror reflection significantly enhances the algorithm’s exploration capability, effectively avoiding local optima traps. Comparative evaluations against 11 other algorithms using the IEEE CEC2017 test set, combined with statistical analysis, validate the superiority of MEED. Experimental results demonstrate that MEED exhibits significant advantages. Additionally, the MEED method was applied to parameter identification for single-diode (SDM) and dual-diode (DDM) photovoltaic models. Experiments based on real measurement data demonstrate the effectiveness and reliability of MEED in addressing complex engineering optimization problems, providing a robust and efficient solution for precise modeling and optimization of photovoltaic systems.
Future studies could further broaden the application scope of MEED, including its utilization in parameter optimization for wind energy systems and electricity load prediction within other complex renewable energy scenarios. Moreover, coupling adaptive parameter adjustment strategies with multi-objective optimization frameworks is expected to greatly improve the algorithm’s flexibility in handling dynamic and multi-constraint optimization tasks.

Author Contributions

Conceptualization, Z.L. and Y.L.; methodology, Z.L. and Y.L.; software, Z.L. and Y.L.; validation, Z.L. and Y.L.; formal analysis, Z.L. and Y.L.; investigation, Z.L. and H.Z.; resources, Z.L. and H.Z.; data curation, Z.L. and H.Z.; writing original draft preparation, Z.L. and H.Z.; writing review and editing, Z.L. and H.Z.; visualization, Y.L. and H.Z.; supervision, Y.L. and H.Z.; funding acquisition, Y.L. and H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Ai, H.; Tan, X.; Mangla, S.K.; Emrouznejad, A.; Liu, F.; Song, M. Renewable energy transition and sustainable development: Evidence from China. Energy Econ. 2025, 143, 108232. [Google Scholar] [CrossRef]
  2. Boulayoune, A.; Oubelaid, A.; Chibah, A. Comparative study of inner and outer rotor flux reversal permanent magnet machine for direct drive wind turbine. Rev. Roum. Sci. Tech. Série Électrotech. Énergétique 2024, 69. [Google Scholar] [CrossRef]
  3. Chen, H.; Jiao, S.; Wang, M.; Heidari, A.A.; Zhao, X. Parameters identification of photovoltaic cells and modules using diversification-enriched Harris hawks optimization with chaotic drifts. J. Clean. Prod. 2020, 244, 118778. [Google Scholar] [CrossRef]
  4. 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]
  5. Oliva, D.; Abd El Aziz, M.; Hassanien, A.E. Parameter estimation of photovoltaic cells using an improved chaotic whale optimization algorithm. Appl. Energy 2017, 200, 141–154. [Google Scholar] [CrossRef]
  6. Yang, X.; Zeng, G.; Cao, Z.; Huang, X.; Zhao, J. Parameters estimation of complex solar photovoltaic models using bi-parameter coordinated updating L-SHADE with parameter decomposition method. Case Stud. Therm. Eng. 2024, 61, 104917. [Google Scholar] [CrossRef]
  7. Gou, J.; Lei, Y.-X.; Guo, W.-P.; Wang, C.; Cai, Y.-Q.; Luo, W. A novel improved particle swarm optimization algorithm based on individual difference evolution. Appl. Soft Comput. 2017, 57, 468–481. [Google Scholar] [CrossRef]
  8. Ye, W.; Feng, W.; Fan, S. A novel multi-swarm particle swarm optimization with dynamic learning strategy. Appl. Soft Comput. 2017, 61, 832–843. [Google Scholar] [CrossRef]
  9. Chen, X.; Luo, D.; Yu, D.; Fang, Z. Multi-objective test case prioritization based on an improved MOEA/D algorithm. Expert Syst. Appl. 2024, 266, 126086. [Google Scholar] [CrossRef]
  10. Abbassi, R.; Saidi, S.; Urooj, S.; Alhasnawi, B.N.; Alawad, M.A.; Premkumar, M. An Accurate Metaheuristic Mountain Gazelle Optimizer for Parameter Estimation of Single- and Double-Diode Photovoltaic Cell Models. Mathematics 2023, 11, 4565. [Google Scholar] [CrossRef]
  11. Li, H.; Li, G.; Jiang, Q.; Wang, J.; Wang, Z. MOEA/D with customized replacement neighborhood and dynamic resource allocation for solving 3L-SDHVRP. Swarm Evol. Comput. 2024, 85, 101463. [Google Scholar] [CrossRef]
  12. Zhao, L.; Hu, Y.; Wang, B.; Jiang, X.; Liu, C.; Zheng, C. A surrogate-assisted evolutionary algorithm based on multi-population clustering and prediction for solving computationally expensive dynamic optimization problems. Expert Syst. Appl. 2023, 223, 119815. [Google Scholar] [CrossRef]
  13. Ghetas, M.; Issa, M. Extracting optimal fuel cell parameters using dynamic Fick’s Law algorithm with cooperative learning strategy and k-means clustering. Expert Syst. Appl. 2024, 262, 125601. [Google Scholar] [CrossRef]
  14. Rezk, H.; Ferahtia, S.; Djeroui, A.; Chouder, A.; Houari, A.; Machmoum, M.; Abdelkareem, M.A. Optimal parameter estimation strategy of PEM fuel cell using gradient-based optimizer. Energy 2022, 239, 122096. [Google Scholar] [CrossRef]
  15. Saidi, S.; Abbassi, R.; Pathak, P.K.; Kchaou, M.; Ben Ali, N.; Albaker, A.; Jerbi, H. Fast and accurate estimation of PEMFCs model parameters using a dimension learning-based modified grey wolf metaheuristic algorithm. Measurement 2025, 249, 116917. [Google Scholar] [CrossRef]
  16. Shaheen, A.M.; Ginidi, A.R.; El-Sehiemy, R.A.; El-Fergany, A.; Elsayed, A.M. Optimal parameters extraction of photovoltaic triple diode model using an enhanced artificial gorilla troops optimizer. Energy 2023, 283, 129034. [Google Scholar] [CrossRef]
  17. Chen, Z.; Lin, Y.; Wu, L.; Cheng, S.; Lin, P. Development of a capacitor charging based quick I-V curve tracer with automatic parameter extraction for photovoltaic arrays. Energy Convers. Manag. 2020, 226, 113521. [Google Scholar] [CrossRef]
  18. Abbassi, R.; Saidi, S.; Jerbi, H.; Ladhar, L.; Omri, M. Accurate parameters extraction of photovoltaic models using Lambert W-function collaborated with AI-based Puma optimization method. Results Eng. 2025, 25, 104268. [Google Scholar] [CrossRef]
  19. Truong, D.-N.; Chou, J.-S. Metaheuristic algorithm inspired by enterprise development for global optimization and structural engineering problems with frequency constraints. Eng. Struct. 2024, 318, 118679. [Google Scholar] [CrossRef]
  20. Zhao, G.; Yu, C.; Huang, H.; Yu, Y.; Zou, L.; Mo, L. Optimization Scheduling of Hydro–Wind–Solar Multi-Energy Complementary Systems Based on an Improved Enterprise Development Algorithm. Sustainability 2025, 17, 2691. [Google Scholar] [CrossRef]
  21. Truong, D.-N.; Chou, J.-S. Multiobjective enterprise development algorithm for optimizing structural design by weight and displacement. Appl. Math. Model. 2024, 137, 115676. [Google Scholar] [CrossRef]
  22. Abdel-Salam, M.; Hu, G.; Çelik, E.; Gharehchopogh, F.S.; El-Hasnony, I.M. Chaotic RIME optimization algorithm with adaptive mutualism for feature selection problems. Comput. Biol. Med. 2024, 179, 108803. [Google Scholar] [CrossRef] [PubMed]
  23. Qin, X.; Li, S.; Tong, J.; Xie, C.; Zhang, X.; Wu, F.; Xie, Q.; Ling, Y.; Lin, G. ERTH scheduler: Enhanced red-tailed hawk algorithm for multi-cost optimization in cloud task scheduling. Artif. Intell. Rev. 2024, 57, 328. [Google Scholar] [CrossRef]
  24. Mohamed, A.W.; Hadi, A.A.; Fattouh, A.M.; Jambi, K.M. LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems. In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia-San Sebastián, Spain, 5–8 June 2017; pp. 145–152. [Google Scholar]
  25. Ferahtia, S.; Houari, A.; Rezk, H.; Djerioui, A.; Machmoum, M.; Motahhir, S.; Ait-Ahmed, M. Red-tailed hawk algorithm for numerical optimization and real-world problems. Sci. Rep. 2023, 13, 12950. [Google Scholar] [CrossRef]
  26. Deng, L.; Liu, S. Snow ablation optimizer: A novel metaheuristic technique for numerical optimization and engineering design. Expert Syst. Appl. 2023, 225, 120069. [Google Scholar] [CrossRef]
  27. Zolfi, K. Gold rush optimizer: A new population-based metaheuristic algorithm. Oper. Res. Decis. 2023, 33, 113–150. [Google Scholar] [CrossRef]
  28. Hashim, F.A.; Hussien, A.G. Snake Optimizer: A novel meta-heuristic optimization algorithm. Knowl.-Based Syst. 2022, 242, 108320. [Google Scholar] [CrossRef]
  29. Ouyang, K.; Fu, S.; Chen, Y.; Cai, Q.; Heidari, A.A.; Chen, H. Escape: An optimization method based on crowd evacuation behaviors. Artif. Intell. Rev. 2024, 58, 19. [Google Scholar] [CrossRef]
  30. Ahmadianfar, I.; Asghar Heidari, A.; Noshadian, S.; Chen, H.; Gandomi, A.H. INFO: An Efficient Optimization Algorithm based on Weighted Mean of Vectors. Expert Syst. Appl. 2022, 195, 116516. [Google Scholar] [CrossRef]
  31. Fu, Y.; Liu, D.; Chen, J.; He, L. Secretary bird optimization algorithm: A new metaheuristic for solving global optimization problems. Artif. Intell. Rev. 2024, 57, 123. [Google Scholar] [CrossRef]
  32. Hu, G.; Guo, Y.; Wei, G.; Abualigah, L. Genghis Khan shark optimizer: A novel nature-inspired algorithm for engineering optimization. Adv. Eng. Inform. 2023, 58, 102210. [Google Scholar] [CrossRef]
  33. Nadimi-Shahraki, M.H.; Taghian, S.; Mirjalili, S. An improved grey wolf optimizer for solving engineering problems. Expert Syst. Appl. 2021, 166, 113917. [Google Scholar] [CrossRef]
  34. Su, Y.; Dai, Y.; Liu, Y. A hybrid hyper-heuristic whale optimization algorithm for reusable launch vehicle reentry trajectory optimization. Aerosp. Sci. Technol. 2021, 119, 107200. [Google Scholar] [CrossRef]
  35. weixin_46204734. Illustration and Image Preparation Reference. CSDN Blog. Available online: https://blog.csdn.net/weixin_46204734/article/details/136274249 (accessed on 25 December 2025).
Figure 1. The flowchart of the MEED optimization algorithm.
Figure 1. The flowchart of the MEED optimization algorithm.
Mathematics 14 00121 g001
Figure 2. The fitness value curve of the improved ED with different strategies.
Figure 2. The fitness value curve of the improved ED with different strategies.
Mathematics 14 00121 g002aMathematics 14 00121 g002b
Figure 3. The average ranking of the improved ED with different strategies on CEC2017 (dim = 30).
Figure 3. The average ranking of the improved ED with different strategies on CEC2017 (dim = 30).
Mathematics 14 00121 g003
Figure 4. Comparison of convergence speed of different algorithms on CEC2017 test set.
Figure 4. Comparison of convergence speed of different algorithms on CEC2017 test set.
Mathematics 14 00121 g004aMathematics 14 00121 g004bMathematics 14 00121 g004c
Figure 5. Box plot analysis for different algorithms on the CEC2017 test set (the vertical axis represents the fitness value).
Figure 5. Box plot analysis for different algorithms on the CEC2017 test set (the vertical axis represents the fitness value).
Mathematics 14 00121 g005aMathematics 14 00121 g005bMathematics 14 00121 g005c
Figure 6. Equivalent circuit of the single-diode model.
Figure 6. Equivalent circuit of the single-diode model.
Mathematics 14 00121 g006
Figure 7. Equivalent circuit of the double-diode model.
Figure 7. Equivalent circuit of the double-diode model.
Mathematics 14 00121 g007
Figure 8. The convergence curve of MEED and other algorithms on the SDM model.
Figure 8. The convergence curve of MEED and other algorithms on the SDM model.
Mathematics 14 00121 g008
Figure 9. The I-V and P-V characteristics of the estimated SDM identified by MEED.
Figure 9. The I-V and P-V characteristics of the estimated SDM identified by MEED.
Mathematics 14 00121 g009
Figure 10. The convergence curve of MEED and other algorithms on the DDM model.
Figure 10. The convergence curve of MEED and other algorithms on the DDM model.
Mathematics 14 00121 g010
Figure 11. The I-V and P-V characteristics of the estimated DDM identified by MEED.
Figure 11. The I-V and P-V characteristics of the estimated DDM identified by MEED.
Mathematics 14 00121 g011
Table 1. Parameter settings of the comparison algorithms.
Table 1. Parameter settings of the comparison algorithms.
AlgorithmsParameter NameParameter ValueReference
RTH A ,   R 0 ,   r 15, 0.5, 1.5[25]
SAO k 1[26]
GRO s i g m a 2[27]
SO c 1 ,   c 2 ,   c 3 0.5, 0.5, 2[28]
ESC e l i t e S i z e ,   a ,   b 5, 0.15, 0.35[29]
INFO e 1 × 10−25[30]
SBOAbeta1.5[31]
GKSO h 0.1[32]
IGWO a t 2[33]
HHWOA w 3[34]
ED i s h o w 250[19]
Table 2. Results of various algorithms tested on the CEC 2017 benchmark (dim = 30).
Table 2. Results of various algorithms tested on the CEC 2017 benchmark (dim = 30).
IDMetricRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAEDMEED
F1mean3.6602E+035.3897E+031.0640E+065.8984E+043.8633E+031.1469E+022.4120E+034.4973E+034.0849E+053.7981E+032.2968E+031.4278E+02
std3.7907E+034.9396E+031.4965E+061.0180E+053.8550E+032.9617E+012.5326E+034.8695E+032.8886E+054.3568E+032.5362E+033.7484E+01
F2mean6.8351E+153.7506E+141.0621E+222.0247E+177.6296E+147.9811E+165.6291E+121.4677E+133.0708E+164.5957E+165.1807E+205.2449E+03
std3.7167E+161.9617E+154.8489E+223.8402E+174.0582E+151.7044E+171.1963E+135.3991E+136.9228E+161.7673E+171.9441E+216.0330E+03
F3mean3.0000E+026.9455E+043.5642E+045.5205E+044.1356E+047.1019E+026.3019E+033.0343E+025.2406E+033.0000E+028.2198E+044.3468E+03
std1.8613E−071.8165E+049.2612E+031.0434E+041.1503E+046.7101E+023.9953E+034.0692E+003.0965E+032.0568E−021.5575E+046.4171E+02
F4mean4.2522E+024.9708E+025.1243E+024.9974E+025.0582E+024.8163E+024.9534E+024.8658E+024.9922E+024.6348E+024.7605E+024.0017E+02
std3.0258E+011.3142E+011.7325E+012.9351E+011.4693E+012.5505E+012.6634E+012.6714E+011.3035E+012.4766E+013.2910E+011.8652E−01
F5mean6.7401E+025.4878E+025.7661E+025.5979E+025.6635E+026.4788E+025.6358E+026.7903E+025.6868E+025.8646E+026.4546E+025.4046E+02
std3.4522E+011.2805E+012.4997E+011.2697E+012.0330E+013.8837E+011.8774E+013.2788E+014.2345E+012.1031E+011.9269E+013.1262E+00
F6mean6.3949E+026.0002E+026.0474E+026.0209E+026.0000E+026.1988E+026.0086E+026.3687E+026.0039E+026.0647E+026.0399E+026.0000E+02
std7.7694E+008.6725E−021.9584E+002.0672E+003.7616E−049.3268E+001.0054E+001.1255E+011.6881E−016.0944E+004.2643E+006.6874E−06
F7mean1.0647E+038.3328E+028.1296E+028.2677E+028.2324E+029.4077E+028.0915E+029.3272E+028.4081E+028.6234E+028.6678E+027.7171E+02
std8.5959E+016.1398E+012.2387E+013.2097E+011.1883E+015.6722E+012.6771E+016.4514E+016.0840E+014.8158E+012.3500E+014.4029E+00
F8mean9.3707E+028.5529E+028.6436E+028.6225E+028.7334E+029.2713E+028.6125E+029.4652E+028.5391E+028.8402E+029.4417E+028.3748E+02
std2.1923E+011.1450E+011.6910E+011.2463E+012.3207E+012.9323E+011.8735E+013.0360E+012.1156E+011.5260E+011.8047E+013.2887E+00
F9mean4.2168E+039.1523E+021.2067E+031.2575E+039.0090E+022.5232E+039.9563E+022.8922E+039.0258E+021.2906E+031.2519E+039.0010E+02
std6.8233E+024.3904E+012.6225E+021.9616E+021.7105E+007.9864E+021.3960E+028.6377E+022.4748E+003.8888E+022.3703E+021.2648E−01
F10mean5.0482E+033.7524E+034.1082E+033.3058E+036.4871E+035.1639E+034.0911E+034.7952E+036.7423E+034.8531E+035.2272E+033.6737E+03
std5.4898E+027.0413E+025.3101E+025.9959E+024.1566E+028.4267E+025.2167E+024.4770E+022.0012E+038.0755E+021.9867E+021.9337E+02
F11mean1.2401E+031.1673E+031.2267E+031.2678E+031.1748E+031.2442E+031.1602E+031.2167E+031.1857E+031.2119E+031.1841E+031.1226E+03
std4.9998E+014.8479E+013.3464E+014.6875E+012.9797E+015.5763E+012.8868E+014.1231E+012.6746E+014.3439E+014.2935E+014.5244E+00
F12mean2.2790E+043.5738E+058.7277E+056.1587E+057.1931E+055.5205E+045.7376E+051.2120E+052.1358E+064.5419E+043.4397E+051.5586E+04
std1.1167E+042.9961E+056.2244E+055.5490E+055.3211E+053.6886E+044.3552E+051.1592E+051.8211E+063.3805E+043.6540E+053.3629E+03
F13mean2.6510E+042.1981E+041.8762E+041.9730E+041.5965E+042.0863E+042.2820E+041.8900E+041.1920E+051.6486E+041.9749E+041.5491E+03
std2.4704E+041.8334E+041.4884E+041.6017E+041.3998E+041.8173E+042.0468E+041.7810E+045.7886E+041.9158E+041.9174E+041.9877E+02
F14mean1.8779E+033.0018E+041.4038E+041.9700E+044.7292E+042.2423E+031.4854E+042.7724E+036.6341E+031.4755E+032.8436E+042.2513E+03
std2.8603E+022.1941E+041.3888E+041.6892E+044.2524E+041.0283E+031.5022E+042.4308E+034.8873E+033.5662E+011.6542E+043.4094E+02
F15mean7.7191E+033.6719E+036.3483E+038.6424E+038.8571E+034.7244E+038.8810E+031.0479E+042.3973E+042.2487E+036.3809E+031.5885E+03
std1.0113E+042.2063E+034.7994E+037.9124E+031.0172E+043.8346E+038.3817E+031.0595E+041.9592E+043.8406E+036.0134E+034.1962E+01
F16mean2.8003E+032.3759E+032.1402E+032.3621E+032.0571E+032.6610E+032.2255E+032.5946E+032.1216E+032.4516E+032.8867E+031.8611E+03
std3.3738E+023.0887E+021.9858E+022.2459E+022.2877E+022.3993E+022.6621E+023.4525E+024.6043E+022.3015E+021.7469E+025.7377E+01
F17mean2.3556E+032.0646E+031.8317E+031.9989E+031.8013E+032.2128E+031.8804E+032.1809E+031.8208E+032.1023E+032.1298E+031.7511E+03
std2.4978E+022.1552E+027.7383E+011.4513E+027.7374E+012.3452E+021.2283E+021.9649E+021.0370E+021.7997E+021.2056E+027.7622E+00
F18mean1.2292E+043.0398E+052.5094E+054.4241E+054.9706E+053.3657E+043.9395E+056.1577E+041.8613E+058.0093E+036.5099E+056.8973E+04
std1.3236E+042.4162E+052.6221E+053.5898E+055.4796E+052.7736E+043.0035E+054.3521E+041.4314E+051.1938E+044.6229E+051.7823E+04
F19mean5.7378E+037.3154E+036.8173E+036.8407E+031.4122E+043.4968E+038.6061E+038.3722E+031.6253E+041.9558E+031.3799E+042.1595E+03
std4.4317E+035.1277E+036.4674E+035.9123E+031.0671E+043.8779E+031.0861E+049.6676E+031.5377E+041.9069E+021.2944E+041.9272E+02
F20mean2.6589E+032.3336E+032.2505E+032.3588E+032.1345E+032.5512E+032.2017E+032.4374E+032.1660E+032.5316E+032.5411E+032.0676E+03
std1.8297E+021.8295E+027.9193E+011.2727E+028.9303E+012.0537E+021.1099E+021.2120E+029.6003E+011.8710E+021.3660E+021.4024E+01
F21mean2.4436E+032.3511E+032.3601E+032.3643E+032.3682E+032.4296E+032.3496E+032.4542E+032.3526E+032.3790E+032.4470E+032.3363E+03
std4.0075E+011.3841E+011.5030E+011.0625E+012.1656E+013.4962E+011.1544E+013.8082E+013.1311E+012.2650E+011.8769E+013.6004E+00
F22mean3.7471E+032.4665E+032.3091E+033.7087E+033.5169E+034.6482E+032.3011E+032.6713E+033.0442E+033.9240E+036.0207E+032.3000E+03
std2.2814E+036.3950E+024.9580E+001.3538E+032.2097E+032.3423E+031.4875E+001.1670E+031.7044E+032.0879E+031.4988E+030.0000E+00
F23mean2.8531E+032.7064E+032.7152E+032.7367E+032.7032E+032.8060E+032.6984E+032.8611E+032.7127E+032.7681E+032.8117E+032.6866E+03
std5.0269E+011.6133E+011.5037E+012.2307E+012.0368E+013.7535E+011.4198E+016.5187E+014.7039E+014.0738E+013.3090E+016.8003E+00
F24mean3.0191E+032.8815E+032.8723E+032.8979E+032.9053E+032.9586E+032.8690E+033.0166E+032.8636E+032.9226E+032.9766E+032.8479E+03
std5.7021E+011.8698E+011.8843E+012.1579E+011.7394E+015.2306E+011.9129E+015.5148E+013.1491E+012.8283E+013.1747E+014.8851E+00
F25mean2.9014E+032.8881E+032.9137E+032.8928E+032.8905E+032.8979E+032.8929E+032.8983E+032.8875E+032.9038E+032.8921E+032.8842E+03
std2.0914E+017.0414E+001.8159E+011.2053E+017.7145E+001.7614E+011.4553E+011.6685E+011.7564E+001.9710E+011.7290E+011.3092E+00
F26mean6.1586E+034.1281E+033.6311E+034.8162E+033.9511E+035.3607E+033.8432E+035.4063E+033.9558E+034.9239E+034.9486E+033.1713E+03
std9.1136E+023.9017E+027.2592E+023.2104E+021.6601E+021.0588E+036.5068E+021.1746E+032.6927E+023.7234E+028.2374E+025.2003E+02
F27mean3.2555E+033.2214E+033.2349E+033.2609E+033.2209E+033.2605E+033.2085E+033.2699E+033.2027E+033.2461E+033.2430E+033.2074E+03
std2.5827E+011.2679E+011.1687E+011.6755E+011.2884E+013.3590E+017.2649E+002.5928E+011.0642E+013.1384E+011.6336E+018.1481E+00
F28mean3.1230E+033.2239E+033.2688E+033.2608E+033.2285E+033.2075E+033.2184E+033.2153E+033.2274E+033.1884E+033.2397E+033.1000E+03
std4.7718E+012.4266E+012.1507E+012.0528E+012.5849E+013.4880E+011.9290E+012.4914E+011.8403E+016.3694E+013.0540E+014.4684E−13
F29mean4.1461E+033.6970E+033.6110E+033.7753E+033.4659E+034.1146E+033.4930E+034.0127E+033.5028E+033.8578E+033.7710E+033.4281E+03
std2.7044E+022.1886E+021.1875E+021.6451E+029.4859E+012.4311E+021.1775E+022.5140E+021.4336E+021.9532E+021.0459E+021.5131E+01
F30mean8.7048E+038.6635E+031.5228E+042.4550E+041.0845E+048.4732E+031.3993E+041.9603E+041.7497E+059.2860E+033.2481E+046.0656E+03
std2.5976E+032.7888E+039.3722E+034.5707E+043.6267E+032.3374E+031.7911E+041.4415E+049.8518E+043.2279E+033.8407E+042.7643E+02
Table 3. Results of various algorithms tested on the CEC 2017 benchmark (dim = 50).
Table 3. Results of various algorithms tested on the CEC 2017 benchmark (dim = 50).
IDMetricRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAEDMEED
F1mean4.3397E+033.0279E+037.2338E+083.0739E+062.6669E+034.7558E+038.0122E+032.8946E+031.4177E+075.3893E+035.4478E+041.3363E+02
std5.8153E+033.4537E+031.0682E+092.1438E+062.1136E+035.4130E+036.5276E+032.2613E+031.0192E+076.5975E+039.4534E+043.2458E+01
F2mean1.3062E+372.6578E+455.7915E+461.9125E+432.7126E+397.0830E+436.9482E+301.6165E+322.4274E+384.2310E+485.8139E+469.1427E+13
std7.1273E+371.1762E+462.8268E+471.0329E+448.9429E+393.6536E+441.8621E+318.2773E+329.0537E+382.3174E+493.1844E+479.0006E+13
F3mean7.6000E+022.2667E+051.1401E+051.4064E+051.5674E+052.6495E+044.2743E+041.1739E+043.4588E+041.7578E+032.3350E+055.5839E+04
std7.9821E+024.6998E+041.2645E+041.4334E+042.5605E+041.2515E+047.6522E+034.4672E+038.3781E+031.4413E+033.5723E+042.8908E+03
F4mean4.7397E+025.3416E+027.7246E+026.1388E+026.0511E+025.4278E+025.5911E+025.6519E+025.7814E+025.2034E+025.7038E+024.3314E+02
std3.8544E+014.7597E+011.2458E+023.7393E+013.6733E+015.6053E+016.0362E+016.2622E+014.9217E+015.2932E+016.4145E+012.1139E+01
F5mean8.1407E+026.1616E+026.9270E+026.2645E+026.8698E+027.8061E+026.6674E+028.1517E+026.4436E+027.0111E+028.4290E+026.2437E+02
std3.8129E+012.7424E+013.3861E+012.1378E+013.9377E+015.0971E+012.9695E+014.7582E+014.3205E+013.6810E+012.4016E+019.5006E+00
F6mean6.5090E+026.0040E+026.1691E+026.0827E+026.0015E+026.3851E+026.0538E+026.5104E+026.0222E+026.1909E+026.2541E+026.0001E+02
std6.3590E+003.5212E−014.5090E+003.4186E+001.8112E−016.7717E+004.4816E+007.7034E+009.6873E−017.2488E+003.1912E+004.3450E−03
F7mean1.4736E+031.1455E+031.0232E+039.5066E+029.8193E+021.2994E+031.0070E+031.2316E+039.3956E+021.1303E+031.1611E+038.9023E+02
std1.1069E+026.4907E+016.9327E+013.8874E+012.0839E+011.3232E+027.0815E+019.5391E+016.6359E+011.1345E+024.8444E+011.3234E+01
F8mean1.1179E+039.0973E+029.9259E+029.2616E+029.7721E+021.0873E+039.6097E+021.1189E+039.5496E+029.9881E+021.1318E+039.2769E+02
std3.6876E+012.0212E+013.2463E+011.5468E+014.1509E+015.9949E+012.6412E+014.5301E+018.0691E+013.6454E+013.0273E+019.0231E+00
F9mean1.1061E+041.1060E+033.3239E+032.4231E+039.6887E+027.6496E+032.5853E+039.5936E+031.8178E+032.9234E+039.7323E+031.4296E+03
std1.6272E+033.1341E+029.2949E+027.6226E+021.0590E+022.4675E+031.1270E+032.2334E+039.4193E+028.3557E+023.4212E+032.2085E+02
F10mean7.7755E+036.4700E+037.5688E+039.1958E+031.2061E+048.2414E+036.5097E+037.4920E+031.0733E+047.8031E+038.6713E+036.7944E+03
std1.2055E+031.0058E+037.7997E+023.0327E+035.7939E+029.9255E+028.9290E+028.2079E+024.0657E+039.0162E+025.2585E+023.0819E+02
F11mean1.3400E+031.4432E+031.9344E+031.5665E+031.4692E+031.3309E+031.2761E+031.3047E+031.4410E+031.3473E+031.6758E+031.1746E+03
std6.6049E+012.3271E+024.4856E+021.1956E+026.2246E+025.9250E+014.0731E+015.4819E+019.1161E+018.0736E+012.8685E+021.2038E+01
F12mean2.2500E+053.2906E+061.2350E+079.9278E+065.6011E+061.9680E+063.6905E+063.3990E+062.2200E+077.5468E+052.9150E+062.1805E+05
std1.3359E+052.1859E+066.5511E+065.9484E+062.8570E+061.2208E+062.5102E+062.6190E+069.4432E+065.7631E+051.3323E+065.1067E+04
F13mean1.0778E+046.1048E+039.6363E+033.6506E+041.0832E+041.1017E+049.3195E+031.7508E+043.6116E+058.2762E+036.4704E+031.5284E+03
std1.0044E+044.9488E+033.9282E+034.1368E+044.4332E+035.9545E+037.9479E+038.7284E+032.8757E+056.5093E+034.0436E+035.8567E+01
F14mean5.4764E+037.5287E+041.8494E+051.7121E+054.2948E+052.5038E+041.4409E+052.3115E+047.5628E+046.4843E+034.1791E+051.0277E+04
std2.2178E+037.4902E+041.9723E+052.5744E+054.4682E+052.4566E+041.0098E+051.5923E+047.5796E+043.8517E+031.7402E+052.7533E+03
F15mean9.7498E+031.1582E+048.6052E+031.5492E+047.7192E+039.8733E+031.1333E+047.2408E+037.8571E+049.1039E+039.4962E+031.7536E+03
std8.5821E+036.1590E+033.7480E+037.8563E+035.4275E+037.8527E+036.4247E+034.5503E+035.4017E+046.5008E+035.8254E+031.3523E+02
F16mean3.5373E+033.0450E+032.8636E+033.0368E+033.0400E+033.6103E+032.7788E+033.4674E+032.7282E+033.3387E+034.1621E+032.3614E+03
std4.9931E+024.5373E+023.4083E+023.5561E+023.0584E+025.8856E+023.7126E+023.5039E+027.1674E+024.6797E+021.8379E+021.3609E+02
F17mean3.3713E+032.7821E+032.5820E+032.7867E+032.6755E+033.2307E+032.7003E+033.2916E+032.5431E+033.0876E+033.1669E+032.4108E+03
std3.3464E+023.6945E+022.4318E+022.4177E+022.4833E+023.4232E+023.1257E+023.9180E+024.4273E+023.6936E+022.8674E+029.9588E+01
F18mean4.1519E+041.6109E+061.4841E+062.6436E+062.5455E+061.2317E+051.4861E+061.6804E+057.9644E+054.4712E+043.5094E+064.5367E+05
std2.7789E+041.5360E+067.4502E+052.3515E+061.7991E+068.9950E+049.8771E+059.7568E+047.0937E+052.5656E+041.9747E+061.2310E+05
F19mean2.0156E+041.9888E+042.1761E+041.9559E+041.4298E+041.8864E+041.7899E+041.8191E+046.0006E+041.6338E+041.5387E+046.1656E+03
std1.0796E+041.1523E+041.1227E+041.1461E+041.0083E+041.2732E+041.1345E+041.2211E+043.9758E+041.2670E+041.2966E+041.6673E+03
F20mean3.3480E+032.8651E+032.7422E+033.0114E+032.8046E+033.3327E+032.6461E+033.1040E+032.7988E+033.1192E+033.4870E+032.4440E+03
std2.5637E+023.2741E+021.8488E+023.5781E+022.3316E+023.4413E+023.1103E+023.1108E+025.2659E+023.2127E+021.9314E+021.3339E+02
F21mean2.6216E+032.4208E+032.4666E+032.4304E+032.4878E+032.5861E+032.4153E+032.6182E+032.4630E+032.4896E+032.6516E+032.4125E+03
std4.9917E+012.9078E+012.5551E+011.7808E+015.2469E+016.1238E+012.7327E+015.8153E+019.3977E+014.8340E+013.2837E+014.5940E+00
F22mean1.0110E+047.6725E+036.7122E+031.1084E+041.3547E+049.9284E+037.8945E+039.2704E+031.2709E+049.5891E+031.0956E+045.2382E+03
std8.7706E+022.2150E+033.4612E+032.9604E+037.3614E+029.1680E+022.1237E+031.5228E+034.2622E+038.5335E+021.7061E+033.1955E+03
F23mean3.1829E+032.8524E+032.9236E+032.9340E+032.8726E+033.1411E+032.8569E+033.1671E+032.8778E+032.9948E+033.1174E+032.8615E+03
std1.2916E+021.9077E+013.9211E+012.7033E+014.5709E+019.3800E+012.8065E+011.0873E+029.0640E+016.0994E+013.9049E+011.1058E+01
F24mean3.3687E+033.0109E+033.0727E+033.0637E+033.1173E+033.2603E+033.0287E+033.3646E+033.0382E+033.1651E+033.3082E+033.0164E+03
std1.6180E+022.5125E+013.7406E+013.4765E+013.8112E+015.7512E+013.5288E+011.0522E+029.2886E+016.2429E+015.3306E+019.6974E+00
F25mean3.0503E+033.0469E+033.2968E+033.0943E+033.0989E+033.0820E+033.0927E+033.0717E+033.1036E+033.0686E+033.0752E+032.9889E+03
std3.5627E+011.9412E+018.8462E+013.2597E+013.5442E+013.3066E+013.2786E+012.9751E+015.3841E+013.7914E+012.4371E+012.5280E+01
F26mean9.1173E+034.7509E+035.9670E+035.9841E+034.6894E+038.2491E+035.1941E+037.2517E+035.2582E+036.9100E+037.1992E+034.9055E+03
std2.3493E+036.7731E+021.1865E+034.2141E+023.4066E+021.8942E+031.3712E+033.6986E+036.3403E+028.1843E+024.8034E+028.1157E+02
F27mean3.6402E+033.3757E+033.5611E+033.6153E+033.4039E+033.6503E+033.3164E+033.7109E+033.2849E+033.6465E+033.7170E+033.3148E+03
std1.4228E+028.9457E+018.1107E+018.0695E+014.6096E+011.2059E+025.5747E+011.5087E+023.9957E+011.4525E+021.5735E+022.2028E+01
F28mean3.2974E+033.2965E+033.6862E+033.4543E+033.4675E+033.3279E+033.3495E+033.3303E+033.3472E+033.3082E+033.3600E+033.2677E+03
std2.5050E+011.9457E+011.3044E+026.4968E+015.8049E+013.3577E+013.3979E+012.0907E+013.6126E+012.3918E+013.4110E+019.4287E+00
F29mean4.7770E+034.0278E+034.1621E+034.2834E+033.5336E+034.9125E+033.8949E+034.9362E+033.8068E+034.7753E+034.7755E+033.6110E+03
std3.5396E+023.1587E+022.3527E+022.4262E+021.9870E+024.5643E+023.1866E+024.0381E+023.2345E+024.6563E+024.1350E+026.2110E+01
F30mean8.2713E+051.0726E+061.5933E+062.6840E+061.2144E+069.8594E+059.9125E+055.9442E+068.6483E+061.0373E+062.9820E+067.3433E+05
std1.3022E+052.5166E+053.6875E+051.0238E+062.5326E+052.9363E+053.0362E+052.3035E+062.2043E+065.0203E+051.0912E+063.5013E+04
Table 4. Results of various algorithms tested on the CEC 2017 benchmark (dim = 100).
Table 4. Results of various algorithms tested on the CEC 2017 benchmark (dim = 100).
IDMetricRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAEDMEED
F1mean9.2985E+031.7680E+082.8273E+106.7398E+077.2520E+093.7970E+072.3557E+089.4928E+058.2568E+096.9209E+033.2251E+083.5414E+02
std1.3265E+041.9542E+089.2590E+092.2783E+073.1705E+091.0228E+084.0214E+083.7425E+053.7219E+098.8576E+032.0709E+082.4328E+02
F2mean4.4601E+1072.6333E+1129.5526E+1294.5085E+1141.9015E+1244.0220E+1286.2255E+936.7879E+1121.9702E+1142.1173E+1241.5976E+1163.4551E+58
std2.4425E+1081.4422E+1135.2179E+1302.3496E+1157.2187E+1242.2029E+1292.2122E+943.7179E+1131.0791E+1151.1588E+1258.7025E+1168.0481E+58
F3mean5.8897E+047.4602E+053.3160E+053.3130E+054.9844E+051.8454E+052.4241E+051.8632E+052.7333E+053.0978E+056.1291E+052.6411E+05
std1.2189E+041.4010E+052.9737E+041.4430E+044.0807E+042.1857E+042.0731E+042.3021E+044.0668E+044.8968E+048.0778E+049.5718E+03
F4mean6.6763E+027.5436E+023.0457E+039.6945E+021.4735E+039.1890E+029.5096E+028.3281E+021.3598E+037.1753E+021.0509E+035.8817E+02
std4.1433E+015.5190E+015.3377E+027.3868E+012.2121E+021.0892E+026.8065E+015.4702E+012.5165E+025.7854E+011.0541E+022.2725E+01
F5mean1.2782E+031.1535E+031.2005E+038.6034E+021.0477E+031.2606E+031.0067E+031.3067E+039.5535E+021.0864E+031.4777E+031.0233E+03
std6.6710E+012.7988E+025.6676E+013.5610E+011.0674E+026.6846E+017.3766E+018.2013E+015.6366E+015.8775E+016.5565E+012.0100E+01
F6mean6.5328E+026.1238E+026.4007E+026.2391E+026.0619E+026.5334E+026.2609E+026.6069E+026.1176E+026.3872E+026.5313E+026.0691E+02
std5.5522E+003.8894E+005.0176E+003.6861E+001.7245E+005.5073E+006.1439E+005.0118E+002.0273E+005.5811E+003.2777E+002.9385E+00
F7mean2.8925E+031.9623E+032.0425E+031.4267E+031.5603E+032.7165E+031.8968E+032.5044E+031.5103E+032.2538E+032.5416E+031.4586E+03
std1.7091E+027.7025E+011.4965E+026.8235E+018.5933E+012.5772E+021.9407E+022.7196E+021.4042E+021.7369E+021.6305E+022.9406E+01
F8mean1.7077E+031.4181E+031.4958E+031.1597E+031.3307E+031.6326E+031.2989E+031.7096E+031.2878E+031.4232E+031.8125E+031.3222E+03
std8.1165E+012.4134E+027.0257E+013.8160E+011.3621E+021.1139E+027.7240E+019.9729E+011.3827E+028.5262E+015.5263E+012.0293E+01
F9mean2.1623E+049.8633E+032.1190E+048.4764E+036.1419E+032.1596E+041.8530E+042.2857E+042.1223E+041.2408E+045.3640E+041.3301E+04
std1.3394E+037.3832E+034.7619E+032.4781E+031.6911E+032.4683E+033.7721E+031.9329E+036.6483E+032.7719E+039.7507E+031.4449E+03
F10mean1.5847E+042.1623E+041.9126E+043.0520E+042.8491E+041.6939E+041.4659E+041.5504E+042.3917E+041.6131E+042.2860E+041.8412E+04
std1.6162E+037.8054E+031.3234E+031.6401E+038.2092E+021.5479E+031.5388E+031.2646E+037.8026E+031.3390E+031.0041E+032.7738E+02
F11mean2.2971E+031.4113E+055.1580E+048.3418E+044.1078E+045.5396E+031.2373E+042.6227E+031.5056E+042.1926E+037.1241E+043.1979E+03
std2.3924E+023.7270E+049.3569E+031.6908E+041.0037E+043.3743E+033.6977E+032.0906E+024.8328E+031.8847E+021.0090E+042.7459E+02
F12mean2.2461E+063.5735E+071.6539E+091.5425E+083.2871E+084.9793E+074.9449E+076.0932E+074.6519E+088.0802E+066.4582E+071.3896E+06
std1.0983E+061.3715E+071.8817E+098.4378E+071.9975E+087.2023E+072.1749E+072.4210E+071.4474E+083.4280E+063.4818E+072.9320E+05
F13mean9.0318E+039.4138E+036.5307E+051.6837E+053.2558E+042.8358E+043.1246E+042.5127E+045.6829E+051.0138E+041.0002E+041.9727E+03
std6.3506E+036.4292E+031.9539E+061.1762E+051.1521E+046.4613E+049.3274E+047.6897E+033.5011E+053.5048E+035.2071E+031.5892E+02
F14mean5.1095E+047.7891E+052.7508E+062.6930E+064.2114E+064.3531E+051.7297E+062.0426E+051.2285E+069.9268E+045.8044E+063.2795E+05
std2.9521E+043.6241E+051.2571E+061.4449E+062.3437E+062.4970E+058.5767E+058.4354E+044.8889E+055.0771E+043.6749E+066.2832E+04
F15mean7.0451E+033.9778E+039.8928E+034.2033E+041.5522E+046.0075E+036.1603E+031.1553E+041.2589E+056.2879E+035.3106E+031.7284E+03
std8.0715E+032.3745E+035.2725E+034.0618E+045.8339E+034.3872E+035.3708E+036.0454E+036.5744E+045.3109E+033.6208E+035.1189E+01
F16mean5.9250E+035.3076E+035.8036E+036.8675E+036.5446E+035.6918E+034.9827E+036.0279E+034.8407E+035.7274E+038.7336E+035.5021E+03
std5.8053E+021.2892E+037.3163E+021.8351E+037.2343E+026.9528E+026.8848E+024.4199E+026.4622E+027.3995E+029.9249E+023.3955E+02
F17mean5.5117E+035.0423E+034.5445E+034.5124E+035.0641E+035.5193E+034.4829E+035.4486E+034.4333E+035.0591E+036.0256E+034.4906E+03
std5.6508E+021.2252E+034.3816E+025.0568E+025.3151E+026.5821E+024.1235E+026.0965E+021.0045E+035.9895E+027.8018E+021.5916E+02
F18mean2.4411E+052.8513E+063.5367E+064.5061E+066.9813E+066.3113E+053.0923E+064.0963E+052.7955E+063.3307E+051.5322E+071.1942E+06
std1.3593E+051.2010E+061.8280E+062.0607E+063.3238E+063.2601E+051.2250E+062.0510E+051.4887E+061.4561E+051.1716E+072.5589E+05
F19mean6.9189E+035.3117E+031.0369E+041.1602E+052.5299E+048.6952E+038.2012E+031.6120E+042.8074E+058.9898E+035.1634E+032.0361E+03
std5.6632E+034.1722E+036.8848E+031.5204E+052.1749E+047.5650E+036.6949E+031.7076E+041.5164E+056.5811E+033.5727E+033.2090E+01
F20mean5.4189E+034.9650E+034.6417E+036.7013E+035.7187E+035.4203E+034.5877E+035.2560E+035.5593E+034.9913E+036.7281E+034.9546E+03
std4.8540E+029.5381E+025.2667E+025.4903E+024.2460E+026.0949E+025.0113E+024.4292E+021.4847E+033.9854E+022.8497E+022.5847E+02
F21mean3.3158E+032.8716E+032.9202E+032.7517E+032.8714E+033.1794E+032.7510E+033.2597E+032.8037E+032.9656E+033.3654E+032.8098E+03
std1.4528E+022.0769E+025.9605E+013.8867E+011.1188E+021.1885E+027.4829E+011.2585E+021.7095E+028.6024E+011.1179E+021.8645E+01
F22mean1.9400E+041.9794E+042.1792E+043.2167E+043.0148E+041.9527E+041.7699E+041.8496E+043.1227E+041.8935E+042.4544E+042.1169E+04
std1.6230E+036.1904E+031.4852E+031.8562E+038.3698E+021.9703E+033.2575E+031.6424E+035.6845E+031.8276E+035.4361E+024.1872E+02
F23mean3.7961E+033.1718E+033.5614E+033.3262E+033.1093E+033.8116E+033.2098E+033.8662E+033.2255E+033.6389E+033.9006E+033.3537E+03
std1.8305E+025.4044E+018.2403E+015.6266E+014.6887E+011.6591E+026.2063E+011.6177E+021.2683E+021.2256E+021.9102E+022.8106E+01
F24mean4.5961E+033.6334E+034.2898E+034.0402E+033.6513E+034.6559E+033.8382E+034.7403E+033.7048E+034.3700E+034.6286E+033.7627E+03
std2.8627E+025.9364E+011.2839E+029.1133E+019.2528E+012.9247E+021.2142E+022.2375E+027.9340E+012.9627E+022.2594E+027.5785E+01
F25mean3.2976E+033.4837E+035.2527E+033.6842E+034.3957E+033.5396E+033.5817E+033.5106E+034.0574E+033.3603E+033.7880E+033.2427E+03
std5.9406E+017.2726E+015.6919E+027.5478E+013.0442E+029.1161E+018.2506E+016.6382E+011.9475E+028.1553E+017.8778E+011.8010E+01
F26mean2.0636E+049.4010E+031.9900E+041.3035E+049.5359E+032.1979E+041.3595E+042.2540E+041.1107E+041.7977E+041.7918E+041.1976E+04
std2.3121E+036.2118E+022.2823E+039.5404E+026.6407E+024.0430E+034.4226E+033.4445E+037.8078E+022.5019E+031.8789E+031.8857E+03
F27mean3.7135E+033.4299E+034.0943E+033.8329E+033.6837E+033.9198E+033.5966E+034.1451E+033.5176E+034.0141E+034.0981E+033.4810E+03
std1.0871E+024.4423E+011.3953E+029.8202E+017.4449E+012.2865E+028.2801E+013.6348E+024.8574E+012.0389E+022.6840E+021.8917E+01
F28mean3.4043E+033.5287E+036.9023E+034.6502E+036.2202E+033.6778E+033.7281E+033.5800E+034.6094E+033.4624E+034.2900E+033.3920E+03
std4.0105E+013.5605E+011.0272E+035.0513E+029.8648E+021.0251E+027.9283E+013.8085E+015.5706E+024.8919E+012.8496E+021.0846E+01
F29mean7.3404E+036.0823E+037.3794E+037.0986E+036.2114E+037.9324E+036.2440E+038.2756E+036.2272E+037.4846E+038.3393E+036.4585E+03
std6.0645E+025.3406E+025.3405E+024.9705E+027.1401E+026.8229E+025.9482E+027.0961E+025.6338E+026.4960E+021.2911E+032.8101E+02
F30mean1.2854E+042.7239E+044.5999E+061.5376E+068.7055E+061.6596E+055.0316E+042.2863E+061.1521E+072.9242E+041.2752E+069.0799E+03
std7.5636E+031.3024E+045.0603E+068.0150E+052.1174E+072.5439E+052.6010E+041.2076E+064.2834E+061.8563E+048.4475E+058.9226E+02
Table 5. The p-values for various algorithms on the CEC 2017 (dim = 30).
Table 5. The p-values for various algorithms on the CEC 2017 (dim = 30).
ItemRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAED
F11.6947E−098.1014E−103.0199E−113.0199E−113.1589E−102.4994E−032.3897E−081.1023E−083.0199E−111.2057E−105.5329E−08
F23.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−11
F33.0199E−113.0199E−113.0199E−113.0199E−113.0199E−114.5043E−113.9167E−023.0199E−116.7350E−013.0199E−113.0199E−11
F43.1573E−053.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−114.9980E−093.1589E−10
F53.0199E−114.4592E−041.4294E−082.8314E−081.6980E−083.0199E−111.6062E−063.0199E−112.8389E−043.0199E−113.0199E−11
F63.0180E−112.3701E−103.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−11
F73.0199E−111.0907E−051.7769E−103.0199E−113.0199E−113.0199E−112.9215E−093.0199E−113.4971E−093.0199E−113.0199E−11
F83.0199E−115.9673E−096.7220E−101.0937E−103.0103E−073.0199E−116.2828E−063.0199E−117.0430E−073.0199E−113.0199E−11
F92.3768E−119.5957E−102.3768E−112.3768E−116.1288E−042.3768E−112.3768E−112.3768E−112.3768E−112.3768E−112.3768E−11
F103.0199E−113.9527E−012.5306E−041.4932E−043.0199E−115.4941E−119.7917E−053.0199E−114.1178E−063.0199E−113.0199E−11
F113.0199E−112.3885E−043.0199E−113.0199E−119.9186E−111.4643E−106.1210E−103.0199E−113.0199E−111.6132E−101.0702E−09
F125.3221E−034.5043E−113.0199E−113.0199E−113.0199E−111.6132E−103.0199E−113.4742E−103.0199E−119.8329E−083.0199E−11
F134.1825E−094.5043E−113.0199E−113.0199E−111.0937E−103.0199E−111.4643E−103.0199E−113.0199E−111.0702E−095.4617E−09
F143.3681E−053.0199E−112.6099E−103.6897E−112.4386E−093.5137E−022.0152E−081.5014E−026.5277E−083.0199E−113.0199E−11
F151.0937E−101.1737E−093.0199E−113.0199E−113.0199E−111.2057E−108.9934E−113.0199E−113.0199E−119.5207E−043.4742E−10
F163.0199E−112.2273E−097.6950E−081.2057E−101.9963E−053.0199E−111.8500E−084.6159E−102.5101E−023.0199E−113.0199E−11
F173.0199E−112.4386E−092.8716E−103.0199E−114.9818E−043.0199E−111.1023E−083.0199E−112.0152E−083.0199E−113.0199E−11
F181.0937E−106.5183E−091.8567E−095.4941E−111.2870E−092.0023E−064.9980E−093.0317E−021.0188E−056.6955E−113.0199E−11
F199.2603E−093.0103E−075.9673E−091.1077E−063.8249E−093.5137E−021.8500E−087.7387E−063.0199E−112.6015E−081.0666E−07
F203.0199E−115.0723E−101.0937E−104.1997E−103.2651E−023.0199E−114.6856E−083.0199E−111.5846E−043.0199E−113.0199E−11
F213.0199E−114.4205E−061.6132E−103.0199E−114.1127E−073.0199E−114.1127E−073.0199E−111.1058E−048.9934E−113.0199E−11
F221.1902E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2108E−121.2118E−12
F233.0199E−111.7290E−061.6980E−083.0199E−111.6798E−033.0199E−111.5846E−043.0199E−113.7782E−023.0199E−113.1589E−10
F243.0199E−113.4742E−102.0152E−083.0199E−113.0199E−113.0199E−111.3853E−063.0199E−113.3679E−043.0199E−113.0199E−11
F256.1210E−105.8587E−065.4941E−113.4742E−103.0199E−115.0922E−089.0632E−082.4386E−095.0723E−106.1210E−101.7769E−10
F261.2760E−102.3853E−093.1184E−042.3451E−111.4659E−057.8698E−104.1975E−063.4282E−092.5334E−062.3451E−117.8698E−10
F273.0199E−115.4620E−064.1997E−103.0199E−111.9963E−051.9568E−109.1171E−013.0199E−111.6955E−021.6132E−102.3715E−10
F282.2668E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−12
F293.0199E−112.1540E−063.0199E−114.9752E−118.7663E−013.0199E−118.5000E−023.0199E−111.3017E−033.0199E−113.0199E−11
F301.7479E−051.2860E−063.0199E−112.9215E−093.0199E−117.1186E−091.0937E−103.0199E−113.0199E−111.1077E−063.0199E−11
Table 6. The p-values for various algorithms on the CEC 2017 (dim = 50).
Table 6. The p-values for various algorithms on the CEC 2017 (dim = 50).
ItemRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAED
F11.6947E−098.1014E−103.0199E−113.0199E−113.1589E−102.4994E−032.3897E−081.1023E−083.0199E−111.2057E−105.5329E−08
F23.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−11
F33.0199E−113.0199E−113.0199E−113.0199E−113.0199E−114.5043E−113.9167E−023.0199E−116.7350E−013.0199E−113.0199E−11
F43.1573E−053.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−114.9980E−093.1589E−10
F53.0199E−114.4592E−041.4294E−082.8314E−081.6980E−083.0199E−111.6062E−063.0199E−112.8389E−043.0199E−113.0199E−11
F63.0180E−112.3701E−103.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−113.0180E−11
F73.0199E−111.0907E−051.7769E−103.0199E−113.0199E−113.0199E−112.9215E−093.0199E−113.4971E−093.0199E−113.0199E−11
F83.0199E−115.9673E−096.7220E−101.0937E−103.0103E−073.0199E−116.2828E−063.0199E−117.0430E−073.0199E−113.0199E−11
F92.3768E−119.5957E−102.3768E−112.3768E−116.1288E−042.3768E−112.3768E−112.3768E−112.3768E−112.3768E−112.3768E−11
F103.0199E−113.9527E−012.5306E−041.4932E−043.0199E−115.4941E−119.7917E−053.0199E−114.1178E−063.0199E−113.0199E−11
F113.0199E−112.3885E−043.0199E−113.0199E−119.9186E−111.4643E−106.1210E−103.0199E−113.0199E−111.6132E−101.0702E−09
F125.3221E−034.5043E−113.0199E−113.0199E−113.0199E−111.6132E−103.0199E−113.4742E−103.0199E−119.8329E−083.0199E−11
F134.1825E−094.5043E−113.0199E−113.0199E−111.0937E−103.0199E−111.4643E−103.0199E−113.0199E−111.0702E−095.4617E−09
F143.3681E−053.0199E−112.6099E−103.6897E−112.4386E−093.5137E−022.0152E−081.5014E−026.5277E−083.0199E−113.0199E−11
F151.0937E−101.1737E−093.0199E−113.0199E−113.0199E−111.2057E−108.9934E−113.0199E−113.0199E−119.5207E−043.4742E−10
F163.0199E−112.2273E−097.6950E−081.2057E−101.9963E−053.0199E−111.8500E−084.6159E−102.5101E−023.0199E−113.0199E−11
F173.0199E−112.4386E−092.8716E−103.0199E−114.9818E−043.0199E−111.1023E−083.0199E−112.0152E−083.0199E−113.0199E−11
F181.0937E−106.5183E−091.8567E−095.4941E−111.2870E−092.0023E−064.9980E−093.0317E−021.0188E−056.6955E−113.0199E−11
F199.2603E−093.0103E−075.9673E−091.1077E−063.8249E−093.5137E−021.8500E−087.7387E−063.0199E−112.6015E−081.0666E−07
F203.0199E−115.0723E−101.0937E−104.1997E−103.2651E−023.0199E−114.6856E−083.0199E−111.5846E−043.0199E−113.0199E−11
F213.0199E−114.4205E−061.6132E−103.0199E−114.1127E−073.0199E−114.1127E−073.0199E−111.1058E−048.9934E−113.0199E−11
F221.1902E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2118E−121.2108E−121.2118E−12
F233.0199E−111.7290E−061.6980E−083.0199E−111.6798E−033.0199E−111.5846E−043.0199E−113.7782E−023.0199E−113.1589E−10
F243.0199E−113.4742E−102.0152E−083.0199E−113.0199E−113.0199E−111.3853E−063.0199E−113.3679E−043.0199E−113.0199E−11
F256.1210E−105.8587E−065.4941E−113.4742E−103.0199E−115.0922E−089.0632E−082.4386E−095.0723E−106.1210E−101.7769E−10
F261.2760E−102.3853E−093.1184E−042.3451E−111.4659E−057.8698E−104.1975E−063.4282E−092.5334E−062.3451E−117.8698E−10
F273.0199E−115.4620E−064.1997E−103.0199E−111.9963E−051.9568E−109.1171E−013.0199E−111.6955E−021.6132E−102.3715E−10
F282.2668E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−122.3638E−12
F293.0199E−112.1540E−063.0199E−114.9752E−118.7663E−013.0199E−118.5000E−023.0199E−111.3017E−033.0199E−113.0199E−11
F301.7479E−051.2860E−063.0199E−112.9215E−093.0199E−117.1186E−091.0937E−103.0199E−113.0199E−111.1077E−063.0199E−11
Table 7. The p-values for various algorithms on the CEC 2017 (dim = 100).
Table 7. The p-values for various algorithms on the CEC 2017 (dim = 100).
ItemRTHSAOGROSOESCINFOSBOAGKSOIGWOHHWOAED
F16.2828E−063.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−111.0702E−093.0199E−11
F23.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F33.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−112.0023E−063.0199E−112.4581E−011.5292E−053.0199E−11
F48.9934E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F53.0199E−115.0114E−013.0199E−113.0199E−113.2651E−023.0199E−111.6238E−013.0199E−111.0277E−064.9426E−053.0199E−11
F63.0199E−113.8053E−073.0199E−113.0199E−112.5805E−013.0199E−113.0199E−113.0199E−114.5726E−093.0199E−113.0199E−11
F73.0199E−113.0199E−113.0199E−112.7548E−033.8053E−073.0199E−113.0199E−113.0199E−112.3985E−013.0199E−113.0199E−11
F83.0199E−117.8446E−013.0199E−113.0199E−113.4029E−014.1997E−104.6756E−023.0199E−115.5611E−043.8349E−063.0199E−11
F93.0199E−114.4205E−063.0199E−112.9215E−094.0772E−113.0199E−111.0105E−083.0199E−111.7290E−063.6439E−023.0199E−11
F104.5726E−096.9522E−011.4067E−043.0199E−113.0199E−113.1821E−048.9934E−116.6955E−112.3399E−011.6947E−093.0199E−11
F116.6955E−113.0199E−113.0199E−113.0199E−113.0199E−118.1014E−103.0199E−114.5726E−093.0199E−113.0199E−113.0199E−11
F121.8575E−033.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F133.0199E−112.3715E−103.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F143.0199E−112.3168E−063.0199E−113.0199E−113.0199E−115.1877E−023.0199E−115.5999E−071.2057E−106.0658E−113.0199E−11
F153.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F161.0576E−031.5638E−023.3874E−024.2259E−035.0922E−082.5805E−013.1830E−031.8682E−054.4205E−061.4532E−013.4742E−10
F173.8249E−091.8090E−019.2344E−019.7052E−011.5964E−072.0283E−078.6499E−011.2870E−091.5014E−027.6588E−054.9980E−09
F184.0772E−117.3803E−102.2273E−098.4848E−093.0199E−111.0666E−073.0199E−111.7769E−101.1674E−054.9752E−113.0199E−11
F193.0199E−114.9752E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−11
F201.4298E−051.0869E−011.8916E−044.5043E−116.0104E−085.8282E−032.4994E−036.0971E−032.8378E−018.4180E−013.0199E−11
F213.0199E−115.5923E−011.0702E−091.8500E−081.2212E−023.0199E−111.4067E−043.0199E−113.8307E−055.5727E−103.0199E−11
F222.0023E−067.1988E−055.3221E−033.0199E−113.0199E−115.8587E−061.1023E−083.8249E−091.1077E−062.4913E−063.0199E−11
F233.0199E−114.5043E−113.0199E−112.3243E−023.0199E−113.0199E−111.4643E−103.0199E−111.0702E−093.0199E−113.0199E−11
F243.0199E−112.1959E−073.0199E−118.1527E−112.2780E−053.0199E−118.7710E−023.0199E−115.3221E−033.0199E−113.0199E−11
F258.1465E−053.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0103E−073.0199E−11
F263.0199E−114.5726E−093.0199E−119.5207E−045.4617E−093.0199E−111.3732E−013.0199E−114.1178E−063.0199E−113.8202E−10
F274.9752E−118.8411E−073.0199E−113.0199E−113.0199E−113.0199E−118.3520E−083.0199E−112.2658E−033.0199E−113.0199E−11
F283.5547E−013.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.3520E−083.0199E−11
F297.6950E−081.5178E−031.6947E−091.7290E−065.3685E−024.5043E−114.6756E−023.0199E−114.6371E−031.8500E−081.0937E−10
F309.3519E−015.5727E−103.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−113.0199E−115.5727E−103.0199E−11
Table 8. Friedman mean rank test result.
Table 8. Friedman mean rank test result.
SuitesCEC2017
Dimension3050100
Algorithms M . R T . R M . R T . R M . R T . R
RTH7.87107.1075.675
SAO5.4034.5024.572
GRO7.2377.80118.8011
SO7.8397.7097.308
ESC6.1056.6367.6010
INFO7.4087.77107.307
SBOA5.1725.0334.573
GKSO8.23117.6387.539
IGWO6.3366.5056.476
HHWOA6.0345.9745.504
ED8.83129.47129.5012
MEED1.5711.9013.201
Table 9. The ranges of unknown parameters.
Table 9. The ranges of unknown parameters.
ParametersSingle-Diode PV ModelsDouble-Diode Models
L b U b L b U b
I p h A 0102
I d μ A 01050
R s Ω 00.502
R s h Ω 010002000
n 12150
I d 1 μ A 01050
I d 2 μ A 01050
n 1 12150
n 1 12150
Table 10. Comparison among different algorithms on SDM.
Table 10. Comparison among different algorithms on SDM.
Algorithm I p h ( A ) I d ( μ A ) R s ( Ω ) R s h ( Ω ) n R S M E s i g
RTH7.6078E−013.2302E−073.6377E−025.3719E+011.4812E+009.8615E−04/
SAO7.6076E−013.3180E−073.6270E−025.4453E+011.4839E+009.8735E−04+
GRO7.6076E−013.3812E−073.6194E−025.4964E+011.4858E+009.8987E−04+
SO7.6084E−011.0000E−063.1385E−021.0000E+021.6045E+002.4000E−03+
ESC7.6081E−015.2676E−073.4357E−029.1803E+011.5318E+001.7000E−03+
INFO7.6078E−013.2302E−073.6377E−025.3719E+011.4812E+009.8654E−04+
SBOA7.6075E−013.2100E−073.6407E−025.3949E+011.4805E+009.8633E−04+
GKSO7.6078E−013.2302E−073.6377E−025.3719E+011.4812E+009.8678E−04+
IGWO7.6102E−013.0477E−073.6644E−024.9105E+011.4753E+001.1000E−03+
HHWOA7.6078E−013.2299E−073.6377E−025.3712E+011.4812E+009.8674E−04+
ED7.6088E−013.2042E−073.6415E−025.3109E+011.4804E+009.8870E−04+
MEED7.6073E−013.2236E−073.6345E−025.3716E+011.4803E+009.8602E−04+
Table 11. IAE of MEED on SDM.
Table 11. IAE of MEED on SDM.
MEED V V I A I s i m A I A E I A P s i m W I A E p A
1−2.0570E−017.6409E−017.6400E−018.7704E−05−1.1480E−041.8041E−05
2−1.2910E−017.6266E−017.6200E−016.6309E−04−8.7019E−048.5604E−05
3−5.8800E−027.6136E−017.6050E−018.5531E−04−1.1247E−035.0292E−05
45.7000E−037.6015E−017.6050E−013.4601E−044.5498E−041.9723E−06
56.4600E−027.5906E−017.6000E−019.4479E−041.2431E−036.1034E−05
61.1850E−017.5804E−017.5900E−019.5765E−041.2617E−031.1348E−04
71.6780E−017.5709E−017.5700E−019.1654E−05−1.2108E−041.5380E−05
82.1320E−017.5614E−017.5700E−018.5864E−041.1343E−031.8306E−04
92.5450E−017.5509E−017.5550E−014.1313E−045.4683E−041.0514E−04
102.9240E−017.5366E−017.5400E−013.3612E−044.4579E−049.8282E−05
113.2690E−017.5139E−017.5050E−018.9097E−04−1.1872E−032.9126E−04
123.5850E−017.4735E−017.4650E−018.5385E−04−1.1438E−033.0611E−04
133.8730E−017.4012E−017.3850E−011.6172E−03−2.1899E−036.2635E−04
144.1370E−017.2738E−017.2800E−016.1777E−048.4859E−042.5557E−04
154.3730E−017.0697E−017.0650E−014.7265E−04−6.6900E−042.0669E−04
164.5900E−016.7528E−016.7550E−012.1985E−043.2546E−041.0091E−04
174.7840E−016.3076E−016.3200E−011.2417E−031.9648E−035.9404E−04
184.9600E−015.7193E−015.7300E−011.0716E−031.8702E−035.3153E−04
195.1190E−014.9961E−014.9900E−016.0702E−04−1.2165E−033.1073E−04
205.2650E−014.1365E−014.1300E−016.4879E−04−1.5709E−033.4159E−04
215.3980E−013.1751E−013.1650E−011.0101E−03−3.1915E−035.4526E−04
225.5210E−012.1215E−012.1200E−011.5494E−04−7.3085E−048.5542E−05
235.6330E−011.0225E−011.0350E−011.2487E−031.2065E−027.0339E−04
245.7360E−01−8.7175E−03−1.0000E−021.2825E−031.2825E−017.3562E−04
255.8330E−01−1.2551E−01−1.2300E−012.5074E−03−2.0385E−021.4626E−03
265.9000E−01−2.0847E−01−2.1000E−011.5277E−037.2746E−039.0133E−04
Table 12. Comparison among different algorithms on DDM.
Table 12. Comparison among different algorithms on DDM.
Algorithm I p h A R s Ω R s h Ω I d 1 μ A n 1 I d 2 μ A n 2 R S M E s i g
RTH7.6078E−013.6740E−025.5486E+012.2597E−071.4510E+007.4937E−072.0000E+009.8230E−04/
SAO7.6078E−013.6856E−025.5615E+015.3628E−071.7551E+001.4557E−071.4217E+009.8651E−04+
GRO7.6076E−013.6046E−025.6964E+011.7258E−071.8766E+003.1710E−071.4818E+009.8665E−04+
SO7.6057E−013.4549E−026.2743E+014.4473E−071.5164E+004.3184E−081.6974E+009.8638E−04+
ESC7.6038E−013.5857E−029.6426E+011.1478E−071.6041E+003.2207E−071.4928E+009.8470E−04+
INFO7.6078E−013.6747E−025.5514E+012.2496E−071.4506E+007.5672E−072.0000E+009.8747E−04+
SBOA7.6096E−013.7396E−025.2086E+016.7906E−071.7579E+009.8279E−081.3906E+009.8320E−04+
GKSO7.6078E−013.6692E−025.5312E+012.3590E−071.4546E+006.6801E−072.0000E+009.9661E−04+
IGWO7.5964E−013.5817E−029.0315E+015.1663E−071.9376E+003.0406E−071.4798E+009.9032E−04+
HHWOA7.6071E−013.6344E−025.5017E+013.1739E−071.4800E+006.0228E−081.9452E+009.8509E−04+
ED7.6075E−013.6556E−025.7131E+014.3946E−071.8720E+002.3677E−071.4568E+009.8611E−04+
MEED7.6078E−013.6740E−025.5485E+017.4935E−072.0000E+002.2597E−071.4510E+009.8228E−04+
Table 13. IAE of MEED on DDM.
Table 13. IAE of MEED on DDM.
Algorithm V V I A I s i m A I A E I A P s i m W I A E p A
1−2.0570E−017.6400E−017.6398E−011.6594E−05−1.5715E−013.4135E−06
2−1.2910E−017.6200E−017.6260E−016.0409E−04−9.8452E−027.7988E−05
3−5.8800E−027.6050E−017.6134E−018.3770E−04−4.4767E−024.9257E−05
45.7000E−037.6050E−017.6017E−013.2621E−044.3330E−031.8594E−06
56.4600E−027.6000E−017.5911E−018.9232E−044.9038E−025.7644E−05
61.1850E−017.5900E−017.5812E−018.7858E−048.9837E−021.0411E−04
71.6780E−017.5700E−017.5719E−011.8862E−041.2706E−013.1650E−05
82.1320E−017.5700E−017.5624E−017.5639E−041.6123E−011.6126E−04
92.5450E−017.5550E−017.5518E−013.2269E−041.9219E−018.2125E−05
102.9240E−017.5400E−017.5372E−012.7764E−042.2039E−018.1182E−05
113.2690E−017.5050E−017.5140E−018.9914E−042.4563E−012.9393E−04
123.5850E−017.4650E−017.4730E−018.0145E−042.6791E−012.8732E−04
133.8730E−017.3850E−017.4001E−011.5107E−032.8661E−015.8508E−04
144.1370E−017.2800E−017.2725E−017.5305E−043.0086E−013.1154E−04
154.3730E−017.0650E−017.0685E−013.5029E−043.0911E−011.5318E−04
164.5900E−016.7550E−016.7521E−012.8946E−043.0992E−011.3286E−04
174.7840E−016.3200E−016.3076E−011.2392E−033.0176E−015.9286E−04
184.9600E−015.7300E−015.7199E−011.0053E−032.8371E−014.9861E−04
195.1190E−014.9900E−014.9971E−017.0613E−042.5580E−013.6147E−04
205.2650E−014.1300E−014.1373E−017.3367E−042.1783E−013.8628E−04
215.3980E−013.1650E−013.1755E−011.0462E−031.7141E−015.6474E−04
225.5210E−012.1200E−012.1212E−011.2300E−041.1711E−016.7907E−05
235.6330E−011.0350E−011.0216E−011.3367E−035.7549E−027.5298E−04
245.7360E−01−1.0000E−02−8.7917E−031.2083E−03−5.0429E−036.9305E−04
255.8330E−01−1.2300E−01−1.2554E−012.5434E−03−7.3229E−021.4836E−03
265.9000E−01−2.1000E−01−2.0837E−011.6284E−03−1.2294E−019.6076E−04
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, Z.; Liao, Y.; Zhou, H. Improved Enterprise Development Optimization with Historical Trend Updating for High-Precision Photovoltaic Model Parameter Estimation. Mathematics 2026, 14, 121. https://doi.org/10.3390/math14010121

AMA Style

Li Z, Liao Y, Zhou H. Improved Enterprise Development Optimization with Historical Trend Updating for High-Precision Photovoltaic Model Parameter Estimation. Mathematics. 2026; 14(1):121. https://doi.org/10.3390/math14010121

Chicago/Turabian Style

Li, Zhiping, Yi Liao, and Haoxiang Zhou. 2026. "Improved Enterprise Development Optimization with Historical Trend Updating for High-Precision Photovoltaic Model Parameter Estimation" Mathematics 14, no. 1: 121. https://doi.org/10.3390/math14010121

APA Style

Li, Z., Liao, Y., & Zhou, H. (2026). Improved Enterprise Development Optimization with Historical Trend Updating for High-Precision Photovoltaic Model Parameter Estimation. Mathematics, 14(1), 121. https://doi.org/10.3390/math14010121

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