Search

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]

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]

Lightning strikes can cause equipment damage and power outages, so the distribution system's reliability in withstanding lightning strikes is crucial. This research paper presents a model that aims to optimise the configuration of a lightning protection system (LPS) in the power distribution system and minimise the System Average Interruption Frequency Index (SAIFI), a measure of reliability, and the associated cost investment. The proposed lightning electromagnetic transient model considers LPS factors such as feeder shielding, grounding design, and soil types, which affect critical current, flashover rates, SAIFI, and cost. A metaheuristic algorithm, PSOGSA, is used to obtain the optimal solution. The paper's main contribution is exploring grounding schemes and soil resistivity's impact on SAIFI. Using 4 grounding rods arranged in a straight line under the soil with 10 Ωm resistivity reduces grounding resistance and decreases SAIFI from 3.783 int./yr (no LPS) to 0.146 int./yr. Unshielded LPS has no significant effect on critical current for soil resistivity. Four test cases with different cost investments are considered, and numerical simulations are conducted. Shielded LPSs are more sensitive to grounding topologies and soil resistivities, wherein higher investment, with 10 Ωm soil resistivity, SAIFI decreases the most by 73.34%. In contrast, SAIFIs for 1 kΩm and 10 kΩm soil resistivities show minor decreases compared to SAIFIs with no LPS. The study emphasises the importance of considering soil resistivity and investment cost when selecting the optimal LPS configuration for distribution systems, as well as the significance of LPS selection in reducing interruptions to customers. [ABSTRACT FROM AUTHOR]

Designing effective PID controllers for gimbal payload systems (GPS) in naval applications poses inherent challenges due to the dynamic nature of these systems. The gimbal system requires precise control to stabilize its line of sight (LOS) for accurate target tracking in electro-optical systems. Conventional PID controllers often struggle to address the complex dynamics and nonlinearities inherent in gimbal systems, resulting in suboptimal performance. Therefore, in this study, we introduce a novel control design framework for the gimbal payload system (GPS) employed in naval applications. A more effective PID controller is developed by utilizing the hunting mechanism of the antlion optimization technique. This controller precisely manages and stabilizes the LOS of the GPS, ensuring seamless target tracking in electro-optical systems. Furthermore, we assess the robustness of the proposed controller by varying system parameters, including moment of inertia (± 20%) and motor resistance (+ 10%). The results demonstrate robust target tracking even in the presence of changes within the system. Additionally, the gimbal system exhibits zero overshoot, and the achieved high values of gain and phase margins outperform other techniques such as genetic algorithm, particle swarm optimization, and classical methods. [ABSTRACT FROM AUTHOR]

Cloud provides preferred services to the users based on their requirements over the internet. In a cloud server, virtual network mapping (VNM) is employed to build a network on demand by deploying virtual machines in a substrate network based on the user request and offers efficient service provision. In case of service provisioning, sufficient computing resource is an essential one to deliver services for satisfying the customers' requirements. The resource optimal service provisioning is a still demanding issue in cloud computing. To develop, Oppositional Learned Metaheuristic Whale Optimization-based Graphical Virtual Network Mapping (OLMWO-GVNM) technique for improving the mapping efficiency of virtual network request to the resource-efficient physical node with minimum computation time. Initially, the number of virtual network requests arrived at the cloud server from different locations. After collecting the requests, the cloud server uses the graph theory for performing both virtual node mapping and link mapping with optimal resource utilization. The node mapping is carried out using the Oppositional Learned Metaheuristic Whale Optimization technique with multiple resources such as CPU, memory, bandwidth, and energy to find the optimal physical node for mapping the virtual network requests. After that, the link mapping is carried out by mapping the virtual link on the substrate path. In this way, the OLMWO-GVNM technique efficiently mapping the input virtual network request to the resource optimum physical node with minimum time. Experimental evaluation of the OLMWO-GVNM technique and existing techniques are carried out with different factors such as mapping efficiency, computation time, request acceptance ratio, and memory consumption concerning several requests. The discussed results prove that the proposed OLMWO-GVNM technique improves the virtual network mapping efficiency and acceptance ratio with minimum time as well as memory consumption compared to state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Sewer systems are a component of city infrastructure that requires large investment in construction and operation. Metaheuristic optimization methods have been used to solve sewer optimization problems. The aim of this study is to investigate the effects of network size on metaheuristic optimization algorithms. Cuckoo Search (CS) and four versions of Grey Wolf Optimization (GWO) were utilized for the hydraulic optimization of sewer networks. The purpose of using different algorithms is to investigate whether the results obtained differ depending on the algorithm. In addition, to eliminate the parameter effect, the relevant algorithms were run with different parameters, such as population size. These algorithms were performed on three different-sized networks, namely small-sized, medium-sized, and large-sized networks. Friedman and Wilcoxon tests were utilized to statistically analyze the results. The results were also evaluated in terms of the optimality gap criterion. According to the results based on the optimality gap, the performance of each algorithm decreases as the network size increases. [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]

