Search

Using Hybrid optimization algorithms for nonlinear systems analysis is a novel approach. It is a powerful technique that uses the exploitation ability of one algorithm and the exploration ability of another algorithm, to find the best solution. Literature survey reveals that hybrid algorithms not only show quality response but also give faster convergence of error for nonlinear systems. In this paper, hybrid optimization techniques based proportional integral derivative (PID) controller is used for benchmark problems: Continuous stirred tank reactor (CSTR), Inverted pendulum and blood glucose system. Two recent hybrid algorithms: Particle swarm optimization‐Gravitational search algorithm (PSO‐GSA) and Particle swarm optimization‐Grey wolf algorithm (PSO‐GWO) are implemented to control the temperature and concentration of CSTR, pendulum angle of inverted pendulum, glucose concentration and insulin level of blood glucose system. In PID and PSOGWO algorithms, the exploration abilities of GSA and GWO combined with the exploitation ability of PSO have been used. The performance of these algorithms is then compared with individual PSO, GSA, and GWO algorithms proving their superiority. Stability is ensured using the Lyapunov approach while the robustness of the systems is checked using the parameter perturbation technique. Simulation results show substantial improvement in the performance of these systems by using these meta‐heuristic hybrid optimization techniques. A comparative analysis of these algorithms has also been done. [ABSTRACT FROM AUTHOR]

Purpose: This work is dedicated to disk brake rotor optimization using parametric and topological optimizations considering three conflicting objectives: mass, temperature variation, and breaking time. The rotor had explicit equations modeled and the Multi-objective Lichtenberg Algorithm (MOLA), which is executable in Matlab®, performed a parametric optimization to find the general rotor design parameters. Several optimization techniques have been developed last few years, however, the ones that have presented better results are meta-heuristics associated with posteriori decision-making techniques. Thus, in this work, this powerful and recently created multi-objective meta-heuristic was applied. The MOLA found more than 3000 solutions and the TOPSIS was used for decision-making. Then, the rotor was designed in the SolidWorks® 3D software and the ANSYS software was applied to perform topological optimization, where more mass was removed and analysis regarding the work stresses was done. To the best author's knowledge, this is the first work to consider multi-objective parametric and topological optimization for this structure at the same time in the literature. A considerable mass reduction was obtained. It was possible to find a rotor weighing only 164.8 g with the lowest safety factor across the entire rotor equals 2.02. Therefore, a rotor optimized with reliable, lightweight, and that allows a low braking time was found. Also, these results show that the methodology used can be applied in other structures with complex parameterization. [ABSTRACT FROM AUTHOR]

Machine learning classifiers have been widely used for crop mapping; however, employing numerous features can reduce classifier accuracy. Feature selection is a widely recognized technique that addresses the issue of high dimensionality by choosing the most relevant subset of features with the highest degree of relevance and practicality. Therefore, the optimal combination of feature selection methods and classifiers for high-precision crop mapping remains an open problem. In this study, we introduce a novel hybrid feature selection approach to obtain the optimal subset of features for effective crop mapping. Initially, spectro-temporal remote sensing features from the dataset were ranked using two distinct feature selection techniques: Mutual Information (MI) and ReliefF filter. The most relevant features from each filter-based approach were combined into a union subset. Subsequently, the Gray Wolf Optimization (GWO), a metaheuristic optimization technique, was applied to enhance the feature set generated in the initial step. In the final stage, a random forest classifier leveraged the optimized feature subset for accurate crop type prediction. The effectiveness of the proposed approach was evaluated in Behiera governorate, Egypt. Comparative analysis against existing crop mapping methods demonstrated the superior performance of the proposed approach, achieving an accuracy rate of 82%. Furthermore, this approach showcased a significant reduction in the feature count, streamlining the set from 308 down to only 26 features. [ABSTRACT FROM AUTHOR]

