Performance Of Optimization Algorithm Research Articles

Application of the Gray Wolf Optimization Algorithm and Neural Networks for Solving Discrete Problems

Relevance. In recent decades, metaheuristic optimization methods have become popular for solving complex problems that require searching for global extrema. Algorithms such as genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), as well as more modern approaches such as cat pack optimization (CSO) and gray wolf pack optimization (GWO) demonstrate high efficiency, but their application is often limited by the conditions of continuity and differentiability of the objective functions. This is a challenge when solving problems with discrete data, where such requirements are not met. In this context, the search for methods that allow adapting metaheuristic algorithms to work with discrete functions is of particular relevance.Aim. The study is aimed at testing the hypothesis about the possibility of using a neural network trained on a limited set of discrete data as an approximation of a function sufficient for the correct execution of the GWO algorithm when searching for a global minimum. The implementation of this hypothesis can significantly expand the scope of GWO, making it available for a wider range of problems where functions are defined on discrete sets.Methods. The study is based on the analysis of existing approaches and experimental verification of the hypothesis on two test functions: a linear function and a Booth function, which are widely used as standards for evaluating the performance of optimization algorithms. Numerical experiments were conducted using neural networks as an approximating model to obtain the results. Solution. During the experiments, an analysis of the applicability of neural networks for approximating discrete functions was carried out, which showed the success of this approach. It was found that neural networks can approximate discrete functions with high accuracy, creating conditions for a successful search for a global minimum using the GWO algorithm.Novelty. For the first time, a hypothesis was proposed and tested on the use of neural networks for approximating objective functions in metaheuristic optimization problems on discrete data. This direction has not previously received due coverage in the scientific literature, which adds significance to the obtained results and confirms the effectiveness of the proposed approach.Practical significance. The results of the study open up new prospects for the application of algorithms such as GWO in optimization problems based on discrete data, expanding the capabilities of metaheuristic methods and facilitating their implementation in a wider class of applied problems, including problems where the use of other methods is limited.

An optimization method for deformable mirror configuration in multi-conjugate adaptive optics systems

Multi-conjugate adaptive optics (MCAO) is a crucial technology for achieving high-resolution imaging over a wide field of view with modern ground-based optical telescopes. The configuration of deformable mirrors (DMs) is a key component in the analysis and optimization of MCAO performance. Currently, the search for the optimal DM configuration often relies on iterative and time-consuming Monte Carlo simulations. This issue arises from the lack of an appropriate optimization method for DM configurations. The primary objective of this paper is to establish an optimization method for DM configurations in MCAO systems. We established a quantitative criterion for evaluating DM configurations by analyzing their correction capabilities for turbulence aberrations at different altitudes. Then, we optimized the DM configurations based on this criterion. This method provides a new theoretical foundation and practical tool for the design and performance optimization of MCAO systems. Based on the pupil phase structure function, we established a DM configuration evaluation criterion, namely the non-conjugate correction index (NCCI). Using NCCI as the optimal criterion, combined with the particle swarm optimization algorithm, we searched for the optimal solution across different DM configuration spaces. We conducted simulations based on the turbulence profiles of typical telescope sites. We validated our proposed theoretical model against Monte Carlo simulation models and find that the NCCI error ranges from 0.05 to 0.1. For optimizing DM conjugate heights, the results of our optimization algorithm differ by less than 1 km from those obtained via Monte Carlo simulations. Regarding the performance of the DM optimization algorithm, the average convergence accuracy error is less than 0.1 km, and the average convergence speed is approximately ten iterations. Additionally, our optimization method runs in just a few minutes; Monte Carlo simulations, in comparison, require several dozen hours.

Employing machine learning techniques for prediction of micronutrient supplementation status during pregnancy in East African Countries