Recently, there has been a growing interest in employing optimization techniques to ascertain the most efficient operation of reservoirs. This involves their application to various facets of the reservoir operating system, particularly in determining optimal rule curves. This study delves into the exploration of different algorithms, including Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Firefly Algorithm (FA), Invasive Weed Optimization (IWO), Teaching Learning-Based Optimization (TLBO), and Harmony Search (HS). Each algorithm was integrated into a reservoir simulation model, focusing on finding optimal rule curves for the Mujib reservoir in Jordan from 2004 to 2019. The primary objective was to evaluate the long-term impact of water shortages and excess releases on the Mujib reservoir. Furthermore, the study aimed to determine the effects of water demand management by reducing it by 10%, 20%, and 30%. The results revealed that the used algorithms effectively mitigated water shortages and excess releases compared to the current operational strategy. Notably, the Teaching Learning-Based Optimization (TLBO) algorithm yielded the most favorable outcomes, reducing the frequency and average of water shortages to 55.09% and 56.26%, respectively. Additionally, it curtailed the frequency and average of excess releases to 63.16% and 73.31%, respectively. [ABSTRACT FROM AUTHOR]

This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]

This study seeks to plan and evaluate the cost of the logistics in manufacturing tetra duplex board using prime grade and recycled materials. The real-world data for this study is obtained from one of the largest paper and board industries in Asia. The bi-objective problem is formulated by developing a mixed integer linear programming (MILP) model considering the constraints related to raw material supplies, processing, and storage. The metaheuristic optimization techniques are applied based on the concept of epsilon dominance to balance the conflicting objectives to counter the complex problem in the real world of transportation for the ease of the decision-makers to make the best-informed decisions in the selection of raw material. The investigation results indicate that the cost of prime-grade material in the tetra duplex board supply chain is 71 percent higher than recycled fiber. Furthermore, this study can be extended by evaluating the environmental aspects of prime and recycled-grade transportation. Moreover, the logistics of the prime grade can further be narrowed down by investigating it in various modes of transportation such as highways, waterways, rail, and air. [ABSTRACT FROM AUTHOR]

In the increasingly decentralized energy environment, economical power dispatching from distributed generations (DGs) is crucial to minimizing operating costs, optimizing resource utilization, and guaranteeing a consistent and sustainable supply of electricity. A comprehensive review of optimization techniques for economic power dispatching from distributed generations is imperative to identify the most effective strategies for minimizing operational costs while maintaining grid stability and sustainability. The choice of optimization technique for economic power dispatching from DGs depends on a number of factors, such as the size and complexity of the power system, the availability of computational resources, and the specific requirements of the application. Optimization techniques for economic power dispatching from distributed generations (DGs) can be classified into two main categories: (i) Classical optimization techniques, (ii) Heuristic optimization techniques. In classical optimization techniques, the linear programming (LP) model is one of the most popular optimization methods. Utilizing the LP model, power demand and network constraints are met while minimizing the overall cost of generating electricity from DGs. This approach is efficient in determining the best DGs dispatch and is capable of handling challenging optimization issues in the large-scale system including renewables. The quadratic programming (QP)model, a classical optimization technique, is a further popular optimization method, to consider non-linearity. The QP model can take into account the quadratic cost of energy production, with consideration constraints like network capacity, voltage, and frequency. The metaheuristic optimization techniques are also used for economic power dispatching from DGs, which include genetic algorithms (GA), particle swarm optimization (PSO), and ant colony optimization (ACO). Also, Some researchers are developing hybrid optimization techniques that combine elements of classical and heuristic optimization techniques with the incorporation of droop control, predictive control, and fuzzy-based methods. These methods can deal with large-scale systems with many objectives and non-linear, non-convex optimization issues. The most popular approaches are the LP and QP models, while more difficult problems are handled using metaheuristic optimization techniques. In summary, in order to increase efficiency, reduce costs, and ensure a consistent supply of electricity, optimization techniques are essential tools used in economic power dispatching from DGs. [ABSTRACT FROM AUTHOR]

Distributed Denial of Service (DDoS) attacks have increased in frequency and sophistication over the last ten years. Part of the challenge of defending against such attacks requires the analysis of very large volumes of data. Metaheuristic algorithms can assist in selecting relevant features from the network traffic data for use in DDoS detection models. By efficiently exploring different combinations of features, these methods can identify subsets that are informative for distinguishing between normal and attack traffic. However, identifying an optimized solution in this area is an open research question. Tuning the parameters of metaheuristic search techniques in the optimization process is critical. In this study, a switching approximation is used in a variety of metaheuristic search techniques. This approximation is used to find the best solution for the analysis of the network traffic features in either lower or upper values between 0 and 1. We compare the fine-tuning of this parameter against standard approaches and find that it is not substantially better than the BestFirst algorithm (a standard default approach for feature selection). This study contributes to the literature by testing and eliminating various fine-tuning strategies for the metaheuristic approach. [ABSTRACT FROM AUTHOR]