This article develops two metaheuristics optimization techniques, Grey Wolf Optimizer (GWO) and Harris Hawks Optimization (HHO), to handle multi-objective optimal power flow (MOOPF) issues. Multi Objective GWO (MOGWO) and Multi Objective HHO (MOHHO) are the names of the developed techniques. By combining these optimization techniques with Pareto techniques, the non-dominated solution set can be obtained. These developed approaches are characterized by simplicity and have few control parameters. Fuel cost, emissions, real power losses, and voltage deviation were the four objective functions considered. The theories used to determine the best compromise solution and organize the Pareto front options are the fuzzy membership equation and the crowding distance approach, respectively. To validate and evaluate the performance of the presented techniques, two standard IEEE bus systems—30-bus and 57-bus power systems—were proposed. Bi, Tri, and Quad objective functions with 21 case studies are the types of objective functions and the scenarios that were applied in this paper. As compared to the results of the most recent optimization techniques documented in the literature, the comparative analysis results for the proposed methodologies demonstrated the superiority and robustness of MOGWO and MOHHO. [ABSTRACT FROM AUTHOR]

Several optimization-based population search methods have been proposed; they use various operators that permit exploring the search space. These methods typically suffer from local search (LS) problems and are unbalanced between exploration and exploitation. Consequently, recent researchers sought to modify the algorithms to avoid search problems using local search techniques to intensify the exploitation when is necessary. This paper proposes a novel single-based local search optimization algorithm called the non-monopolize search (NO). The NO is a single-solution metaphor-free algorithm, and its operators are designed based to explore and exploit along the iterative process. The NO works only with a candidate solution, and the operators modify the dimension to move the current solution along the search space. The NO is an effective LS method that combines the benefits of exploration with exploitation. Different from other LS, the NO can escape from suboptimal solutions thanks to the randomness incorporated into its operators. This is the main advantage of the NO. Experiments are conducted on standard benchmark functions to validate the performance of the proposed non-monopolize search optimization technique. The results are compared with other well-known methods, and the proposed NO got better results. Moreover, the proposed NO can be considered a powerful alternative to improve the optimization algorithms' performance and help avoid local search problems. Source codes of NO are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/156154-the-non-monopolize-search-no. [ABSTRACT FROM AUTHOR]

The built environment is a significant contributor to global energy consumption and greenhouse gas emissions. Advancements in the adoption of environmentally friendly building technology have become crucial in promoting sustainable development. These advancements play a crucial role in conserving energy. The aim is to achieve an optimal design by balancing various interrelated factors. The emergence of innovative techniques to address energy conservation have been witnessed in the built environment. This review examines existing research articles that explore different metaheuristic optimization techniques (MOTs) for energy conservation in buildings. The focus is on evaluating the simplicity and stochastic nature of these optimization techniques. The findings of the review present theoretical and mathematical models for each algorithm and assess their effectiveness in problem solving. A systematic analysis of selected algorithms using MOT is conducted, considering factors that influence wellbeing, occupant health, and indoor environmental quality. The study examines the variations among swarm intelligence MOTs based on complexity, advantages, and disadvantages. The algorithms' performances are based on the concept of uncertainty in consistently providing optimal solutions. The paper highlights the application of each technique in achieving energy conservation in buildings. [ABSTRACT FROM AUTHOR]

