Search

Meta-heuristic algorithms, due to their high search speed and strong generalization ability, are frequently applied in programs mainly to discover the corresponding optimal strategy for any problem in view of their defined rules. After years of collision evolution, they have been continuously used to solve the complex, unordered and diverse optimization problems and improve efficiency. Aiming at the problems of low convergence accuracy and easy to fall into local optima of the traditional Harris hawks optimization algorithm, a compound improved Harris Hawks Optimization algorithm (CIHHO) is proposed. Firstly, the early circling exploration and later attack exploitation phase of the dynamic adjustment algorithm for environmental factors is introduced to regulate the energy of Harris hawks; Secondly, the concept of Versoria function is introduced to modify the random jump strength and raise the data grabbing ability of local space; Introducing the Levy flight function to adjust the factor and reduce the disturbance impact of Levy flight is beneficial for getting rid of the local space after entering the exploitation phase, and introducing random white noise to reduce step size and improve algorithm accuracy. Taking CEC 2017 test function suite set as the core, the performance of CIHHO algorithm is analyzed. Firstly, the performance of CIHHO algorithm is compared with HHO, HHO_JOS, LHHO, LMHHO and NCHHO. Secondly, the performance of unimodal function, multimodal function, mixed function and compound function is compared with other 7 improved algorithms. Finally, ablation experiments are carried out. The convergence value of the iterative curve obtained is more quantitative than the improved algorithm, The generality of the improved CIHHO algorithm in solving multiple optimization problems with different dimensions is verified. Further applying the CIHHO algorithm to three different engineering experiments, the minimum cost calculation results directly demonstrate that the CIHHO algorithm obtained has certain advantages in dealing with search space problems. [ABSTRACT FROM AUTHOR]

Streamflow estimation is necessary to develop sustainable water management strategies that balance the needs of various water users while protecting the ecological health of the watershed. This study presents a comprehensive analysis of river flow data in Turkey's Meriç basin using long-term daily data spanning the years 2001–2011. Within the scope of forecasting of daily river flows, 80% of dataset was used for training stage and the 20% of dataset was used for testing. The performance of four different models, including Extreme Gradient Boosting (XGBoost) benchmark model, Linear Regression, Long Short-Term Memory Network (LSTM), and proposed Particle Swarm Optimization (PSO)—XGBoost hybrid model, was evaluated using several statistical evaluation criteria such as RMSE, MAPE, MAE, SD, NSE, KGE, and model success was assessed based on determination coefficient (R2) values. The forecasting results of the models were evaluated with statistical metrics. The proposed PSO-XGBoost model outperformed all models with R2 values of 0.7460 at the Babaeski FMS station, 0.9582 at the Meriç FMS station, and 0.8116 at the Hayrabolu FMS station, respectively. It has been found that when the parameters of the XGBoost model are optimized with the meta-heuristic PSO algorithm, the daily flow prediction accuracy is significantly increased in the Meriç River basin, which has a pluviozonal River regime. The results demonstrate that the proposed hybrid model produces precise and reliable estimations for daily river flow analysis in the Meriç basin. The findings derived from the proposed model demonstrate its promising potential for water resource management and decision-making in the region. [ABSTRACT FROM AUTHOR]

The work presents a newly designed penalty function to be added with an existing Cross Entropy based fitness function [3] for optimal selection of multi-level thresholds for image segmentation. The extended fitness function so designed is tested here for Brain magnetic resonance (MR) image segmentation using nature-inspired meta-heuristics such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA) and Moth-flame Optimization (MFO), and MFO is finally selected. The proposed method excels in Brain MR image segmentation when tested on WBA database and BrainWeb MR image database with other nature-inspired meta-heuritic based methods. It outperformed the other methods in terms of the three performance metrics Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM) and Feature Similarity Index (FSIM). The best results shown by the proposed method on WBA database in terms of these metrics - PSNR, SSIM and FSIM - are 29.77, 0.927 and 0.899 respectively. On BrainWeb database, the proposed method yields 26.91, 0.864 and 0.892 for the three respective metrics. [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]

This study fixates on determining the optimum laser input parameters that simultaneously meet the desired kerf width and depth during CO2 laser cutting of various polymethylmethacrylate (PMMA) sheets. It has three contributions. The first is to model the cutting process of PMMA by polynomial curve fitting as a function of laser power, laser speed, and standoff distance. R-squared (R2), adjusted R2 and root-mean-square error (RMSE) criteria were taken into account to measure the performance of the proposed model. The effect of laser parameters on the process is investigated by analysis of variance (ANOVA) and sensitivity analysis. The second is to optimize the derived nonlinear regression models using genetic algorithm (GA), particle swarm optimization (PSO), whale optimization algorithm (WOA) and ant lion optimization (ALO) metaheuristic methods and compare the performances of the algorithms. The third is to compare the adequacy of the optimization process with the artificial neural network (ANN). The investigations exhibited that the best-fitting polynomials are obtained with the R2 and adjusted R2 values of over 99% and 97%, respectively. ANOVA and sensitivity test revealed that the sensitivity of the laser power, which is the most effective parameter, was 150 at low powers and decreased to 0 as the power value increased. When the nozzle distance is 4.1, the proposed metaheuristics gave effective and sufficiently accurate results. PSO stood out in terms of both best cost value (3.49 × 10–8) and relative error value (0.19%). The relative error of the ANN was found as 3% in terms of kerf depth. [ABSTRACT FROM AUTHOR]

It is known that manually detecting heart conditions is often costly and time-consuming and any study regarding diagnose these conditions has a great importance. In this study, a metaheuristic optimization model has been developed to automate the detection of heart diseases with artificial intelligence compatible methods. In the proposed model, the feature set is selected to represent the best heart sound signals and heart disease diagnoses using machine learning algorithms with these feature sets. The proposed method has been tested on the Pascal dataset which consists of four classes. Firstly, an electronic-based filter model is used as low-pass filter and has great potential to use as a filtering for heart sound signals to decrease noise. Secondly, the statistical and acoustic feature vector extracted from the audio signals in the Pascal dataset is passed through particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo search algorithm (CSA), and the most suitable feature vector is selected. After obtaining the most suitable feature vector with metaheuristic optimization algorithms and filtering method, heart disease diagnosis is performed using random forest (RF), K-nearest neighbor (K-NN), support vector machine (SVM) and Naive Bayes machine learning algorithms. [ABSTRACT FROM AUTHOR]

