Search

The wild horse optimizer (WHO) is a novel metaheuristic algorithm, which has been successfully applied to solving continuous engineering problems. Considering the characteristics of the wild horse optimizer, a discrete version of the algorithm, named discrete wild horse optimizer (DWHO), is proposed to solve the capacitated vehicle routing problem (CVRP). By incorporating three local search strategies-swap operation, reverse operation, and insertion operation-along with the introduction of the largest-order-value (LOV) decoding technique, the precision and quality of the solutions have been enhanced. Experimental results conducted on 44 benchmark instances indicate that, in most test cases, the solving capability of discrete wild horse optimizer surpasses that of basic wild horse optimizer (BWHO), hybrid firefly algorithm, dynamic space reduction ant colony optimization (DSRACO), and discrete artificial ecosystem-based optimization (DAEO). The discrete wild horse optimizer provides a novel approach for solving the capacitated vehicle routing problem and also offers a new perspective for addressing other discrete problems. [ABSTRACT FROM AUTHOR]

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

In this study, a stochastic multi-objective structure for optimization of the intelligent electric parking lots (EPLs) is implemented in the distribution network for minimizing the power losses annual costs, power purchased from the main grid, unsupplied energy of subscribers, cost of vehicles to the grid as well as minimizing the network voltage deviations considering battery degradation cost (BDC) and network load uncertainty (NLUn). In this research, the unscented transformation method (UTM) is used for NLUn modeling and this method is easily applicable and has a low computational cost. An improved meta-heuristic algorithm named improved fire hawks optimization (IFHO) is utilized for decision variables finding defined as the site and size of the EPLs in the distribution network. The conventional fire hawks optimization (FHO) algorithm is inspired by the fire hawks foraging behavior and in this research, the Taylor-based neighborhood technique (TBNT) is used to reduce the dependency and the possibility of becoming trapped in local optimal. To evaluate the proposed methodology, the simulations are implemented in three scenarios (1) EPLs optimization without BDC and NLUn based-UTM, (2) EPLs optimization with BDC and without NLUn, and (3) EPLs optimization with BDC and NLUn. The results of the third scenario considering BDC and NLUn showed that the EPLs optimization integrated with a multi-objective framework by finding the EPL's optimal size and capacity in the network via the IFHO has reduced the annual losses, voltage deviations, ENS cost, and substation cost by 21.06%, 12.15%, 70.82%, and 39.10%, respectively compared to the base distribution network. Additionally, the results demonstrated that incorporating the BDC and NLUn, the annual losses, voltage oscillations, ENS cost, grid cost, and EPLs have increased in comparison with the EPLs optimization without BDC and NLUn based-UTM. In addition, the TBNT based-IFHO superiority has been confirmed in different scenarios by achieving better values of the objectives and also obtaining the convergence process with lower convergence tolerance and higher convergence accuracy. [ABSTRACT FROM AUTHOR]

Supply chain efficiency is a major challenge in today's business environment, where efficient resource allocation and coordination of activities are essential for competitive advantage. Traditional efficiency strategies often struggle for resources for the complex and dynamic network. In response, bio-inspired metaheuristic algorithms have emerged as powerful tools to solve these optimization problems. Referring to the random search nature of metaheuristic algorithms and emphasizing that no metaheuristic algorithm is the best optimizer for all optimization applications, the No Free Lunch (NFL) theorem encourages researchers to design newer algorithms to be able to provide more effective solutions to optimization problems. Motivated by the NFL theorem, the innovation and novelty of this paper is in designing a new meta-heuristic algorithm called Bobcat Optimization Algorithm (BOA) that imitates the natural behavior of bobcats in the wild. The basic inspiration of BOA is derived from the hunting strategy of bobcats during the attack towards the prey and the chase process between them. The theory of BOA is stated and then mathematically modeled in two phases (i) exploration based on the simulation of the bobcat's position change while moving towards the prey and (ii) exploitation based on simulating the bobcat's position change during the chase process to catch the prey. The performance of BOA is evaluated in optimization to handle the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100, as well as to address CEC 2020. The optimization results show that BOA has a high ability in exploration, exploitation, and balance them during the search process in order to achieve a suitable solution for optimization problems. The results obtained from BOA are compared with the performance of twelve well-known metaheuristic algorithms. The findings show that BOA has been successful in handling the CEC 2017 test suite in 89.65, 79.31, 93.10, and 89.65% of the functions for the problem dimension equal to 10, 30, 50, and 100, respectively. Also, the findings show that in order to handle the CEC 2020 test suite, BOA has been successful in 100% of the functions of this test suite. The statistical analysis confirms that BOA has a significant statistical superiority in the competition with the compared algorithms. Also, in order to analyze the efficiency of BOA in dealing with real world applications, twenty-two constrained optimization problems from CEC 2011 test suite and four engineering design problems have been selected. The findings show that BOA has been successful in 90.90% of CEC2011 test suite optimization problems and in 100% of engineering design problems. In addition, the efficiency of BOA to handle SCM applications has been challenged to solve ten case studies in the field of sustainable lot size optimization. The findings show that BOA has successfully provided superior performance in 100% of the case studies compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

Many emerging commercial services are based on the sharing or pooling of resources for common use with the aim of reducing costs. Businesses such as delivery-, mobility-, or transport-as-a-service have become standard in many parts of the world, fulfilling on-demand requests for customers in live settings. However, it is known that many of these problems are NP-hard, and therefore both modeling and solving them accurately is a challenge. Here we focus on one such routing problem, the Ride Pooling Problem (RPP), where multiple customers can request on-demand pickups and drop-offs from shared vehicles within a fleet. The combinatorial optimization task is to optimally pool customer requests using the limited set of vehicles, akin to a small-scale flexible bus route. In this work, we propose a quadratic unconstrained binary optimization (QUBO) program and introduce efficient formulation methods for the RPP to be solved using metaheuristics, and specifically emerging quantum optimization algorithms. [ABSTRACT FROM AUTHOR]

In this work, intelligent numerical models for the prediction of debris flow susceptibility using slope stability failure factor of safety (FOS) machine learning predictions have been developed. These machine learning techniques were trained using novel metaheuristic methods. The application of these training mechanisms was necessitated by the need to enhance the robustness and performance of the three main machine learning methods. It was necessary to develop intelligent models for the prediction of the FOS of debris flow down a slope with measured geometry due to the sophisticated equipment required for regular field studies on slopes prone to debris flow and the associated high project budgets and contingencies. With the development of smart models, the design and monitoring of the behavior of the slopes can be achieved at a reduced cost and time. Furthermore, multiple performance evaluation indices were utilized to ensure the model's accuracy was maintained. The adaptive neuro-fuzzy inference system, combined with the particle swarm optimization algorithm, outperformed other techniques. It achieved an FOS of debris flow down a slope performance of over 85%, consistently surpassing other methods. [ABSTRACT FROM AUTHOR]