Teaching–learning-based optimization (TLBO) algorithm is an excellent human-inspired optimization technique. This paper proposes an innovative improved version of TLBO—collectivism teaching–learning-based optimization (CTLBO) algorithm. This algorithm imitates group and individual behaviours in the reality of teaching and learning, applies group-individual multi-mode cooperation strategies to form new search mechanism. The CTLBO contains three phases, i.e. preparation phase, teaching and learning phases. In the preparation phase, there are two operators, i.e. teacher self-learning and teacher-learner interaction operators. In the teaching phase, class teaching and performance-based group teaching operators are implied. In the learning phase, neighbour learning, student self-learning and team-learning strategies are mixed together to form three operators. Two sets of experiments are conducted to test the performance of CTLBO. The first set of experiments validates the improvement effect of CTLBO by comparing it with the original TLBO and other authors' improved versions of TLBO. The second set of experiments illustrates the advantage of CTLBO by comparing it with other 17 meta-heuristic algorithms in solving 30 general benchmark functions and 15 CEC2015 test suit functions. The results of experiments show that CTLBO algorithm has significant improvement effect compared with TLBO. It is the most effective one amongst the improved versions of TLBO selected for comparison, and outperforms all other 17 meta-heuristic algorithms. The algorithm can significantly improve the convergence ability and the accuracy in solving different-scale complex optimization models. [ABSTRACT FROM AUTHOR]

This review aims to exploit a study on different benchmark test functions used to evaluate the performance of Meta-Heuristic (MH) optimization techniques. The performance of the MH optimization techniques is evaluated with the different sets of mathematical benchmark test functions and various real-world engineering design problems. These benchmark test functions can help to identify the strengths and weaknesses of newly proposed MH optimization techniques. This review paper presents 215 mathematical test functions, including mathematical equations, characteristics, search space and global minima of the objective function and 57 real-world engineering design problems, including mathematical equations, constraints, and boundary conditions of the objective functions carried out from the literature. The MATLAB code references for mathematical benchmark test functions and real-world design problems, including the Congress of Evolutionary Computation (CEC) and Genetic and Evolutionary Computation Conference (GECCO) test suite, are presented in this paper. Also, the winners of CEC are highlighted with their reference papers. This paper also comprehensively reviews the literature related to benchmark test functions and real-world engineering design challenges using a bibliometric approach. This bibliometric analysis aims to analyze the number of publications, prolific authors, academic institutions, and country contributions to assess the field's growth and development. This paper will inspire researchers to innovate effective approaches for handling inequality and equality constraints. [ABSTRACT FROM AUTHOR]

The parameter identification problem of photovoltaic (PV) models is classified as a complex nonlinear optimization problem that cannot be accurately solved by traditional techniques. Therefore, metaheuristic algorithms have been recently used to solve this problem due to their potential to approximate the optimal solution for several complicated optimization problems. Despite that, the existing metaheuristic algorithms still suffer from sluggish convergence rates and stagnation in local optima when applied to tackle this problem. Therefore, this study presents a new parameter estimation technique, namely HKOA, based on integrating the recently published Kepler optimization algorithm (KOA) with the ranking-based update and exploitation improvement mechanisms to accurately estimate the unknown parameters of the third-, single-, and double-diode models. The former mechanism aims at promoting the KOA's exploration operator to diminish getting stuck in local optima, while the latter mechanism is used to strengthen its exploitation operator to faster converge to the approximate solution. Both KOA and HKOA are validated using the RTC France solar cell and five PV modules, including Photowatt-PWP201, Ultra 85-P, Ultra 85-P, STP6-120/36, and STM6-40/36, to show their efficiency and stability. In addition, they are extensively compared to several optimization techniques to show their effectiveness. According to the experimental findings, HKOA is a strong alternative method for estimating the unknown parameters of PV models because it can yield substantially different and superior findings for the third-, single-, and double-diode models. [ABSTRACT FROM AUTHOR]