Snake optimizer (SO) is an optimization algorithm drawn from the reproductive habits of serpents. It exhibits outstanding effectiveness in solving continuous optimization problems. However, SO may face some performance challenges related to its population diversity and early convergence behavior. In this paper, we address the challenges of SO by introducing the Hybrid snake optimizer algorithm (HSOA). HSOA is a novel approach to optimization that incorporates two new optimization techniques into the SO algorithm. First, it incorporates a new opposition-based learning technique called Oppositional-mutual learning into the initialization stage of the SO algorithm. Second, it integrates dynamic polynomial mutation, which is an intelligent mutation method, into the initialization and optimization stages of the SO algorithm. These integrated approaches aim to increase the population's diversity of SO, while improving its searchability during its optimization stage. In power systems, the economic load dispatch (ELD) is an intricate optimization problem that becomes more challenging when the restrictions of the valve point effect (VPE) are incorporated into it. ELD with VPE is non-convex, lacking smoothness, and exhibiting nonlinearity that considers operational limitations expressed as both equality and inequality constraints to generate electricity. The suggested HSOA algorithm underwent evaluation and was compared with 47 renowned optimization algorithms across five real-world ELD problems with different specifications: generators with different unit capacities, transmission losses, prohibited operation zones, and Ramp Rate restrictions. The experimental results demonstrate that HSOA produces competitive solutions for the five real-world ELD problems. In detail, HSOA achieves the top rank in three cases of ELD problems with a 3-unit generator, and it secures the second and third positions in high-dimensional ELD problems with 40-unit and 80-unit generators, respectively. The statistical tests confirm the reliability and efficiency of HSOA. In addition, the effectiveness of HSOA was evaluated using the single-objective IEEE-CEC 2014 functions and compared to the results of eight popular metaheuristic algorithms. The results demonstrate that HSOA is a competitive optimization algorithm capable of solving the functions of IEEE-CEC 2014. [ABSTRACT FROM AUTHOR]

In this study, we introduce the pied kingfisher optimizer (PKO), a novel swarm-based meta-heuristic algorithm that draws inspiration from the distinctive hunting behavior and symbiotic relationships observed in pied kingfishers in the natural world. The PKO algorithm is structured around three distinct phases: perching/hovering for prey (exploration/diversification), diving for prey (exploitation/intensification), and fostering symbiotic relations. These behavioral aspects are translated into mathematical models capable of effectively addressing a wide array of optimization challenges across diverse search spaces. The algorithm's performance is rigorously evaluated across thirty-nine test functions, which encompass various unimodal, multimodal, composite, and hybrid ones. Additionally, eight real-world engineering optimization problems, including both constrained and unconstrained scenarios, are considered in the assessment. To gauge PKO's efficacy, it is subjected to a comparative analysis against 3 categories of rival optimizers. The 1st category comprises well-established and widely-cited optimizers such as particle swarm optimization and genetic algorithm. The 2nd category encompasses recently published algorithms, including Harris Hawks optimization, Whale optimization algorithm, sine cosine algorithm, Grey Wolf optimizer, gravitational search algorithm, and moth-flame optimization. The 3rd category includes advanced algorithms, such as covariance matrix adaptation evolution strategy and Ensemble Sinusoidal Differential Covariance Matrix Adaptation with Euclidean Neighborhood (LSHADE-cnEpSin). The comparative analysis employs various performance metrics, including the Friedman mean rank and the Wilcoxon rank-sum test, to reveal PKO's effectiveness and efficiency. The overall results highlight PKO's exceptional ability to tackle intricate optimization problems characterized by challenging search spaces. PKO demonstrates superior exploration and exploitation tendencies while effectively avoiding local optima. The source code for the PKO algorithm is publicly accessible at https://www.mathworks.com/matlabcentral/fileexchange/160043-pied-kingfisher-optimizer-pko. [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]

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]

Suspended sediment load estimation is vital for the development of river initiatives, water resources management, the ecological health of rivers, determination of the economic life of dams and the quality of water resources. In this study, the potential of Feed Forward Neural Network (FFNN), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Shuffled Frog Leaping Algorithm (SFLA) models was evaluated for suspended sediment load (SSL) estimation in Yeşilırmak River. The heat map of Pearson correlation values of meteorological and hydrological parameters in 1973–2021, which significantly impacted SSL estimation, was examined to estimate SSL values. As a result of the analysis it was developed a prediction model with three different combinations of precipitation, stream flow and past SSL values (M1: streamflow, M2: streamflow and precipitation, M3: streamflow, precipitation, and SSL). The prediction accuracy of the models was visually compared with the Coefficient of Determination (R2), Bias Factor (BF), Mean Absolute Error (MAE), Mean Bias Error (MBE), Root Mean Square Error (RMSE), Akaike Information Criterion (AIC), Kling-Gupta Efficiency (KGE) statistical criteria and Bland-Altan plot, boxplot, scatter plot and line plot. Based on the analyses, the PSO-ANN model in the M1 model combination showed good estimation performance with an RMSE of 1739.92, MAE of 448.56, AIC of 1061.55, R2 of 0.96, MBE of 448.56, and BF of 0.29. Similarly, the SFLA-ANN model in the M2 model combination had an RMSE of 1819.58, MAE of 520.64, AIC of 1069.9, R2 of 0.96, MBE of 520.64, and BF of 0.19. In the M3 model combination, the SFLA-ANN model achieved an RMSE of 1423.09, MAE of 759.88, AIC of 1071.9, R2 of 0.81, MBE of 411.31, and BF of -0.77. Overall, these models can be considered good estimators as their predicted values are generally close to the measured values. The study outputs can help ensure water structures' effective lifespan and operation and take precautions against sediment-related disaster risks. [ABSTRACT FROM AUTHOR]

Forecasting of long-term annual electricity demand is studied utilizing historical data for electrical energy consumption and socio-economic indicators—gross domestic product, population, import and export values for the case of Turkey between 1975 and 2020. A quadratic model for electrical energy consumption was applied to define the relation between the historical and predicted data. This model used metaheuristic algorithms; genetic algorithms (GA), differential evolution (DE), particle swarm optimization (PSO), artificial intelligence (AI) approaches; neural networks (NN), and adaptive network fuzzy inference systems (ANFIS), and machine learning (ML) applications; all models undergo testing, but the top four models—stepwise linear regression (SLR), NN, Gaussian process regression (GPR) with exponential, and GPR with squared exponential—are selected for additional research to determine the best forecasting model based on their forecasting performance. Comparing the finalized models SLR produced the best forecasting model with a mean absolute percentage error (MAPE) value of 2.36%, followed by GA with 2.97%. Turkey's yearly electrical energy consumption is projected under three possible scenarios through 2030. Finding the most appropriate forecasting model among the models studied for long-term electrical energy forecasting is ultimately the primary goal of this research. Simulations are done on the MATLAB™ platform. [ABSTRACT FROM AUTHOR]