Maintaining the reliability of the modern power system is becoming increasingly challenging due to the continuous growth in its size and complexity. One of the most significant challenges PS faces is frequency regulation, which is essential for maintaining a stable and reliable operation of PS. This article investigates the automatic generation control (AGC) of a multi-area PS considering partial loading scheduled in a hydro and thermal generating unit. A bird swarm algorithm (BSA) based two-degree of freedom tilt integral derivative (2DOF-TID) controller has been suggested. The superiority of the optimal 2DOF-TID controller has been selected by comparing the system dynamics with other conventional controllers. Also, the ascendancy of suggested BSA has been shown over the grasshopper algorithm and particle swarm optimization techniques. The investigation on partial loading schedules for the hydro-thermal system showed that the system's dynamic response deteriorates when loading on hydro units exceeds their nominal loading. Also, system dynamics are enhanced when thermal units are loaded beyond their capacity. The investigations are also conducted to analyse the effect of high voltage direct current (HVDC) link and virtual inertia emulation with an energy storage system. The studies with alternating current (AC)/HVDC and virtual inertia revealed that dynamic responses are better with the latter when compared with AC and HVDC links alone. • A novel 2DOF-TID controller has been proposed for a three-area hydro-thermal AGC system. • The controller gains and other parameters are optimized using a novel meta-heuristic algorithm called the BSA. • The supremacy of BSA has been analyzed over PSO and GHA. • The performance of the system, considering different loading schedules in thermal and hydro generating units is analyzed. • The effects of a parallel AC/HVDC link and virtual inertia with RFB on system dynamics are analyzed. [ABSTRACT FROM AUTHOR]

This study is a first attempt to provide an effective tool for crack prediction in beam-type structures using the peridynamics (PD) theory and metaheuristic-based optimization. The norm of the difference between the response of the tested beam and that of the trial model (analyzed using PD), is minimized to find the position and depth of crack. Model calibration is discussed thoroughly. Five well-known metaheuristics as well as an upgraded charged system search algorithm are considered. Results reveal that the proposed procedure can effectively localize and detect the crack severity, even in noise contaminated cases. [ABSTRACT FROM AUTHOR]

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]

Many new metaheuristic algorithms prioritize their search strategy phase, often neglecting equally critical stages like initialization. Latin hypercube sampling (LHS) is one technique that stands out in this context. LHS selects representative samples through permutations in a multidimensional space, effectively preventing the clustering of points in specific areas. However, its limitations become apparent in high-dimensional problems, as it fails to provide crucial search space information and struggles to determine samples across all dimensions. Addressing these challenges, this paper introduces an innovative population initialization approach, combining the strengths of LHS with evolutionary behaviors. This technique is divided into two main sections: spatial and quality. The spatial section divides the search space into equal intervals across each dimension to establish initial solutions. Meanwhile, the quality section employs evolutionary strategies like mutation and crossover. These strategies serve a dual purpose: they explore the search space thoroughly and refine solutions, bringing them closer to the objective function. To validate the effectiveness of this method, these principles have been integrated it into the classic Differential Evolution algorithm. We conducted extensive tests using 30 representative benchmark functions to assess its performance. The experimental results are encouraging; our methodology not only speeds up convergence but also enhances solution quality, outperforming other similar techniques. [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]

Use Case Points estimation framework relies on the complexity weight parameters to estimate software development projects. However, due to the discontinue parameters, it lead to abrupt weight classification and results in inaccurate estimation. Several research studies have addressed these weaknesses by employing various approaches, including fuzzy logic, regression analysis, and optimization techniques. Nevertheless, the utilization of optimization techniques to determine use case weight parameter values has yet to be extensively explored, with the potential to enhance accuracy further. Motivated by this, the current research delves into various metaheuristic search-based algorithms, such as genetic algorithms, Firefly algorithms, Reptile search algorithms, Particle swarm optimization, and Grey Wolf optimizers. The experimental investigation was carried out using a Silhavy UCP estimation dataset, which contains 71 project data from three software houses and is publicly available. Furthermore, we compared the performance between models based on metaheuristic algorithms. The findings indicate that the performance of the Firefly algorithm outperforms the others based on five accuracy metrics: mean absolute error, mean balance relative error, mean inverted relative error, standardized accuracy, and effect size. This research could be useful for software project managers to leverage the practical implications of this study by utilizing the UCP estimation method, which is optimized using the Firefly algorithm. [ABSTRACT FROM AUTHOR]

