Search

This work presents a new version of the salp swarm optimizer (SSA), called "mSSA," that uses complex mathematical expressions to dynamically manipulate the crucial control parameter ( c 1 ) during optimization. These expressions are carefully designed to modulate the shift in search strategy from exploratory to exploitative, improving the flexibility and speed of convergence of the algorithm. To evaluate the performance of the developed mSSA variants, a thorough examination is carried out on twenty-three benchmark test functions alongside their application to the complex task of software module classification. The process of classifying defective software modules involves developing a multilayer perceptron (MLP) classifier that is suited to the particular complexity and heterogeneity of the task. Selecting the best optimizer is made easier by systematically evaluating the different mSSA versions as MLP classifier trainers. Based on metrics like classification accuracy, convergence speed, and avoidance of local minima, a comparative analysis in opposition to six previously published metaheuristic optimizers shows that mSSA3, when combined with the developed MLP classifier, outperforms both other mSSA variations and state-of-the-art metaheuristic optimizers in terms of overall performance. The excellent classification accuracy, swift convergence, and ability to avoid local minima of mSSA3 highlight its superiority and establish it as a cutting-edge method in the application of metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

The fundamental objective of a modern power system lies in ensuring reliable and effective energy access for its customers. The assessment and determination of optimal operating conditions for power systems involve the utilization of the optimal power flow (OPF) tool. By considering critical factors such as generator power, bus voltages, and line power flow limits while satisfying the power balance equations, the OPF tool enables the identification of the most favorable configuration for efficient power system operation. Traditional optimization methods have limitations in addressing complex power system problems due to poor convergence and long computational times. As a result, computational intelligence tools have gained popularity in recent years. These tools are versatile and enable efficient solution of power system problems by effectively handling qualitative constraints. This paper presents a well-organized and comprehensive review of the algorithms used in power system optimization in the existing literature, encompassing the most recent developments in the field. Specifically, it examines the application of various population-based artificial intelligence techniques that have gained widespread adoption over the past decade (2012–2022). The aim of these techniques is to resolve an OPF problem. This paper organizes the reviewed papers into various types of population-based metaheuristic algorithms, each one implemented sequentially to deal with the OPF problem in the same chronological order in which they appeared in the literature. [ABSTRACT FROM AUTHOR]

Ensemble learning has become a cornerstone in various classification and regression tasks, leveraging its robust learning capacity across disciplines. However, the computational time and memory constraints associated with almost all-learners-based ensembles necessitate efficient approaches. Ensemble pruning, a crucial step, involves selecting a subset of base learners to address these limitations. This study underscores the significance of optimization-based methods in ensemble pruning, with a specific focus on metaheuristics as high-level problem-solving techniques. It reviews the intersection of ensemble learning and metaheuristics, specifically in the context of selective ensembles, marking a unique contribution in this direction of research. Through categorizing metaheuristic-based selective ensembles, identifying their frequently used algorithms and software programs, and highlighting their uses across diverse application domains, this research serves as a comprehensive resource for researchers and offers insights into recent developments and applications. Also, by addressing pivotal research gaps, the study identifies exploring selective ensemble techniques for cluster analysis, investigating cutting-edge metaheuristics and hybrid multi-class models, and optimizing ensemble size as well as hyper-parameters within metaheuristic iterations as prospective research directions. These directions offer a robust roadmap for advancing the understanding and application of metaheuristic-based selective ensembles. [ABSTRACT FROM AUTHOR]

Detecting tumors using gene analysis in microarray data is a critical area of research in artificial intelligence and bioinformatics. However, due to the large number of genes compared to observations, feature selection is a central process in microarray analysis. While various gene selection methods have been developed to select the most relevant genes, these methods' efficiency and reliability can be improved. This paper proposes a new two-phase gene selection method that combines the ReliefF filter method with a novel version of the spider wasp optimizer (SWO) called RSWO-MPA. In the first phase, the ReliefF filter method is utilized to reduce the number of genes to a reasonable number. In the second phase, RSWO-MPA applies a recursive spider wasp optimizer guided by the marine predators algorithm (MPA) to select the most informative genes from the previously selected ones. The MPA is used in the initialization step of recursive SWO to narrow down the search space to the most relevant and accurate genes. The proposed RSWO-MPA has been implemented and validated through extensive experimentation using eight microarray gene expression datasets. The enhanced RSWO-MPA is compared with seven widely used and recently developed meta-heuristic algorithms, including Kepler optimization algorithm (KOA), marine predators algorithm (MPA), social ski-driver optimization (SSD), whale optimization algorithm (WOA), Harris hawks optimization (HHO), artificial bee colony (ABC) algorithm, and original SWO. The experimental results demonstrate that the developed method yields the highest accuracy, selects fewer features, and exhibits more stability than other compared algorithms and cutting-edge methods for all the datasets used. Specifically, it achieved an accuracy of 100.00%, 94.51%, 98.13%, 95.63%, 100.00%, 100.00%, 92.97%, and 100.00% for Yeoh, West, Chiaretti, Burcyznski, leukemia, ovarian cancer, central nervous system, and SRBCT datasets, respectively. [ABSTRACT FROM AUTHOR]

The Chinese Postman Problem (CPP) is a well-known optimization problem involving determining the shortest route, modeling the system as an undirected graph, for delivering mail, ensuring all roads are traversed while returning to the post office. The Directed Chinese Postman Problem (DCPP) extends the Chinese Postman Problem (CPP), where the underlying graph representing the system incorporates exclusively directed edges. Similarly to CPP, this problem has plenty of applications in route optimization, interactive system analysis, and circuit design problems. However, due to the added constraint (directionality of edges), DCPP results are more challenging to solve. Although methods to solve it in literature are proposed, typically by using minimum-cost-flow algorithms, the meta-heuristics approaches proposed to deal with it are very limited. In this paper, we propose an innovative meta-heuristic approach to solve DCPP by using an ant colony optimization (ACO) algorithm, i.e., an algorithm that simulates in a simplified way the behavior of some species of ants to solve optimization problems. The efficiency of our ant colony optimization for solving the Directed Chinese Postman Problem (ACO-DCPP) is measured by comparing the ACO outcomes with the results obtained by a recursive algorithm that explores all the possible solutions. Results show that ACO-DCPP is stable and gets the global optimum frequently by using an extremely limited number of solutions explored. [ABSTRACT FROM AUTHOR]