In recent years, due to the rapid growth of the world's population, the demand for agricultural products and food is growing increasingly. Therefore, the agricultural supply chain optimization has been grabbed by researchers to reduce food security concerns. On the other hand, the production amount of farmers is affected by various factors, including environmental conditions. In this paper, a supply chain network is investigated by developing a Mixed-Integer Linear Programming (MILP) model to effectively improve economic objectives under uncertainty. Then, a scenario-based robust optimization approach is employed to deal with the uncertainty. One of the novelities of our paper is considering weather conditions and economic fluctuations in different scenarios. The effectiveness of the proposed mathematical model has been confirmed by a real case study of dates farms. Dates and its by-products have a significant role in GDP, job creation, export, and the creation of various packaging and processing. Moreover, three meta-heuristic algorithms including Whale Optimization Algorithm (WOA), Particle Swarm Optimization (PSO), and a hybrid algorithm based on them (WOA–PSO) are adapted to deal with the NP-hardness of the problems. Moreover, the parameters of the proposed algorithms are improved by the Taguchi method, and to achieve more exact measurements, sensitivity analysis is performed. Finally, the numerical results confirmed that the accuracy of the hybrid algorithm was between 1.9 and 2.8%. Therefore, this approach could be practical and efficient for solving large-sized problems. The obtained outcomes demonstrated that the planned model provides tactical considerations for the related managers. [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 artificial intelligence (AI), optimization techniques are used to solve several problems in different fields. One of these areas is software reliability verification, which is an important part of software products, as it helps determine how reliable the software is to complete its functions. This is done by estimating the parameters of software reliability growth models (SRGMs). SRGMs predict the expected number of failures after completion, while also serving as an indicator of software readiness for delivery. Therefore, this study aims to optimize the estimation of these parameters based on the available failure data using one of the stochastic optimization algorithms, the simulated annealing algorithm (SA) due to its power and effectiveness. Three SRGMs' models are studied: delayed S-shaped, Musa-Okumoto logarithmic and Power models, to examine the feasibility of the proposed algorithm using five different data sets. The results were compared and analyzed with several algorithms: Particle swarm optimization (PSO), cuckoo search (CS), modify whale optimization algorithm (MWOA), S-shaped model with logistic TEF and social spider algorithm (SSA). A comparison was also made with recent SRGMs that do not rely on AI techniques. The results showed that the proposed algorithm based on SA outperformed all other methods in finding the optimal parameters. [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]

High-utility itemsets mining (HUIM) is an important research topic in data mining that consists of extracting efficient itemsets that generate high profit in databases. Metaheuristic algorithms are good candidates for finding some sufficiently good high-utility itemsets (HUIs) while reducing the prohibitive computational cost incurred by such mining. However, metaheuristic algorithms suffer from crucial issues: runtime and memory consumption, entailing scalability issues. To contribute in alleviating these drawbacks, we explore a hybrid approach combining metaheuristics with an optimization technique, and experimentally show the obtainment of better quality solutions. The exploration component in our approach relies on the crow search algorithm (CSA) which is a method that presents a strong capacity in the global search process. The exploitation component is based on the particle swarm optimization (PSO) which is an established stochastic optimization technique known to have a good convergence capability. This article proposes the HUIM-ICSO algorithm, coupling CSA and PSO, as a hybrid method for mining HUIs. In addition to the proposed main CSA-based algorithm, two additional novel enhanced variants are incorporated and integrated with PSO. Experiments are undertaken on 12 publicly available datasets and compared with state-of-the-art algorithms, such as mHUIMiner, HUIM-SPSO and HUIM-AF. Experiments show that, as the number of transactions or items grows, the suggested approach remains scalable and delivers favorable outcomes in terms of runtime, memory usage, and the quantity of HUIs mined, all while maintaining a good convergence rate. [ABSTRACT FROM AUTHOR]

In the context of workflows, scheduling involves the systematic arrangement of tasks, allocation of resources, and coordination of dependencies to achieve desired outcomes. Effective scheduling is paramount in cloud–fog computing environments to harness the full potential of distributed resources while meeting application requirements. However, finding the most efficient solution often involves the quest for an optimal algorithm. An optimal algorithm is one that produces the best possible outcome in terms of a specified objective. While metaheuristic algorithms have been proposed by several researchers to address this issue, the solutions often converge at the local level, limiting their effectiveness. This study proposes the hybrid particle whale optimization algorithm as a solution for workflow scheduling problems. It is a combination of particle swarm optimization (PSO) and the whale optimization algorithm (WOA). By integrating the features of both algorithms, this algorithm tries to avoid becoming trapped in local optima. This algorithm aims to minimize the total execution cost, makespan, and energy consumption of tasks in a cloud–fog computing environment. The performance of the proposed algorithm is compared with that of the round robin, ant colony optimization, PSO, and WOA algorithms using five different scientific workflows, namely, the Inspiral, Montage, Epigenomics, Cybershake, and Sipht algorithms, which deploy various numbers of tasks and VMs. The proposed algorithm outperformed the other existing scheduling strategies. Moreover, the approach provides users with the flexibility to customize the scheduling strategy based on their preferences. Overall, this paper presents a novel approach for workflow scheduling in cloud–fog computing environments that improves the performance and efficiency of applications while also providing users with greater control over the scheduling process. [ABSTRACT FROM AUTHOR]

