CEC2013 Test Research Articles

Phase-Angle-Encoded Snake Optimization Algorithm for K-Means Clustering

The rapid development of metaheuristic algorithms proves their advantages in optimization. Data clustering, as an optimization problem, faces challenges for high accuracy. The K-means algorithm is traditaaional but has low clustering accuracy. In this paper, the phase-angle-encoded snake optimization algorithm (θ-SO), based on mapping strategy, is proposed for data clustering. The disadvantages of traditional snake optimization include slow convergence speed and poor optimization accuracy. The improved θ-SO uses phase angles for boundary setting and enables efficient adjustments in the phase angle vector to accelerate convergence, while employing a Gaussian distribution strategy to enhance optimization accuracy. The optimization performance of θ-SO is evaluated by CEC2013 datasets and compared with other metaheuristic algorithms. Additionally, its clustering optimization capabilities are tested on Iris, Wine, Seeds, and CMC datasets, using the classification error rate and sum of intra-cluster distances. Experimental results show θ-SO surpasses other algorithms on over 2/3 of CEC2013 test functions, hitting a 90% high-performance mark across all clustering optimization tasks. The method proposed in this paper effectively addresses the issues of data clustering difficulty and low clustering accuracy.

Application of spiral enhanced whale optimization algorithm in solving optimization problems

The Whale Optimization Algorithm (WOA) is regarded as a classic metaheuristic algorithm, yet it suffers from limited population diversity, imbalance between exploitation and exploration, and low solution accuracy. In this paper, we propose the Spiral-Enhanced Whale Optimization Algorithm (SEWOA), which incorporates a nonlinear time-varying self-adaptive perturbation strategy and an Archimedean spiral structure into the original WOA. The Archimedean spiral structure enhances the diversity of the solution space, aiding the algorithm in escaping local optima. The nonlinear time-varying self-adaptive optimization dynamic perturbation strategy improves the algorithm’s local search capability and enhances solution accuracy. The effectiveness of the proposed algorithm is validated from multiple perspectives using CEC2014 test functions, CEC2017 test functions, and 23 benchmark test functions. The experimental results demonstrate that the enhanced Whale Optimization Algorithm significantly improves population diversity, balances global and local search, and enhances solution accuracy. Additionally, SEWOA exhibits excellent performance in solving three engineering design problems, showcasing its value and wide range of potential applications.

Improved Bald Eagle Search Optimization Algorithm for the Inverse Kinematics of Robotic Manipulators.

The inverse kinematics of robotic manipulators involves determining an appropriate joint configuration to achieve a specified end-effector position. This problem is challenging because the inverse kinematics of manipulators are highly nonlinear and complexly coupled. To address this challenge, the bald eagle search optimization algorithm is introduced. This algorithm combines the advantages of evolutionary and swarm techniques, making it more effective at solving nonlinear problems and improving search efficiency. Due to the tendency of the algorithm to fall into local optima, the Lévy flight strategy is introduced to enhance its performance. This strategy adopts a heavy-tailed distribution to generate long-distance jumps, thereby preventing the algorithm from becoming trapped in local optima and enhancing its global search efficiency. The experiments first evaluated the accuracy and robustness of the proposed algorithm based on the inverse kinematics problem of manipulators, achieving a solution accuracy of up to 10-18 m. Subsequently, the proposed algorithm was compared with other algorithms using the CEC2017 test functions. The results showed that the improved algorithm significantly outperformed the original in accuracy, convergence speed, and stability. Specifically, it achieved over 70% improvement in both standard deviation and mean for several test functions, demonstrating the effectiveness of the Lévy flight strategy in enhancing global search capabilities. Furthermore, the practicality of the proposed algorithm was verified through two real engineering optimization problems.

Optimization of Synchronous Control Parameters Based on Improved Sinusoidal Gray Wolf Algorithm

High precision control is often accompanied by many control parameters, which are interrelated and difficult to adjust directly. It is difficult to convert the system control effect directly into mathematical expression, so it is difficult to optimize it by intelligent algorithm. To solve this problem, we propose an improved sinusoidal gray wolf optimization algorithm (ISGWO). In this algorithm, a particle crossing processing mechanism based on the symmetry idea is introduced to maximize the retention of the position information of the optimal individual and improve the search accuracy of the algorithm. In addition, a differential cross-perturbation strategy is adopted to help the algorithm jump out of the local optimal solution in time, which enhances the development capability of ISGWO. Meanwhile, the position update formula with improved sinusoidal can better balance the development and exploration of ISGWO. The ISGWO algorithm is compared with three improved Gray Wolf algorithms on the CEC2017 test set as well as the synchronization controller. The experimental results show that the ISGWO algorithm has better selectivity, speed and robustness.