As science and technology advance, the need for novel optimization techniques has led to an increase. The recently proposed metaheuristic algorithm, Gradient-based optimizer (GBO), is rooted in the gradient-based Newton's method. GBO has a more concrete theoretical foundation. However, gradient search rule (GSR) and local escaping operator (LEO) operators in GBO still have some shortcomings. The insufficient updating method and the simple selection process limit the search performance of the algorithm. In this paper, an improved version is proposed to compensate for the above shortcomings, called RL-SDOGBO. First, during the GSR phase, the Spearman rank correlation coefficient is used to determine weak solutions on which to perform dynamic opposite learning. This operation assists the algorithm to escape from local optima and enhance exploration capability. Secondly, to optimize the exploitation capability, reinforcement learning is used to guide the selection of solution update modes in the LEO operator. RL-SDOGBO is tested on 12 classical benchmark functions and 12 CEC2022 benchmark functions with seven representative metaheuristics, respectively. The impact of the improvements, the scalability and running time of the algorithm, and the balance of exploration and exploitation are analyzed and discussed. Combining the experimental results and some statistical results, RL-SDOGBO exhibits excellent numerical optimization performance and provides high-quality solutions in most cases. In addition, RL-SDOGBO is also used to solve the anchor clustering problem for small target detection, making it a more potential and competitive option. [ABSTRACT FROM AUTHOR]

The effective utilization of photovoltaic systems (PVS) is significantly affected by partial shading (PS). Although total cross‐tied topology minimizes the power loss, the partial shading condition (PSC) decreases the output power generation and exhibits multiple power peaks in the Power Voltage characteristics. To address this issue, a dual‐objective optimization technique based on reduced search space equilibrium optimization (RSS‐EO) for a single‐phase, two‐stage grid‐connected PVS, is presented. The proposed technique accomplishes two objectives 1) maximizing power generation by reconfiguring the PV modules using a switching matrix based on irradiance equalization and 2) extracting the global maximum power (GMP) with faster convergence, negligible steady‐state oscillations, and reduced steady‐state error. The simulation and experimental results validate the effectiveness of the proposed RSS‐EO technique in efficiently distributing shade over the entire PV array and tracking GMP. The power enhancements achieved by RSS‐EO, particle swarm optimization, and Munkres are 23.03%, 20.02%, and 19.01%, respectively. Additionally, the proposed method exhibits an average mismatch power loss of 738 W, a fill factor of 58.1%, and a percentage power loss of 26.83%. Furthermore, the proposed algorithm is evaluated based on energy calculations and shows better performance by achieving the shortest payback period of 1.6 years. [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]

Introduction: The Swarm Intelligence Based (SIB) method has widely been applied to effcient optimization in many fields with discrete solution domains. E-commerce raises the importance of designing suitable selling strategies, including channel- and direct sales, and the mix of them, but researchers in this field seldom employ advanced metaheuristic techniques in their optimization problem due to the complexities caused by the high-dimensional problems and cross-dimensional constraints. Method: In this work, we introduce an extension of the SIB method that can simultaneously tackle these two challenges. To pursue faster computing, CPU parallelization techniques are employed for algorithm acceleration. Results: The performance of the SIB method is examined on the problems of designing selling schemes in diffierent scales. It outperforms the Genetic Algorithm (GA) in terms of both the speed of convergence and the optimized capacity as measured using improvement multipliers. [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]

The root growth algorithm has often been used to solve challenging optimization issues. It is one of the metaheuristic algorithms inspired by root growth in plant behaviors. An article reviewed and analyzed bibliographic data on metaheuristics but is not specific on the topic of root growth algorithm. Therefore, this article presents a bibliometric analysis based on the topic of the root growth algorithm. It reviews the publication from the Scopus database. Based on the search process done on 14 February 2023 using the keywords of root growth algorithm, this article managed to gather 1836 articles from 1976-2023. However, this article only focuses on Engineering, Computer Science, and Mathematics to ensure it relates to the area the researcher wants to explore. Moreover, articles in the year 2023 will also be excluded due to incomplete data. After the researcher limited the data to those areas, it was reduced to 837 articles. This article uses three types of software: Microsoft Excel, VOSviewer software, and Harzing's Publish or Perish software to analyze the frequency, visualization mapping, and citation metrics analysis, respectively. The finding from the bibliometric analysis shows the researcher has noticed that the total publication keeps increasing rapidly from 2014 until 2022. The country that contributes the most to the root growth algorithm topic is China. Furthermore, the most productive author is Chen, H. and all the top 10 productive authors are from China except for Christofides, P. D., who comes from the United States. The top 10 sources of root growth algorithm research contributed over a quarter of the total articles (231 or 27.60%). The results of this study have significant implications for increasing the number of practices using the root growth algorithm in future research. Last but not least, bibliometric analysis on the topic of root growth algorithm is needed to identify influential publications, understand research trends, evaluate research impact, and identify potential research gaps in a concise manner, which helps researchers and readers stay informed, make informed decisions, and contribute to the advancement of knowledge in the field. [ABSTRACT FROM AUTHOR]