The reliable operation of power systems while integrating renewable energy systems depends on Optimal Power Flow (OPF). Power systems meet the operational demands by efficiently managing the OPF. Identifying the optimal solution for the OPF problem is essential to ensure voltage stability, and minimize power loss and fuel cost when the power system is integrated with renewable energy resources. The traditional procedure to find the optimal solution utilizes nature-inspired metaheuristic optimization algorithms which exhibit performance drop in terms of high convergence rate and local optimal solution while handling uncertainties and nonlinearities in Hybrid Renewable Energy Systems (HRES). Thus, a novel hybrid model is presented in this research work using Deep Reinforcement Learning (DRL) with Quantum Inspired Genetic Algorithm (DRL-QIGA). The DRL in the proposed model effectively combines the proximal policy network to optimize power generation in real-time. The ability to learn and adapt to the changes in a real-time environment makes DRL to be suitable for the proposed model. Meanwhile, the QIGA enhances the global search process through the quantum computing principle, and this improves the exploitation and exploration features while searching for optimal solutions for the OPF problem. The proposed model experimental evaluation utilizes a modified IEEE 30-bus system to validate the performance. Comparative analysis demonstrates the proposed model's better performance in terms of reduced fuel cost of $620.45, minimized power loss of 1.85 MW, and voltage deviation of 0.065 compared with traditional optimization algorithms. [ABSTRACT FROM AUTHOR]

This research introduces a new technique to control constrained nonlinear systems, named Lyapunov-based neural network model predictive control using a metaheuristic optimization approach. This controller utilizes a feedforward neural network model as a prediction model and employs the driving training based optimization algorithm to resolve the related constrained optimization problem. The proposed controller relies on the simplicity and accuracy of the feedforward neural network model and the convergence speed of the driving training based optimization algorithm. The closed-loop stability of the developed controller is ensured by including the Lyapunov function as a constraint in the cost function. The efficiency of the suggested controller is illustrated by controlling the angular speed of three-phase squirrel cage induction motor. The reached results are contrasted to those of other methods, specifically the fuzzy logic controller optimized by teaching learning-based optimization algorithm, the optimized PID with particle swarm optimization algorithm, the neural network model predictive controller based on particle swarm optimization algorithm, and the neural network model predictive controller using driving training based optimization algorithm. This comparative study showcase that the suggested controller provides good accuracy, quickness and robustness due to the obtained values of the mean absolute error, mean square error root mean square error, enhancement percentage, and computing time in the different simulation cases, and it can be efficiently utilized to control constrained nonlinear systems with fast dynamics. [ABSTRACT FROM AUTHOR]

Cybersecurity is critical in today's digitally linked and networked society. There is no way to overestimate the importance of cyber security as technology develops and becomes more pervasive in our daily lives. Cybersecurity is essential to people's protection. One type of cyberattack known as "credential stuffing" involves using previously acquired usernames and passwords by attackers to access user accounts on several websites without authorization. This is feasible as a lot of people use the same passwords and usernames on several different websites. Maintaining the security of online accounts requires defence against credential-stuffing attacks. The problems of credential stuffing attacks, failure detection, and prediction can be handled by the suggested EWOA-ANN model. Here, a novel optimization approach known as Enhanced Whale Optimization Algorithm (EWOA) is put on to train the neural network. The effectiveness of the suggested attack identification model has been demonstrated, and an empirical comparison will be carried out with respect to specific security analysis. [ABSTRACT FROM AUTHOR]

In this paper, a new algorithm named the improved transient search optimization algorithm (ITSOA) is utilized to solve classical test functions, optimize the consumption of building energy, and optimize hybrid energy system production. The conventional TSOA draws inspiration from the fleeting behavior of electrical circuits with energy storage components. Rosenbrock's direct rotation technique is used to improve the traditional TSOA performance against exploration and exploitation unbalance. First, the ITSOA performance is investigated in solving 23 classical benchmark functions, and the outcomes have shown the superior capability of the recommended algorithm in comparison with the conventional TSOA, DMO, SHO, GA, MRFO, and PSO methods. Also, the ITSOA proficiency is verified in solving the building energy optimization (BEO) problem for minimizing the energy usage of two simple and detailed buildings. The optimization results showed that the optimized solutions of ITSOA in single and multi-objective optimizations compared to conventional TSOA, DMO, SHO, GA, MRFO, and PSO obtained a lower value of the cost function. Also, the superiority of ITSOA has been confirmed to solve the BEO compared to previous methods. Moreover, the multi-objective optimization results have shown that ITSOA is able to determine the ultimate solution among the Pareto front set based on the fuzzy decision-making approach and building energy utilization decisions. [ABSTRACT FROM AUTHOR]

In the coming decade, as restrictions on fossil fuel usage become more stringent, investment in renewable energy projects presents an increasingly appealing opportunity. Evaluating investment attractiveness involves considering both profitability and investment risk. This study proposes a multi-objective mathematical model for identifying the optimal Renewable Energy Project Portfolio (REPP), aiming to maximize net present value while minimizing investment risk. The key innovation of this model is its incorporation of project lifetime and workforce employment considerations to discern the best REPP. To optimize the objective functions of this mathematical model, a hybrid meta-heuristic algorithm combining Artificial Immune System (AIS) and Artificial Fish Swarm (AFS) algorithms is introduced. Genuine data from a varied spectrum of renewable energy projects spanning 20 countries has been meticulously collected. The proposed model is optimized using this dataset, considering portfolio sizes of 3, 5, 10, and 15. The numerical results indicate that, at a specific investment risk threshold, the proposed hybrid algorithm outperforms both AIS and AFS in terms of profitability. Furthermore, the assessment of the geographical distribution of selected projects reveals a deliberate effort to avoid concentration in any specific region, demonstrating a commitment to identifying optimal investment opportunities globally. This research advances the understanding of renewable energy project portfolio optimization, providing valuable insights for investors, policymakers, and sustainable development practitioners. [ABSTRACT FROM AUTHOR]

In this paper, a novel Moth-Flame Optimization (MFO) algorithm, namely MFO algorithm enhanced by Multiple Improvement Strategies (MISMFO) is proposed for solving parameter optimization in Multi-Kernel Support Vector Regressor (MKSVR), and the MISMFO-MKSVR model is further employed to deal with the software effort estimation problems. In MISMFO, the logistic chaotic mapping is applied to increase initial population diversity, while the mutation and flame number phased reduction mechanisms are carried out to improve the search efficiency, as well the adaptive weight adjustment mechanism is used to accelerate convergence and balance exploration and exploitation. The MISMFO model is verified on fifteen benchmark functions and CEC 2020 test set. The results show that the MISMFO has advantages over other meta-heuristic algorithms and MFO variants in terms of convergence speed and accuracy. Additionally, the MISMFO-MKSVR model is tested by simulations on five software effort datasets and the results demonstrate that the proposed model has better performance in software effort estimation problem. The Matlab code of MISMFO can be found at https://github.com/loadstar1997/MISMFO. [ABSTRACT FROM AUTHOR]

In many engineering optimization problems, the number of function evaluations is severely limited by the time or cost constraints. These limitations present a significant challenge in the field of global optimization, because existing metaheuristic methods typically require a substantial number of function evaluations to find optimal solutions. This paper presents a new metaheuristic optimization algorithm that considers the information obtained by a radial basis function neural network (RBFNN) in terms of the objective function for guiding the search process. Initially, the algorithm uses the maximum design approach to strategically distribute a set of solutions across the entire search space. It then enters a cycle in which the RBFNN models the objective function values from the current solutions. The algorithm identifies and uses key neurons in the hidden layer that correspond to the highest objective function values to generate new solutions. The centroids and standard deviations of these neurons guide the sampling process, which continues until the desired number of solutions is reached. By focusing on the areas of the search space that yield high objective function values, the algorithm avoids exhaustive solution evaluations and significantly reduces the number of function evaluations. The effectiveness of the method is demonstrated through a comparison with popular metaheuristic algorithms across several test functions, where it consistently outperforms existing techniques, delivers higher-quality solutions, and improves convergence rates. [ABSTRACT FROM AUTHOR]