An efficient weighted slime mould algorithm for engineering optimization

In engineering applications, optimal parameter design is crucial. While Slime Mould Algorithm (SMA) excels in parameter discovery under constrained conditions, it faces challenges in achieving global convergence and avoiding local opsecttimal traps in complex tasks. This paper introduces an enhanced variant of SMA, termed CCHSMA, which integrates a Chaotic Local Search (CLS) mechanism to improve initial population diversity and combines Covariance Matrix Adaptation (CMA) and Harris Hawks Optimization (HHO) strategies to enhance global search efficiency. CCHSMA aims to improve search quality and reduce the likelihood of getting trapped in local optima. We evaluated CCHSMA's effectiveness by benchmarking it against the standard SMA and its variants using 30 CEC2017 test functions, and compared its performance with seven notable meta-heuristic algorithms and ten advanced swarm intelligence variants. The experimental results demonstrate that CCHSMA outperforms the other algorithms tested on the benchmark functions. To further validate its practical utility, CCHSMA's performance was also benchmarked against leading algorithms in real-world engineering applications. This paper uses detailed statistical methods, including the Wilcoxon signed-rank test and the Friedman test, to validate the comparative results. Our findings show that CCHSMA outperforms other algorithms in solving complex engineering optimization problems such as tension/compression spring design, pressure vessel design, and three-bar truss design, proving to be a robust tool for complex engineering optimization. Its enhanced initial population diversity and improved global search efficiency are essential for effectively addressing diverse engineering challenges.

A Novel Reinforcement Learning-Based Particle Swarm Optimization Algorithm for Better Symmetry between Convergence Speed and Diversity

This paper introduces a novel Particle Swarm Optimization (RLPSO) algorithm based on reinforcement learning, embodying a fundamental symmetry between global and local search processes. This symmetry aims at addressing the trade-off issue between convergence speed and diversity in traditional algorithms. Traditional Particle Swarm Optimization (PSO) algorithms often struggle to maintain good convergence speed and particle diversity when solving multi-modal function problems. To tackle this challenge, we propose a new algorithm that incorporates the principles of reinforcement learning, enabling particles to intelligently learn and adjust their behavior for better convergence speed and richer exploration of the search space. This algorithm guides particle learning behavior through online updating of a Q-table, allowing particles to selectively learn effective information from other particles and dynamically adjust their strategies during the learning process, thus finding a better balance between convergence speed and diversity. The results demonstrate the superior performance of this algorithm on 16 benchmark functions of the CEC2005 test suite compared to three other algorithms. The RLPSO algorithm can find all global optimum solutions within a certain error range on all 16 benchmark functions, exhibiting outstanding performance and better robustness. Additionally, the algorithm’s performance was tested on 13 benchmark functions from CEC2017, where it outperformed six other algorithms by achieving the minimum value on 11 benchmark functions. Overall, the RLPSO algorithm shows significant improvements and advantages over traditional PSO algorithms in aspects such as local search strategy, parameter adaptive adjustment, convergence speed, and multi-modal problem handling, resulting in better performance and robustness in solving optimization problems. This study provides new insights and methods for the further development of Particle Swarm Optimization algorithms.

A Reinforced Whale Optimization Algorithm for Solving Mathematical Optimization Problems.

The whale optimization algorithm has several advantages, such as simple operation, few control parameters, and a strong ability to jump out of the local optimum, and has been used to solve various practical optimization problems. In order to improve its convergence speed and solution quality, a reinforced whale optimization algorithm (RWOA) was designed. Firstly, an opposition-based learning strategy is used to generate other optima based on the best optimal solution found during the algorithm's iteration, which can increase the diversity of the optimal solution and accelerate the convergence speed. Secondly, a dynamic adaptive coefficient is introduced in the two stages of prey and bubble net, which can balance exploration and exploitation. Finally, a kind of individual information-reinforced mechanism is utilized during the encircling prey stage to improve the solution quality. The performance of the RWOA is validated using 23 benchmark test functions, 29 CEC-2017 test functions, and 12 CEC-2022 test functions. Experiment results demonstrate that the RWOA exhibits better convergence accuracy and algorithm stability than the WOA on 20 benchmark test functions, 21 CEC-2017 test functions, and 8 CEC-2022 test functions, separately. Wilcoxon's rank sum test shows that there are significant statistical differences between the RWOA and other algorithms.