The biogeography-based optimization (BBO) algorithm is known for its simplicity and low computational overhead, but it often struggles with falling into local optima and slow convergence speed. Against this background, this work presents a multi-strategy enhanced BBO variant, named MSBBO. Firstly, the example chasing strategy is proposed to eliminate the destruction of the inferior solutions to superior solutions. Secondly, the heuristic crossover strategy is designed to enhance the search ability of the population. Finally, the prey search–attack strategy is used to balance the exploration and exploitation. To verify the performance of MSBBO, we compare it with standard BBO, seven BBO variants (PRBBO, BBOSB, HGBBO, FABBO, BLEHO, MPBBO and BBOIMAM) and seven meta-heuristic algorithms (GWO, WOA, SSA, ChOA, MPA, GJO and BWO) on multiple dimensions of 24 benchmark functions. It concludes that MSBBO significantly outperforms all competitors both on convergence accuracy, speed and stability, and MSBBO basically converges to the same results on 10,000 dimensions as on 1000 dimensions. Further, MSBBO is applied to six real-world engineering design problems. The experimental results show that our work is still more competitive than other latest optimization techniques (COA, EDO, OMA, SHO and SCSO) on constrained optimization problems. [ABSTRACT FROM AUTHOR]

Jaya is a metaheuristic algorithm that uses a pair of random internal parameters to adjust its exploration and exploitation search behaviors. Such a random setting can negatively affect the search performance of the algorithm by causing inappropriate search behavior in some iterations. To tackle this issue, the present study deals with developing a new fuzzy decision-making mechanism for dynamic adjusting the trade-off between the exploration and exploitation search behaviors of the Jaya method. The new algorithm is named Fuzzy Reinforced Jaya (FRJ) method. The search capability of the FRJ is evaluated in solving a suite of unconstrained mathematical benchmarks and constrained mechanical and structural optimization problems with buckling and natural frequency constraints. Also, the relevant decision variables are selected from both continuous and discrete domains. To provide a deeper insight into the effect of the defined auxiliary fuzzy module, the performance of the algorithm is evaluated and discussed using normalized diversity concept and behavioral diagrams. Also, employing different statistical analyses (e.g., Q–Q diagrams, Wilcoxson and Friedman tests), the significance of the outcomes is evaluated. Also, the numeric achievements are compared with six other well-stablished techniques. Attained outcomes indicate that the proposed FRJ, as a self-adaptive and parameter-free method, provides superior and promising results in the terms of stability, accuracy, and computational cost in solving mathematical and structural optimization problems. [ABSTRACT FROM AUTHOR]

Over the last decade, concepts such as industry 4.0 and the Internet of Things (IoT) have contributed to the increase in the availability and affordability of sensing technology. In this context, structural health monitoring (SHM) arises as an especially interesting field to integrate and develop these new sensing capabilities, given the criticality of structural application for human life and the elevated costs of manual monitoring. Due to the scale of structural systems, one of the main challenges when designing a modern monitoring system is the optimal sensor placement (OSP) problem. The OSP problem is combinatorial in nature, making its exact solution infeasible in most practical cases, usually requiring the use of metaheuristic optimization techniques. While approaches such as genetic algorithms (GAs) have been able to produce significant results in many practical case studies, their ability to scale up to more complex structures is still an area of open research. This study proposes a novel quantum-based combinatorial optimization approach to solve the OSP problem approximately, within the context of SHM. For this purpose, a quadratic unconstrained binary optimization (QUBO) model formulation is developed, taking as a starting point of the modal strain energy (MSE) of the structure. The framework is tested using numerical simulations of Warren truss bridges of varying scales. The results obtained using the proposed framework are compared against exhaustive search approaches to verify their performance. More importantly, a detailed discussion of the current limitations of the technology and the future paths of research in the area is presented to the reader. [ABSTRACT FROM AUTHOR]