Data mining and machine learning require feature selection because features can dramatically improve model performance. In contrast, there are no polynomial solutions for selecting a subset feature. It is possible to achieve this by using meta-heuristic algorithms, specifically population-based algorithms that are able to provide a subset of features that is optimal and not exact. Meta-heuristic algorithms face challenges such as staying in local minima, easily falling into local optimum, weakly global searchability, premature convergence, and slow convergence speeds. However, recent research has limitations such as high complexity and weak initialization. In order to overcome these limitations, a three-stage model is proposed. In the first stage, the correlation of features and the correlation of features with class are considered during feature selection and used to create the initial population in the pathfinder optimization algorithm (PFA). PFA is a population-based algorithm and has some drawbacks, in the last iterations, the fluctuation rate (A) and vibration vector (ε) parameters converge to 0, and finding a new solution is impossible. As a second stage, a fuzzy inference system is designed to adjust these parameters adaptively and is called fuzzy-pathfinder optimization (FPO). In the third stage, FPO is used to select relevant features based on classification error, proportion of selected features, and redundancy. Finally, different algorithms such as simulated annealing (SA), differential evolutionary (DE), genetic algorithm (GA), particle swarm optimization (PSO), PFA, estimation of distribution algorithm (EDA), and symmetrical uncertainty criterion (SUC-PSO) are used for comparison. Based on the results, the proposed model is able to reach an average accuracy of 96% on average. Based on a comparison of the proposed algorithm with SA, DE, GA, PSO, PFA, EDA, and SUC-PSO, the objective function is improved by 17.3%, 5.6%, 3.0%, 4.5%, 5.0%, 0.5%, and 1.2%, respectively. The use of comprehensive objective functions, the adaptive adjustment of parameters, and the creation of a targeted initial population are key strengths of FPO. [ABSTRACT FROM AUTHOR]

This paper proposes a novel social cognitive learning-based metaheuristic called kids Learning Optimizer (KLO), inspired by the early social learning behavior of kids organized as families in societal setup. In a society, people are organized as family groups (parents and children) where they interact with each other within and outside their family. This interaction plays a vital role in early brain development, mannerisms, and behavioral learning. Early childhood learning is affected by various stimuli in their surroundings at different stages of life (newborn, infant, toddler, pre-school). This idea motivated us to map the decentralized learning concept of families and their interactions into a new algorithm where search agents (individuals) are arranged/organized in families, and they interact with each other at different stages of life to find the optimal solution. The algorithm is tested against 116 challenging benchmark functions including 31 unimodal, 63 multimodal, 14 CEC'2017 functions, and eight constrained functions. The algorithm is compared with 10 state-of-the-art algorithms. Friedman's Mean Rank (FMR) and Wilcoxon rank-sum test (WRS) are used to measure the performance of competing algorithms. In the first two experiments, unimodal and multimodal benchmark functions are used to measure the explorative and exploitative ability of the algorithm. FMR and WRS show KLO outperformed all other algorithms. In the third experiment, the proposed method is tested against 14 CEC'2017 functions and eight constrained functions along with three real life mechanical engineering optimization problems. KLO proved to be better or equivalent to other competing algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid metaheuristic algorithm called the remora crayfish optimization algorithm (HRCOA) designed for solving continuous optimization problems. The crayfish optimization algorithm (COA), recently proposed as a meta-heuristic algorithm (MA), exhibits certain limitations such as imbalanced exploration and exploitation capacities, susceptibility to premature optimization, and a propensity for stagnation. To address these shortcomings, we incorporate the exploitation operators from the remora optimization algorithm (ROA) to enhance the exploitative behaviors of COA. In addition, we simplify the summer resort operator in the original COA to streamline the search operator design, thus avoiding unnecessary complexity. Furthermore, numerical experiments on 10-dimensional (D) and 20-D CEC2022 benchmark functions, 50-D and 100-D CEC2020 benchmark functions, engineering optimization problems, and wireless sensor networks (WSNs) coverage optimization problems are conducted to investigate the performance of our proposed HRCOA comprehensively. We compare the proposed HRCOA against eight well-known state-of-the-art MAs, including CMAES and the original COA, as competitor algorithms. The experimental and statistical results confirm the effectiveness, competitiveness, and scalability of our proposal. Finally, we conclude that the proposed HRCOA possesses significant potential for addressing diverse optimization challenges in real-world scenarios. [ABSTRACT FROM AUTHOR]

Software defect prediction is a critical challenge within software engineering aimed at enhancing software quality by proactively identifying potential defects. This approach involves selecting defect-prone modules ahead of the testing phase, thereby reducing testing time and costs. Machine learning methods provide developers with valuable models for categorising faulty software modules. However, the challenge arises from the numerous elements present in the training dataset, which frequently reduce the accuracy and precision of classification. Addressing this, selecting effective features for classification from the dataset becomes an NP-hard problem, often tackled using metaheuristic algorithms. This study introduces a novel approach, the Binary Chaos-based Olympiad Optimisation Algorithm, specifically designed to select the most impactful features from the training dataset. By selecting these influential features for classification, the precision and accuracy of software module classifiers can be notably improved. The study's primary contributions involve devising a binary variant of the chaos-based Olympiad optimisation algorithm to meticulously select effective features and construct an efficient classification model for identifying faulty software modules. Five real-world and standard datasets were utilised across both the training and testing phases of the classifier to evaluate the proposed method's effectiveness. The findings highlight that among the 21 features within the training datasets, specific metrics such as basic complexity, the sum of operators and operands, lines of code, quantity of lines containing code and comments, and the sum of operands have the most significant influence on software defect prediction. This research underscores the combined effectiveness of the proposed method and machine learning algorithms, significantly boosting accuracy (91.13%), precision (92.74%), recall (97.61%), and F1 score (94.26%) in software defect prediction. [ABSTRACT FROM AUTHOR]

Wireless rechargeable sensor networks (WRSNs) are a popular and promising field of research that can be used in many different fields. The battery life and storage space of the sensors are limited, due to this it is hard to keep the network up for longer. Combining wireless energy transfer and wireless data gathering devices on a Mobile Vehicle (MV) is one solution to this challenge. The objective of this work is to reduce the number of dead sensors and packet delivery delay. We proposed the circle-covering based algorithm to determine sojourn point based on energy consumption rates and the location of sensors. An Improved Grey Wolf Optimization (IGWO) meta-heuristic algorithm partitions the network into the minimum number of regions, assigns a MV to each region, and ensures balanced sub-tour lengths among the regions. A novel weight function is proposed to determine the order of the sojourn points. To accomplish our objectives, we propose a heuristic partial charging and data gathering strategy to determine the sojourn times of the MVs at the sojourn points. The performance of our proposed PCDGS scheme is compared with IMPSS, PMCDC, MOAC and JERDC schemes. The simulation results show that our proposed PCDGS scheme outperforms the others. [ABSTRACT FROM AUTHOR]