MSBWO: A Multi-Strategies Improved Beluga Whale Optimization Algorithm for Feature Selection.

Feature selection (FS) is a classic and challenging optimization task in most machine learning and data mining projects. Recently, researchers have attempted to develop more effective methods by using metaheuristic methods in FS. To increase population diversity and further improve the effectiveness of the beluga whale optimization (BWO) algorithm, in this paper, we propose a multi-strategies improved BWO (MSBWO), which incorporates improved circle mapping and dynamic opposition-based learning (ICMDOBL) population initialization as well as elite pool (EP), step-adaptive Lévy flight and spiral updating position (SLFSUP), and golden sine algorithm (Gold-SA) strategies. Among them, ICMDOBL contributes to increasing the diversity during the search process and reducing the risk of falling into local optima. The EP technique also enhances the algorithm's ability to escape from local optima. The SLFSUP, which is distinguished from the original BWO, aims to increase the rigor and accuracy of the development of local spaces. Gold-SA is introduced to improve the quality of the solutions. The hybrid performance of MSBWO was evaluated comprehensively on IEEE CEC2005 test functions, including a qualitative analysis and comparisons with other conventional methods as well as state-of-the-art (SOTA) metaheuristic approaches that were introduced in 2024. The results demonstrate that MSBWO is superior to other algorithms in terms of accuracy and maintains a better balance between exploration and exploitation. Moreover, according to the proposed continuous MSBWO, the binary MSBWO variant (BMSBWO) and other binary optimizers obtained by the mapping function were evaluated on ten UCI datasets with a random forest (RF) classifier. Consequently, BMSBWO has proven very competitive in terms of classification precision and feature reduction.

Parameter tuning for active disturbance rejection control of fixed-wing UAV based on improved bald eagle search algorithm

PurposeThis paper aims to develop a method for tuning the parameters of the active disturbance rejection controller (ADRC) for fixed-wing unmanned aerial vehicles (UAVs). The bald eagle search (BES) algorithm has been improved, and a cost function has been designed to enhance the optimization efficiency of ADRC parameters.Design/methodology/approachA six-degree-of-freedom nonlinear model for a fixed-wing UAV has been developed, and its attitude controller has been formulated using the active disturbance rejection control method. The parameters of the disturbance rejection controller have been fine-tuned using the collaborative mutual promotion bald eagle search (CMP-BES) algorithm. The pitch and roll controllers for the UAV have been individually optimized to obtain the most effective controller parameters.FindingsInspired by the salp swarm algorithm (SSA), the interaction among individual eagles has been incorporated into the CMP-BES algorithm, thereby enhancing the algorithm's exploration capability. The efficient and accurate optimization ability of the proposed algorithm has been demonstrated through comparative experiments with genetic algorithm, particle swarm optimization, Harris hawks optimization HHO, BES and modified bald eagle search algorithms. The algorithm's capability to solve complex optimization problems has been further proven by testing on the CEC2017 test function suite. A transitional function for fitness calculation has been introduced to accelerate the ability of the algorithm to find the optimal parameters for the ADRC controller. The tuned ADRC controller has been compared with the classical proportional-integral-derivative (PID) controller, with gust disturbances introduced to the UAV body axis. The results have shown that the tuned ADRC controller has faster response times and stronger disturbance rejection capabilities than the PID controller.Practical implicationsThe proposed CMP-BES algorithm, combined with a fitness function composed of transition functions, can be used to optimize the ADRC controller parameters for fixed-wing UAVs more quickly and effectively. The tuned ADRC controller has exhibited excellent robustness and disturbance rejection capabilities.Originality/valueThe CMP-BES algorithm and transitional function have been proposed for the parameter optimization of the active disturbance rejection controller for fixed-wing UAVs.

A Multi-Strategy Improved Northern Goshawk Optimization Algorithm for Optimizing Engineering Problems.