The Salp Swarm Algorithm (SSA) is a bio-inspired metaheuristic optimization technique that mimics the collective behavior of Salp chains hunting for food in the ocean. While it demonstrates competitive performance on benchmark problems, the SSA faces challenges with slow convergence and getting trapped in local optima like many population-based algorithms. To address these limitations, this study proposes the locally weighted Salp Swarm Algorithm (LWSSA), which combines two mechanisms into the standard SSA framework. First, a locally weighted approach is introduced and integrated into the SSA to guide the search toward locally promising regions. This heuristic iteratively probes high-quality solutions in the neighborhood and refines the current position. Second, a mutation operator generates new positions for Salp followers to increase randomness throughout the search. In order to assess its effectiveness, the proposed approach was evaluated against the state-of-the-art metaheuristics using standard test functions from the IEEE CEC 2021 and IEEE CEC 2017 competitions. The methodology is also applied to a risk assessment of cardiovascular disease (CVD). Seven optimization strategies of the extreme gradient boosting (XGBoost) classifier are evaluated and compared to the proposed LWSSA-XGBoost model. The proposed LWSSA-XGBoost achieves superior prediction performance with 94% F1 score, 94% recall, 93% accuracy, and 93% area under the ROC curve in comparison with state-of-the-art competitors. Overall, the experimental results demonstrate that the LWSSA enhances SSA's optimization ability and XGBoost predictive power in automated CVD risk assessment. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

Engineering optimization typically involves a large number of nonlinear constraints; therefore, effective constraint handling techniques (CHTs) are sought for metaheuristic optimization algorithms. Modified repair-based CHT is proposed here for a multi-objective evolutionary algorithm based on decomposition (MOEA/D). This CHT is: (1) adaptive to the share of infeasible solutions in a population; (2) free of problem-specific heuristics that users typically need to provide for repair; and (3) without control parameters. Infeasible solutions with superior decomposition function value are repaired using information contained in the neighbourhoods of the current population. The approach is tested on four multi-objective problems: a common mathematical optimization benchmark problem, two truss optimization problems and a real-world structural design of a tanker ship. A few prominent CHTs and metaheuristic algorithms are used for comparison. With the proposed CHT, MOEA/D shows improved convergence speed and spread of the Pareto front, providing competitive results in comparison to the other algorithms. [ABSTRACT FROM AUTHOR]

Structural damage identification (SDI), an important issue in the field of structural health monitoring (SHM), is usually converted into a constrained optimization problem. However, the conventional objective functions defined by natural frequencies and mode shapes are insensitive enough to structural damage. To tackle this problem, this study proposed a new SDI method based on quadratic optimization of objective functions with both modal residual force and weighting strategy. First, a new structural damage index was constructed by Taylor expansion and sensitive matrix analysis about the modal residual force with respect to damage factor, and then the new index was introduced into a new objective function together with the frequency and mode shape. Then, to balance the magnitude effects of each term in objective functions, a weighting strategy was introduced to define the second new objective function for higher SDI accuracy and robustness to noise. The two proposed objective functions were further solved for SDI with a novel metaheuristic optimization technique, the whale optimization algorithm (WOA). To evaluate the effectiveness of the proposed SDI method, numerical simulations on a simply supported beam and a truss structure, as well as various experimental verifications on a simply supported beam in the laboratory, were carried out. The results show that the proposed SDI method outperforms the traditional method with a higher SDI accuracy and robustness to noise, and the second objective function is more suitable for multiple damage identification in complex structures. [ABSTRACT FROM AUTHOR]

PVs (photo Voltaics) are the leading player in distributed power systems. Despite all the developments and evolution, the affordability of the solar system is still challenging. The issue of its economy has led to the development of Maximum PowerPoint Tracking (MPPT). The role of maximum power extraction under partial shading is a crucial feature of energy harvesting. This paper has reviewed various conventional, soft computing, and hybrid techniques for MPPT under partial shading conditions. It is observed that conventional methods fail to extract maximum power under partial shading conditions due to multiple peaks. Therefore, different soft computing, hybrid techniques, algorithms and modern PV topologies are discussed to track global maxima from multiple local maxima. The strengths and weaknesses of various methods' tracking speed, transient and steady-state oscillation, cost, computational complexity, etc., are taken as independent quantities and various MPPT techniques as dependent quantity to prepare a user-friendly table. Also, three different meta-heuristic algorithms (Cuckoo Search, JAYA and PSO) performance have been compared for the PSC based on tracking time and efficiency by using a Hardware-in-the-loop (HIL) simulation platform. [ABSTRACT FROM AUTHOR]