This paper addresses the critical gap in the understanding of the effects of various configurations and feedback mechanisms on the performance of hybrid metaheuristics (HMs) in unsupervised clustering applications. Despite the widespread use of HMs due to their ability to leverage multiple optimization methods, the lack of comprehensive studies on their configuration and feedback mechanisms effects often results in sub-optimal clustering performances and premature convergence. To tackle these issues, we introduce two algorithms for implementing eight distinct HM schemes, focusing on the impacts of parallel and serial processing models along with different feedback mechanisms. Our approach involves selecting candidate metaheuristics based on a mix of evolutionary and swarm-based methods, including the k-means algorithm, to form various HM-based clustering schemes. These schemes were then rigorously evaluated across a range of datasets and feedback mechanisms, further assessing their efficiency in the deployment of smart grid base stations. Performance analysis was based on total fitness evaluations, timing capabilities, and clustering accuracy. The results revealed that parallel HMs with decoupled feedback mechanisms performed best in terms of accuracy but at the cost of slower convergence rates as compared to serial HMs. Our findings further suggest that serial HMs will be best suited for time-sensitive applications where a compromise between speed and accuracy is acceptable, while parallel HMs with decoupled feedback mechanisms are preferable for scenarios where precision is paramount. This research significantly contributes to the field by providing a detailed analysis of HM performance in varying conditions, thereby guiding the selection of appropriate HM schemes for specific clustering tasks. [ABSTRACT FROM AUTHOR]

The number of cloud-, edge-, and Internet of Things (IoT)-based applications that produce sensitive and personal data has rapidly increased in recent years. The IoT is a new model that integrates physical objects and the Internet and has become one of the principal technological evolutions of computing. Cloud computing is a paradigm for centralized computing that gathers resources in one place and makes them available to consumers via the Internet. Despite the vast array of resources that cloud computing offers, real-time mobile applications might not find it acceptable because it is typically located far from users. However, in applications where low latency and high dependability are required, edge computing—which disperses resources to the network edge—is becoming more and more popular. Though it has less processing power than traditional cloud computing, edge computing offers resources in a decentralized way that can react to customers' needs more quickly. There has been a sharp increase in attackers stealing data from these applications since the data is so sensitive. Thus, a powerful Intrusion Detection System (IDS) that can identify intruders is required. IDS are essential for the cybersecurity of the IoT, cloud, and edge architectures. Investigators have mostly embraced the use of deep learning algorithms as a means of protecting the IoT environment. However, these techniques have some issues with computational complexity, long processing times, and poor precision. Feature selection approaches can be utilized to overcome these problems. Optimization methods, including bio-inspired algorithms, are applied as feature selection approaches to enhance the classification accuracy of IDS systems. Based on the cited sources, it appears that no study has looked into these difficulties in depth. This research thoroughly analyzes the current literature on intrusion detection and using nature-inspired algorithms to safeguard IoT and cloud/edge settings. This article examines pertinent analyses and surveys on the aforementioned subjects, dangers, and outlooks. It also examines many frequently used algorithms in the development of IDSs used in IoT security. The findings demonstrate their efficiency in addressing IoT and cloud/edge ecosystem security issues. Moreover, it has been shown that the methods put out in the literature might improve IDS security and dependability in terms of precision and execution speed. [ABSTRACT FROM AUTHOR]

Population-based meta-heuristic optimization algorithms play a vital role in addressing optimization problems. Nowadays, exponential distribution optimizer (EDO) can be considered to be one of the most recent among these algorithms. Although it has achieved many promising results, it has a set of shortcomings, for example, the decelerated convergence, and provides local optima solution as it cannot escape from local regions in addition to imbalance between diversification and intensification. Therefore, in this study, an enhanced variant of EDO called mEDO was proposed to address these shortcomings by combining two efficient search mechanisms named orthogonal learning (OL) and local escaping operator (LEO). In mEDO, the LEO has been exploited to escape local optima and improve the convergence behavior of the EDO by employing random operators to maximize the search process and to effectively discover the globally optima solution. Then the OL has been combined to keep the two phases (i.e., exploration and exploitation) balanced. To validate the effectiveness and performance of the mEDO algorithm, the proposed method has been evaluated over ten functions of the IEEE CEC'2020 test suite as well as eight real-world applications (engineering design optimization problems), Furthermore we test the applicability of the proposed algorithm by tackling 21 instance of the quadratic assignment problem (QAP). The experimental and statistical results of the proposed algorithm have been compared against seven other common metaheuristic algorithms (MAs), including the basic EDO. The results show the supremacy of the mEDO algorithm over the other algorithms and reveal the applicability and effectiveness of the mEDO algorithm compared to well-established metaheuristic algorithms. The experimental results and different statistical measures revealed the reliability and applicability of the mEDO method in solving the global, engineering design, and combinatorial optimization problems by achieving a reasonable solution in terms of scoring a global optima solutions and avoiding premature convergence by increasing the population's diversity. [ABSTRACT FROM AUTHOR]

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]

Honey Badger algorithm (HBA) is an intelligent adaptive meta-heuristic optimization algorithm with few parameters, fast convergence and good convergence accuracy for single-objective problems. However, many real-world optimization problems involve multiple conflicting objectives that need to be optimized simultaneously. A new multi-objective Honey Badger algorithm is proposed to solve the combined economic and environmental power scheduling problem. The proposed MOHBA combines the HBA with the Pareto dominance principle to produce a non-dominated solution. It uses an external elite storage mechanism with congested distance ordering to maintain the diversity of the distribution during the evolution of the Pareto optimal solutions. Furthermore, a fuzzy decision strategy is used to select the best compromise solution from the obtained Pareto bound. Then, to validate the performance of the proposed MOHBA, 20 different benchmark test functions are used to test it against other multi-objective optimization techniques. Moreover, the method is implemented on the multi-objective CEEPD problem for the IEEE 30-bus 6 generator and IEEE 118-bus 14 generator systems. Various objective function s in a multi-objective optimization space is confirmed by comparative studies with minimization schemes and fuzzy decision strategies are utilized to achieve the best scheduling solution for energy and emissions savings. The predominance of the algorithm and its potentiality to handle CEEPD problem several other algorithms. [ABSTRACT FROM AUTHOR]

Introducing a novel meta-heuristic optimization algorithm, the Flood Algorithm (FLA) draws inspiration from the intricate movement and flow patterns of water masses during flooding events in river basins. FLA mathematically models key phenomena such as the movement of water toward slopes, flow rates over time, soil permeability effects, and periodic increases and decreases in water levels from precipitation and losses. Leveraging these models, the algorithm guides the movement and evolution of a population of potential solutions toward enhanced optimality. The algorithm endeavors to establish an appropriate correlation between the fundamental aspects of natural flood events and the optimization process. Its formulation and working mechanism are described in detail. It operates in two main phases—a regular movement phase, where the population moves naturally toward current best solutions, and a flooding phase, which introduces random disturbances to increase diversity. New solutions are periodically introduced while weaker ones are removed, mirroring the natural cycles of water levels. FLA's effectiveness is demonstrated through its application on well-known benchmark optimization problems and engineering design problems. Extensive comparisons have been carried out on CEC2005 functions using 16 algorithms in both basic and enhanced modes, as well as on CEC2014 functions with dimensions 30, 50, and 100 using a total of 20 other algorithms. These rigorous studies unequivocally confirm the robustness and strength of the proposed algorithm. Furthermore, the algorithm's performance on 12 constrained engineering problems demonstrates its ability to tackle real-world challenges. The FLA's source code is publicly available at https://www.optim-app.com/projects/fla. [ABSTRACT FROM AUTHOR]