Northern Goshawk Optimization (NGO) is an efficient optimization algorithm, but it has the drawbacks of easily falling into local optima and slow convergence. Aiming at these drawbacks, an improved NGO algorithm named the Multi-Strategy Improved Northern Goshawk Optimization (MSINGO) algorithm was proposed by adding the cubic mapping strategy, a novel weighted stochastic difference mutation strategy, and weighted sine and cosine optimization strategy to the original NGO. To verify the performance of MSINGO, a set of comparative experiments were performed with five highly cited and six recently proposed metaheuristic algorithms on the CEC2017 test functions. Comparative experimental results show that in the vast majority of cases, MSINGO's exploitation ability, exploration ability, local optimal avoidance ability, and scalability are superior to those of competitive algorithms. Finally, six real world engineering problems demonstrated the merits and potential of MSINGO.

PMSOMA: optical microscope algorithm based on piecewise linear chaotic mapping and sparse adaptive exploration

The optical microscope algorithm (OMA) is a metaheuristic algorithm that draws inspiration from the magnifying functionality of optical microscopes. This study introduces an enhanced variant of OMA, termed PMSOMA, designed to mitigate the original version's limitations, notably its slow convergence rates and vulnerability to local optima. PMSOMA integrates a piecewise linear chaotic map to refine population initialization and augment diversity, alongside a sparse adaptive exploration mechanism to bolster search efficacy. The performance of PMSOMA was rigorously tested using a suite of 50 benchmark functions, the CEC2017 test suite, feature selection datasets, and three classical engineering challenges. The empirical findings confirm that PMSOMA surpasses both the original OMA and competing algorithms by delivering superior solutions, accelerating convergence, and demonstrating enhanced robustness in convergence.

DCWPSO: particle swarm optimization with dynamic inertia weight updating and enhanced learning strategies.

Particle swarm optimization (PSO) stands as a prominent and robust meta-heuristic algorithm within swarm intelligence (SI). It originated in 1995 by simulating the foraging behavior of bird flocks. In recent years, numerous PSO variants have been proposed to address various optimization applications. However, the overall performance of these variants has not been deemed satisfactory. This article introduces a novel PSO variant, presenting three key contributions: First, a novel dynamic oscillation inertia weight is introduced to strike a balance between exploration and exploitation; Second, the utilization of cosine similarity and dynamic neighborhood strategy enhances both the quality of solution and the diversity of particle populations; Third, a unique worst-best example learning strategy is proposed to enhance the quality of the least favorable solution and consequently improving the overall population. The algorithm's validation is conducted using a test suite comprised of benchmarks from the CEC2014 and CEC2022 test suites on real-parameter single-objective optimization. The experimental results demonstrate the competitiveness of our algorithm against recently proposed state-of-the-art PSO variants and well-known algorithms.

An Adaptive Spiral Strategy Dung Beetle Optimization Algorithm: Research and Applications.

The Dung Beetle Optimization (DBO) algorithm, a well-established swarm intelligence technique, has shown considerable promise in solving complex engineering design challenges. However, it is hampered by limitations such as suboptimal population initialization, sluggish search speeds, and restricted global exploration capabilities. To overcome these shortcomings, we propose an enhanced version termed Adaptive Spiral Strategy Dung Beetle Optimization (ADBO). Key enhancements include the application of the Gaussian Chaos strategy for a more effective population initialization, the integration of the Whale Spiral Search Strategy inspired by the Whale Optimization Algorithm, and the introduction of an adaptive weight factor to improve search efficiency and enhance global exploration capabilities. These improvements collectively elevate the performance of the DBO algorithm, significantly enhancing its ability to address intricate real-world problems. We evaluate the ADBO algorithm against a suite of benchmark algorithms using the CEC2017 test functions, demonstrating its superiority. Furthermore, we validate its effectiveness through applications in diverse engineering domains such as robot manipulator design, triangular linkage problems, and unmanned aerial vehicle (UAV) path planning, highlighting its impact on improving UAV safety and energy efficiency.

Elite-guided Resampling and Multi-mutation based Differential Evolution with exponential crossover for numerical optimization