This paper conducts a comprehensive exploration of contemporary optimization algorithms, addressing challenges and outlining potential avenues for future research. The survey encompasses a wide spectrum of optimization techniques employed in various domains, ranging from mathematical programming to machine learning and artificial intelligence. It systematically analyses the inherent challenges faced by existing algorithms, including scalability issues, convergence speed, and adaptability to diverse problem spaces. Furthermore, the paper critically examines the impact of optimization algorithms on real-world applications, considering their effectiveness and limitations. The survey identifies emerging trends, such as hybrid approaches and metaheuristic methods that offer promising directions for overcoming current challenges. By synthesizing the state-of-the-art in optimization algorithms, this paper provides a valuable resource for researchers, practitioners, and decision-makers, guiding them towards addressing existing limitations and unlocking new opportunities in the evolving landscape of optimization research. [ABSTRACT FROM AUTHOR]

The convergence rate has been widely accepted as a performance measure for choosing a better metaheuristic algorithm. So, we propose a novel technique to improve the performance of the existing Grey Wolf Optimization (GWO) algorithm in terms of its convergence rate. The proposed approach also prioritizes the test cases that are obtained after executing the input benchmark programs. This paper has three technical contributions. In our first contribution, we generate test cases for the input benchmark programs. Our second contribution prioritizes test cases using an improved version of the existing GWO algorithm (CGWO). Our third contribution analyzes the obtained result and compares it with state-of-the-art metaheuristic techniques. This work is validated after running the proposed model on six benchmark programs. The obtained results show that our proposed approach has achieved 48% better APFD score for the prioritized order of test cases than the non-prioritized order. We also achieved a better convergence rate, which takes around 4000 fewer iterations, when compared with the existing methods on the same platform. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is a crucial task in machine learning applications, which aims to select the most appropriate feature subset while maintaining high classification accuracy with the minimum number of selected features. Despite the widespread usage of metaheuristics as wrapper-based FS techniques, they show reduced effectiveness and increased computational cost when applied to high-dimensional datasets. This paper presents a novel Binary Object-Oriented Programming Optimization Algorithm (BOOPOA) for FS of high dimensional datasets, where the Object-Oriented Programming Optimization Algorithm (OOPOA) is a novel optimization technique inspired by the inheritance concept of Object-Oriented programming (OOP) languages. The effectiveness of this method in solving high dimensional FS problems is validated by using 26 datasets, most of which are of high dimension (large number of features). Seven existing FS algorithms are compared with the proposed OOPOA using various metrics, including best fitness, average fitness (AVG), selection size, and computational time. The results prove the superiority of the proposed algorithm over the other FS algorithms, having an average performance of %92.5, 0.078, 0.084, %38.9, and 8.6 min for classification accuracy, best fitness, average fitness, size reduction ratio, and computational time. The outcomes demonstrate the proposed FS approach's superiority over currently used methods. [Display omitted] [ABSTRACT FROM AUTHOR]

Circuit design plays a pivotal role in engineering, ensuring the creation of efficient, reliable, and cost-effective electronic devices. The complexity of modern circuit design problems has led to the exploration of multi-objective optimization techniques for circuit design optimization, as traditional optimization tools fall short in handling such problems. While metaheuristic algorithms, especially genetic algorithms, have demonstrated promise, their susceptibility to premature convergence poses challenges. This paper proposes a pioneering approach, the chaotic multi-objective Runge–Kutta algorithm (CMRUN), for circuit design optimization, building upon the Runge–Kutta optimization algorithm. By infusing chaos into the core RUN structure, a refined balance between exploration and exploitation is obtained, critical for addressing complex optimization landscapes, enabling the algorithm to navigate nonlinear and nonconvex optimization challenges effectively. This approach is extended to accommodate multiple objectives, ultimately generating Pareto Fronts for the multiple circuit design goals. The performance of CMRUN is rigorously evaluated against 11 multiobjective algorithms, encompassing 15 benchmark test functions and practical circuit design scenarios. The findings of this study underscore the efficiency and real-world applicability of CMRUN, offering valuable insights for tailoring optimization algorithms to the real-world circuit design challenges. [ABSTRACT FROM AUTHOR]

Lung cancer is the most critical disease because it affects both men and women. Most of the time, lung cancer leads to death due to less health care and medical attention. In addition, lung cancer is difficult to identify in earlier stages due to the low‐level symptoms and risk factors. To overcome the complexity, effective techniques must predict lung cancer earlier. To attain the problem statement, an lung cancer identification system is developed with the help of a meta‐heuristic algorithm. The CT imageries obtained from the CIA database are analyzed step by step. The gathered image noise is removed by applying the mean filter, and the affected regions are segmented with the help of the Butterfly Optimization Algorithm‐based K‐Means Clustering (BOAKMC) algorithm. Afterward, various statistical features are derived, and the Supervised Jaya Optimized Rough Set related Feature Selection (SJORSFS) process is used to select the lung features. Finally, the lung cancer is identified using Autoencoder based Recurrent Neural Network (ARNN) classification algorithm, successfully recognizing the lung cancer features. Then the system's efficiency is evaluated using a MATLAB setup; here, 3000 are treated as training images and 2043 for testing images. The effective training enhances overall lung cancer prediction accuracy by up to 99.15%. [ABSTRACT FROM AUTHOR]