The efficacy of meta-heuristic algorithms has been demonstrated in solving unconstrained optimization problems. Inspired by the food foraging behavior of beetles, we propose herein a model-free meta-heuristic optimization algorithm, referred to as the Beetle Antennae Search-Bellwether Swarm, which incorporates the schemes of adaptive antenna fiber length and direction vector. A joint annealing-heating scheme along with the re-initialization mechanism is proposed such that each antenna fiber length could simultaneously gradually decrease or increase in different circumstances. We also propose to adapt each individual antenna fiber length based on the best smell perception direction (bellwether). The proposed schemes of adaptive antenna fiber length yield the algorithm almost insusceptible to different initial antenna fiber lengths for a relatively large range of initial antenna fiber lengths. The softmax combiner is leveraged to obtain the direction vector such that the beetle would be steered to step toward the new randomly combined direction and arrive at a candidate position. The beetle position is further updated by evaluating whether the candidate position is conducive to minimizing the objective function. The illustrative simulations demonstrate the fast initial convergence, cost-effectiveness and feasibility of the proposed algorithm. [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]

Offering Product-Service Systems (PSS) becomes an established strategy for companies to increase the provided customer value and ensure their competitiveness. Designing PSS business models, however, remains a major challenge. One reason for this is the fact that PSS business models are characterized by a long-term nature. Decisions made in the development phase must take into account possible scenarios in the operational phase. Risks must already be anticipated in this phase and mitigated with appropriate measures. Another reason for the design phase being a major challenge is the size of the solution space for a possible business model. Developers are faced with a multitude of possible business models and have the challenge of selecting the best one. In this article, a simheuristic optimization approach is developed to test and evaluate PSS business models in the design phase in order to select the best business model configuration beforehand. For optimization, a proprietary evolutionary algorithm is developed and tested. The results validate the suitability of the approach for the design phase and the quality of the algorithm for achieving good results. This could even be transferred to already established PSS. [ABSTRACT FROM AUTHOR]

Rockburst is one of the most hazardous geological disasters in underground engineering due to its complex causes and destructive nature. To address this, there is an imperative for methodologies that can predict rockbursts quickly and effectively to mitigate preemptively the risks and damages. In this study, 259 rockburst instances were analyzed, employing six rockburst feature parameters: maximum tangential stress (σθ), uniaxial compressive strength of rock (σc), uniaxial tensile strength of rock (σt), stress coefficient (σθ/σt), rock brittleness coefficient (σc/σt), and elastic energy index (Wet) as inputs. By integrating three novel meta-heuristic algorithms—dingo optimization algorithm (DOA), osprey optimization algorithm (OOA), and rime-ice optimization algorithm (RIME)—with support vector machine (SVM), hybrid models for long-term rockburst trend prediction were constructed. Performance evaluations through fivefold cross-validation revealed that for the no rockbursts, DOA–SVM (Pop = 200) demonstrated superior predictive performance, achieving an accuracy of 0.9808, precision of 0.9231, recall of 1, and an F1-score of 0.96. For moderate rockbursts, OOA–SVM (Pop = 100) emerged as the most effective, registering an accuracy of 0.9808, precision of 0.9545, recall of 1, and an F1-score of 0.9767. For light and severe rockbursts, DOA–SVM, OOA–SVM, and RIME–SVM showcased comparable predictive outcomes. However, these hybrid models outperformed traditional SVM models optimized with conventional algorithms in terms of accuracy across all rockburst hazard levels. Moreover, the hybrid models underwent additional validation with a new dataset of 20 rockburst instances collected globally, confirming their robust efficacy and exceptional generalization capabilities. An ensuing analysis using local interpretable model-agnostic explanations (LIME) on the six key feature parameters revealed a significant positive correlation between σθ and Wet with the severity of rockbursts. These results not only affirm the superior optimization performance of the DOA, OOA, and RIME algorithms but also their substantial potential to enhance the predictive accuracy of machine learning models in forecasting long-term rockbursts. [ABSTRACT FROM AUTHOR]

The 2022 Qatar World Cup created massive global attention and generated widespread discussions on different social media platforms, including the X platform. The event was the subject of intense debate after Qatar was announced as the host. Opinions were divided, with supporters and critics weighing in based on political, ethical, cultural, and social considerations. Public sentiments evolved throughout three key phases-before, during, and after the event-shaped by numerous factors. This study aims to analyze these sentiments during these three stages based on a novel hybrid evolutionary approach. Three versions for each stage were produced by applying pre-trained word embeddings with 100 and 400 features and sentiment features combined with word embeddings. In total, nine different versions of datasets were employed to examine the proposed approach. Furthermore, five different metaheuristic algorithms were applied: the multi-verse optimizer (MVO), the genetic algorithm (GA), the particle swarm optimization (PSO), the salp swarm algorithm (SSA), and the whale optimization algorithm (WOA). The five metaheuristic algorithms were combined with the feature selection-support vector machine (FS-SVM) and weighting-support vector machine (WSVM) to examine the newly created dataset versions. The results reveal that people's perspectives shifted from negative before the event to positive during and after the event. Moreover, a comparison of the proposed MVO-WSVM and MVO-SVM-Fs approaches with other metaheuristic algorithms showed the superior accuracy of the proposed approaches in sentiment prediction. [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]

Since many years ago, walnuts have been extensively available around the world and come in various quality varieties. The proper variety of walnut can be grown in the right area and is vital to human health. This fruit's production is time-consuming and expensive. However, even specialists find it challenging to differentiate distinct kinds since walnut leaves are so similar in color and feel. There aren't many studies on the classification of walnut leaves in the literature, and the most of them were conducted in laboratories. The classification process can now be carried out automatically from leaf photos thanks to technological advancements. The walnut data set was applied to the suggested deep learning model. There aren't many studies on the classification of walnut leaves in the literature, and the most of them were conducted in laboratories. The walnut data set, which consists of 18 different types of 1751 photos, was used to test the suggested deep learning model. The three most successful algorithms among the commonly utilized CNN algorithms in the literature were first selected for the suggested model. From the Vgg16, Vgg19, and AlexNet CNN algorithms, many features were retrieved. Utilizing the Whale Optimization Algorithm (WOA), a new feature set was produced by choosing the top extracted features. KNN is used to categorize this feature set. An accuracy rating of 92.59% was attained as a consequence of the tests. [ABSTRACT FROM AUTHOR]