Parameter identification of solar photovoltaic (PV) cells is crucial for the PV system modeling. However, finding optimal parameters of PV models is an intractable problem due to the highly nonlinear characteristics between currents and voltages in different environments. To address this problem, whale optimization algorithm (WOA)-based meta-heuristic algorithm has turned out to be a feasible and effective approach. As a highly promising optimization algorithm, different enhanced WOA variants have been proposed. Nevertheless, there has been no comparative study of WOA and its variants for parameter identification of PV models so far. To further investigate and analyze the performance of WOA in the studied problem, this work applied and compared WOA and ten enhanced WOA variants for identifying five PV model parameters. Different evaluation indices including solution accuracy, search robustness, and convergence curve were employed to reveal their performance variation. Based on the simulation results, a multi-model statistical analysis with the Friedman test at a confidence level 0.05 was conducted to rank all algorithms. EWOA that hybridizes the sorting-based differential mutation operator and the Lévy flight strategy ranked first and its performance was further verified. Besides, according to the simulation results, possible effective improvement directions for WOA in tackling this intractable problem are concluded to guide future work. [ABSTRACT FROM AUTHOR]

Global optimization techniques are increasingly preferred over human-driven methods in the design of electromagnetic structures such as metasurfaces, and careful construction and parameterization of the physical structure is critical in ensuring computational efficiency and convergence of the optimization algorithm to a globally optimal solution. While many design variables in physical systems take discrete values, optimization algorithms often benefit from a continuous design space. This work demonstrates the use of level set functions as a continuous basis for designing material distributions for metasurface arrays and introduces an improved parameterization which is termed the periodic level set function. We explore the use of alternate norms in the definition of the level set function and define a new pseudo-inverse technique for upsampling basis coefficients with these norms. The level set method is compared to the fragmented parameterization and shows improved electromagnetic responses for two dissimilar cost functions: a narrowband objective and a broadband objective. Finally, we manufacture an optimized level set metasurface and measure its scattering parameters to demonstrate real-world performance. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is an extensive system of interrelated devices equipped with sensors to monitor and track real world objects, spanning several verticals, covering many different industries. The IoT's promise is capturing interest as its value in healthcare continues to grow, as it can overlay on top of challenges dealing with the rising burden of chronic disease management and an aging population. To address difficulties associated with IoT-enabled healthcare, we propose a secure routing protocol that combines a fuzzy logic system and the Whale Optimization Algorithm (WOA) hierarchically. The suggested method consists of two primary approaches: the fuzzy trust strategy and the WOA-inspired clustering methodology. The first methodology plays a critical role in determining the trustworthiness of connected IoT equipment. Furthermore, a WOA-based clustering framework is implemented. A fitness function assesses the likelihood of IoT devices acting as cluster heads. This formula considers factors such as centrality, range of communication, hop count, remaining energy, and trustworthiness. Compared with other algorithms, the proposed method outperformed them in terms of network lifespan, energy usage, and packet delivery ratio by 47%, 58%, and 17.7%, respectively. [ABSTRACT FROM AUTHOR]

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

This study examined the optimal size of an autonomous hybrid renewable energy system (HRES) for a residential application in Buea, located in the southwest region of Cameroon. Two hybrid systems, PV-Battery and PV-Battery-Diesel, have been evaluated in order to determine which was the better option. The goal of this research was to propose a dependable, low-cost power source as an alternative to the unreliable and highly unstable electricity grid in Buea. The decision criterion for the proposed HRES was the cost of energy (COE), while the system's dependability constraint was the loss of power supply probability (LPSP). The crayfish optimization algorithm (COA) was used to optimize the component sizes of the proposed HRES, and the results were contrasted to those obtained from the whale optimization algorithm (WOA), sine cosine algorithm (SCA), and grasshopper optimization algorithm (GOA). The MATLAB software was used to model the components, criteria, and constraints of this single-objective optimization problem. The results obtained after simulation for LPSP of less than 1% showed that the COA algorithm outperformed the other three techniques, regardless of the configuration. Indeed, the COE obtained using the COA algorithm was 0.06%, 0.12%, and 1% lower than the COE provided by the WOA, SCA, and GOA algorithms, respectively, for the PV-Battery configuration. Likewise, for the PV-Battery-Diesel configuration, the COE obtained using the COA algorithm was 0.065%, 0.13%, and 0.39% lower than the COE provided by the WOA, SCA, and GOA algorithms, respectively. A comparative analysis of the outcomes obtained for the two configurations indicated that the PV-Battery-Diesel configuration exhibited a COE that was 4.32% lower in comparison to the PV-Battery configuration. Finally, the impact of the LPSP reduction on the COE was assessed in the PV-Battery-Diesel configuration. The decrease in LPSP resulted in an increase in COE owing to the nominal capacity of the diesel generator. [ABSTRACT FROM AUTHOR]