• Importance and challenges of relay coordination in Microgrid. • Overview of different adaptive schemes opted for relay coordination. • Different optimization techniques which have been used for the calculation of relay settings. • Evolvement of algorithms from conventional to Hybrid methods which combines two different metaheuristic methods to solve a complex, non- linear optimization problem in an efficient way for optimized relay coordination. • Future directions of research for further modifications possible in Algorithms are stated at the end. Concept of microgrids (MGs) have gained significant attention in order to enhance the resilience and efficiency of modern Power Systems. MG offers bi-directional power flow so an effective protection and control becomes a vital requirement to ensure the reliable operation of MGs. Relay coordination being an integral part of the protection system, plays a critical role in prevention of power disturbances and equipment damage due to the presence of bi-directional power flow. This review paper focuses on the optimization of relay coordination in MGs, and highlights the importance of adaptive and intelligent approaches involved for the efficacy of MG operation. This paper overviews different schemes used to adapt while determining the DOCRs settings with different contingencies considered. The paper depicts the key challenges associated with relay coordination in MGs; varying fault currents, and bidirectional power flows. To overcome these challenges, recent researches have explored advanced techniques that includes intelligent algorithms to operate on collected real-time data. Additionally, the impact of communication technologies for relay coordination in real-time has been discussed for Grid connected and Islanded mode of operation. This review covers a wide range of optimization methods such as; Traditional, Meta-Heuristic, and Hybrid algorithms, which allows adaptive and reliable protection schemes during different modes of MG operations. [ABSTRACT FROM AUTHOR]

This research endeavor strives to conceptualize a hybrid microgrid tailored for household consumption in Guelmim City, situated in the southern region of Morocco. In pursuit of this objective, a groundbreaking and enhanced algorithm, denoted as the Leader Artificial Rabbits Optimization Algorithm, is introduced. The efficacy of this innovative algorithm is initially validated by means of an exhaustive performance assessment involving a comprehensive comparison with the original version of the algorithm as well as other contemporary optimization methodologies. This comparative analysis encompasses the evaluation of the algorithms across 23 benchmark functions. The outcomes clearly exhibit that the developed algorithm outperforms both the original iteration and other optimization techniques in terms of both convergence speed and solution quality. Subsequent to this validation, the proposed algorithm is applied to the specific project at hand. The resulting outcomes are juxtaposed with those derived from other optimization strategies. This comparative evaluation serves to underscore the effectiveness of the suggested approach. The outcome of this comparison highlights a net present cost of $106,821, based on the microgrid configuration employing PV/wind/diesel/battery. Additionally, the cost of energy is estimated at approximately $0.11 per kWh, accompanied by a reliability rate of 5 % and an availability rate of 95 %. [Display omitted] [ABSTRACT FROM AUTHOR]