Micronutrient deficiencies, known as “hidden hunger” or “hidden malnutrition,” pose a significant health risk to pregnant women, particularly in low-income countries like the East Africa region. This study employed eight advanced machine learning algorithms to predict the status of micronutrient supplementation among pregnant women in 12 East African countries, using recent demographic health survey (DHS) data. The analysis involved 138,426 study samples, and algorithm performance was evaluated using accuracy, area under the ROC curve (AUC), specificity, precision, recall, and F1-score. Among the algorithms tested, the random forest classifier emerged as the top performer in predicting micronutrient supplementation status, exhibiting excellent evaluation scores (AUC = 0.892 and accuracy = 94.0%). By analyzing mean SHAP values and performing association rule mining, we gained valuable insights into the importance of different variables and their combined impact, revealing hidden patterns within the data. Key predictors of micronutrient supplementation were the mother’s education level, employment status, number of antenatal care (ANC) visits, access to media, number of children, and religion. By harnessing the power of machine learning algorithms, policymakers and healthcare providers can develop targeted strategies to improve the uptake of micronutrient supplementation. Key intervention components involve enhancing education, strengthening ANC services, and implementing comprehensive media campaigns that emphasize the importance of micronutrient supplementation. It is also crucial to consider cultural and religious sensitivities when designing interventions to ensure their effectiveness and acceptance within the specific population. Furthermore, researchers are encouraged to explore and experiment with various techniques to optimize algorithm performance, leading to the identification of the most effective predictors and enhanced accuracy in predicting micronutrient supplementation status.

Adaptive PSO-SO algorithm with Sobol sequence for aerodynamic physical parameter identification of projectiles

In the domain of aerodynamic physical parameter identification, conventional optimization algorithms are often limited by falling into local optima. To overcome this limitation, a novel adaptive PSO-SO algorithm based on Sobol sequences (SAPSO-SO) algorithm is proposed in this study. The algorithm integrates particle swarm optimization algorithms and snake optimization algorithms, utilizing Sobol sequences for initialization, which enhances the global search and local development ability of the algorithm by adaptively adjusting the inertia weights and learning factors. In addition, this study introduced a local optimal discriminant mechanism and a local search function to further enhance the optimization performance of the algorithms. In this study, the small interval constant method was used to subdivide the trajectory, relying on the three-degree-of-freedom ballistic model to identify the starting ballistic parameters and aerodynamic physical parameters of each small interval. The performances of the snake optimization algorithm, particle swarm optimization algorithm, C-K method, and SAPSO-SO algorithm in the identification of ballistic physical parameters were compared using the full ballistic simulation data of a high-speed rotating projectile as measurement data. The results show that the SAPSO-SO algorithm demonstrates excellent accuracy and effectiveness, especially in noisy simulation data, where its recognition accuracy is improved by 7.79% over the C-K method, highlighting its superior anti-noise performance and global optimization capability. It is comprehensively analyzed that the SAPSO-SO algorithm has strong global optimization potential in theory and shows a high degree of accuracy and stability in practical applications, independent of the selection of initial parameters.

Short-Term Electrical Load Forecasting Based on IDBO-PTCN-GRU Model

Accurate electrical load forecasting is crucial for the stable operation of power systems. However, existing forecasting models face limitations when handling multidimensional features and feature interactions. Additionally, traditional metaheuristic algorithms tend to become trapped in local optima during the optimization process, negatively impacting model performance and prediction accuracy. To address these challenges, this paper proposes a short-term electrical load forecasting method based on a parallel Temporal Convolutional Network–Gated Recurrent Unit (PTCN-GRU) model, optimized by an improved Dung Beetle Optimization algorithm (IDBO). This method employs a parallel TCN structure, using TCNs with different kernel sizes to extract and integrate multi-scale temporal features, thereby overcoming the limitations of traditional TCNs in processing multidimensional input data. Furthermore, this paper enhances the optimization performance and global search capability of the traditional Dung Beetle Optimization algorithm through several key improvements. Firstly, Latin hypercube sampling is introduced to increase the diversity of the initial population. Next, the Golden Sine Algorithm is integrated to refine the search behavior. Finally, a Cauchy–Gaussian mutation strategy is incorporated in the later stages of iteration to further strengthen the global search capability. Extensive experimental results demonstrate that the proposed IDBO-PTCN-GRU model significantly outperforms comparison models across all evaluation metrics. Specifically, the mean absolute error (MAE), mean absolute percentage error (MAPE), and root mean square error (RMSE) were reduced by 15.01%, 14.44%, and 14.42%, respectively, while the coefficient of determination (R2) increased by 2.13%. This research provides a novel approach to enhancing the accuracy of electrical load forecasting.