During the last decades many metaheuristics for global numerical optimization have been proposed. Among them, Basin Hopping is very simple and straightforward to implement, although rarely used outside its original Physical Chemistry community. In this work, our aim is to compare Basin Hopping, and two population variants of it, with readily available implementations of the well known metaheuristics Differential Evolution, Particle Swarm Optimization, and Covariance Matrix Adaptation Evolution Strategy. We perform numerical experiments using the IOH profiler environment with the BBOB test function set and two difficult real-world problems. The experiments were carried out in two different but complementary ways: by measuring the performance under a fixed budget of function evaluations and by considering a fixed target value. The general conclusion is that Basin Hopping and its newly introduced population variant are almost as good as Covariance Matrix Adaptation on the synthetic benchmark functions and better than it on the two hard cluster energy minimization problems. Thus, the proposed analyses show that Basin Hopping can be considered a good candidate for global numerical optimization problems along with the more established metaheuristics, especially if one wants to obtain quick and reliable results on an unknown problem. [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 study employed meta-heuristic clustering algorithms to determine the source and mechanism of groundwater salinization in Quebec's Saguenay-Lac-Saint-Jean (SLSJ) region, utilizing hydrogeochemical (38 inorganic constituents, including minor, major, and trace elements) and isotopic data (δ18O and δ2H). A total of 382 groundwater and precipitation samples were examined. Among the meta-heuristic algorithms, Artificial Bee Colony K-Means (ABCKM), Differential Evolution K-Means (DEKM), Harmony Search K-Means (HSKM), Particle Swarm Optimization K-Means (PSOKM), and Genetic K-Means (GKM) were used and investigated, and finally, PSOKM displayed superior performance and was chosen for further investigation. Analysis of diverse plots and hydrogeochemical modeling unveiled the impact of the Laflamme Sea invasion on groundwater chemistry. PSOKM1, PSOKM4, and PSOKM5 exhibited notable carbonate and silicate dissolution, with PSOKM4 demonstrating predominant carbonate dissolution. Cation exchange was identified through binary plots and Chloro Alkaline Index (CAI), with reverse cation exchange predominantly observed in most PSOKM4 samples, while positive values suggested direct cation exchange in other clusters. Spatial dynamics analysis using HFE-D indicated that salinization occurs as groundwater flows through crystalline bedrock aquifers, resulting in a transition from HCO3− dominance in PSOKM4 to Cl− dominance in the remaining clusters. Interaction between groundwater and rock along this path facilitated a transformation towards a Na-Cl end-member. The closely aligned stable isotopes with the Global Meteoric Water Line (GMWL) indicated a blend of meteoric water and seawater as the groundwater source. [ABSTRACT FROM AUTHOR]

The gazelle optimization algorithm (GOA) is an iterative optimization method inspired by the agile movements of gazelles, employing adaptive step sizes and velocity adjustments for rapid convergence in continuous search spaces. However, GOA tends to lack diversity, leading to issues like local minima trapping and premature convergence. This paper addresses these limitations by introducing dynamic opposition-based learning (OBL) and incorporating a balanced sine-control-logistic chaotic mapping system, resulting in the improved GOA (IGOA). Dynamic OBL accelerates the search process, improving learning and selecting superior candidate solutions, while chaotic mapping in chaotic local search widens ranges for exploration and local optima escape. Evaluating IGOA against seven algorithms, including GOA and others, across 31 general test functions, the results consistently showcase IGOA's superior efficiency in achieving solutions closest to optima, early convergence, and hit rate when compared to alternative algorithms. [ABSTRACT FROM AUTHOR]

The software-defined network paradigm, ensembled with a wireless sensor network, has emerged as a promising phenomenon to enable multi-tasking, re-configuration, and scalability. Termed the software-defined wireless sensor network (SDWSN), it divides the network into two planes: data and control. The data plane consists of software-defined sensor nodes (SDSN) that sense monitoring activity and generate data. On the other hand, the control plane has controller/control Nodes (CN) which collect data from SDSN, perform data aggregation, and then transmit toward the sink node. These CNs consume more amount of energy as compared to SDSNs as they perform multiple tasks. Following this scenario, this paper proposes an energy-efficient multi-objective optimization approach to solve the CNs placement problem through a meta-heuristic algorithm by considering the nodes' location, energy, and load distribution. This paper presents a particle swarm optimization-based controller placement and re-placement (PSO-CPR) algorithm for SDWSN. The PSO-CPR elects SDSNs to become CN based on their distance, residual energy, and capacity in the network. Moreover, the placement of a CN rotates within the cluster to avoid its failure and balance energy consumption. The simulation results show improved CN placement with respect to the state-of-the-art algorithms in terms of average delay by 23.5–37.4%, energy consumption by 18.6–32.6%, and probabilistic load distribution by 17.7–54.1%. Moreover, the comparative study also indicates that PSO-CPR achieve promising result by reducing packet loss by 14.4–27.5% and network re-clustering period by 32.3–68.3% and enhance the network lifetime by 22.6–42.5%. [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]

The escalating demand for sustainable and environmentally friendly energy sources has driven substantial growth in renewable energy adoption across residential and industrial sectors. To effectively meet this demand, the development of efficient and sustainable renewable energy conversion methods is crucial, with inverters playing a pivotal role in achieving this objective. While researchers strive to enhance inverter power handling capabilities and reduce output harmonic contents, the incorporation of additional power electronic switches and peripheral devices presents challenges such as increased circuit cost, complexity, and size. Additionally, the utilization of high-frequency switching techniques for achieving low output harmonics results in elevated switching losses and electromagnetic interference, adversely affecting sensitive electronic devices. This research introduces a novel approach to address these issues through the introduction of a reduced switch multilevel inverter topology. Unlike existing systems, the proposed topology employs a reduced number of power electronic switches and direct current sources to generate a stable output voltage waveform. Operating in a symmetric mode, the topology achieves a nine-level output voltage with enhanced harmonic elimination capabilities. A multiple-stepped selective harmonic elimination (SHE-PWM) switching control technique, employing a 1/3/3/1 distribution ratio, is utilized to extend the harmonic elimination range from 3 to 7 lower-order harmonics. To optimize the switching angles required for the proposed topology, the moth flame optimization (MFO) algorithm is employed and compared with particle swarm optimization (PSO) and whale optimization algorithms (WOA). The MFO algorithm exhibits faster convergence to the global optima, achieving an optimal fitness value of 3.322e−08 at 0.78 modulation points. This results in total harmonic distortion values of 0.7%, 0.757%, and 1.069% for MFO, PSO, and WOA, respectively, with corresponding total losses of 71.609W, 71.794W, and 79.792W. The proposed inverter topology is simulated using PSIM software and experimentally verified using a typhoon HIL-402 hardware-in-the-loop testing device. The simulation and experimental results provide compelling evidence for the superior performance of the MFO algorithm compared to PSO and WOA in achieving improved inverter performance. The proposed topology, in conjunction with the MFO algorithm, presents a promising solution for efficient and sustainable renewable energy conversion, thereby contributing to the advancement of renewable energy technologies in both residential and industrial settings. [ABSTRACT FROM AUTHOR]

In today's dynamic business landscape, organizations heavily rely on cloud computing to leverage the power of virtualization and resource sharing. Service composition plays a vital role in cloud computing, combining multiple cloud services to fulfill complex user requests. Service composition in cloud computing presents several challenges. These include service heterogeneity, dynamic service availability, QoS (Quality of Service) constraints, and scalability issues. Traditional approaches often struggle to handle these challenges efficiently, leading to suboptimal resource utilization and poor service performance. This work presents a fuzzy-based strategy for composing cloud services to overcome these obstacles. The fact that service composition is NP-hard has prompted the use of a range of metaheuristic algorithms in numerous papers. Therefore, Particle Swarm Optimization (PSO) has been applied in this paper to solve the problem. Implementing a fuzzy-based PSO for service composition requires defining the fuzzy membership functions and rules based on the specific service domain. Once the fuzzy logic components are established, they can be integrated into the PSO algorithm. The simulation results have shown the high efficiency of the proposed method in decreasing the latency, cost, and response time. [ABSTRACT FROM AUTHOR]

Digital twin network (DTN) as an emerging network paradigm, have garnered growing attention. For large-scale networks, a crucial problem is how to effectively map physical networks onto the infrastructure platform of DTN. To address this issue, we propose a heuristic method of the adaptive boundary whale optimization algorithm (ABWOA) to solve the digital twin network construction problem, improving the efficiency and reducing operational costs of DTN. Extensive comparison experiments are conducted between ABWOA and various algorithms such as genetic algorithm, particle swarm optimization, artificial bee colony, differential evolution algorithm, moth search algorithm and original whale optimization algorithm. The experimental results show that ABWOA is superior to other algorithms in terms of solution quality, convergence speed, and time cost. It can solve the digital twin network construction problem more effectively. [ABSTRACT FROM AUTHOR]

The control system of the Inverted Pendulum System (IPS) has turned to be a common engineering issue for investigators because of its importance in the implementation in real life. The controller model is usually employed to stabilize the position and the angle of the IPS. In the present study, a cart IPS is designed using Artificial Neural Network (ANN) based Adaptive Neuro-Fuzzy Inference system (ANFIS) controller. To enhance the stability of the closed loop system, a hybrid meta-heuristic optimization algorithm is used to tune the hyper-parameters. The best position of the cart is determined using a hybrid approach (i.e. Ant-colony optimization and Particle Swarm Optimization Algorithms). The model is designed with 10 hidden layers and adopted 25 fuzzy logic rules. The proposed model is evaluated based on the settling time, rise time. The simulation results of the proposal model is performed using SIMULINK in MATLAB. It is found that the proposed model has attained low settling and rise time and low Integrated Squared of Errors (ISE) and Steady State Error rates (SSE). Thus, with these significant features, the proposed model can be practically implemented to acquire an efficient IPS that is optimally stable. To confirm the efficacy of the proposed system, comparison is undertaken with regard to Mean Square Error (MSE) for exposing the better performance of the proposed system. [ABSTRACT FROM AUTHOR]

Taking a lot of time to solve optimization problems has become a challenge for metaheuristic algorithms. Due to independence of the metaheuristics components, parallel processing is a good option to reduce the computational time and to find high quality solutions that are close to the optimum with an acceptable cost. One of these metaheuristic algorithms is the Sailfish Optimizer (SFO) which is inspired by a group of hunting sailfish. The SFO algorithm uses a simple method to provide a dynamic balance between exploration and exploitation phases, creates a swarm diversity, avoids local optima, and guarantees high convergence speed. It has been shown that the SFO algorithm outperforms various state-of-art metaheuristic algorithms for multimodal and high dimensional benchmark functions and complicated real-world optimization problems in terms of accuracy and speed by CPU and GPU implementation. In this paper, to speedup this algorithm and increase its performance we propose a reconfigurable hardware version of SFO implemented on Field Programmable Gate Array (FPGA). The FPGA-based SFO can be a very good option in many applications with massive calculations. Due to the inherent parallelism and high computing capabilities of FPGA, the SFO algorithm gains optimum computational time despite the complexity of optimization problems. We have compared the performance of the proposed FPGA-based SFO with its CPU and GPU implementation and some other metaheuristic algorithms. The results show the FPGA implementation is considerably faster than the CPU and GPU implementation. Also, it outperforms other compared FPGA-based metaheuristic algorithms in terms of execution time and convergence speed. [ABSTRACT FROM AUTHOR]

Archimedes Optimization Algorithm (AOA) is a recent optimization algorithm inspired by Archimedes' Principle. In this study, a Modified Archimedes Optimization Algorithm (MDAOA) is proposed. The goal of the modification is to avoid early convergence and improve balance between exploration and exploitation. Modification is implemented by a two phase mechanism: optimizing the candidate positions of objects using the dimension learning-based (DL) strategy and recalculating predetermined five parameters used in the original AOA. DL strategy along with problem specific parameters lead to improvements in the balance between exploration and exploitation. The performance of the proposed MDAOA algorithm is tested on 13 standard benchmark functions, 29 CEC 2017 benchmark functions, optimal placement of electric vehicle charging stations (EVCSs) on the IEEE-33 distribution system, and five real-life engineering problems. In addition, results of the proposed modified algorithm are compared with modern and competitive algorithms such as Honey Badger Algorithm, Sine Cosine Algorithm, Butterfly Optimization Algorithm, Particle Swarm Optimization Butterfly Optimization Algorithm, Golden Jackal Optimization, Whale Optimization Algorithm, Ant Lion Optimizer, Salp Swarm Algorithm, and Atomic Orbital Search. Experimental results suggest that MDAOA outperforms other algorithms in the majority of the cases with consistently low standard deviation values. MDAOA returned best results in all of 13 standard benchmarks, 26 of 29 CEC 2017 benchmarks (89.65%), optimal placement of EVCSs problem and all of five real-life engineering problems. Overall success rate is 45 out of 48 problems (93.75%). Results are statistically analyzed by Friedman test with Wilcoxon rank-sum as post hoc test for pairwise comparisons. [ABSTRACT FROM AUTHOR]

The research aims to propose a feature selection model for hydraulic analysis as such a model has not been proposed previously. For this purpose, hybrids of three metaheuristic algorithms, particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) with two machine learning models which are support vector machine (SVM) and K-nearest neighbor (KNN) are employed. The dataset considered was hydraulic having an association with flood and possessed topographic, geo-environmental, and human-induced variables. The dataset considered had multicollinearity heteroscedasticity and autocorrelation problems. The metaheuristic algorithms were evaluated by varying the number of population size. Among them, PSO performed better by providing an appropriate number of features with a lower number of iterations. We have analyzed the performance of SVM with different kernels; linear, radial basis function (RBF), sigmoid, and polynomial, as the original SVM is designed only for linear datasets but the hydraulic dataset possesses non-linear characteristics as well. The performance of different kernels in terms of their accuracies is evaluated and recorded. This study showed that RBF performed the best and sigmoid showed the least accuracy for GA, PSO, and ACO algorithms. The performance of KNN is evaluated in terms of accuracies by varying the K-values. It was found that KNN shows low accuracy with a small K-value which then attained a maximum level by increasing K-values, and it finally started decreasing, explicitly, by further enhancing K-values. While comparing the performance of hybrids of GA, PSO, and ACO with SVM and KNN, it was analyzed that KNN performed better with these meta-heuristics with PSO-KNN which performed the best among the baseline models. Thus, the study proposes that PSO-KNN can be utilized as a feature selection technique to obtain optimal data subsets for hydraulic modeling and analysis. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is a crucial preprocessing step that aims to eliminate irrelevant and redundant features, reduce the dimensionality of the feature space, and enhance clustering efficiency and effectiveness. FS is categorized as NP-Hard due to the high number of existing solutions. Various metaheuristic methods have been developed to address the FS problem, yielding promising results. Particularly, particle swarm optimization (PSO), an evolutionary computing (EC) approach guided by swarm intelligence, has gained widespread adoption owing to its implementation simplicity and potential for global search. This paper analyzes several variants of PSO algorithms and introduces a new FS method called HPSO. The proposed approach utilizes an asynchronously adaptive inertia weight and an improved constriction factor. Additionally, it incorporates a chaotic map and a MAD fitness function with a feature count penalty to tackle the clustering FS problem. The efficiency of the developed method is evaluated against the genetic algorithm (GA) and well-known variants of PSO algorithms, including PSOs with fixed inertia weights, PSOs with improved inertia weights, PSOs with fixed constriction factors, PSOs with improved constriction factors, PSOs with adaptive inertia weights, and PSO's includes advanced learning exemplars and sophisticated structure topologies. This paper assesses two different reference text data sets, Reuters-21578 and Webkb. In comparison with competitive methods, the proposed HPSO method achieves higher clustering precision and selects a more informative feature set. [ABSTRACT FROM AUTHOR]