In this paper, the estimation of solar cell parameters in the Bishop model was developed. The parameter estimation was formulated as an optimization problem. Several techniques were selected and compared, such as, Ant Lion Optimizer (ALO), Arithmetic Optimization Algorithm (AOA), Grasshopper Optimization Algorithm (GOA), Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Salp Swarm Algorithm (SSA), and Vortex Search Algorithm (VSA). All these techniques were selected because of their solutions' quality when applied to estimating parameters in photovoltaic models. The Bishop model was selected since it can represent the behavior of a photovoltaic cell in direct and reverse modes of operation (when producing and consuming power, respectively). For the validation stage, two technologies were selected (monocrystalline and polycrystalline). All the techniques were executed 100 times and compared based on their estimated objective function and computation time (mean value and standard deviation). Then, the four techniques with the best results were selected and further analyzed employing the I–V curve reconstructions and the results of some critical points, such as short-circuit current and maximum power point. • A procedure to obtain cell I–V curve that includes information in the first and second quadrants of a commercial panel. • A cell parameter estimation strategy based on optimization techniques applied to the Bishop model. • Analysis of estimation results based on response repeatability and execution times. • Analysis of the quality of some important points in the I–V curve. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Particle Swarm Optimization technique (PSO) is widely used in practical applications due to its flexibility and strong optimization performance. However, like other metaheuristic algorithms, PSO has limitations, such as a propensity to become trapped in local minima and an uneven distribution of effort between exploration and exploitation stages. A novel local search technique called QPSOL, based on PSO is the proposed solution to mitigate these issues. QPSOL aims to increase diversity and achieve a closer balance between the exploration and exploitation phases. The QPSOL incorporates a dynamic optimization strategy to enhance the method's efficiency. Unlike the novel local search strategy, which uses a new local search approach (LSA) to break out of local optima, QPSOL employs quadratic interpolation around the optimal search agent to enhance its exploitation capability and solution accuracy. These strategies complement each other and contribute to boosting PSO's convergence efficiency while seeking to balance exploration and exploitation. The proposed method is assessed using the IEEE CEC'2021 test suite, and its efficacy is evaluated against other metaheuristics and cutting-edge algorithms to determine its trustworthiness. The optimal parameters of three PV models are determined using the proposed technique and compared to different well-established algorithms. Systematic comparisons show that QPSOL is competitive with, and often outperforms, commonly used methods in research for predicting model parameters. [ABSTRACT FROM AUTHOR]

The finite element model updating procedure of large or complex structures is challenging for engineering practitioners and researchers. Iterative methods, such as genetic algorithms and response surface models, have a high computational burden for these problems. This work introduces an enhanced version of the well-known Efficient Global Optimisation technique to address this issue. The enhanced method, refined Efficient Global Optimisation or rEGO, exploits a two-step refinement and selection technique to expand the global search capability of the original method to a global–local, or hybrid, search capability. rEGO is tested and validated on four optimisation test functions against the original methods and genetic algorithms with different settings. Good results in terms of precision and computational performance are achieved, so an application for model updating is sought. A penalty function for the finite element model updating is identified in residuals of the modified total modal assurance criterion. Finally, rEGO for finite element model updating is implemented on a hybrid, numerical and experimental, case study based on a well-known experimental dataset and on a higher dimension finite element model of a wing spar. Satisfactory results in terms of precision and computational performance are achieved when compared to the original methods and genetic algorithms, needing two orders of magnitude fewer evaluations and achieving comparable results in terms of precision. • A new meta-modelling optimisation routine based on the Efficient Global Optimization. • The method is paired with a modal parameters-driven goal function for model updating. • The model updating technique is tested on complex datasets for damage detection. [ABSTRACT FROM AUTHOR]

This paper introduces a novel approach that extracts the maximum power from photovoltaic (PV) system utilizing the Horse Herd Optimization (HHO) algorithm under different weather conditions, including fast changes in solar radiation (FCSR) and partial shading conditions (PSCs). The HHO algorithm is a technique for optimization that mimics the movement behavior exhibited by horses within a herd. The proposed MPPT controller has been tested and compared with other recognized metaheuristic algorithms, including the Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO), Flower Pollination (FP), Deterministic PSO (DPSO), and Cuckoo Search (CS). According to the simulation results, the proposed HHO-based MPPT method is found to outperform other considered metaheuristic methods in terms of the maximum power extraction, fast-tracking, and settling times under various weather conditions. Additionally, the suggested MPPT controller is robust and can continuously track the MPP under the FCSR. The performance of the proposed HHO controller is validated experimentally on a real PV system. It is demonstrated that the proposed HHO algorithm is robust and capable of outperforming the other counterpart metaheuristic algorithms as well as offering the highest MPPT efficiency of about 98.81 % with a rapid tracking time of 2.2 s. Furthermore, it has the lowest power oscillations of about 1.91 %, ensuring stable and consistent power output. [ABSTRACT FROM AUTHOR]