256‐level honey memristor‐based in‐memory neuromorphic system

AbstractPromising synaptic behaviour has been exhibited by memristors based on natural organic materials. Such memristor‐based neuromorphic systems offer notable benefits, including environmental sustainability, low production and disposal costs, non‐volatile storage capability, and bio/Complementary Metal‐Oxide‐Semiconductor (CMOS) compatibility. Here, a 256‐level honey memristor‐based neuromorphic system is experimentally evaluated for image recognition. In detail, first, 256‐level honey memristors are manufactured and tested based on in‐house technology; next, the non‐linear characteristics and inherent variation of honey memristor devices, which lead to imprecise weight updates and limit the inference accuracy, are investigated. Experimental results indicate that the inference accuracy of the 256‐level honey memristor‐based neuromorphic system is greater than 88% without cycle‐to‐cycle variations and 87% with cycle‐to‐cycle variations for different optimization algorithms. The overall performance of optimization algorithms with and without variation is compared in terms of energy and latency, where the momentum algorithm consistently outperforms the rest of the algorithms. This 256‐level honey memristor is a promising alternative enabling sustainable neuromorphic systems, encouraging further research into natural organic materials for neuromorphic computing.

Predicting the compressive strength of self-compacting concrete by developed African vulture optimization algorithm-Elman neural networks

The compressive strength of concrete depends on various factors. Since these parameters can be in a relatively wide range, it is difficult for predicting the behavior of concrete. Therefore, to solve this problem, an advanced modeling is needed. The aim of the literature is to achieve an ideal and flexible solution for predicting the behavior of concrete. Therefore, it is necessary to develop new approaches. Artificial Neural Networks (ANNs) have evolved from a theoretical method to a widely utilized technology by successful applications for a variety of issues. Actually, ANNs are a strong computing tool that provides the right solutions to problems that are difficult to use conventional methods. Inspired by the biological neural system, these networks are now widely used for solving a wide range of complicated problems in civil engineering. This study’’s target is evaluating the performance of developed African vulture optimization algorithm (DAVOA)-Elman neural networks (ENNs) by considering different input parameters in predicting the self-compacting concrete compressive strength. Hence, once 8 parameters and again to get as close as possible to the prediction conditions in the laboratory, 140 parameters entered to the improved version of Elman Neural Networks as input. According to the results, the element network has the lowest mean squares of the test error in predicting the compressive strength of 7 and 28 days in 100 repetitions. Further, in predicting both compressive strengths, the element grid with the Logsig-Purelin interlayer transfer function has the lowest test error, which determines the optimal transfer function. Moreover, the results showed that DAVOA as a reliable tool with time and cost savings have high power in predicting the desired characteristics. Also, in predicting both 7-day and 28-day compressive strength, networks built with 140 parameters have a 74.54 and 70.44% improvement in test error over 8-parameter networks, respectively, which directly affects this effect. Further parameters are considered as input to the network error rate in predicting the desired properties.

Improving derivative-free optimization algorithms through an adaptive sampling procedure