Featured Application: Electric Vehicle, Data Center, Simulink, etc. This study examines the use of meta-heuristic algorithms, specifically particle swarm optimization and genetic algorithms, for optimizing thermal systems, addressing a research gap on their efficacy in larger systems. Utilizing MATLAB's Simulink and Simscape, the research initially targets an electric vehicle thermal system model, emphasizing the optimization of a Li-ion battery pack and associated cooling components, like chillers, pumps, and cooling plates, during operation. One consideration is the use of a glycerol–water mixture in the chiller pump, which demands the use of an optimal control algorithm that adjusts to outdoor temperatures and control strategies. This study focuses on computational efficiency reflecting the complexity of system simulations. Challenges related to applying particle swarm optimization and genetic algorithms to these systems are scrutinized, leading to the establishment of a new objective function to pinpoint target values for system optimization. This research aims to refine design methodologies for engineers by harmonizing optimal design with computational expediency, thereby enhancing the engineering design process in thermal management. This integrative approach promises to yield practical insights, benefiting engineers dedicated to the advancement of thermal system design and optimization. The results show that, compared to the base model, 1% of the overall state of charge could be saved, and the battery temperature could also be cooled by more than 4 °C compared to the initial temperature. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) is a promising technology that realizes short‐range wireless optical communication and illumination simultaneously. The use of light‐emitting diodes (LEDs) in lighting has accelerated the development of short‐range wireless optical technology. However, the limited switching frequency of LEDs used in lighting restricts the communication speed of VLC systems. Non‐orthogonal multiple access (NOMA) methods can be used to improve the sum rate in VLC systems. In this study, meta‐heuristic optimization algorithms are proposed to calculate the power allocation coefficients of users in indoor NOMA‐based VLC systems. During the calculations, many constraints used fairness and optical intensity, which were not taken into account in many studies in the literature. The proposed algorithms are compared with the previously proposed methods according to the sum rate results, considering the number of users increases and the user signal strength values differ. The obtained results revealed that metaheuristic methods demonstrate a significant improvement in terms of sum rate compared to other methods. In addition, the effects of parameters such as sum rate, fairness, and optical intensity on each other are investigated in the simulation environment. © 2023 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Summary: The wireless sensor network (WSN) contains sensor nodes for understanding, communicating, and storing battery capacity data. Data collection can be defined as the process that base stations use to eliminate unwanted transmissions and provide mixed information. This improves energy efficiency and extends the life of low‐energy WSNs enabled by IoT (IoT‐WSNs). In this article, we propose an optimal QoS‐aware intra‐inter cluster data aggregation technique for WSNs using hybrid optimization techniques (OQ‐IICA). First, we introduce a modified bowerbird optimization (MBO) algorithm for balanced clustering which improves energy efficiency. Second, we develop a multi‐objective seagull optimization‐based decision‐making (MSO‐DM) algorithm to estimate the CH of clusters in the network. Next, we introduce a teacher‐inspired cappuccino search algorithm to ensure the quality of data transfer between nodes by learning through internal and cluster routing. Finally, the proposed OQ‐IICA algorithm compares the latest technologies in ICA, Leach, and Leach‐C power consumption, latency, throughput, latency, number of live nodes, routing, and grid length. [ABSTRACT FROM AUTHOR]

Simulation-based metamodels or surrogate models are simplified models that capture the relationship between inputs and outputs of the simulation model. The analytical expression of metamodels is defined using a sample of input/output points obtained from the simulation model. This analytical expression is then embedded in an optimization process that usually provides solutions much faster than other simulation-based optimization techniques such as metaheuristics or mathematical modeling. The goal of this paper is to describe the simulation-based metamodeling approach and to provide a thorough review of the literature on its applications to emergency healthcare systems. For this purpose, we examine the recent literature (journals and conference proceedings) published in the last 15 years (2008–2022). Finally, we identify findings and avenues of research in simulation-based metamodeling that deserve special attention from the scientific community and allow the potential of this approach to be used for better decision-making in emergency healthcare. [ABSTRACT FROM AUTHOR]