The bitterling fish is a prime example of intelligent behavior in nature for survival. The bitterling fish uses the oyster spawning strategy as their babysitter. The female bitterling fish looks for a male fish stronger than other fish to find the right pair. In order to solve optimization issues, the Bitterling Fish Optimization (BFO) algorithm is modeled in this manuscript based on the mating behavior of these fish. The bitterling fish optimization algorithm is more accurate than the gray wolf optimization algorithm, whale optimization algorithm, butterfly optimization algorithm, Harris Hawks optimization algorithm, and black widow optimization algorithm, according to experiments and implementations on various benchmark functions. Data mining and machine learning are two areas where meta-heuristic techniques are frequently used. In trials, the MLP artificial neural network and a binary version of the BFO algorithm are used to lower the detection error for intrusion traffic. The proposed method's accuracy, precision, and sensitivity index for detecting network intrusion are 99.14%, 98.87%, and 98.85%, respectively, according to experiments on the NSL KDD data set. Compared to machine learning approaches like NNIA, DT, RF, XGBoot, and CNN, the proposed method is more accurate at detecting intrusion. The BFO algorithm is used for feature selection in the UNSW-NB15 dataset, and the tests showed that the accuracy of the proposed method is 96.72% in this dataset. The proposed method of the BFO algorithm is also used to improve Kmeans clustering, and the tests performed on the dataset of covid 19, diabetes, and kidney disease show that the proposed method performs better than iECA*, ECA*, GENCLUST + + (G + +) methods. Deep has KNN, LVQ, SVM, ANN, and KNN. [ABSTRACT FROM AUTHOR]

When contemplating the improvement of overall performance in machine learning (ML) models, a critical strategy for optimizing data preparation is feature selection (FS). There has been a significant rise in the popularity of metaheuristic FS algorithms in recent times. This can be attributed to their proficiency in accurately identifying and selecting the most relevant features for ML tasks. This study presents three feature selection strategies that utilize metaheuristic algorithms. The methodologies mentioned include the Gravitational Search Optimization Algorithm (GSA), Emperor Penguin Optimization (EPO), and a hybrid approach of GSA and EPO referred to as hGSAEPO. Previous research has explored the use of baseline algorithms for feature selection in various ML tasks. However, there is a lack of investigation regarding their application specifically in breast cancer(BC) classification. A combination of these two has been utilized for the first occasion. The purpose of selecting BC as the study of investigation is due to the reason that this illness is recognized as the second most prevalent cause of mortality in the female population. If the condition is detected in its initial phases, it can be remedied and can assist individuals in evading superfluous medical processes. The procedure of selecting relevant features holds significant importance in the purpose of predicting ailments like BC. The current research presents an innovative methodology that employs three soft-computing algorithms, EPO, GSA, and their proposed hybrid hGSAEPO to efficiently identify significant features while concurrently decreasing the occurrence of irrelevant ones, simplifying overall complexity and enhancing the accuracy. The utilization of these soft computing methodologies and six ML classifiers presents a viable framework for prognostic research through the classification of data instances on Wisconsin Diagnostic Breast Cancer (WDBC). The experimental findings of eight experiments conducted suggest that the suggested approach exhibits exceptional performance in the context of binary classification for BC by computing astounding results like precision of 0.9800, sensitivity of 0.9700, specificity of 0.9887, F1-score of 0.9539, area under the curve(AUC) surpassing 0.998, with an accuracy of 98.31%. We achieved our objectives by presenting a dependable clinical prediction system for healthcare professionals for efficient diagnosis. [ABSTRACT FROM AUTHOR]

It is very tiresome for a practiser to detect the best feasible sizing design of structural members including reinforced concrete columns that is a highly nonlinear and complicated structural engineering optimization problem. This is due to such a design is practically conducted via conventional trial-and-error computing methods in which resistance to external loads, cost efficiency, and aesthetic factors, etc. have to be considered. This study focuses on minimizing the design cost of primarily proposed reinforced concrete column design problem via three overnew swarm-based optimizers such as Coati Optimization Algorithm, Fox Optimizer and Pelican Optimization Algorithm (POA) that are firstly utilized for this purpose. In this regard, the type of steel rebar distribution, the characteristic strength of the concrete, the height and width of the column section, and the number and diameter of the rebars are treated as discrete design variables of the newly proposed complex reinforced concrete column design cost optimization problem. In solution, the design requirements specified in practice code provisions should also be met. Here, Turkish Building Earthquake Code 2018 specifications are considered as practice structural design constraints. Consequently, the algorithmic performances of three overnew swarm-based metaheuristic optimization algorithms are compared and evaluated in detail. Amongst them, the POA shows most fruitful algorithmic design solution performance. [ABSTRACT FROM AUTHOR]

The artificial hummingbird algorithm (AHA) has been applied in various fields of science and provided promising solutions. Although the algorithm has demonstrated merits in the optimization area, it suffers from local optimum stagnation and poor exploration of the search space. To overcome these drawbacks, this study redesigns the update mechanism of the original AHA algorithm with the natural survivor method (NSM) and proposes a novel metaheuristic called NSM-AHA. The strength of the developed algorithm is that it performs population management not only according to the fitness function value but also according to the NSM score value. The adopted strategy contributes to NSM-AHA exhibiting powerful local optimum avoidance and unique exploration ability. The optimization ability of the proposed NSM-AHA algorithm was compared with 21 state-of-the-art algorithms over CEC 2017 and CEC 2020 benchmark functions with dimensions of 30, 50, and 100, respectively. Based on the Friedman test results, it was observed that NSM-AHA ranked 1st out of 22 competitive algorithms, while the original AHA ranked 8th. This result highlights that the NSM update mechanism provides a remarkable evolution in the convergence performance of the original AHA algorithm. Furthermore, two constrained engineering problems including the optimization of single-diode solar cell model (SDSCM) parameters and the design of a power system stabilizer (PSS) are solved with the proposed algorithm. The NSM-AHA algorithm provided better results compared to other algorithms with a value of 9.86E − 04 root mean square error for SDSCM and 1.43E − 03 integral time square error for PSS. The experimental results showed that the proposed NSM-AHA is a competitive optimizer for solving global and engineering problems. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) system performance and reliability can be improved through the detection of defects in PV modules and the evaluation of their effects on system operation. In this paper, a novel system is proposed to detect and classify defects based on electroluminescence (EL) images. This system is called Fault Detection and Classification (FDC) and splits into four modules, which are (1) Image Preprocessing Module (IPM), (2) Feature Extraction Module (FEM), (3) Feature Selection Module (FSM), and (4) Classification Module (CM). In the first module (i.e., IPM), the EL images are preprocessed to enhance the quality of the images. Next, the two types of features in these images are extracted and fused together through FEM. Then, during FSM, the most important and informative features are extracted from these features using a new feature selection methodology, namely, Feature Selection-based Chaotic Map (FS-CM). FS-CM consists of two stages: filter stage using chi-square to initially select the most effective features and a modified selection stage using an enhanced version of Butterfly Optimization Algorithm (BOA). In fact, BOA is a popular swarm-based metaheuristic optimization algorithm that has only recently found success. While BOA has many benefits, it also has some drawbacks, including a smaller population and an increased likelihood of getting stuck in a local optimum. In this paper, a new methodology is proposed to improve the performance of BOA, called chaotic-based butterfly optimization algorithm. Finally, these selected features are used to feed the proposed classification model through CM. During CM, Hybrid Classification Model (HCM) is proposed. HCM consists of two stages, which are binary classification stage using Naïve Bayes (NB) and multi-class classification stage using enhanced multi-layer perceptron. According to the experimental results, the proposed system FDC outperforms the most recent methods. FDC introduced 98.2%, 89.23%, 87.2%, 87.9%, 87.55%, and 88.20% in terms of accuracy, precision, sensitivity, specificity, g-mean, and f-measure in the same order. [ABSTRACT FROM AUTHOR]