The energy management (EM) solution of the multi-microgrids (MMGs) is a crucial task to provide more flexibility, reliability, and economic benefits. However, the energy management (EM) of the MMGs became a complex and strenuous task with high penetration of renewable energy resources due to the stochastic nature of these resources along with the load fluctuations. In this regard, this paper aims to solve the EM problem of the MMGs with the optimal inclusion of photovoltaic (PV) systems, wind turbines (WTs), and biomass systems. In this regard, this paper proposed an enhanced Jellyfish Search Optimizer (EJSO) for solving the EM of MMGs for the 85-bus MMGS system to minimize the total cost, and the system performance improvement concurrently. The proposed algorithm is based on the Weibull Flight Motion (WFM) and the Fitness Distance Balance (FDB) mechanisms to tackle the stagnation problem of the conventional JSO technique. The performance of the EJSO is tested on standard and CEC 2019 benchmark functions and the obtained results are compared to optimization techniques. As per the obtained results, EJSO is a powerful method for solving the EM compared to other optimization method like Sand Cat Swarm Optimization (SCSO), Dandelion Optimizer (DO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and the standard Jellyfish Search Optimizer (JSO). The obtained results reveal that the EM solution by the suggested EJSO can reduce the cost by 44.75% while the system voltage profile and stability are enhanced by 40.8% and 10.56%, respectively. [ABSTRACT FROM AUTHOR]

In metropolitan cities, it is very complicated to govern the optimum routes for garbage collection vehicles due to high waste production and very dense population. Furthermore, wrongly designed routes are the source of wasting time, fuel and other resources in the collection of municipal trash procedure. The Vehicle Routing Problem (VRP) published between 2011 and 2023 was systematically analysed. The majority of the surveyed research compute the waste collecting problems using metaheuristic approaches. This manuscript serves two purposes: first, categorising the VRP and its variants in the field of waste collection; second, examining the role played by most of the metaheuristics in the solution of the VRP problems for a waste collection. Three case study of Asia continent has been analysed and the results show that the metaheuristic algorithms have the capability in providing good results for large-scale data. Lastly, some promising paths ranging from highlighting research gap to future scope are drawn to encourage researchers to conduct their research work in the field of waste management route problems. [ABSTRACT FROM AUTHOR]

Sports image classification is a complex undertaking that necessitates the utilization of precise and robust techniques to differentiate between various sports activities. This study introduces a novel approach that combines the deep neural network (DNN) with a modified metaheuristic algorithm known as novel tuna swarm optimization (NTSO) for the purpose of sports image classification. The DNN is a potent technique capable of extracting high-level features from raw images, while the NTSO algorithm optimizes the hyperparameters of the DNN, including the number of layers, neurons, and activation functions. Through the application of NTSO to the DNN, a finely-tuned network is developed, exhibiting exceptional performance in sports image classification. Rigorous experiments have been conducted on an extensive dataset of sports images, and the obtained results have been compared against other state-of-the-art methods, including Attention-based graph convolution-guided third-order hourglass network (AGTH-Net), particle swarm optimization algorithm (PSO), YOLOv5 backbone and SPD-Conv, and Depth Learning (DL). According to a fivefold cross-validation technique, the DNN/NTSO model provided remarkable precision, recall, and F1-score results: 97.665 ± 0.352%, 95.400 ± 0.374%, and 0.8787 ± 0.0031, respectively. Detailed comparisons reveal the DNN/NTSO model's superiority toward various performance metrics, solidifying its standing as a top choice for sports image classification tasks. Based on the practical dataset, the DNN/NTSO model has been successfully evaluated in real-world scenarios, showcasing its resilience and flexibility in various sports categories. Its capacity to uphold precision in dynamic settings, where elements like lighting, backdrop, and motion blur are prominent, highlights its utility. The model's scalability and efficiency in analyzing images from live sports competitions additionally validate its suitability for integration into real-time sports analytics and media platforms. This research not only confirms the theoretical superiority of the DNN/NTSO model but also its pragmatic effectiveness in a wide array of demanding sports image classification assignments. [ABSTRACT FROM AUTHOR]

This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue. Under standard and conservative operating settings, the OPF problem is modeled utilizing a range of objectives, constraints, and formulations. Five case studies have been conducted using IEEE 30-bus and IEEE 118-bus standard test systems to evaluate the effectiveness and robustness of the proposed algorithms. A performance evaluation procedure is suggested to compare the optimization techniques' strength and resilience. A fresh comparison methodology is created to compare the proposed methodologies with other well-known methodologies. Compared to previously reported optimization algorithms in the literature, the obtained results show the potential of GBO to solve various OPF problems efficiently. [ABSTRACT FROM AUTHOR]

Image segmentation techniques play a vital role in aiding COVID-19 diagnosis. Multi-threshold image segmentation methods are favored for their computational simplicity and operational efficiency. Existing threshold selection techniques in multi-threshold image segmentation, such as Kapur based on exhaustive enumeration, often hamper efficiency and accuracy. The whale optimization algorithm (WOA) has shown promise in addressing this challenge, but issues persist, including poor stability, low efficiency, and accuracy in COVID-19 threshold image segmentation. To tackle these issues, we introduce a Latin hypercube sampling initialization-based multi-strategy enhanced WOA (CAGWOA). It incorporates a COS sampling initialization strategy (COSI), an adaptive global search approach (GS), and an all-dimensional neighborhood mechanism (ADN). COSI leverages probability density functions created from Latin hypercube sampling, ensuring even solution space coverage to improve the stability of the segmentation model. GS widens the exploration scope to combat stagnation during iterations and improve segmentation efficiency. ADN refines convergence accuracy around optimal individuals to improve segmentation accuracy. CAGWOA's performance is validated through experiments on various benchmark function test sets. Furthermore, we apply CAGWOA alongside similar methods in a multi-threshold image segmentation model for comparative experiments on lung X-ray images of infected patients. The results demonstrate CAGWOA's superiority, including better image detail preservation, clear segmentation boundaries, and adaptability across different threshold levels. [ABSTRACT FROM AUTHOR]

The RIME optimization algorithm (RIME) represents an advanced optimization technique. However, it suffers from issues such as slow convergence speed and susceptibility to falling into local optima. In response to these shortcomings, we propose a multi-strategy enhanced version known as the multi-strategy improved RIME optimization algorithm (MIRIME). Firstly, the Tent chaotic map is utilized to initialize the population, laying the groundwork for global optimization. Secondly, we introduce an adaptive update strategy based on leadership and the dynamic centroid, facilitating the swarm's exploitation in a more favorable direction. To address the problem of population scarcity in later iterations, the lens imaging opposition-based learning control strategy is introduced to enhance population diversity and ensure convergence accuracy. The proposed centroid boundary control strategy not only limits the search boundaries of individuals but also effectively enhances the algorithm's search focus and efficiency. Finally, to demonstrate the performance of MIRIME, we employ CEC 2017 and CEC 2022 test suites to compare it with 11 popular algorithms across different dimensions, verifying its effectiveness. Additionally, to assess the method's practical feasibility, we apply MIRIME to solve the three-dimensional path planning problem for unmanned surface vehicles. Experimental results indicate that MIRIME outperforms other competing algorithms in terms of solution quality and stability, highlighting its superior application potential. [ABSTRACT FROM AUTHOR]

Data categorization is a top concern in medical data to predict and detect illnesses; thus, it is applied in modern healthcare informatics. In modern informatics, machine learning and deep learning models have enjoyed great attention for categorizing medical data and improving illness detection. However, the existing techniques, such as features with high dimensionality, computational complexity, and long-term execution duration, raise fundamental problems. This study presents a novel classification model employing metaheuristic methods to maximize efficient positives on Chronic Kidney Disease diagnosis. The medical data is initially massively pre-processed, where the data is purified with various mechanisms, including missing values resolution, data transformation, and the employment of normalization procedures. The focus of such processes is to leverage the handling of the missing values and prepare the data for deep analysis. We adopt the Binary Grey Wolf Optimization method, a reliable subset selection feature using metaheuristics. This operation is aimed at improving illness prediction accuracy. In the classification step, the model adopts the Extreme Learning Machine with hidden nodes through data optimization to predict the presence of CKD. The complete classifier evaluation employs established measures, including recall, specificity, kappa, F-score, and accuracy, in addition to the feature selection. Data related to the study show that the proposed approach records high levels of accuracy, which is better than the existing models. [ABSTRACT FROM AUTHOR]

One of the major challenges in the civil engineering sector is the durability of reinforced concrete structures against carbonation during the physico-chemical process of interaction of hydrated cementitious composites with carbon dioxide. This aggressive process causes carbon penetration into the reinforcement part, which affects the behavior of the structure during its lifetime due to corrosion risk. A countermeasure is using alternative cementitious materials to improve concrete texture and resist increased carbonation depth (CD). Considering that the CD test requires a long time and a skilled technician, this study strives to provide an alternative approach by moving from traditional laboratory-based methods towards artificial intelligence (AI) techniques for modeling the CD of sustainable concrete containing fly ash (CCFA). Despite the development of single AI models so far, it is undeniable that utilizing metaheuristic optimization techniques in the form of hybrid models can improve their performance. To this end, a new hybrid model from the integration of biogeography-based optimization (BBO) technique with artificial neural network (ANN) is developed for the first time to estimate the CD of CCFA. The error distribution results revealed that 59% of the ANN predictions had errors within the range of (− 1 mm, 1 mm], while the corresponding percentage for the ANN-BBO predictions was 70%, indicating an 11% reduction in the prediction errors by the proposed hybrid model. Furthermore, A10-index highlighted a performance improvement of 78% for the hybrid model, which met the closeness of the predicted values to the observed ones, so that the value of this index for models of ANN and ANN-BBO was 0.5019 and 0.8947, respectively. Analyzing the cross-validation confirmed the reliability and generalizability of the developed model. Also, the three most influential variables in estimating the CD were exposure time (27%), carbon dioxide concentration (22%), and water/binder (18%), respectively. Finally, the superiority of the ANN-BBO model was verified by comparing it with previous studies' models. [ABSTRACT FROM AUTHOR]

Logistics distribution is one of the main sources of carbon dioxide emissions at present, and there are also such distribution problems in the shipbuilding process. With the increasing attention paid to environmental problems, how to effectively reduce the energy consumption of block transportation and improve the utilization rate of resources in the factory is the key problem that China's shipbuilding industry needs to solve at present. This article considers the time windows for block transportation tasks, as well as the self-loading constraints of different types of flat cars, and establishes an optimization model that minimizes the empty transport time and energy consumption of the flat cars as the optimization objective. Then, an Improved Genetic Whale Optimization Algorithm is designed, which combines the cross and mutation ideas of genetic algorithms and proposes a whale individual position updating mechanism under a mixed strategy. Furthermore, the performance and computational efficiency of the algorithm are verified through comparative analysis with other classical optimization algorithms on standard test examples. Finally, the shipyard's block transportation example proves that the energy-saving ship block transportation scheduling method can effectively improve the efficiency of shipbuilding enterprise's block transportation and reduce the energy consumption in the block transportation process. It proves the engineering practicality of the green dispatching method proposed in this paper, which can further provide a decision-making method for shipyard managers. [ABSTRACT FROM AUTHOR]

Due to the current environmental situation and human health, a green manufacturing system is very essential in the manufacturing world. Several researchers have developed various types of green manufacturing models by considering green products, green investments, carbon emission taxes, etc. Motivated by this topic, a green production model is formulated by considering selling price, time, warranty period and green level dependent demand with a carbon emission tax policy. Also, the production rate of the system is an unknown function of time. Per unit production cost of the products is taken as increasing function of production rate and green level of the products. In our proposed model, carbon emission rate is taken as linear function of time. Then, an optimization problem of the production model is constructed. To validate of our proposed model, a numerical example is considered and solved it by AHA. Further, other five metaheuristics algorithms (AEFA, FA, GWOA, WOA and EOA) are taken to compare the results obtained from AHA. Also, concavity of the average profit function and convergence graph of different metaheuristics algorithms are presented. Finally, a sensitivity analysis is carried out to investigate the impact of different system parameters on our optimal policy and reach a fruitful conclusion from this study. [ABSTRACT FROM AUTHOR]

Economic development relies on access to electrical energy, which is crucial for society's growth. However, power shortages are challenging due to non-renewable energy depletion, unregulated use, and a lack of new energy sources. Ethiopia's Debre Markos distribution network experiences over 800 h of power outages annually, causing financial losses and resource waste on diesel generators (DGs) for backup use. To tackle these concerns, the present study suggests a hybrid power generation system, which combines solar and biogas resources, and integrates Superconducting Magnetic Energy Storage (SMES) and Pumped Hydro Energy Storage (PHES) technologies into the system. The study also thoroughly analyzes the current and anticipated demand connected to the distribution network using a backward/forward sweep load flow analysis method. The results indicate that the total power loss has reached its absolute maximum, and the voltage profiles of the networks have dropped below the minimal numerical values recommended by the Institute of Electrical and Electronics Engineers (IEEE) standards (i.e., 0.95–1.025 p.u.). After reviewing the current distribution network's operation, additional steps were taken to improve its effectiveness, using metaheuristic optimization techniques to account for various objective functions and constraints. In the results section, it is demonstrated that the whale optimization algorithm (WOA) outperforms other metaheuristic optimization techniques across three important objective functions: financial, reliability, and greenhouse gas (GHG) emissions. This comparison is based on the capability of the natural selection whale optimization algorithm (NSWOA) to achieve the best possible values for four significant metrics: Cost of Energy (COE), Net Present Cost (NPC), Loss of Power Supply Probability (LPSP), and GHG Emissions. The NSWOA achieved optimal values for these metrics, namely 0.0812 €/kWh, 3.0017 × 106 €, 0.00875, and 7.3679 × 106 kg reduced, respectively. This is attributable to their thorough economic, reliability, and environmental evaluation. Finally, the forward/backward sweep load flow analysis employed during the proposed system's integration significantly reduced the impact of new energy resources on the distribution network. This was evident in the reduction of total power losses from 470.78 to 18.54 kW and voltage deviation from 6.95 to 0.35 p.u., as well as the voltage profile of the distribution system being swung between 1 and 1.0234 p.u., which now comply with the standards set by the IEEE. Besides, a comparison of the cost and GHG emission efficiency of the proposed hybrid system with existing (grid + DGs) and alternative (only DGs) scenarios was done. The findings showed that, among the scenarios examined, the proposed system is the most economical and produces the least amount of GHG emissions. [ABSTRACT FROM AUTHOR]

This paper proposes an approach to enhance the differentiation task between benign and malignant Breast Tumors (BT) using histopathology images from the BreakHis dataset. The main stages involve preprocessing, which encompasses image resizing, data partitioning (training and testing sets), followed by data augmentation techniques. Both feature extraction and classification tasks are employed by a Custom CNN. The experimental results show that the proposed approach using the Custom CNN model exhibits better performance with an accuracy of 84% than applying the same approach using other pretrained models, including MobileNetV3, EfficientNetB0, Vgg16, and ResNet50V2, that present relatively lower accuracies, ranging from 74 to 82%; these four models are used as both feature extractors and classifiers. To increase the accuracy and other performance metrics, Grey Wolf Optimization (GWO), and Modified Gorilla Troops Optimization (MGTO) metaheuristic optimizers are applied to each model separately for hyperparameter tuning. In this case, the experimental results show that the Custom CNN model, refined with MGTO optimization, reaches an exceptional accuracy of 93.13% in just 10 iterations, outperforming the other state-of-the-art methods, and the other four used pretrained models based on the BreakHis dataset. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

The emergence of microgrids arises from the growing integration of Renewable Energy Resources (RES) and Energy Storage Systems (ESSs) into Distribution Networks (DNs). Effective integration, coordination, and control of Multiple Microgrids (MMGs) whereas navigating the complexities of energy transition within this context poses a significant challenge. The dynamic operation of MMGs is a challenge faced by the traditional distributed hierarchical control techniques. The application of Artificial Intelligence (AI) techniques is a promising way to improve the control and dynamic operation of MMGs in future smart DNs. In this paper, an innovative hybrid optimization technique that originates from Cheetah Optimization (CHO) and Particle Swarm Optimization (PSO) techniques is proposed, known as HYCHOPSO. Extensive benchmark testing validates HYCHOPSO's superiority over CHO and PSO in terms of convergence performance. The objective for this hybridization stems from the complementary strengths of CHO and PSO. CHO demonstrates rapid convergence in local search spaces, while PSO excels in global exploration. By combining these techniques, the aim is to leverage their respective advantages and enhance the algorithm's overall performance in addressing complex optimization problems. The contribution of this paper offering a unique approach to addressing optimization challenges in microgrid systems. Through a comprehensive comparative study, HYCHOPSO is evaluated against various metaheuristic optimization approaches, demonstrating superior performance, particularly in optimizing the design parameters of Proportional-Integral (PI) controllers for hierarchical control systems within microgrids. This contribution expands the repertoire of available optimization methodologies and offers practical solutions to critical challenges in microgrid optimization, enhancing the efficiency, reliability, and sustainability of microgrid operations. HYCHOPSO achieves its optimal score within fewer than 50 iterations, unlike CHO, GWO, PSO, Hybrid-GWO-PSO, and SSIA-PSO, which stabilize after around 200 iterations. Across various benchmark functions, HYCHOPSO consistently demonstrates the lowest mean values, attains scores closer to the optimal values of the benchmark functions, underscoring its robust convergence capabilities.the proposed HYCHOPSO algorithm, paired with a PI controller for distributed hierarchical control, minimizes errors and enhances system reliability during dynamic MMG operations. Using HYCHOPSO framework, an accurate power sharing, voltage/frequency stability, seamless grid-to-island transition, and smooth resynchronization are achieved. This enhances the real application's reliability, flexibility, scalability and robustness. [ABSTRACT FROM AUTHOR]

Sand cat swarm optimization algorithm is a meta-heuristic algorithm created to replicate the hunting behavior observed by sand cats. The presented sand cat swarm optimization method (CWXSCSO) addresses the issues of low convergence precision and local optimality in the standard sand cat swarm optimization algorithm. It accomplished this through the utilization of elite decentralization and a crossbar approach. To begin with, a novel dynamic exponential factor is introduced. Furthermore, throughout the developmental phase, the approach of elite decentralization is incorporated to augment the capacity to transcend the confines of the local optimal. Ultimately, the crossover technique is employed to produce novel solutions and augment the algorithm's capacity to emerge from local space. The techniques were evaluated by performing a comparison with 15 benchmark functions. The CWXSCSO algorithm was compared with six advanced upgraded algorithms using CEC2019 and CEC2021. Statistical analysis, convergence analysis, and complexity analysis use statistics for assessing it. The CWXSCSO is employed to verify its efficacy in solving engineering difficulties by handling six traditional engineering optimization problems. The results demonstrate that the upgraded sand cat swarm optimization algorithm exhibits higher global optimization capability and demonstrates proficiency in dealing with real-world optimization applications. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

In this research paper, the intelligent learning abilities of the gray wolf optimization (GWO), multi-verse optimization (MVO), moth fly optimization, particle swarm optimization (PSO), and whale optimization algorithm (WOA) metaheuristic techniques and the response surface methodology (RSM) has been studied in the prediction of the mechanical properties of self-healing concrete. Bio-concrete technology stimulated by the concentration of bacteria has been utilized as a sustainable structural concrete for the future of the built environment. This is due to the recovery tendency of the concrete structures after noticeable structural failures. However, it requires a somewhat expensive exercise and technology to create the medium for the growth of the bacteria needed for this self-healing ability. The method of data gathering, analysis and intelligent prediction has been adopted to propose parametric relationships between the bacteria usage and the concrete performance in terms of strength and durability. This makes is cheaper to design self-healing concrete structures based on the optimized mathematical relationships and models proposed from this exercise. The performance of the models was tested by using the coefficient of determination (R2), root mean squared errors, mean absolute errors, mean squared errors, variance accounted for and the coefficient of error. At the end of the prediction protocol and model performance evaluation, it was found that the classified metaheuristic techniques outclassed the RSM due their ability to mimic human and animal genetics of mutation. Furthermore, it can be finally remarked that the GWO outclassed the other methods in predicting the concrete slump (Sl) with R2 of 0.998 and 0.989 for the train and test, respectively, the PSO outclassed the rest in predicting the flexural strength with R2 of 0.989 and 0.937 for train and test, respectively and the MVO outclassed the others in predicting the compressive strength with R2 of 0.998 and 0.958 for train and test, respectively. [ABSTRACT FROM AUTHOR]

Concrete-filled steel tube columns (CFSTCs) are important elements in the construction sector and predictive analysis of their behavior is essential. Recent works have revealed the potential of metaheuristic-assisted approximators for this purpose. The main idea of this paper, therefore, is to introduce a novel integrative model for appraising the axial compression capacity (Pu) of CFSTCs. The proposed model represents an artificial neural network (ANN) supervised by satin bowerbird optimizer (SBO). In other words, this metaheuristic algorithm trains the ANN optimally to find the best contribution of input parameters to the Pu. In this sense, column length and the compressive strength of concrete, as well as the characteristics of the steel tube (i.e., diameter, thickness, yield stress, and ultimate stress), are considered input data. The prediction results are compared to five ANNs supervised by backtracking search algorithm (BSA), earthworm optimization algorithm (EWA), social spider algorithm (SOSA), salp swarm algorithm (SSA), and wind-driven optimization. Evaluating various accuracy indicators showed that the proposed model surpassed all of them in both learning and reproducing the Pu pattern. The obtained values of mean absolute percentage error of the SBO-ANN was 2.3082% versus 4.3821%, 17.4724%, 15.7898%, 4.2317%, and 3.6884% for the BSA-ANN, EWA-ANN, SOSA-ANN, SSA-ANN and WDA-ANN, respectively. The higher accuracy of the SBO-ANN against several hybrid models from earlier literature was also deduced. Moreover, the outcomes of principal component analysis on the dataset showed that the yield stress, diameter, and ultimate stress of the steel tube are the three most important factors in Pu prediction. A predictive formula is finally derived from the optimized SBO-ANN by extracting and organizing the weights and biases of the ANN. Owing to the accurate estimation shown by this model, the derived formula can reliably predict the Pu of concrete-filled steel tube columns. [ABSTRACT FROM AUTHOR]

Analyzing the stability of footings is a significant step in civil/geotechnical engineering projects. In this work, two novel predictive tools are suggested based on an artificial neural network (ANN) to analyze the bearing capacity of a footing installed on a two-layered soil mass. To this end, backtracking search algorithm (BSA) and equilibrium optimizer (EO) are employed to train the ANN for approximating the stability value (SV) of the system. After executing a set of finite element analyses, the settlement values lower/higher than 5 cm are considered to indicate the stability/failure of the system. The results demonstrated the efficiency of these algorithms in fulfilling the assigned task. In detail, the training error of the ANN (in terms of root mean square error—RMSE)) dropped from 0.3585 to 0.3165 (11.72%) and 0.2959 (17.46%) by applying the BSA and EO, respectively. Moreover, the prediction accuracy of the ANN climbed from 93.7 to 94.3% and 94.1% (in terms of area under the receiving operating characteristics curve—AUROC). A comparison between the elite complexities of these algorithms showed that the EO enjoys a larger accuracy, while BSA is a more time-effective optimizer. Lastly, an explicit mathematical formula is derived from the EO-ANN model to be conveniently used in predicting the SV. [ABSTRACT FROM AUTHOR]