Quantum-behaved Particle Swarm Optimization (QPSO) is a meta-heuristic optimization algorithm, which is widely used in many research fields and practical problems due to its flexibility and low computational cost. However, the existing QPSO algorithms and their variants still have problems such as insufficient search capabilities, lack of adaptivity, and prone to stagnation. This paper proposes a novel ensemble algorithm, ACQPSOW-HGS, based on Quantum-behaved Particle Swarm Optimization (QPSO) and Hunger Games Search (HGS). By combining three improvements and introducing three hybrid strategies, our algorithm has made a comprehensive development, effectively improving the stability and solution accuracy in a large number of test functions and the parameter identification application, which is superior compared with many existing algorithms. First, we design the Weibull distribution random number generation operator, the distance-guided adaptive control technique, and the chaotic update mechanism to deal with the weak randomness, insufficient adaptability, and susceptibility to stagnation of the original QPSO algorithm, respectively. Integrating the above improvements, ACQPSOW is proposed as an improved variant of QPSO. Second, the proposed ensemble algorithm ACQPSOW-HGS is built on ACQPSOW and HGS and combined with specific hybrid strategies to add population diversity and improve search efficiency, including the Selection-Crossover-Mutation mechanism, the elite local search mechanism, and the information exchange mechanism. Finally, the experiments, on 23 benchmark functions and the IEEE CEC 2017 test suite, demonstrate that ACQPSOW-HGS outperforms comparison algorithms in terms of convergence speed and solution accuracy through non-parametric statistical tests. Moreover, ACQPSOW-HGS was applied to the fractional-order hyper-chaotic financial system for parameter identification to illustrate the applicability and robustness in solving real-world problems. [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]