Black-box optimization plays a pivotal role in addressing complex real-world problems where the underlying mathematical model is unknown or expensive to evaluate. In this context, this work presents a method to enhance the performance of derivative-free optimization algorithms by integrating an adaptive sampling process. The proposed methodology aims to overcome the limitations of traditional methods by intelligently guiding the search towards promising regions of the search space. To achieve this, we utilize machine learning models, which effectively substitute first principles models. Furthermore, we employ the error maximization approach to steer the exploration towards areas where the surrogate model deviates significantly from the true model. Moreover, we involve a heuristic method, an adaptive sampling procedure, that repeats calls to a widely-used derivative-free optimization algorithm, SNOBFIT, allowing for the creation of new and improved surrogate models. To evaluate the efficiency of the proposed method, we conduct a comparative analysis across a benchmark set of 776 continuous problems. Our findings indicate that our approach successfully solved 93% of the problems. Notably, for larger problems, our method outperformed the standard SNOBFIT algorithm by achieving a 19% increase in problem-solving rate, and when, we introduced an additional termination criterion to enhance computational efficiency, the proposed method achieved a 31% time reduction compared to SNOBFIT.

Offline constrained reinforcement learning for batch-to-batch optimization of cobalt oxalate synthesis process

The cobalt oxalate synthesis, a batch process, plays a crucial role in the refinement of cobalt metal. The mean particle size of cobalt oxalate is a critical indicator that reflects product quality. However, excessive ammonium oxalate solution flow can heighten waste disposal costs in the production process. To address these issues, we propose a novel offline reinforcement learning (RL) algorithm that guarantees compliance with constraints in the cobalt oxalate synthesis process, utilizing exclusively static datasets. This method employs cost critic networks to assess costs, transforming the constrained optimization problem into an unconstrained one by introducing Lagrangian multipliers. We use exponential moving average (EMA) to optimize the update of proportional integral derivative (PID) control multipliers, reduce overshoot and oscillation in the control process, and thus improve the overall stability of the system. Furthermore, to optimize algorithm performance, a deep residual network (DResNet) is integrated into the policy network. Experimental results indicate that the algorithm’s optimization policy performs significantly better under constraints.

Application of improved grey wolf model in collaborative trajectory optimization of unmanned aerial vehicle swarm

With the development of science and technology and economy, UAV is used more and more widely. However, the existing UAV trajectory planning methods have the limitations of high cost and low intelligence. In view of this, grey Wolf algorithm is being used to achieve collaborative trajectory optimization of UAV groups. However, it is found that the Grey Wolf optimization algorithm (GWO) has the problem of weak cooperation. In this study, based on the traditional GWO pheromone factor is introduced to improve it.. Aiming at the problem of unstable performance of swarm intelligence optimization algorithm under dynamic threat, deep reinforcement learning is used to optimize the model. An unmanned aerial vehicle swarm trajectory planning model was constructed based on the improved grey wolf algorithm. Through experimental analysis, the optimal fitness value of the improved grey wolf algorithm was lower than 0.43 of the grey wolf algorithm. Compared with other algorithms, the fitness value of this algorithm is significantly reduced and the stability is higher. In complex scenarios, the improved grey wolf algorithm had a trajectory length of 70.51 km and a planning time of 5.92 s, which was clearly superior to other algorithms. The path length planned by the research and design model was 58.476 km, which was significantly smaller than the other three models. The planning time was 5.33 s and the number of path extension points was 46. The indicator values of the Unmanned Aerial Vehicle swarm trajectory planning model designed by this research were all smaller than the other three models. By analyzing the results, the model can achieve low-cost trajectory optimization, providing more reasonable technical support for unmanned aerial vehicle mission execution.

Investigation of mechanical properties of high-performance concrete via multi-method of regression tree approach