This study presents an advanced metaheuristic approach termed the Enhanced Gorilla Troops Optimizer (EGTO), which builds upon the Marine Predators Algorithm (MPA) to enhance the search capabilities of the Gorilla Troops Optimizer (GTO). Like numerous other metaheuristic algorithms, the GTO encounters difficulties in preserving convergence accuracy and stability, notably when tackling intricate and adaptable optimization problems, especially when compared to more advanced optimization techniques. Addressing these challenges and aiming for improved performance, this paper proposes the EGTO, integrating high and low-velocity ratios inspired by the MPA. The EGTO technique effectively balances exploration and exploitation phases, achieving impressive results by utilizing fewer parameters and operations. Evaluation on a diverse array of benchmark functions, comprising 23 established functions and ten complex ones from the CEC2019 benchmark, highlights its performance. Comparative analysis against established optimization techniques reveals EGTO's superiority, consistently outperforming its counterparts such as tuna swarm optimization, grey wolf optimizer, gradient based optimizer, artificial rabbits optimization algorithm, pelican optimization algorithm, Runge Kutta optimization algorithm (RUN), and original GTO algorithms across various test functions. Furthermore, EGTO's efficacy extends to addressing seven challenging engineering design problems, encompassing three-bar truss design, compression spring design, pressure vessel design, cantilever beam design, welded beam design, speed reducer design, and gear train design. The results showcase EGTO's robust convergence rate, its adeptness in locating local/global optima, and its supremacy over alternative methodologies explored. [ABSTRACT FROM AUTHOR]