This study proposes the One-to-One-Based Optimizer (OOBO), a new optimization technique for solving optimization problems in various scientific areas. The key idea in designing the suggested OOBO is to effectively use the knowledge of all members in the process of updating the algorithm population while preventing the algorithm from relying on specific members of the population. We use a one-to-one correspondence between the two sets of population members and the members selected as guides to increase the involvement of all population members in the update process. Each population member is chosen just once as a guide and is only utilized to update another member of the population in this one-to-one interaction. The proposed OOBO's performance in optimization is evaluated with fifty-two objective functions, encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results highlight the remarkable capacity of OOBO to strike a balance between exploration and exploitation within the problem-solving space during the search process. The quality of the optimization results achieved using the proposed OOBO is evaluated by comparing them to eight well-known algorithms. The simulation findings show that OOBO outperforms the other algorithms in addressing optimization problems and can give more acceptable quasi-optimal solutions. Also, the implementation of OOBO in six engineering problems shows the effectiveness of the proposed approach in solving real-world optimization applications. [ABSTRACT FROM AUTHOR]

Rooftop units (RTUs) were commonly employed in small commercial buildings that represent that can frequently do not take the higher level maintenance that chillers receive. Fault detection and diagnosis (FDD) tools can be employed for RTU methods to ensure essential faults are addressed promptly. In this aspect, this article presents an Optimal Deep Belief Network based Fault Detection and Classification on Packaged Rooftop Units (ODBNFDC-PRTU) model. The ODBNFDC-PRTU technique considers fault diagnosis as amulti-class classification problem and is handled usingDL models. For fault diagnosis in RTUs, the ODBNFDC-PRTU model exploits the deep belief network (DBN) classification model, which identifies seven distinct types of faults. At the same time, the chicken swarm optimization (CSO) algorithm-based hyperparameter tuning technique is utilized for resolving the trial and error hyperparameter selection process, showing the novelty of the work. To illustrate the enhanced performance of the ODBNFDC-PRTU algorithm, a comprehensive set of simulations are applied. The comparison study described the improvement of the ODBNFDC-PRTU method over other recent FDD algorithms with maximum accuracy of 99.30% and TPR of 93.09%. [ABSTRACT FROM AUTHOR]

The primary objective of this study is to delve into the application and validation of the Resistance Capacitance Optimization Algorithm (RCOA)—a new, physics-inspired metaheuristic optimization algorithm. The RCOA, intriguingly inspired by the time response of a resistance–capacitance circuit to a sudden voltage fluctuation, has been earmarked for solving complex numerical and engineering design optimization problems. Uniquely, the RCOA operates without any control/tunable parameters. In the first phase of this study, we evaluated the RCOA's credibility and functionality by deploying it on a set of 23 benchmark test functions. This was followed by thoroughly examining its application in eight distinct constrained engineering design optimization scenarios. This methodical approach was undertaken to dissect and understand the algorithm's exploration and exploitation phases, leveraging standard benchmark functions as the yardstick. The principal findings underline the significant effectiveness of the RCOA, especially when contrasted against various state-of-the-art algorithms in the field. Beyond its apparent superiority, the RCOA was put through rigorous statistical non-parametric testing, further endorsing its reliability as an innovative tool for handling complex engineering design problems. The conclusion of this research underscores the RCOA's strong performance in terms of reliability and precision, particularly in tackling constrained engineering design optimization challenges. This statement, derived from the systematic study, strengthens RCOA's position as a potentially transformative tool in the mathematical optimization landscape. It also paves the way for further exploration and adaptation of physics-inspired algorithms in the broader realm of optimization problems. [ABSTRACT FROM AUTHOR]

The pursuit of achieving total power network observability in smart grids using Phasor Measurement Units (PMUs) carries a significant promise of real-time Wide-Area Monitoring, Protection, and Control (WAMPAC). PMU applications eliminate periodical measurements, thereby increasing accuracy through a high sampling rate of the measured power systems quantities. The high costs of installation of PMUs for total power system observability presents a challenge in the implementation of PMUs. This is due to the expensive costs of PMU devices. This has led to a prominent optimal PMU placement (OPP) problem that researchers tirelessly aim to solve by ensuring a complete power network observability while using the least installed PMU devices possible. In this paper, a novel Binary Firefly Algorithm (BFA) based on the node degree centrality scores of each bus is proposed to minimize PMU installations. The BFA solves the OPP problem in consideration of the effect of Zero Injection Buses (ZIBs) under normal operation and single PMU outage (SPO). The robustness and efficiency of the proposed algorithm is tested on IEEE-approved test systems and visualized with a force-directed technique on an undirected power network graph. The proposed BFA yields the same but better optimal PMU numbers, obtained by existing meta-heuristic optimization techniques found in the literature for each of the IEEE test cases, as well as highlighting the cost–benefit of having a robust system against single PMU loss while considering the ZIB effect for an improved system measurement availability. [ABSTRACT FROM AUTHOR]