In the current research scenario, sincere effort has been taken worldwide to explore the use of renewable energy sources in electrical power system for the economic benefits and environmental consciousness. In this work, a relatively published new population-based optimization technique, called opposition-based whale optimization algorithm (WOA) (OWOA) having the ability to enhance the local search and speeding up the convergence speed of the solution, has been implemented to analyse the wind- and solar-based hydro–thermal scheduling with transmission losses. The main purpose of this work is to minimize the generation cost as well as emission by optimally scheduling the generation on hourly basis. This newly developed algorithm is initially tested on benchmark functions (high-dimensional complex problems) to establish the optimization capability of the algorithm as compared to the basic WOA counterpart. This optimization technique has the ability to handle the nonlinearity due to the presence of valve point loading in thermal power plant and the uncertainty of wind and solar for wind and solar-based power plant in practical situation. The proposed OWOA and the basic WOA are tested on hydro–thermal scheduling (HTS) and, finally, on HTS with wind and solar. The obtained results show that the generation cost and emission decrease with the incorporation of wind and solar in HTS system. Furthermore, the obtained results from OWOA for cost as well as emission minimization are compared with the WOA, grey wolf optimization (GWO), differential evolution (DE), quantum-inspired evolutionary algorithm (QEA), small population-based particle swarm optimization (SPSO), fuzzy-based evolutionary programming (Fuzzy EP), sine cosine algorithm (SCA) and backtracking search algorithm (BSA) for various cases to verify robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Accurately estimating evaporation is essential for water managers to formulate effective rules and policies. The complexity arising from intricate interactions within the soil-atmosphere system makes evaporation a challenging parameter to predict. In the past decade, Machine Learning techniques rooted in soft computing have emerged as potent tools for addressing the intricacies and non-linearities in hydrology. Surprisingly, there has been no prior research exploring the impact of reservoir water temperature on evaporation modeling. Consequently, this study aimed to employ a hybridized Adaptive Neuro-Fuzzy Inference System (ANFIS) integrated with four optimization algorithms: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Harris Hawks Optimization (HHO), and Salp Swarm Algorithm (SSA). The focus was on modeling the monthly evaporation of the Boukourdane Dam in Algeria for the period of September 1996 to August 2016 and examining how the reservoir's water temperature influences model performance based on four performance indicators, Root Mean Square Error (RMSE), Mean Absolute Error (MAE), scatter index (SI) and Correlation Coefficient (R). The findings underscored the significance of incorporating the water temperature parameter. Among the models, ANFIS-HHO demonstrated the highest accuracy with MAE, RMSE and R values of 1.28, 1.21 mm and 0.92, respectively during test period. Moreover, results revealing a notable impact of reservoir water temperature on evaporation forecasting and the addition of this parameter provide an increase in R and decrease in RMSE about 4.54% and 17.98% respectively. [ABSTRACT FROM AUTHOR]