This study presents the K-means clustering-based grey wolf optimizer, a new algorithm intended to improve the optimization capabilities of the conventional grey wolf optimizer in order to address the problem of data clustering. The process that groups similar items within a dataset into non-overlapping groups. Grey wolf hunting behaviour served as the model for grey wolf optimizer, however, it frequently lacks the exploration and exploitation capabilities that are essential for efficient data clustering. This work mainly focuses on enhancing the grey wolf optimizer using a new weight factor and the K-means algorithm concepts in order to increase variety and avoid premature convergence. Using a partitional clustering-inspired fitness function, the K-means clustering-based grey wolf optimizer was extensively evaluated on ten numerical functions and multiple real-world datasets with varying levels of complexity and dimensionality. The methodology is based on incorporating the K-means algorithm concept for the purpose of refining initial solutions and adding a weight factor to increase the diversity of solutions during the optimization phase. The results show that the K-means clustering-based grey wolf optimizer performs much better than the standard grey wolf optimizer in discovering optimal clustering solutions, indicating a higher capacity for effective exploration and exploitation of the solution space. The study found that the K-means clustering-based grey wolf optimizer was able to produce high-quality cluster centres in fewer iterations, demonstrating its efficacy and efficiency on various datasets. Finally, the study demonstrates the robustness and dependability of the K-means clustering-based grey wolf optimizer in resolving data clustering issues, which represents a significant advancement over conventional techniques. In addition to addressing the shortcomings of the initial algorithm, the incorporation of K-means and the innovative weight factor into the grey wolf optimizer establishes a new standard for further study in metaheuristic clustering algorithms. The performance of the K-means clustering-based grey wolf optimizer is around 34% better than the original grey wolf optimizer algorithm for both numerical test problems and data clustering problems. [ABSTRACT FROM AUTHOR]