Concrete's workability and durability are influenced by its mechanical properties, including Tensile and Compressive strength. High-performance concrete exhibits non-linear relationships between its compressive and tensile strength characteristics and the proportions of its constituent materials, such as water, aggregate, cement, and admixtures. The investigation of the relations between the constituents of concrete and its mechanical properties has posed a challenging issue. This paper seeks to develop a range of single, hybrid, and ensemble models to resolve the problem of accurately estimating the mechanical properties of concrete according to its constituent components as input variables. In this regard, various frameworks incorporating a machine learning technique called decision tree and four metaheuristic optimization algorithms were utilized in model development to emulate the values of tensile and compressive strength. The findings indicated that the decision tree-dynamic arithmetic optimization algorithm hybrid model produced results with an correlation of determination of 0.9919 in compressive strength and 0.9933 in tensile strength, which were on average 1–3 % higher than that of the decision tree-dandelion optimizer algorithm, decision tree-arithmetic optimization algorithm, and decision tree-coot optimization algorithm, indicating superior optimization performance of dynamic arithmetic optimization algorithm. Additionally, the powerful prediction capability of the decision tree + dynamic arithmetic optimization algorithm + dandelion optimizer algorithm + coot optimization algorithm + arithmetic optimization algorithm ensemble model was noticeable with R2 of 0.9882 and 0.9936 in compressive and tensile strength estimation reliable to be used for various data produced in the future. In general, the utilization of coupling techniques to generate hybrid and ensemble models can enhance the accuracy of predictions while reducing the time and costs associated with experimental procedures.

Comparing the performance of genetic algorithm and particle swarm optimization algorithm in allocating and scheduling fire stations

Comparing the performance of genetic algorithm and particle swarm optimization algorithm in allocating and scheduling fire stations

Intelligent optimization of inspection route based on multi-population integer coding particle swarm optimization algorithm

Aiming at the problems of premature convergence and slow convergence speed in the optimization process of single population particle swarm optimization algorithm, in order to improve the global convergence performance of particle swarm optimization algorithm, a hierarchical three-population integer coded particle swarm optimization algorithm based on grade evaluation with parallel structure is proposed and used to solve the traveling salesman problem (TSP). The algorithm imitates the form of biological aggregation in nature. In the initialization stage, three independent populations are generated according to different particle fitness, including an elite population composed of small-scale individuals with high fitness and two large-scale civilian populations composed of remaining individuals. The three populations apply the immigration strategy based on grade evaluation to exchange particles after a certain number of evolutionary generations. By applying the grade evaluation strategy, the natural law of the biological cluster is integrated into the particle swarm optimization algorithm, which effectively improves the optimization efficiency of the particle swarm optimization algorithm. The above algorithm is applied to the inspection route optimization of one of the traveling salesman problems. The results show that the improved algorithm is superior to the single population particle swarm optimization algorithm in terms of convergence speed, global optimization ability and stability.

Carbon peaking prediction scenarios based on different neural network models: A case study of Guizhou Province.

Global warming, caused by greenhouse gas emissions, is a major challenge for all human societies. To ensure that ambitious carbon neutrality and sustainable economic development goals are met, regional human activities and their impacts on carbon emissions must be studied. Guizhou Province is a typical karst area in China that predominantly uses fossil fuels. In this study, a backpropagation (BP) neural network and extreme learning machine (ELM) model, which is advantageous due to its nonlinear processing, were used to predict carbon emissions from 2020 to 2040 in Guizhou Province. The carbon emissions were calculated using conversion and inventory compilation methods with energy consumption data and the results showed an "S" growth trend. Twelve influencing factors were selected, however, five with larger correlations were screened out using a grey correlation analysis method. A prediction model for carbon emissions from Guizhou Province was established. The prediction performance of a whale optimization algorithm (WOA)-ELM model was found to be higher than the BP neural network and ELM models. Baseline, high-speed, and low-carbon scenarios were analyzed and the size and time of peak carbon emissions in Liaoning Province from 2020 to 2040 were predicted using the WOA-ELM model.

Fitness Landscape Analysis of Product Unit Neural Networks