Substantial deterioration of surface water quality, mainly caused by human activities and climate change, makes the assessment of water quality a global priority. Thus, in this study, four metaheuristic algorithms, namely the particle swarm optimization (PSO), differential evolution (DE), ant colony optimization algorithm (ACOR), and genetic algorithm (GA), were employed to improve the performance of the adaptive neuro-fuzzy inference system (ANFIS) in the evaluation of surface water total dissolved solids (TDS). Monthly and annual TDS were considered as target variables in the analysis. In order to evaluate and compare the authenticity of the models, an economic factor (convergence time) and statistical indices of the coefficient of determination (R2), Kling Gupta efficiency (KGE), root mean squared error (RMSE), mean absolute error (MAE), and Nash-Sutcliff efficiency (NSE) were utilized. The results revealed that the hybrid methods used in this study could enhance the classical ANFIS performance in the analysis of the monthly and annual TDS of both stations. For more clarification, the models were ranked using the TOPSIS approach by simultaneously applying the effects of statistical parameters, temporal and spatial change factors, and convergence time. This approach significantly facilitated decision-making in ranking models. The ANFIS-ACOR annual model considering discharge had the best performance in the Vanyar Station; Furthermore, the ANFIS-ACOR monthly model ignoring discharge was outstanding in the Gotvand Station. In total, after utilizing two defined and proposed temporal and spatial change factors, the ANFIS-ACOR and ANFIS-DE hybrid models had the best and worst performance in TDS prediction, respectively. [ABSTRACT FROM AUTHOR]

This study investigated the compressibility of clay (Cc) for soft ground improvement and developed six optimized metaheuristic-based extreme learning machine (ELM) models (particle swarm optimization (PSO)-ELM, moth search optimization (MSO)-ELM, firefly optimization (FO)-ELM, cuckoo search optimization (CSO)-ELM, bees optimization (BO)-ELM, and ant colony optimization (ACO)-ELM) to predict Cc. A total of 739 laboratory tests were conducted to develop the models, and 517 datasets were used for training, while the remaining 222 samples were used for testing. The results showed that the accuracy of the developed models was improved by 3–5% compared to the original ELM model. The BO-ELM and MSO-ELM models were identified as the most effective models for predicting Cc, with accuracies ranging from 86.5% to 87%. The study suggests that the MSO-ELM model should be used if training time is critical. The developed models provide useful tools for predicting Cc, an essential parameter for soft ground improvement design, and can assist in the improvement of soft ground. [ABSTRACT FROM AUTHOR]

In this study, two innovative techniques were introduced, including data enrichment and optimization, with the aim of significantly improving the accuracy of air over-pressure (AOP) prediction models in mine blasting. Firstly, the Extra Trees algorithm was applied to enrich the collected dataset with the goal of enhancing the understanding of the predictive models for AOP prediction. Then, a neural network model with two hidden layers (ANN) was designed to predict AOP using both the original and enriched datasets. Secondly, to further enhance the accuracy of the ANN model, a novel optimization algorithm based on a random walk strategy and the grey wolf optimization algorithm (RWGWO) was employed to optimize the weights of the ANN model. This optimized model, referred to as the RWGWO–ANN model, was developed and evaluated for predicting AOP using both the original and enriched datasets. To comprehensively assess the impact of data enrichment and the proposed RWGWO-ANN model, three other optimization algorithms—particle swarm optimization (PSO), fruit-fly optimization algorithm (FOA), and single-based genetic algorithm (SGA)—were also applied to optimize the ANN model for AOP prediction. These models were named PSO–ANN, FOA–ANN, and SGA–ANN, respectively. The tenfold cross-validation procedure was applied and repeated three times to ensure the objectivity and consistency of the models. Additionally, conventional ANN and the United States Bureau of Mines empirical model were developed for comparison, serving similar purposes to evaluate the efficiency of the optimization algorithms employed in this study. To demonstrate the advantages of the proposed method and models, a dataset comprising 312 blasting events and six input parameters at the Coc Sau open-pit coal mine in Vietnam was gathered and analyzed. These parameters included burden, spacing, rock hardness, powder factor, monitoring distance, and maximum explosive charge per delay. An additional input variable—Extra Trees—was introduced, making the total number of input variables seven in the enriched dataset. The proposed hybrid model, along with others, was developed based on both the original and enriched datasets. The results revealed that the Extra Trees algorithm is robust and effectively enriches the raw dataset, enhancing the understanding of predictive models and providing improved accuracy. Sensitivity analysis results also highlighted the robust contribution of the Extra Trees variable in the enriched dataset. Compared to the original dataset, the performance of AOP predictive models was improved by 7–24% using the enriched dataset enriched by the Extra Trees algorithm. Furthermore, the findings indicated that the RWGWO–ANN model exhibited the highest accuracy in predicting AOP in this study, achieving an accuracy of 96.2%. This marked a 16–20% improvement over the accuracy of the conventional ANN model. [ABSTRACT FROM AUTHOR]

Recent improvements in networking technologies have led to a significant shift towards distributed cloud-based services. However, adequate management of computation resources by providers is vital to maintain the costs of operations and quality of services. A robust system is needed to forecast demand and prevent excessive resource allocations. Extensive literature review suggests that the potential of recurrent neural networks with attention mechanisms is not sufficiently explored and applied to cloud computing. To address this gap, this work proposes a methodology for forecasting load of cloud resources based on recurrent neural networks with and without attention layers. Utilized deep learning models are further optimized through hyperparameter tuning using a modified particle swarm optimization metaheuristic, which is also introduced in this work. To help models deal with complex non-stationary data sequences, the variational mode decomposition for decomposing complex series has also been utilized. The performance of this approach is compared to several state-of-the-art algorithms on a real-world cloud-load dataset. Captured performance metrics ( R 2 , mean square error, root mean square error, and index of agreement) strongly indicate that the proposed method has great potential for accurately forecasting cloud load. Further, models optimized by the introduced metaheuristic outperformed competing approaches, which was confirmed by conducted statistical validation. In addition, the best-performing forecasting model has been subjected to SHapley Additive exPlanations analysis to determine the impact each feature has on model forecasts, which could potentially be a very useful tool for cloud providers when making decisions. [ABSTRACT FROM AUTHOR]