Artificial Neural Networks (ANNs) have been used in a multitude of real-world applications given their predictive capabilities, and algorithms based on gradient descent, such as Backpropagation (BP) and variants, are usually considered for their optimisation. However, these algorithms have been shown to get stuck at local optima, and they require a cautious design of the architecture of the model. This paper proposes a novel memetic training method for simultaneously learning the ANNs structure and weights based on the Coral Reef Optimisation algorithms (CROs), a global-search metaheuristic based on corals' biology and coral reef formation. Three versions based on the original CRO combined with a Local Search procedure are developed: (1) the basic one, called Memetic CRO; (2) a statistically guided version called Memetic SCRO (M-SCRO) that adjusts the algorithm parameters based on the population fitness; (3) and, finally, an improved Dynamic Statistically-driven version called Memetic Dynamic SCRO (M-DSCRO). M-DSCRO is designed with the idea of improving the M-SCRO version in the evolutionary process, evaluating whether the fitness distribution of the population of ANNs is normal to automatically decide the statistic to be used for assigning the algorithm parameters. Furthermore, all algorithms are adapted to the design of ANNs by means of the most suitable operators. The performance of the different algorithms is evaluated with 40 classification datasets, showing that the proposed M-DSCRO algorithm outperforms the other two versions on most of the datasets. In the final analysis, M-DSCRO is compared against four state-of-the-art methods, demonstrating its superior efficacy in terms of overall accuracy and minority class performance. [ABSTRACT FROM AUTHOR]

Heart Diseases have the highest mortality worldwide, necessitating precise predictive models for early risk assessment. Much existing research has focused on improving model accuracy with single datasets, often neglecting the need for comprehensive evaluation metrics and utilization of different datasets in the same domain (heart disease). This research introduces a heart disease risk prediction approach by harnessing the whale optimization algorithm (WOA) for feature selection and implementing a comprehensive evaluation framework. The study leverages five distinct datasets, including the combined dataset comprising the Cleveland, Long Beach VA, Switzerland, and Hungarian heart disease datasets. The others are the Z-AlizadehSani, Framingham, South African, and Cleveland heart datasets. The WOA-guided feature selection identifies optimal features, subsequently integrated into ten classification models. Comprehensive model evaluation reveals significant improvements across critical performance metrics, including accuracy, precision, recall, F1 score, and the area under the receiver operating characteristic curve. These enhancements consistently outperform state-of-the-art methods using the same dataset, validating the effectiveness of our methodology. The comprehensive evaluation framework provides a robust assessment of the model's adaptability, underscoring the WOA's effectiveness in identifying optimal features in multiple datasets in the same domain. [ABSTRACT FROM AUTHOR]

The purpose of the present study is to predict and draw up non-grain cultivated land (NCL) susceptibility map based on optimized Extreme Gradient Boosting (XGBoost) model using the Particle Swarm Optimization (PSO) metaheuristic algorithm. In order to, a total of 184 NCL areas were identified based on historical records, and a total of 16 NCL susceptibility conditioning factors (NCLSCFs) were considered, based on both a systematic literature survey and local environmental conditions. The results showed that the XGBoost model optimized by PSO performed well in comparison to other machine learning algorithms; the values of sensitivity, specificity, PPV, NPV, and AUC are 0.93, 0.89, 0.88, 0.93, and 0.96, respectively. Slope, rainfall, fault density, distance from fault and drainage density are most important variables. According to the results of this study, the use of meta-innovative algorithms such as PSO can greatly enhance the ability of machine learning models. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