A fitness landscape analysis of the loss surfaces produced by product unit neural networks is performed in order to gain a better understanding of the impact of product units on the characteristics of the loss surfaces. The loss surface characteristics of product unit neural networks are then compared to the characteristics of loss surfaces produced by neural networks that make use of summation units. The failure of certain optimization algorithms in training product neural networks is explained through trends observed between loss surface characteristics and optimization algorithm performance. The paper shows that the loss surfaces of product unit neural networks have extremely large gradients with many deep ravines and valleys, which explains why gradient-based optimization algorithms fail at training these neural networks.

A methodology for comparing optimization algorithms for auto-tuning

Adapting applications to optimally utilize available hardware is no mean feat: the plethora of choices for optimization techniques are infeasible to maximize manually. To this end, auto-tuning frameworks are used to automate this task, which in turn use optimization algorithms to efficiently search the vast searchspaces. However, there is a lack of comparability in studies presenting advances in auto-tuning frameworks and the optimization algorithms incorporated. As each publication varies in the way experiments are conducted, metrics used, and results reported, comparing the performance of optimization algorithms among publications is infeasible. The auto-tuning community identified this as a key challenge at the 2022 Lorentz Center workshop on auto-tuning. The examination of the current state of the practice in this paper further underlines this. We propose a community-driven methodology composed of four steps regarding experimental setup, tuning budget, dealing with stochasticity, and quantifying performance. This methodology builds upon similar methodologies in other fields while taking into account the constraints and specific characteristics of the auto-tuning field, resulting in novel techniques. The methodology is demonstrated in a simple case study that compares the performance of several optimization algorithms used to auto-tune CUDA kernels on a set of modern GPUs. We provide a software tool to make the application of the methodology easy for authors, and simplifies reproducibility of results.

Universal Symmetry of Optimal Control at the Microscale

Optimizing the energy efficiency of driving processes provides valuable insights into the underlying physics and is of crucial importance for numerous applications, from biological processes to the design of machines and robots. Knowledge of optimal driving protocols is particularly valuable at the microscale, where energy supply is often limited. Here, we experimentally and theoretically investigate the paradigmatic optimization problem of moving a potential carrying a load through a fluid, in a finite time and over a given distance, in such a way that the required work is minimized. An important step towards more realistic systems is the consideration of memory effects in the surrounding fluid, which are ubiquitous in real-world applications. Therefore, our experiments were performed in viscous and viscoelastic media, which are typical environments for synthetic and biological processes on the microscale. Despite marked differences between the protocols in both fluids, we find that the optimal control protocol and the corresponding average particle trajectory always obey a time-reversal symmetry. We show that this symmetry, which surprisingly applies here to a class of processes far from thermal equilibrium, holds universally for various systems, including active, granular, and long-range correlated media in their linear regimes. The uncovered symmetry provides a rigorous and versatile criterion for optimal control that greatly facilitates the search for energy-efficient transport strategies in a wide range of systems. Using a machine learning algorithm, we demonstrate that the algorithmic exploitation of time-reversal symmetry can significantly enhance the performance of numerical optimization algorithms. Published by the American Physical Society 2024

Prediction of gas–solid erosion wear of bionic surfaces based on machine learning and unimodal intelligent optimization algorithm