In the existing Differential Evolution (DE) research, there are two main crossover schemes: exponential crossover and binomial crossover. Most researchers believe that binomial crossover is skilled in handling numerical optimization problems while exponential crossover has the advantage in handling optimization problems with certain correlation between adjacent variables. However, we discover that DE variants with exponential crossover can achieve performance comparable to advanced ones utilizing binomial crossover in optimization applications, provided that an appropriate crossover rate CR and associated parameter control are established. In this paper, an Elite-guided Resampling and Multi-mutation based DE with exponential crossover (ERM-DE) is raised to fill the blank in this field, and its main highlights are as follows: First, a novel structure with two stages is raised in our ERM-DE algorithm. The first stage is elite-guided global opposition learning based resampling, and the other is novel exponential crossover DE evolution stage. Second, a Novel Parameter Control (NPC) technique involving scale factor F and crossover rate CR is raised. Different from applying the fitness-based parameter control, the adaptation schemes of the parameters F and CR in our ERM-DE algorithm are fitness-independent. In addition, this NPC technique will also be selectively applied to the trial vector generation strategy DE/target-to-pbest/1/exp with or without optional archive. Third, a novel population Diversity Enhancement Mechanism (DEM) is proposed, which can enhance population diversity by recalculating individuals in a stagnant state. Finally, a time stamp mechanism is posed to deal with outdated inferior and historical solutions in the external archive. A Large test suite with 88 benchmark functions from CEC2013, CEC2014, and CEC2017 test suites is used for algorithm validation and the experimental results indicate that our ERM-DE demonstrates competitiveness with several state-of-the-art DE variants.

Agricultural UAV Path Planning Based on a Differentiated Creative Search Algorithm with Multi-Strategy Improvement

A differentiated creative search algorithm with multi-strategy improvement (MSDCS) is proposed for the path planning problem for agricultural UAVs under different complicated situations. First, the good point set and oppositional learning strategies are used to effectively improve the quality of population diversity; the adaptive fitness–distance balance reset strategy is proposed to motivate the low performers to move closer to the region near the optimal solution and find the potential optimal solution; and the vertical and horizontal crossover strategy with random dimensions is proposed to improve the computational accuracy of the algorithm and the ability to jump out of the local optimum. Second, the MSDCS is compared to different algorithms using the IEEE_CEC2017 test set, which consists of 29 test functions. The results demonstrate that the MSDCS achieves the optimal value in 23 test functions, surpassing the comparison algorithms in terms of convergence accuracy, speed, and stability by at least one order of magnitude difference, and it is ranked No. 1 in terms of comprehensive performance. Finally, the enhanced algorithm was employed to address the issue of path planning for agricultural UAVs. The experimental results demonstrate that the MSDCS outperforms comparison algorithms in path planning across various contexts. Consequently, the MSDCS can generate optimal pathways that are both rational and safe for agricultural UAV operations.

Quantum Dynamical Interpretation of the Mean Strategy.

The method of quantum dynamics is employed to investigate the mean strategy in the swarm intelligence algorithm. The physical significance of the population mean point is explained as the location where the optimal solution with the highest likelihood can be found once a quantum system has reached a ground state. Through the use of the double well function and the CEC2013 test suite, controlled experiments are conducted to perform a comprehensive performance analysis of the mean strategy. The empirical results indicate that implementing the mean strategy not only enhances solution diversity but also yields accurate, efficient, stable, and effective outcomes for finding the optimal solution.

An improved differential evolution with adaptive population allocation and mutation selection

In order to improve the performance of differential evolution (DE) for different optimization problems, an improved DE with adaptive population allocation and mutation selection (iDE-APAMS) is proposed. First, different mutation strategies are selected to constitute the exploration strategy pool and the exploitation strategy pool. The exploration strategy pool is mainly used for global search to increase the population diversity; the exploitation strategy pool is primarily used for local search to accelerate the convergence and improve the solution accuracy. Second, different mutation strategies obtain population resources dynamically through cooperation and competition. Mutation strategies in the same strategy pool first compete for population resources with mutation strategies in the other strategy pool through cooperation, and in this way the population is allocated between the two strategy pools. Then within each strategy pool, different mutation strategies compete with each other to obtain corresponding population resources. Third, mutation scale factor and crossover rate are adaptively adjusted based on population diversity and fitness improvement. Finally, the Levy random walk is applied to individuals with better fitness at the later stage of the iteration to avoid falling into local optima and further improve the accuracy of the solution. The iDE-APAMS is compared with 4 classical DE variants and 11 state-of-the-art algorithms on the CEC2013, CEC2014, and CEC2017 benchmark test suites respectively, and it is also tested on 22 real-world optimization problems in CEC2011. The results show that iDE-APAMS can improve the convergence of the algorithm and the stability of the solution, and it is statistically significantly better than the comparison algorithms.