The reptile search algorithm (RSA) is a dynamic and effective meta-heuristic algorithm inspired by the behavior of crocodiles in nature and the way of hunting prey. Unlike other crawler search algorithms, it uses four novel mechanisms to update the location of the solutions, such as walking at high or on the belly, and hunting in a coordinated or cooperative manner. In this algorithm, the total number of iterations is divided into four intervals, and different position-updating strategies are used to make the algorithm easily fall into the local optimum. Therefore, an improved reptile search algorithm based on a mathematical optimization accelerator (MOA) and elementary functions is proposed to improve its search efficiency and make it not easily fall into local optimum. MOA was used to realize the switching of RSA's four searching modes by introducing random perturbations of six elementary functions (sine function, cosine function, tangent function, arccosine function, hyperbolic secant function and hyperbolic cosecant function), four mechanisms are distinguished by random number instead of the original RSA algorithm's inherent four mechanisms by iteration number, which increases the randomness of the algorithm and avoids falling into local optimum. The random perturbations generated by elementary functions are added to the variation trend of parameter MOA to improve the optimization accuracy of the algorithm. To verify the effectiveness of the proposed algorithm, 30 benchmark functions in CEC2017 were used for carrying out simulation experiments, and the optimization performance was compared with BAT, PSO, ChOA, MRA and SSA. Finally, two practical engineering design problems are optimized. Simulation results show that the proposed sechRSA has strong global optimization ability. [ABSTRACT FROM AUTHOR]

The equilibrium optimizer (EO) is a recently developed physics-based optimization technique for complex optimization problems. Although the algorithm shows excellent exploitation capability, it still has some drawbacks, such as the tendency to fall into local optima and poor population diversity. To address these shortcomings, an enhanced EO algorithm is proposed in this paper. First, a spiral search mechanism is introduced to guide the particles to more promising search regions. Then, a new inertia weight factor is employed to mitigate the oscillation phenomena of particles. To evaluate the effectiveness of the proposed algorithm, it has been tested on the CEC2017 test suite and the mobile robot path planning (MRPP) problem and compared with some advanced metaheuristic techniques. The experimental results demonstrate that our improved EO algorithm outperforms the comparison methods in solving both numerical optimization problems and practical problems. Overall, the developed EO variant has good robustness and stability and can be considered as a promising optimization tool. [ABSTRACT FROM AUTHOR]

Sliding-mode control (SMC) is a robust technique used in power electronics (PE) for controlling the behavior of power converters. This paper presents simulations and experimental results of an optimal SMC strategy applied to Semi-Bridgeless Boost Converters (SBBC), which includes Power Factor Correction (PFC). As the main contribution, the optimal coefficients of the SMC strategy are obtained using two metaheuristic approaches, namely the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The main objective is to obtain the sliding coefficients that ensure the best converter response in terms of the input current and output voltage, both during start-up and under disturbances (including changes in load, source, and references). The fitness function to be minimized includes two coefficients, namely the Integrative Absolute Error (IAE) and the Integral Time Absolute Error (ITAE), for both the input current and output voltage. These coefficients measure the converter's effort to follow the control references. The IAE penalizes errors during start-up, whereas the ITAE penalizes errors in the steady state. The tests carried out demonstrated the effectiveness of the GA and PSO techniques in the optimization process; nonetheless, the GA outperformed the PSO approach, providing sliding coefficients that allowed for a reduction in the input current overshoot during start-up of up to 24.15% and a reduction in the setting time of the output voltage of up to 99%. The experimental results were very similar when tuning with the GA and PSO techniques; nevertheless, tuning with the GA technique produced a better response in the face of disturbances compared to the PSO technique. [ABSTRACT FROM AUTHOR]

One of the important research issues in wireless sensor networks (WSNs) is the optimal layout designing for the deployment of sensor nodes. It directly affects the quality of monitoring, cost, and detection capability of WSNs. Layout optimization is an NP-hard combinatorial problem, which requires optimization of multiple competing objectives like cost, coverage, connectivity, lifetime, load balancing, and energy consumption of sensor nodes. In the last decade, several meta-heuristic optimization techniques have been proposed to solve this problem, such as genetic algorithms (GA) and particle swarm optimization (PSO). However, these approaches either provided computationally expensive solutions or covered a limited number of objectives, which are combinations of area coverage, the number of sensor nodes, energy consumption, and lifetime. In this study, a meta-heuristic multi-objective firefly algorithm (MOFA) is presented to solve the layout optimization problem. Here, the main goal is to cover a number of objectives related to optimal layouts of homogeneous WSNs, which includes coverage, connectivity, lifetime, energy consumption and the number of sensor nodes. Simulation results showed that MOFA created optimal Pareto front of non-dominated solutions with better hyper-volumes and spread of solutions, in comparison to multi-objective genetic algorithms (IBEA, NSGA-II) and particle swarm optimizers (OMOPSO, SMOPSO). Therefore, MOFA can be used in real-time deployment applications of large-scale WSNs to enhance their detection capability and quality of monitoring. [ABSTRACT FROM AUTHOR]