The chimp optimization algorithm (ChOA) is a nature-inspired algorithm that imitates chimpanzees' individual intelligence and hunting behaviors. In this algorithm, the hunting process consists of four steps: driving, blocking, chasing, and attacking. Because of the novelty of ChOA, the steps of the hunting process have been modeled in the simplest possible way, leading to slow and premature convergence similar to other iterative algorithms. This paper proposes six spiral functions and introduces two novel hybrid spiral functions (SEB-ChOA) to rectify the abovementioned deficiencies. The SEB-ChOAs' performance is evaluated on 23 standard benchmarks, 20 benchmarks of IEEE CEC-2005, 10 cases of IEEE CEC06-2019 test-suite, and 12 constrained real-world engineering problems of IEEE CEC-2020. The SEB-ChOAs are compared with three groups of optimization algorithms, including Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) as the most well-known optimization algorithms, Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Ant Lion Optimization (ALO), Henry Gas Solubility Optimization (HGSO), as almost novel optimization algorithms, and jDE100 and DISHchain1e+12, as winners of IEEE CEC06-2019 competition, and also EBOwithCMAR and CIPDE as superior secondary optimization algorithms. The SEB-ChOAs reached the first rank among almost all benchmarks and demonstrated very competitive results compared to jDE100 and DISHchain1e+12 as the best-performing optimizers. Statistical evidence shows that the SEB-ChOA outperforms the PSO, GA, SMA, MPA, ALO, and HGSO optimizers while producing results comparable to those of the jDE100 and DISHchain1e+12 algorithms. [ABSTRACT FROM AUTHOR]

The role of information and communication technology infrastructure is very crucial and perhaps most important during and post disaster (DPD) scenarios where thousands of lives are at risk. Communication services are expected to operate effectively in such demanding situations with restricted resources while fulfilling their core functionalities. The absence of coordinated cell planning taking the vulnerability of the geographical zone into account is a drawback that inhibits system operations and rescue efforts of public protection and disaster relief (PPDR) units. In this paper, the major issues of cell planning are encountered, and new algorithms for optimum LTE cell planning based on the hybrid dragonfly algorithm with differential evolution (DADE) are proposed under user coverage, user association, and capacity constraints. Thereafter, the feasibility of deployment and operation of an operator-independent emergency system (ES) integrated with balloon-based lightweight LTE eNodeB is analyzed to mitigate the DPD communication challenges. Then evaluate the optimal location for the deployment of ESs to cater to the users under the aforementioned constraint. Finally, optimum cell planning considering the vulnerability of the zone is discussed. The comparative comprehensive analysis of the results shows that the proposed algorithm offers superior convergence characteristics as well as time complexity as compared to the other state-of-the-art algorithms. Comparative results of normalized sum utility depict that the proposed algorithm outperforms the grey wolf optimizer (GWO), salp swarm algorithm (SSA), differential evolution (DE), whale optimization algorithm (WOA), and particle swarm optimization (PSO) based hybrid algorithms, respectively, by 0.5%, 4.3%, 6.5%, 8.6%, and 11.8%. [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]

The Whale Optimisation Algorithm (WOA) is a meta-heuristic model inspired by the hunting behaviours of humpback whales. Similar to many other meta-heuristic models, e.g., Particle Swarm Optimisation (PSO), Artificial Bee Colony (ABC), and Ant Colony Optimisation (ACO), the WOA is susceptible to the issues of slow convergence and local optima. In this study, we address these short comings by first proposing an Enhanced WOA (EWOA) model for tackling single-objective optimisation. Specifically, EWOA integrates the WOA and Differential Evolution (DE). DE is a population-based algorithm that generates new candidate solutions by combining the existing ones, employing a simple yet robust formula. This amalgamation aids in generating diverse solutions during the exploration stage by utilising a non-linear coefficient vector, adaptive weight, and sub-population strategies. Furthermore, fast non-dominated sorting and crowding distance techniques from the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are incorporated into EWOA, resulting in a multi-objective EWOA (MOEWOA) model. We evaluate both EWOA and MOEWOA with a broad spectrum of benchmark functions. The results from 51 single-objective optimisation problems indicate the usefulness of EWOA in terms of a fast convergence rate and with increased performance. On the other hand, MOEWOA demonstrates a better convergence rate and an effective balance between convergence and diversity in 12 multi-objective optimisation problems. In addition, MOEWOA successfully solves 21 complex multi-objective constrained mechanical design problems, outperforming other compared algorithms at the 95% confidence level. The empirical outcomes of our study indicate the potential of EWOA and MOEWOA for undertaking complex, real-world optimisation problems. [ABSTRACT FROM AUTHOR]

Document classification is becoming increasingly essential for the vast number of documents available in digital libraries, emails, the Internet, etc. Textual records frequently contain non-discriminative (noisy and irrelevant) terms that are also high-dimensional, resulting in higher computing costs and poorer learning performance in Text Classification (TC). Feature selection (FS), which tries to discover discriminate terms or features from the textual data, is one of the most effective tasks for this issue. This paper introduces a novel multi-stage term-weighting scheme-based FS model designed for the single-label TC system to obtain the optimal set of features. We have also developed a hybrid deep learning fine-tuning network based on Bidirectional Long Short-Term Memory (BiLSTM) and Convolutional Neural Network (CNN) for the classification stage. The FS approach is worked on two-stage criteria. The filter model is used in the first stage, and the multi-objective wrapper model, an upgraded version of the Whale Optimization Algorithm (WOA) with Particle Swarm Optimization (PSO), is used in the second stage. The objective function in the above wrapper model is based on a tri-objective principle. It uses the Pareto front technique to discover the optimal set of features. Here in the wrapper model, a novel selection strategy has been introduced to select the whale instead of the random whale. The proposed work is evaluated on four popular benchmark text corpora, of which two are binary class, and two are multi-class. The suggested FS technique is compared against classic Machine Learning (ML) and deep learning classifiers. The results of the experiments reveal that the recommended FS technique is more effective in obtaining better results than the other results. [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]