HAPI-DE: Differential evolution with hierarchical archive based mutation strategy and promising information

Differential Evolution (DE), as a population-based meta-heuristic global optimization technique, has shown excellent performance in handling optimization problems in continuous spaces. Despite its effectiveness, the DE algorithm suffers from shortcomings such as complexity of parameter selection and limitations of the mutation strategy. Therefore, this paper presents a new strategy for generating trial vectors based on a hierarchical archive, which integrates promising information during evolution with current populations to obtain a good perception of the objective landscape. Moreover, to mitigate mis-scaling by scale factor, an adaptive parameter generation mechanism with hierarchical selection (APSH) is proposed. Furthermore, a novel population diversity metric technique and a restart mechanism based on wavelet functions is introduced in this paper. Comparative experiments were conducted to evaluate the performance of the proposed algorithm using 100 benchmark functions from the CEC2013, CEC2014, CEC2017, and CEC2022 test suites. The results demonstrate that the HAPI-DE algorithm outperforms or is on par with 6 recent powerful DE variants. Additionally, HAPI-DE was utilized in parameter extraction for the photovoltaic model STP6-120/36. The findings suggest that our algorithm, HAPI-DE, demonstrates competitiveness when compared to the 6 other DE variants.

Optimizing projectile aerodynamic parameter identification of kernel extreme learning machine based on improved Dung Beetle Optimizer algorithm

Accurately obtaining the aerodynamic parameters of a projectile is crucial for improving aircraft performance, optimizing design and control, and enhancing weapon strike accuracy. In this study, the Dung Beetle Optimization (DBO) algorithm was utilized to optimize the kernel parameters and regularization coefficients of the Kernel Extreme Learning Machine (KELM). To fully exploit the performance of the DBO algorithm and enhance identification accuracy, four improvement measures were proposed for the DBO algorithm. The enhanced DBO algorithm, known as the Improved Dung Beetle Optimization (IDBO) algorithm, was developed and validated using the CEC2017 test function. The proposed IDBO-KELM algorithm was applied to the aerodynamic parameter identification of projectiles. Comparative analysis with results from ELM, IDBO-ELM, and other models revealed that single ELM struggles to accurately identify aerodynamic parameters. While the identification results of IDBO-ELM were 3–5 orders of magnitude higher than those of ELM, a certain gap still existed between the identification results and the true values in the highly nonlinear transonic region. Notably, the IDBO-KELM model yielded the best identification results, with an overall improvement of 1–2 orders of magnitude compared to IDBO-ELM, effectively reducing errors in identification within the transonic region. Experimental findings demonstrate that the proposed algorithm combines the advantages of high accuracy and stability.

Photovoltaic model parameters identification using diversity improvement-oriented differential evolution

Fast and accurate parameter identification of the photovoltaic (PV) model is crucial for calculating, controlling, and managing PV generation systems. Numerous meta-heuristic algorithms have been applied to identify unknown parameters due to the multimodal and nonlinear characteristics of the parameter identification problems. Although many of them can obtain satisfactory results, problems such as premature convergence and population stagnation still exist, influencing the optimization performance. A novel variant of Differential Evolution, namely, Diversity Improvement-Oriented Differential Evolution (DIODE), is proposed to mitigate these deficiencies and obtain reliable parameters for PV models. In DIODE, an adaptive perturbation strategy is employed to perturb current individuals to mitigate premature convergence by enhancing population diversity. Secondly, a diversity improvement mechanism is proposed, where information on the covariance matrix and fitness improvement of individuals is used as a diversity indicator to detect stagnant individuals, which are then updated by the intervention strategy. Lastly, a novel parameter adaptation strategy is employed to maintain a sound balance between exploration and exploitation. The proposed DIODE algorithm is applied to parameter identification problems of six PV models, including single, double, and triple diode and three PV module models. In addition, a large test bed containing 72 benchmark functions from CEC2014, CEC2017, and CEC2022 test suites is employed to verify DIODE’s overall performance in terms of optimization accuracy. Experiment results demonstrate that DIODE can secure accurate parameters of PV models and achieve highly competitive performance on benchmark functions.