Parkinson's disease (PD) is a progressively debilitating neurodegenerative disorder that primarily affects the dopaminergic system in the basal ganglia, impacting millions of individuals globally. The clinical manifestations of the disease include resting tremors, muscle rigidity, bradykinesia, and postural instability. Diagnosis relies mainly on clinical evaluation, lacking reliable diagnostic tests and being inherently imprecise and subjective. Early detection of PD is crucial for initiating treatments that, while unable to cure the chronic condition, can enhance the life quality of patients and alleviate symptoms. This study explores the potential of utilizing long-short term memory neural networks (LSTM) with attention mechanisms to detect Parkinson's disease based on dual-task walking test data. Given that the performance of networks is significantly inductance by architecture and training parameter choices, a modified version of the recently introduced crayfish optimization algorithm (COA) is proposed, specifically tailored to the requirements of this investigation. The proposed optimizer is assessed on a publicly accessible real-world clinical gait in Parkinson's disease dataset, and the results demonstrate its promise, achieving an accuracy of 87.4187 % for the best-constructed models. [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]

Metaheuristic algorithms, widely applied across various domains due to their simplicity and strong optimization capabilities, play a crucial role in problem-solving. While the Aquila Optimizer is recognized for its effectiveness, it often exhibits slow convergence rates and susceptibility to local optima in certain scenarios. To address these concerns, this paper introduces an enhanced version, termed Tent-enhanced Aquila Optimizer (TEAO). TEAO incorporates the Tent chaotic map to initialize the Aquila population, promoting a more uniform distribution within the solution space. To balance exploration and exploitation, novel formulas are proposed, accelerating convergence while ensuring precision. The effectiveness of the TEAO algorithm is validated through a comprehensive comparison with 14 state-of-the-art algorithms using 23 classical benchmark test functions. Additionally, to assess the practical feasibility of the approach, TEAO is applied to six constrained engineering problems and benchmarked against the performance of the same 14 algorithms. All experimental results consistently demonstrate that TEAO outperforms other advanced algorithms in terms of solution quality and stability, establishing it as a more competitive choice for optimization tasks. [ABSTRACT FROM AUTHOR]

Naked mole-rat algorithm (NMRA) is a swarm intelligence-based algorithm that draws inspiration from the mating behaviour of mole rats (workers and breeders). This approach, which is based on the ability of breeders to reproduce with the queen, has been utilized to tackle optimization problems. The algorithm, however, suffers from local optima stagnation problem and a slower rate of convergence in order to provide gobal optimal solution. This study suggests attraction and repulsion strategy based NMRA (ARNMRA) along with self-adaptive properties to avoid trapping of solution in local optima. This strategy is utilized to create new breeder rat solutions and mating factor (λ) is made self-adaptive using simulated annealing (sa) based mutation operator. ARNMRA is evaluated on CEC 2005 numerical benchmark problems and found to be superior to other algorithms, including well-known ones like selective operation based GWO (SOGWO), opposition based laplacian equilibrium optimizer (OB-L-EO), improved whale optimization algorithm (IWOA), success-history based adaptive DE (SHADE) and original NMRA. Further, according to experimental results, the performance of ARNMRA is likewise superior to the NMRA for the CEC 2019 and CEC 2020 numerical problems. Convergence profiles and statistical tests (rank-sum test and Friedman test) are employed further to validate the experimental results. Moreover, this article extends the application of ARNMRA to address the data gathering aspect in mobile wireless sensor networks (MWSNs) with the goal of prolonging network lifetime and enhancing energy efficiency. In this MWSN-based protocol, a sensor node is elected as a cluster head based on factors like mobility, residual energy, and connection time. The protocol aims to maximize the system lifetime by efficiently collecting data from all sensors and transmitting it to the base station. The study emphasizes the significance of considering dynamic node densities and speed when designing effective data-gathering protocols for MWSNs. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms distinguish themselves from conventional optimization methods owing to their intrinsic adaptability and straightforward implementation. Among them, the sine cosine algorithm (SCA) is lauded for its ability to transition seamlessly between exploration and exploitation phases throughout the optimization process. However, there exists potential for enhancing the balance that SCA maintains between exploration and exploitation. To augment the proficiency in global optimization of SCA, an innovative strategy—nSCA—that integrates the roulette wheel selection (RWS) with opposition-based learning was formulated. The robustness of nSCA was rigorously evaluated against leading-edge methods such as the genetic algorithm (GA), particle swarm optimization, moth-flame optimization, ant lion optimization, and multi-verse optimizer, as well as the foundational SCA. This evaluation included benchmarks set by both CEC 2019 and CEC 2021 test functions. Additionally, the performance of nSCA was confirmed through numerous practical optimization problems, emphasizing its effectiveness in applied settings. In all evaluations, nSCA consistently showcased superior performance compared to its evolutionary algorithm counterparts, delivering top-tier solutions for both benchmark functions and real-world optimization challenges. Given this compelling evidence, one can posit that nSCA serves as a strong candidate for addressing intricate optimization challenges found in real-world contexts, regardless of whether they are of a discrete or continuous nature. [ABSTRACT FROM AUTHOR]

The present study focuses on the problem of vehicle routing with limited capacity, with the objective of minimizing the transportation distance required to serve h clients with predetermined locations and needs. The aim is to create k trips that cover the shortest possible distance. To achieve this goal, a hybrid whale optimization algorithm (hGWOA) is proposed, which combines the whale optimization algorithm (WOA) with the grey wolf optimizer (GWO). The proposed hybrid model is comprised of two main steps. First step, the GWO's hunting mechanism is integrated transitioning to the utilization phase of WOA, and a newly devised state is introduced that is linked to GWO. In the second step, a novel technique is incorporated into the exploration mission phase to enhance the resolve after per iteration. The algorithm's performance is assessed and compared with other modern algorithms, including the GWO, WOA, ant lion optimizer (ALO), and dragonfly algorithm (DA) using 23 benchmark test functions and CEC2017 benchmark test function. The results indicate that the hybrid hGWOA method outperforms other algorithms in terms of delivery distance optimization for scenarios involving scale and complexity. These findings are corroborated through case studies related to cement delivery and a real-world scenario in Viet Nam. [ABSTRACT FROM AUTHOR]

The whale optimization algorithm has received much attention since its introduction due to its outstanding performance. However, like other algorithms, the whale optimization algorithm still suffers from some classical problems. To address the issues of slow convergence, low optimization precision, and susceptibility to local convergence in the whale optimization algorithm (WOA). Defining the optimization behavior of whale individuals as quantum mechanical behavior, a whale optimization algorithm based on atom-like structure differential evolution (WOAAD) is proposed. Enhancing the spiral update mechanism by introducing a sine strategy guided by the electron orbital center. Improving the random-walk foraging mechanism by applying mutation operations to both the electron orbital center and random individuals. Performing crossover operations between the newly generated individuals from the improved mechanisms and random dimensions, followed by a selection process to retain superior individuals. This accelerates algorithm convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Finally, implementing a scouting bee strategy, where whale individuals progressively increase the number of optimization failures within a limited parameter L. When a threshold is reached, random initialization is carried out to enhance population diversity. Conducting simulation experiments to compare the improved algorithm with the whale optimization algorithm, other optimization algorithms, and other enhanced whale optimization algorithms. The experimental results indicate that the improved algorithm significantly accelerates convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Applying the improved algorithm to five engineering design problems, the experimental results demonstrate that the improved algorithm exhibits good applicability. [ABSTRACT FROM AUTHOR]