Solid particle erosion wear is an inevitable phenomenon in industrial production, with erosion removal mass serving as a crucial metric for assessing the wear rate per unit area on the impacted surface. Developing predictive models to estimate the degree of mass removal is crucial for effectively controlling, evaluating, and preventing severe damage resulting from solid particle erosion wear. In this study, we constructed a comprehensive dataset comprising smooth and bionic surfaces, encompassing inner, outer, and planar surfaces. The dataset was used in a multifactorial erosion experiment, considering adjustable erosion angles, solid particle incident gas velocities, and solid particle diameter sizes. Through visualization and analysis of the obtained dataset, we identified optimal scenarios for bionic surface erosion resistance, offering insights for structural design against bionic erosion resistance. Furthermore, we compared machine learning algorithms to address the prediction problem, resulting in the selection of the best-performing regression algorithm, SVR (Support Vector Regression). Additionally, we compared the performance of other advanced intelligent optimization algorithms using unimodal benchmark functions, finding that HHO (Harris Hawks Optimization) emerged as the optimal choice for unimodal optimization. Building on HHO, we developed the IHHO (Improved Harris Hawks Optimization)-SVR model, using experimental data from erosion tests as the training dataset. This model can predict gas–solid two-phase flow erosion patterns, encompassing various wall types, solid particle sizes, solid incident gas velocities, and impact angles. Due to its robustness and rapid prediction capabilities, the model is expected to serve as a cost-effective tool for predicting erosion removal mass in gas–solid two-phase flow scenarios.

An effective graph-analysis method to schedule a continuous galvanizing line with campaigning boundary constraints

This work deals with the scheduling optimization of a Continuous Galvanizing Line (CGL) in the steel industry. We introduce a real-case extension of the CGL scheduling problem that is concerned with the linking of campaigns. In order to link the different campaigns planned at the CGL, the scheduler may fix the start coil of the sequence, the end coil, or both, introducing new boundary constraints (BC) to the sequencing problem. This shows to have a significant impact in the performance of the current Ant Colony Optimization (ACO) algorithms in use, failing to find feasible solutions with reliability. Our research aims at improving this reliability. Viewing sequences as paths in a directed weighed graph, in which coils are the nodes, and coil changes the edges, the BC problem is to find a minimum cost Hamiltonian path that respects the required start and end nodes. In this paper we study the negative impact brought by the BC in 30 challenging instances from the CGL, we discuss the reasons behind, and we propose a new algorithm able to robustly assure feasibility in all of them. We introduce a brand-new graph analysis method devised as an effective surrogate check for feasibility, which runs embedded in the ACO sequence construction heuristic. In the experimental analysis we see that it clearly boosts performance, increasing reliability by 20%, up to 99.67%. By teaming up with the Interval Reconstruction local search, the reliability and quality of the solutions shows to improve further. This graph analysis method we propose, though illustrated within ACO as a use case, is applicable to any constructive metaheuristic.

A hybrid optimization algorithm to identify unknown parameters of photovoltaic models under varying operating conditions

Enhancing the performance of optimization algorithms to accurately extract parameters for photovoltaic modules is a significant challenge in the field. While several metaheuristic algorithms have been explored, achieving a balance between exploration and exploitation capabilities remains elusive. In this context, hybrid metaheuristics have emerged as a promising approach to address this issue and improve optimization efficiency. In our study, we propose a novel hybrid algorithm that integrates the backtracking search optimization algorithm (BSA) with the differential evolution (DE) algorithm. This hybridization aims to enhance the precision of parameter extraction for various photovoltaic models, including single-diode, dual-diode, and commercially available modules such as the ST40 Thin Film, SM55 Monocrystalline, and S75 Polycrystalline. The BSA is initially employed to leverage historical experiences and guide the evolutionary process, thereby enhancing the algorithm’s exploration capabilities. Subsequently, the DE algorithm is introduced to accelerate convergence during iterations and improve exploitation of the search space. By combining these two algorithms, we aim to achieve superior accuracy and efficiency in parameter estimation. To validate the effectiveness of our approach, extensive experiments are conducted, and the results demonstrate its superiority over other sophisticated algorithms. The proposed algorithm achieves remarkable performance, as evidenced by the lowest mean square error values obtained: 9.86021877891501E-04 for the single-diode model, 9.82484851785148E-04 for the dual-diode model, 2.42507486809511E-03 for Photowatt-PWP201, 1.72981370994069E-03 for STM6-40/36, and 1.66006031250855E-02 for STP6-120/36. This highlights the algorithm’s exceptional accuracy and efficiency in extracting parameters for photovoltaic modules.