A brain-computer interface (BCI) based on an electroencephalograph (EEG) establishes a new channel of communication between the human brain and a computer. Redundant, noisy, and irrelevant channels lead to high computational costs and poor classification accuracy. Therefore, an effective feature selection technique for determining the optimal number of channels can improve BCI's performance. However, existing meta-heuristic algorithms are prone to get trapped in local optimum due to high dimensional dataset. Thus, to reduce dimension, solve inter subject variation and choose an optimal subset of channels, a novel framework called Component Loading followed by Clustering and Classification (CLCC) is proposed in this paper. This novel framework is further divided into two experiment configurations-CLCC with Feature Selection (CLCC-FS) and CLCC without Feature Selection (CLCC-WFS). All these frameworks have been implemented on a motor imagery (MI) EEG dataset of 10 subjects in order to choose the best subset of channels. Further, seven different classifiers have been employed to assess the performance. Experimental outcomes show that on comparing various feature selection techniques, our proposed algorithm i.e., CLCC-FS Opposition-Based Whale Optimization Algorithm (CLCC-FS(OBWOA)) performed substantially better than the other feature selection techniques. We demonstrate that the proposed algorithm is able to achieve 99.6% accuracy by using only few channels and can improve the practicality of the BCI system by reducing the computation cost. [ABSTRACT FROM AUTHOR]

High utility itemset mining is an essential new task in data mining, which is obtained from the extension of frequent itemset mining problems. The difference between these two groups is that in high utility itemset mining, the utilities of the items are essential in addition to the number of items. To find the itemsets with more utilities, defining a minimum utility threshold is necessary by testing different solutions to obtain the desired outcome. This is challenging and needs more time to reach the appropriate value. In this article, we propose a method called TKU-BChOA to explore top-k high utility itemsets according to the number of required itemsets based on the Chimp meta-heuristic algorithm. Because, in comparison with the meta-heuristic methods, the deterministic methods require more time and memory. Experimental results on five datasets show that the proposed approach outperforms the previous deterministic methods in memory usage. The proposed method performs better in terms of time and memory on large datasets than other approximate methods and is more accurate. [ABSTRACT FROM AUTHOR]

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]

Efficient flood risk management hinges on the precise mapping and assessment of areas vulnerable to flooding. This research endeavors to advance the flood susceptibility mapping in Jeddah, Saudi Arabia by harnessing the long short-term memory (LSTM) algorithm enriched with two sophisticated metaheuristic optimizers: invasive weed optimization (IWO) and harmony search (HS). The process commenced with the utilization of synthetic aperture radar (SAR) imagery to construct a detailed flood inventory map. A comprehensive geodatabase encompassing various flood conditioning factors—encompassing lithology, land use, proximity to water bodies, hydrologic soil group (HSG), topographical features (such as slope, plan curvature, and aspect), and hydrological indices [including profile curvature, Topographic Wetness Index (TWI), flow accumulation, Topographic Position Index (TPI), altitude, Terrain Ruggedness Index (TRI), and Stream Power Index (SPI)] was meticulously curated. To develop the model, 70% of this dataset was employed, while the remaining 30% served to validate the predictive efficacy of the resultant flood susceptibility maps. These maps' accuracy was quantitatively gauged through the receiver operating characteristic curve and the area under the curve (AUC) statistics. Findings reveal that the integration of LSTM with IWO and HS metaheuristic algorithms significantly enhances accuracy (LSTM-IWO: AUC = 0.900; LSTM-HS: AUC = 0.876) in comparison to the standalone LSTM approach (AUC = 0.863). The implementation of these hybrid algorithms manifests as a potent and economically viable approach for detailed geospatial modeling of flood susceptibility, providing invaluable insights to bolster flood mitigation, preparedness, and emergency response strategies. [ABSTRACT FROM AUTHOR]

Hybrid energy system (HES) is considered a solution to the energy supply issue, particularly in rural areas to achieve their sustainable development goals. The rise in energy consumption has increased the appeal of renewable resources, because of their potential to supply consumers with competitive, carbon-free electricity. This paper suggests strategies for managing energy and the most recently published optimizers for designing a stand-alone HES positioned in a remote region of southwest Egypt. This HES includes two green energy sources (wind and solar) and a storage system for energy (battery) as the first backup in addition to a second backup (diesel). The most recent sizing techniques employing the Chernobyl disaster optimizer, dynamic control cuckoo search (DCCS), and gold rush optimizer have been suggested to obtain the optimal design of the utilized HES. Furthermore, an in-depth evaluation of the applied optimization approaches has been achieved based on a comparative study. A detailed analysis of the studied algorithms aims to identify the optimum algorithm that provides the lowest possible cost at the highest level of reliability for the proposed HES. The simulation results verified that, the DCCS algorithm outperformed other algorithms, indicating its potential for achieving promising solutions. [ABSTRACT FROM AUTHOR]

Brain tumor is the most serious and deadly disease, and it is formed due to abnormal cell production. There are two different sorts of tumors including benign (non-cancerous) and malignant (cancerous), and the third level of a brain tumor is cancerous, which is a highly deadly form of cancer. Detecting brain tumors early is crucial for accurate diagnosis and efficient treatment planning. Although numerous techniques are established, the prediction techniques are time-consuming, have higher computational complexity, prone to overfitting, and have limited accuracy. Thus we proposed an Attention Bi-directional Gated Recurrent Unit Ensemble Support Vector Machine (ABES model) for detecting brain tumors. Here, the Bi-GRU layer learns the most important context information for every image. The attention layer also uses the attention mechanism to assign weights to each Bi-GRU layer output. The ensemble SVM classifier performs the categorization of brain tumors. Then, the training set is used to train the Attention BiGRU model and Ensemble SVM classifiers. The ABES classifier weights are optimized by utilizing the improved whale optimization algorithm. To demonstrate the efficiency of our proposed method, we compare it to four existing methods including Fully Automatic Heterogeneous Segmentation-based Support Vector Machine, Whale Harris Hawks Optimization-based Deep Learning, Machine learning-based back propagation neural networks, and Deep Convolutional Neural Network. Also, the ABES model is validated using the MRI dataset and the Figshare brain tumor dataset. Accuracy, precision, specificity, and sensitivity are the performance metrics used to evaluate classification performance, which achieves 97.2% accuracy, 98.61% Precision, 96.48% Specificity, and 97.34% Sensitivity, respectively. [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]

To improve the reliability of the glass fiber-reinforced plastic (GFRP) mortar culvert structure more effectively, their failure modes were estimated by combining the Tsai–Wu and Tang failure criteria. The reliability of GFRP mortar culverts was analyzed using the Monte Carlo method. According to the characteristics of structure of GFRP mortar pipe culvert, the adaptive adjustment weights were introduced to improve the whale optimization (WOA) algorithm. The improved WOA algorithm was used to optimize the structure design of the GFRP mortar pipe culvert with its reliability as the objective function under a certain weight. It was determined that the laminated structure produces different optimal lamination angles with different relative thicknesses of single layers. As the number of layers increases, the optimal angle of fibers increases significantly. The optimization based on three design variables gave better results than based on two design variables. It was determined the optimal characteristics to reach maximum reliability of structure of GFRP mortar pipe culvert. [ABSTRACT FROM AUTHOR]

SCADA systems play an important role in tracking the behaviour of critical process variables and connecting geographically dispersed subsystems at the industrial plant level. This article presents a PLC and SCADA-based control framework to automate and supervise the temperature control processes in the heat exchanger plant. The OMRON (NX1P2-9024DT1) PLC is interfaced with the Wonderware InTouch SCADA system to gather data, create a simulated temperature control prototype and carry out the necessary control operations within the heat exchanger plant. The PLC controls the entire process and programming of PLC is done using Sysmac studio automation software using the ladder programming language. The proposed system controls the temperature of the heat exchanger system through PID and Fractional Order PID (P I λ D μ ) controllers with Integral Anti-windup technique. Various control strategies like Cascade Control, Feedforward Control and Smith Predictor for time delayed process are discussed for controlling the temperature of the process. The performance of both PID and fractional order PID controllers is optimized using adaptive heuristic optimization techniques like Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). In control system design and analysis, the calculated performance indices are used as quantitative measures for evaluating the performance of a system. The combined form of temperature controller with Cascade control, Feedforward control and dead-time compensator is modelled and examined for simulation using MATLAB. Simulation and real-time experimentation analysis of the developed controllers are executed with metaheuristic optimization techniques based on different performance indices like ISE, IAE and ITAE. [ABSTRACT FROM AUTHOR]

Various popular multiplayer battle royale games share a lot of common elements. Drawing from our observations, we summarized these shared characteristics and subsequently proposed a novel heuristic algorithm named multiplayer battle game-inspired optimizer (MBGO). The proposed MBGO streamlines mainstream multiplayer battle royale games into two discrete phases: movement and battle. Specifically, the movement phase incorporates the principles of commonly encountered "safe zones" to incentivize participants to relocate to areas with a higher survival potential. The battle phase simulates a range of strategies players adopt in various situations to enhance the diversity of the population. To evaluate and analyze the performance of the proposed MBGO, we executed it alongside ten other algorithms, including three classics and five latest ones, across multiple diverse dimensions within the CEC2017 and CEC2020 benchmark functions. In addition, we employed several industrial design problems to evaluate the scalability and practicality of the proposed MBGO. The statistical analysis results reveal that the novel MBGO demonstrates significant competitiveness, excelling in convergence speed and achieving high levels of convergence accuracy across both benchmark functions and real-world problems. [ABSTRACT FROM AUTHOR]

The Harris hawk Optimization (HHO) has the advantage of employing various local search strategies to adapt to different situations during the exploitation phase. Hence, HHO can search deeper into discovered prospective regions. The reason of poor robustness is that HHO exhibits high randomness in the exploration phase. In the scene of optimizing high-dimensional or multimodal Tasks, the increased dimensionality and parameter correlation lead to the problem of local optimal regions, which affects the accuracy and convergence of the solution. To address these issues, we propose Dynamic Random Mutation Hybrid Harris hawk Optimization (DRM-HHHO). In the hybrid algorithm, the Kepler Optimization Algorithm (KOA) was enhanced (called EKOA) to replace the exploration phase of HHO to solve the problem of excessive diffusion. At the end of each iteration, the leader's position is perturbed by the Dynamic Random Mutation (DRM) algorithm. The mutation probability is adjusted based on the dimension to suit problems of different scales. We conduct ablation experiment to test the effectiveness of the two improved mechanisms. Testing our method on the CEC2017 and CEC2019 benchmark functions, we find that the significance of mutation probability differences decreases with increasing dimensionality. Compared to other Metaheuristic Algorithms (MAs), such as WOA, TSA, and so on, DRM-HHHO shows superior overall performance, especially in solving high-dimensional problems. Furthermore, we successfully apply DRM-HHHO to optimize the Kernel Extreme Learning Machine (KELM) critical parameters. DRM-HHHO-KELM outperforms four traditional machine learning methods and five MAs-KELM strategies on the Australian Credit and Pima Indian Diabetes datasets. [ABSTRACT FROM AUTHOR]

In Industry 4.0, the focus of task scheduling is more on smart services such as robotic services under the paradigm of mobile edge computing, which are widely used to improve the efficiency of smart manufacturing. Existing scheduling research efforts on optimizing efficiency such as swarm algorithm, reinforcement learning, but with little real-time dynamic scheduling. Online learning and adaptation is a critical function when tackling real challenges in unpredictable and dynamically changing edge computing environments. Our goal is to propose algorithms that can meet the real-time dynamic task scheduling even reach the level of communication. We propose a Deep Reinforcement Learning (DRL)-based online real-time task scheduling method which has the new exploration and exploitation strategy using the improved sparrow search algorithm (ISSA). We replace the traditional strategy with a meta-heuristic algorithm, while introducing natural disturbances and modifying the population position update formula to converge to the optimal position. The algorithm has two layers. The first layer is scheduling generation layer, which is responsible for making decisions, and the second layer is scheduling policy update layer, which optimizes the strategy and finds the best set of hyperparameters. The experimental results show that the running time of the method to solve the problem can reach 0.0092 seconds, and the real-time performance reaches up to the millisecond communication level. At the same time other methods are compared, effectively reducing the running cost and meeting the requirements of production scheduling tasks. [ABSTRACT FROM AUTHOR]

Feature selection plays a critical role in reducing high-dimensional feature space in machine learning applications without affecting the accuracy of performance. The feature selection problem has been extensively studied in the literature. Nevertheless, few studies have been conducted on unsupervised text feature selection because of the absence of feature class labels and local optimization limitations. For that, this paper proposes three binary versions of the fire hawk optimizer based on different transfer functions for unsupervised text feature selection that can be used to select the most informative features for text clustering. The internal feature subset was evaluated using a mean absolute difference filter. The performance of the proposed methods is tested and compared with other state-of-the-art metaheuristic algorithms on several different benchmark text datasets from different sources using various evaluation metrics. The K-means clustering is applied to cluster documents based on the features selected by the methods. The results of the experiments indicate the effectiveness of the proposed method based on the S-shaped transfer function for improving the performance of document clustering compared with other feature selection methods. [ABSTRACT FROM AUTHOR]

Feature Selection (FS), a pre-processing step used in the majority of big data processing applications, aims to eliminate irrelevant and redundant features from the data. Its purpose is to select a final set of data characteristics that best represent the data as a whole. To achieve this, it explores every potential solution in order to identify the optimal subset. Meta-heuristic algorithms have been found to be particularly effective in solving FS problems, especially for high-dimensional datasets. This work adopts a recently developed meta-heuristic called the White Shark Optimizer (WSO) due to its simplicity and low computational overhead. However, WSO faces challenges in effectively balancing exploration and exploitation, particularly in complex multi-peak search problems. It tends to converge prematurely and get stuck in local optima, which can lead to poor search performance when dealing with FS problems. To overcome these issues, this paper presents three enhanced binary variants of WSO for well-known FS problems. These variants are as follows: (1) Binary Distribution-based WSO (BDWSO), where the algorithm refines the positions of white sharks by considering both the average and standard deviation of the current shark, the local best shark, and the global best shark. This strategy is designed to alleviate issues of premature convergence and stagnation during iterations , (2) Binary Sine Cosine WSO (BSCWSO), which uses sine and cosine adaptive functions for the social and cognitive components of the position update rule, and (3) Binary Hybrid Sine Cosine WSO (BHSCWSO), which employs sine and cosine acceleration factors to regulate local search and achieve convergence to the global optimal solution. Additionally, the population was initialized using the Opposition-Based Learning (OBL) mechanism, and the sine map was used to modify the inertia weight of WSO. These revised variants of WSO were established to have a better harmony between the exploration and exploitation facets. The proposed methods were extensively compared to the fundamental binary WSO and other well-known algorithms in the field. The experimental findings and comparisons demonstrate that the proposed methods outperform the conventional and most evaluated similar algorithms in terms of robustness and solution quality. In terms of classification accuracy, number of selected features, specificity, sensitivity, and fitness values, the proposed BHSCWSO optimizer performed better than all other proposed peer optimizers, including BSWO, BDWSO, and BSCWSO, in 11, 8, 13, 18, and 10 datasets, respectively. The proposed BHSCWSO optimizer showed performance levels of more than 90% in terms of accuracy, sensitivity, and specificity metric measures on 15, 14, and 11 of the 24 datasets deemed. [ABSTRACT FROM AUTHOR]

The lemur optimizer (LO) is a new metaheuristic algorithm that is inspired by the two primary locomotive patterns of the lemurs. However, LO suffers from improper balance between exploration and exploitation phases and sub-optimal solution stagnation due to poor exploration capability. To address these limitations, an improved lemur optimizer (ILO) with dynamic scaling factors and Gaussian mutation is introduced in this paper. The dynamic scaling factors balance the exploration and exploitation transition by dynamically adjusting their values throughout the optimization process. The proposed algorithm incorporates Gaussian mutation to induce diversity in the population and hence improve the exploration capability. The efficiency of the proposed approach is tested on 33 functions including classical benchmark and CEC-2019 test functions, and a comprehensive comparison is made with six other well-known metaheuristic algorithms. The simulation and statistical results indicate superior performance of ILO in achieving optimal solutions compared to the competing algorithms. The algorithm is further employed to address two constrained classical engineering design problems, demonstrating its robustness. [ABSTRACT FROM AUTHOR]

Traditional deterministic optimization algorithms are difficult to effectively solve many real-world nonlinear, complex, and high-dimensional optimization problems. The metaheuristic optimization algorithm has evolved in recent years into a kind of very popular algorithm due to its gradient-free and random nature. In this paper, a new metaheuristic algorithm, namely the literature research optimization algorithm (LRO), is proposed. In this algorithm, the literature research process is represented as a mathematical model, and new mechanisms are designed to help realize the global exploration and local exploitation. To evaluate the performance of LRO, three sets of test functions including the standard benchmark set, CEC2017, and CEC2019 are applied first, and then, six engineering problems are employed to further verify it. The Friedman test and Wilcoxon rank sum test are also used to statistically compare the proposed LRO algorithm with ten common existing metaheuristics. The results show that the LRO algorithm outperforms the comparison algorithms on most benchmark functions and that it also performs well in practical engineering applications. The LRO algorithm can provide superior solutions to most optimization problems compared to other metaheuristic algorithms and become a promising candidate for many real-life optimization problems. [ABSTRACT FROM AUTHOR]

The DWCS (dynamic wireless charging system) is an innovative electric vehicle charging solution that allows for charging while the vehicle is in motion without requiring direct physical contact. This groundbreaking technology has the capacity to significantly reduce the size of electric vehicle batteries and improve battery life if the DWCS is installed correctly along the route. However, using smaller batteries and improving battery life requires more DWCS stations to be installed along the route. This becomes more challenging due to the heterogeneity of battery vehicles, making finding the optimal compromise between batteries cost and charging infrastructure cost complex since each type has unique characteristics. To address this challenge, we present a quantitative analysis of the benefits of dynamic charging using a mathematical model that considers both batteries and charging infrastructure costs, considering the heterogeneity and life of battery vehicles. Our analysis focuses on identifying how much batteries cost can be reduced to decrease system costs while demonstrating the benefits of dynamic charging on battery life. In the resolution stage, we have created an innovative approach that utilizes multi-agent systems and reinforcement learning, explicitly Q-learning, within the framework of distributed artificial intelligence. [ABSTRACT FROM AUTHOR]

In wireless rechargeable sensor networks (WRSNs), due to data collection and charging, energy efficiency is a crucial factor because it affects the network's reliability and performance. Wireless energy transfer (WET) and wireless data collection (WDC) using separate vehicles are two promising new methods for improving the energy efficiency of sensors. We combine WET and WDC on a single mobile vehicle (MV) to charge and collect data from the sensors by traversing specified sojourn locations within the WRSNs. The objective of this work is to maximize data collection per unit of energy and reduce the number of inactive sensors. In order to accomplish this, we propose a novel scheme, namely DCPCS, that includes two heuristics and two optimization algorithms. We utilized the circle-covering algorithm to determine sojourn locations based on energy consumption rates and the location of sensors. The ant lion optimization (ALO) algorithm partitions the network into the minimum number of regions, assigns a MV to each region, and ensures balanced total energy consumption among the MVs. The ALO algorithm utilizes the first heuristic algorithm to validate the regions for the MVs. Subsequently, the discrete grey wolf optimization algorithm determines the optimal order of the sojourn locations for data collection and charging by a MV within a region. To accomplish our objectives, we propose a heuristic data collection and partial charging strategy to determine the sojourn times of the MVs at the sojourn locations. We conduct simulations and compare the results of the proposed DCPCS scheme with three existing schemes. The simulation outcomes demonstrate that our proposed scheme outperforms the other schemes in terms of various performance metrics. [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]