Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems

Bobcat Optimization Algorithm: an effective bio-inspired metaheuristic algorithm for solving supply chain optimization problems

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

A novel hybrid adaptive differential evolution for global optimization

Differential Evolution (DE) stands as a potent global optimization algorithm, renowned for its application in addressing a myriad of practical engineering issues. The efficacy of DE is profoundly influenced by its control parameters and mutation strategies. In light of this, we introduce a refined DE algorithm characterized by adaptive parameters and dual mutation strategies (APDSDE). APDSDE inaugurates an adaptive switching mechanism that alternates between two innovative mutation strategies: DE/current-to-pBest-w/1 and DE/current-to-Amean-w/1. Furthermore, a novel parameter adaptation technique rooted in cosine similarity is established, with the derivation of explicit calculation formulas for both the scaling factor weight and crossover rate weight. In pursuit of optimizing convergence speed whilst preserving population diversity, a sophisticated nonlinear population size reduction method is proposed. The robustness of each algorithm is rigorously evaluated against the CEC2017 benchmark functions, with empirical evidence underscoring the superior performance of APDSDE in comparison to a host of advanced DE variants.

Nature-Inspired Intelligent Computing: A Comprehensive Survey

Nature, with its numerous surprising rules, serves as a rich source of creativity for the development of artificial intelligence, inspiring researchers to create several nature-inspired intelligent computing paradigms based on natural mechanisms. Over the past decades, these paradigms have revealed effective and flexible solutions to practical and complex problems. This paper summarizes the natural mechanisms of diverse advanced nature-inspired intelligent computing paradigms, which provide valuable lessons for building general-purpose machines capable of adapting to the environment autonomously. According to the natural mechanisms, we classify nature-inspired intelligent computing paradigms into 4 types: evolutionary-based, biological-based, social-cultural-based, and science-based. Moreover, this paper also illustrates the interrelationship between these paradigms and natural mechanisms, as well as their real-world applications, offering a comprehensive algorithmic foundation for mitigating unreasonable metaphors. Finally, based on the detailed analysis of natural mechanisms, the challenges of current nature-inspired paradigms and promising future research directions are presented.

Improved multi-strategy artificial rabbits optimization for solving global optimization problems

Artificial rabbits optimization (ARO) is a metaheuristic algorithm based on the survival strategy of rabbits proposed in 2022. ARO has favorable optimization performance, but it still has some shortcomings, such as weak exploitation capacity, easy to fall into local optima, and serious decline of population diversity at the later stage. In order to solve these problems, we propose an improved multi-strategy artificial rabbits optimization, called IMARO, based on ARO algorithm. In this paper, a roulette fitness distance balanced hiding strategy is proposed so that rabbits can find better locations to hide more reasonably. Meanwhile, in order to improve the deficiency of ARO which is easy to fall into local optimum, an improved non-monopoly search strategy based on Gaussian and Cauchy operators is designed to improve the ability of the algorithm to obtain the global optimal solution. Finally, a covariance restart strategy is designed to improve population diversity when the exploitation is stagnant and to improve the convergence accuracy and convergence speed of ARO. The performance of IMARO is verified by comparing original ARO algorithm with six basic algorithms and seven improved algorithms. The results of CEC2014, CEC2017, CEC2022 show that IMARO has a good exploitation and exploration ability and can effectively get rid of local optimum. Moreover, IMARO produces optimal results on six real-world engineering problems, further demonstrating its efficiency in solving real-world optimization challenges.

An Improved Archimedes Optimization-aided Multi-scale Deep Learning Segmentation with dilated ensemble CNN classification for detecting lung cancer using CT images

Early detection of lung cancer is necessary to prevent deaths caused by lung cancer. But, the identification of cancer in lungs using Computed Tomography (CT) scan based on some deep learning algorithms does not provide accurate results. A novel adaptive deep learning is developed with heuristic improvement. The proposed framework constitutes three sections as (a) Image acquisition, (b) Segmentation of Lung nodule, and (c) Classifying lung cancer. The raw CT images are congregated through standard data sources. It is then followed by nodule segmentation process, which is conducted by Adaptive Multi-Scale Dilated Trans-Unet3+. For increasing the segmentation accuracy, the parameters in this model is optimized by proposing Modified Transfer Operator-based Archimedes Optimization (MTO-AO). At the end, the segmented images are subjected to classification procedure, namely, Advanced Dilated Ensemble Convolutional Neural Networks (ADECNN), in which it is constructed with Inception, ResNet and MobileNet, where the hyper parameters is tuned by MTO-AO. From the three networks, the final result is estimated by high ranking-based classification. Hence, the performance is investigated using multiple measures and compared among different approaches. Thus, the findings of model demonstrate to prove the system's efficiency of detecting cancer and help the patient to get the appropriate treatment.

An Improved Football Team Training Algorithm for Global Optimization

The football team training algorithm (FTTA) is a new metaheuristic algorithm that was proposed in 2024. The FTTA has better performance but faces challenges such as poor convergence accuracy and ease of falling into local optimality due to limitations such as referring too much to the optimal individual for updating and insufficient perturbation of the optimal agent. To address these concerns, this paper presents an improved football team training algorithm called IFTTA. To enhance the exploration ability in the collective training phase, this paper proposes the fitness distance-balanced collective training strategy. This enables the players to train more rationally in the collective training phase and balances the exploration and exploitation capabilities of the algorithm. To further perturb the optimal agent in FTTA, a non-monopoly extra training strategy is designed to enhance the ability to get rid of the local optimum. In addition, a population restart strategy is then designed to boost the convergence accuracy and population diversity of the algorithm. In this paper, we validate the performance of IFTTA and FTTA as well as six comparison algorithms in CEC2017 test suites. The experimental results show that IFTTA has strong optimization performance. Moreover, several engineering-constrained optimization problems confirm the potential of IFTTA to solve real-world optimization problems.

t a c w f c i sab o

HRES (Hybrid Renewable Energy Systems) has been designed because of the increasing demand for environmentally friendly and sustainable energy. In this study, an Improved Subtraction-Average-Based Optimizer (ISABO) is presented for optimizing the HRES system by wind power, fuel cells, and solar energy. The suggested approach, by introducing adaptive mechanisms and enhancing processes, improves the performance of the traditional subtraction-average-based optimization. Optimization aims to provide reliable and efficient energy while lowering system expenses. The efficacy of ISABO is evaluated for this goal and compared with other optimization techniques. According to the findings, The ISABO algorithm, when equipped with adaptive mechanisms, surpasses conventional optimization techniques by achieving a 12 % decrease in Net Present Cost (NPC) and Levelized Cost of Electricity (LCOE) along with a 45 % cost reduction in electrolyzers. Through simulations, it has been shown that the ISABO algorithm ensures the lowest average NPC at $1,357,018.15 while also upholding system reliability with just a 0.8 % decline in Load Point Supply Probability (LPSP) in the event of a PV unit failure. This research validates that hybrid PV/wind/fuel cell systems present superior cost-effectiveness and reliability, thereby opening doors for more economical renewable energy solutions. The study reveals hybrid PV/wind/fuel cell systems are more cost-effective than purely wind, PV, or fuel cell systems. This advancement in HRES design and optimization techniques will enable more cost-effective renewable energy options.

Greater cane rat algorithm (GCRA): A nature-inspired metaheuristic for optimization problems

This paper introduces a new metaheuristic technique known as the Greater Cane Rat Algorithm (GCRA) for addressing optimization problems. The optimization process of GCRA is inspired by the intelligent foraging behaviors of greater cane rats during and off mating season. Being highly nocturnal, they are intelligible enough to leave trails as they forage through reeds and grass. Such trails would subsequently lead to food and water sources and shelter. The exploration phase is achieved when they leave the different shelters scattered around their territory to forage and leave trails. It is presumed that the alpha male maintains knowledge about these routes, and as a result, other rats modify their location according to this information. Also, the males are aware of the breeding season and separate themselves from the group. The assumption is that once the group is separated during this season, the foraging activities are concentrated within areas of abundant food sources, which aids the exploitation. Hence, the smart foraging paths and behaviors during the mating season are mathematically represented to realize the design of the GCR algorithm and carry out the optimization tasks. The performance of GCRA is tested using twenty-two classical benchmark functions, ten CEC 2020 complex functions, and the CEC 2011 real-world continuous benchmark problems. To further test the performance of the proposed algorithm, six classic problems in the engineering domain were used. Furthermore, a thorough analysis of computational and convergence results is presented to shed light on the efficacy and stability levels of GCRA. The statistical significance of the results is compared with ten state-of-the-art algorithms using Friedman's and Wilcoxon's signed rank tests. These findings show that GCRA produced optimal or nearly optimal solutions and evaded the trap of local minima, distinguishing it from the rival optimization algorithms employed to tackle similar problems. The GCRA optimizer source code is publicly available at: https://www.mathworks.com/matlabcentral/fileexchange/165241-greater-cane-rat-algorithm-gcra.

Learning cooking algorithm for solving global optimization problems

In recent years, many researchers have made a continuous effort to develop new and efficient meta-heuristic algorithms to address complex problems. Hence, in this study, a novel human-based meta-heuristic algorithm, namely, the learning cooking algorithm (LCA), is proposed that mimics the cooking learning activity of humans in order to solve challenging problems. The LCA strategy is primarily motivated by observing how mothers and children prepare food. The fundamental idea of the LCA strategy is mathematically designed in two phases: (i) children learn from their mothers and (ii) children and mothers learn from a chef. The performance of the proposed LCA algorithm is evaluated on 51 different benchmark functions (which includes the first 23 functions of the CEC 2005 benchmark functions) and the CEC 2019 benchmark functions compared with state-of-the-art meta-heuristic algorithms. The simulation results and statistical analysis such as the t-test, Wilcoxon rank-sum test, and Friedman test reveal that LCA may effectively address optimization problems by maintaining a proper balance between exploitation and exploration. Furthermore, the LCA algorithm has been employed to solve seven real-world engineering problems, such as the tension/compression spring design, pressure vessel design problem, welded beam design problem, speed reducer design problem, gear train design problem, three-bar truss design, and cantilever beam problem. The results demonstrate the LCA's superiority and capability over other algorithms in solving complex optimization problems.

A novel multi-strategy ameliorated quasi-oppositional chaotic tunicate swarm algorithm for global optimization and constrained engineering applications

Over the last few decades, a number of prominent meta-heuristic algorithms have been put forth to address complex optimization problems. However, there is a critical need to enhance these existing meta-heuristics by employing a variety of evolutionary techniques to tackle the emerging challenges in engineering applications. As a result, this study attempts to boost the efficiency of the recently introduced bio-inspired algorithm, the Tunicate Swarm Algorithm (TSA), which is motivated by the foraging and swarming behaviour of bioluminescent tunicates residing in the deep sea. Like other algorithms, the TSA has certain limitations, including getting trapped in the local optimal values and a lack of exploration ability, resulting in premature convergence when dealing with highly challenging optimization problems. To overcome these shortcomings, a novel multi-strategy ameliorated TSA, termed the Quasi-Oppositional Chaotic TSA (QOCTSA), has been proposed as an enhanced variant of TSA. This enhanced method contributes the simultaneous incorporation of the Quasi-Oppositional Based Learning (QOBL) and Chaotic Local Search (CLS) mechanisms to effectively balance exploration and exploitation. The implementation of QOBL improves convergence accuracy and exploration rate, while the inclusion of a CLS strategy with ten chaotic maps improves exploitation by enhancing local search ability around the most prospective regions. Thus, the QOCTSA significantly enhances convergence accuracy while maintaining TSA diversification. The experimentations are conducted on a set of thirty-three diverse functions: CEC2005 and CEC2019 test functions, as well as several real-world engineering problems. The statistical and graphical outcomes indicate that QOCTSA is superior to TSA and exhibits a faster rate of convergence. Furthermore, the statistical tests, specifically the Wilcoxon rank-sum test and t-test, reveal that the QOCTSA method outperforms the other competing algorithms in the domain of real-world engineering design problems.

An improved manta ray foraging optimization algorithm

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

Dual path parallel hierarchical diagnosis model for intracranial tumors based on multi-feature entropy weight

The grading diagnosis of intracranial tumors is a key step in formulating clinical treatment plans and surgical guidelines. To effectively grade the diagnosis of intracranial tumors, this paper proposes a dual path parallel hierarchical model that can automatically grade the diagnosis of intracranial tumors with high accuracy. In this model, prior features of solid tumor mass and intratumoral necrosis are extracted. Then the optimal division of the data set is achieved through multi-feature entropy weight. The multi-modal input is realized by the dual path structure. Multiple features are superimposed and fused to achieve the image grading. The model has been tested on the actual clinical medical images provided by the Second Affiliated Hospital of Dalian Medical University. The experiment shows that the proposed model has good generalization ability, with an accuracy of 0.990. The proposed model can be applied to clinical diagnosis and has practical application prospects.

An enhanced Coati Optimization Algorithm for global optimization and feature selection in EEG emotion recognition

Emotion recognition based on Electroencephalography (EEG) signals has garnered significant attention across diverse domains including healthcare, education, information sharing, and gaming, among others. Despite its potential, the absence of a standardized feature set poses a challenge in efficiently classifying various emotions. Addressing the issue of high dimensionality, this paper introduces an advanced variant of the Coati Optimization Algorithm (COA), called eCOA for global optimization and selecting the best subset of EEG features for emotion recognition. Specifically, COA suffers from local optima and imbalanced exploitation abilities as other metaheuristic methods. The proposed eCOA incorporates the COA and RUNge Kutta Optimizer (RUN) algorithms. The Scale Factor (SF) and Enhanced Solution Quality (ESQ) mechanism from RUN are applied to resolve the raised shortcomings of COA. The proposed eCOA algorithm has been extensively evaluated using the CEC'22 test suite and two EEG emotion recognition datasets, DEAP and DREAMER. Furthermore, the eCOA is applied for binary and multi-class classification of emotions in the dimensions of valence, arousal, and dominance using a multi-layer perceptron neural network (MLPNN). The experimental results revealed that the eCOA algorithm has more powerful search capabilities than the original COA and seven well-known counterpart methods related to statistical, convergence, and diversity measures. Furthermore, eCOA can efficiently support feature selection to find the best EEG features to maximize performance on four quadratic emotion classification problems compared to the methods of its counterparts. The suggested method obtains a classification accuracy of 85.17% and 95.21% in the binary classification of low and high arousal emotions in two public datasets: DEAP and DREAMER, respectively, which are 5.58% and 8.98% superior to existing approaches working on the same datasets for different subjects, respectively.

A hybrid particle swarm optimization algorithm for solving engineering problem

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.

A Novel Artificial Electric Field Algorithm for Solving Global Optimization and Real-World Engineering Problems

The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization problems.

Chaotic opposition learning with mirror reflection and worst individual disturbance grey wolf optimizer for continuous global numerical optimization

The effective meta-heuristic technique known as the grey wolf optimizer (GWO) has shown its proficiency. However, due to its reliance on the alpha wolf for guiding the position updates of search agents, the risk of being trapped in a local optimal solution is notable. Furthermore, during stagnation, the convergence of other search wolves towards this alpha wolf results in a lack of diversity within the population. Hence, this research introduces an enhanced version of the GWO algorithm designed to tackle numerical optimization challenges. The enhanced GWO incorporates innovative approaches such as Chaotic Opposition Learning (COL), Mirror Reflection Strategy (MRS), and Worst Individual Disturbance (WID), and it's called CMWGWO. MRS, in particular, empowers certain wolves to extend their exploration range, thus enhancing the global search capability. By employing COL, diversification is intensified, leading to reduced solution stagnation, improved search precision, and an overall boost in accuracy. The integration of WID fosters more effective information exchange between the least and most successful wolves, facilitating a successful exit from local optima and significantly enhancing exploration potential. To validate the superiority of CMWGWO, a comprehensive evaluation is conducted. A wide array of 23 benchmark functions, spanning dimensions from 30 to 500, ten CEC19 functions, and three engineering problems are used for experimentation. The empirical findings vividly demonstrate that CMWGWO surpasses the original GWO in terms of convergence accuracy and robust optimization capabilities.

Botox Optimization Algorithm: A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems

This paper introduces the Botox Optimization Algorithm (BOA), a novel metaheuristic inspired by the Botox operation mechanism. The algorithm is designed to address optimization problems, utilizing a human-based approach. Taking cues from Botox procedures, where defects are targeted and treated to enhance beauty, the BOA is formulated and mathematically modeled. Evaluation on the CEC 2017 test suite showcases the BOA's ability to balance exploration and exploitation, delivering competitive solutions. Comparative analysis against twelve well-known metaheuristic algorithms demonstrates the BOA's superior performance across various benchmark functions, with statistically significant advantages. Moreover, application to constrained optimization problems from the CEC 2011 test suite highlights the BOA's effectiveness in real-world optimization tasks.

NSCSO: a novel multi-objective non-dominated sorting chicken swarm optimization algorithm

Addressing the challenge of efficiently solving multi-objective optimization problems (MOP) and attaining satisfactory optimal solutions has always posed a formidable task. In this paper, based on the chicken swarm optimization algorithm, proposes the non-dominated sorting chicken swarm optimization (NSCSO) algorithm. The proposed approach involves assigning ranks to individuals in the chicken swarm through fast non-dominance sorting and utilizing the crowding distance strategy to sort particles within the same rank. The MOP is tackled based on these two strategies, with the integration of an elite opposition-based learning strategy to facilitate the exploration of optimal solution directions by individual roosters. NSCSO and 6 other excellent algorithms were tested in 15 different benchmark functions for experiments. By comprehensive comparison of the test function results and Friedman test results, the results obtained by using the NSCSO algorithm to solve the MOP problem have better performance. Compares the NSCSO algorithm with other multi-objective optimization algorithms in six different engineering design problems. The results show that NSCSO not only performs well in multi-objective function tests, but also obtains realistic solutions in multi-objective engineering example problems.

Application of a novel metaheuristic algorithm inspired by stadium spectators in global optimization problems

This paper presents a novel metaheuristic algorithm inspired by the actions of stadium spectators affecting behavior of players during a match which will be called stadium spectators optimizer (SSO) algorithm. The mathematical model of the SSO algorithm is presented and the performance and efficiency of the presented method is tested on some of the well-known mathematical test functions and also CEC-BC-2017 functions. The SSO algorithm is a parameter-free optimization method since it doesn't require any additional parameter setup at any point throughout the optimization process. It seems urgently necessary to design a novel metaheuristic algorithm that is parameter-free and capable of solving any optimization problem without taking into account extra parameters, as the majority of metaheuristic algorithms rely on the configuration of extra parameters to solve different problems efficiently. A positive point for the SSO algorithm can be seen in the results of the suggested technique, which indicate a partial improvement in performance. The results are compared with those of golf optimization algorithm (GOA), Tiki taka optimization algorithm (TTA), Harris Hawks optimization algorithm (HHO), the arithmetic optimization algorithm (AOA), CMA-ES and EBOwithCMAR algorithms. The statistical tests are carried out for the obtained results and the tests reveal the capability of the presented method in solving different optimization problems with different dimensions. SSO algorithm performs comparably and robustly with the state-of-the-art optimization techniques in 14 of the mathematical test functions. For CEC-BC-2017 functions with ten dimensions, EBOwithCMAR performs better than the proposed method. However, for most functions of CEC-BC-2017 with ten dimensions, the SSO algorithm ranks second after EBOwithCMAR, which is an advantage of the SSO since the proposed method performs better than the well-known CMA-ES optimization algorithm. The overall performance of the SSO algorithm in CEC-BC-2017 functions with 10 dimensions was acceptable, in dimension of 30, 50 and 100, the performance of the proposed method in some functions decreased.

Nested Markov chain hyper-heuristic (NMHH): a hybrid hyper-heuristic framework for single-objective continuous problems

This article introduces a new hybrid hyper-heuristic framework that deals with single-objective continuous optimization problems. This approach employs a nested Markov chain on the base level in the search for the best-performing operators and their sequences and simulated annealing on the hyperlevel, which evolves the chain and the operator parameters. The novelty of the approach consists of the upper level of the Markov chain expressing the hybridization of global and local search operators and the lower level automatically selecting the best-performing operator sequences for the problem. Numerical experiments conducted on well-known benchmark functions and the comparison with another hyper-heuristic framework and six state-of-the-art metaheuristics show the effectiveness of the proposed approach.

Predicting dissolved oxygen level using Young's double-slit experiment optimizer-based weighting model

Accurate prediction of the dissolved oxygen level (DOL) is important for enhancing environmental conditions and facilitating water resource management. However, the irregularity and volatility inherent in DOL pose significant challenges to achieving precise forecasts. A single model usually suffers from low prediction accuracy, narrow application range, and difficult data acquisition. This study proposes a new weighted model that avoids these problems, which could increase the prediction accuracy of the DOL. The weighting constructs of the proposed model (PWM) included eight neural networks and one statistical method and utilized Young's double-slit experimental optimizer as an intelligent weighting tool. To evaluate the effectiveness of PWM, simulations were conducted using real-world data acquired from the Tualatin River Basin in Oregon, United States. Empirical findings unequivocally demonstrated that PWM outperforms both the statistical model and the individual machine learning models, and has the lowest mean absolute percentage error among all the weighted models. Based on two real datasets, the PWM can averagely obtain the mean absolute percentage errors of 1.0216%, 1.4630%, and 1.7087% for one-, two-, and three-step predictions, respectively. This study shows that the PWM can effectively integrate the distinctive merits of deep learning methods, neural networks, and statistical models, thereby increasing forecasting accuracy and providing indispensable technical support for the sustainable development of regional water environments.

Bald eagle search algorithm for solving a three-dimensional path planning problem

Three-dimensional path planning refers to determining an optimal path in a three-dimensional space with obstacles, so that the path is as close to the target location as possible, while meeting some other constraints, including distance, altitude, threat area, flight time, energy consumption, and so on. Although the bald eagle search algorithm has the characteristics of simplicity, few control parameters, and strong global search capabilities, it has not yet been applied to complex three-dimensional path planning problems. In order to broaden the application scenarios and scope of the algorithm and solve the path planning problem in three-dimensional space, we present a study where five three-dimensional geographical environments are simulated to represent real-life unmanned aerial vehicles flying scenarios. These maps effectively test the algorithm's ability to handle various terrains, including extreme environments. The experimental results have verified the excellent performance of the BES algorithm, which can quickly, stably, and effectively solve complex three-dimensional path planning problems, making it highly competitive in this field.

Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms.

Differential Mutation Incorporated Quantum Honey Badger Algorithm with Dynamic Opposite Learning and Laplace Crossover for Fuzzy Front-End Product Design

In this paper, a multi-strategy fusion enhanced Honey Badger algorithm (EHBA) is proposed to address the problem of easy convergence to local optima and difficulty in achieving fast convergence in the Honey Badger algorithm (HBA). The adoption of a dynamic opposite learning strategy broadens the search area of the population, enhances global search ability, and improves population diversity. In the honey harvesting stage of the honey badger (development), differential mutation strategies are combined, selectively introducing local quantum search strategies that enhance local search capabilities and improve population optimization accuracy, or introducing dynamic Laplacian crossover operators that can improve convergence speed, while reducing the odds of the HBA sinking into local optima. Through comparative experiments with other algorithms on the CEC2017, CEC2020, and CEC2022 test sets, and three engineering examples, EHBA has been verified to have good solving performance. From the comparative analysis of convergence graphs, box plots, and algorithm performance tests, it can be seen that compared with the other eight algorithms, EHBA has better results, significantly improving its optimization ability and convergence speed, and has good application prospects in the field of optimization problems.

A New Hybrid Particle Swarm Optimization-Teaching-Learning-Based Optimization for Solving Optimization Problems

This research paper develops a novel hybrid approach, called hybrid particle swarm optimization-teaching-learning-based optimization (hPSO-TLBO), by combining two metaheuristic algorithms to solve optimization problems. The main idea in hPSO-TLBO design is to integrate the exploitation ability of PSO with the exploration ability of TLBO. The meaning of "exploitation capabilities of PSO" is the ability of PSO to manage local search with the aim of obtaining possible better solutions near the obtained solutions and promising areas of the problem-solving space. Also, "exploration abilities of TLBO" means the ability of TLBO to manage the global search with the aim of preventing the algorithm from getting stuck in inappropriate local optima. hPSO-TLBO design methodology is such that in the first step, the teacher phase in TLBO is combined with the speed equation in PSO. Then, in the second step, the learning phase of TLBO is improved based on each student learning from a selected better student that has a better value for the objective function against the corresponding student. The algorithm is presented in detail, accompanied by a comprehensive mathematical model. A group of benchmarks is used to evaluate the effectiveness of hPSO-TLBO, covering various types such as unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. In addition, CEC 2017 benchmark problems are also utilized for evaluation purposes. The optimization results clearly demonstrate that hPSO-TLBO performs remarkably well in addressing the benchmark functions. It exhibits a remarkable ability to explore and exploit the search space while maintaining a balanced approach throughout the optimization process. Furthermore, a comparative analysis is conducted to evaluate the performance of hPSO-TLBO against twelve widely recognized metaheuristic algorithms. The evaluation of the experimental findings illustrates that hPSO-TLBO consistently outperforms the competing algorithms across various benchmark functions, showcasing its superior performance. The successful deployment of hPSO-TLBO in addressing four engineering challenges highlights its effectiveness in tackling real-world applications.

A hybrid algorithm of grey wolf optimizer and harris hawks optimization for solving global optimization problems with improved convergence performance

The grey wolf optimizer is an effective and well-known meta-heuristic algorithm, but it also has the weaknesses of insufficient population diversity, falling into local optimal solutions easily, and unsatisfactory convergence speed. Therefore, we propose a hybrid grey wolf optimizer (HGWO), based mainly on the exploitation phase of the harris hawk optimization. It also includes population initialization with Latin hypercube sampling, a nonlinear convergence factor with local perturbations, some extended exploration strategies. In HGWO, the grey wolves can have harris hawks-like flight capabilities during position updates, which greatly expands the search range and improves global searchability. By incorporating a greedy algorithm, grey wolves will relocate only if the new location is superior to the current one. This paper assesses the performance of the hybrid grey wolf optimizer (HGWO) by comparing it with other heuristic algorithms and enhanced schemes of the grey wolf optimizer. The evaluation is conducted using 23 classical benchmark test functions and CEC2020. The experimental results reveal that the HGWO algorithm performs well in terms of its global exploration ability, local exploitation ability, convergence speed, and convergence accuracy. Additionally, the enhanced algorithm demonstrates considerable advantages in solving engineering problems, thus substantiating its effectiveness and applicability.

Archimedes Optimization Algorithm-Based Feature Selection with Hybrid Deep-Learning-Based Churn Prediction in Telecom Industries

Customer churn prediction (CCP) implies the deployment of data analytics and machine learning (ML) tools to forecast the churning customers, i.e., probable customers who may remove their subscriptions, thus allowing the companies to apply targeted customer retention approaches and reduce the customer attrition rate. This predictive methodology improves active customer management and provides enriched satisfaction to the customers and also continuous business profits. By recognizing and prioritizing the relevant features, such as usage patterns and customer collaborations, and also by leveraging the capability of deep learning (DL) algorithms, the telecom companies can develop highly robust predictive models that can efficiently anticipate and mitigate customer churn by boosting retention approaches. In this background, the current study presents the Archimedes optimization algorithm-based feature selection with a hybrid deep-learning-based churn prediction (AOAFS-HDLCP) technique for telecom companies. In order to mitigate high-dimensionality problems, the AOAFS-HDLCP technique involves the AOAFS approach to optimally choose a set of features. In addition to this, the convolutional neural network with autoencoder (CNN-AE) model is also involved for the churn prediction process. Finally, the thermal equilibrium optimization (TEO) technique is employed for hyperparameter selection of the CNN-AE algorithm, which, in turn, helps in achieving improved classification performance. A widespread experimental analysis was conducted to illustrate the enhanced performance of the AOAFS-HDLCP algorithm. The experimental outcomes portray the high efficiency of the AOAFS-HDLCP approach over other techniques, with a maximum accuracy of 94.65%.

Giant Armadillo Optimization: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications.

Application of modified artificial hummingbird algorithm in optimal power flow and generation capacity in power networks considering renewable energy sources

Today's electrical power system is a complicated network that is expanding rapidly. The power transmission lines are more heavily loaded than ever before, which causes a host of problems like increased power losses, unstable voltage, and line overloads. Real and reactive power can be optimized by placing energy resources at appropriate locations. Congested networks benefit from this to reduce losses and enhance voltage profiles. Hence, the optimal power flow problem (OPF) is crucial for power system planning. As a result, electricity system operators can meet electricity demands efficiently and ensure the reliability of the power systems. The classical OPF problem ignores network emissions when dealing with thermal generators with limited fuel. Renewable energy sources are becoming more popular due to their sustainability, abundance, and environmental benefits. This paper examines modified IEEE-30 bus and IEEE-118 bus systems as case studies. Integrating renewable energy sources into the grid can negatively affect its performance without adequate planning. In this study, control variables were optimized to minimize fuel cost, real power losses, emission cost, and voltage deviation. It also met operating constraints, with and without renewable energy. This solution can be further enhanced by the placement of distributed generators (DGs). A modified Artificial Hummingbird Algorithm (mAHA) is presented here as an innovative and improved optimizer. In mAHA, local escape operator (LEO) and opposition-based learning (OBL) are integrated into the basic Artificial Hummingbird Algorithm (AHA). An improved version of AHA, mAHA, seeks to improve search efficiency and overcome limitations. With the CEC'2020 test suite, the mAHA has been compared to several other meta-heuristics for addressing global optimization challenges. To test the algorithm's feasibility, standard and modified test systems were used to solve the OPF problem. To assess the effectiveness of mAHA, the results were compared to those of seven other global optimization algorithms. According to simulation results, the proposed algorithm minimized the cost function and provided convergent solutions.

A hierarchical chain-based Archimedes optimization algorithm

The Archimedes optimization algorithm (AOA) has attracted much attention for its few parameters and competitive optimization effects. However, all agents in the canonical AOA are treated in the same way, resulting in slow convergence and local optima. To solve these problems, an improved hierarchical chain-based AOA (HCAOA) is proposed in this paper. The idea of HCAOA is to deal with individuals at different levels in different ways. The optimal individual is processed by an orthogonal learning mechanism based on refraction opposition to fully learn the information on all dimensions, effectively avoiding local optima. Superior individuals are handled by an Archimedes spiral mechanism based on Levy flight, avoiding clueless random mining and improving optimization speed. For general individuals, the conventional AOA is applied to maximize its inherent exploration and exploitation abilities. Moreover, a multi-strategy boundary processing mechanism is introduced to improve population diversity. Experimental outcomes on CEC 2017 test suite show that HCAOA outperforms AOA and other advanced competitors. The competitive optimization results achieved by HCAOA on four engineering design problems also demonstrate its ability to solve practical problems.

Extraction of Roads Using the Archimedes Tuning Process with the Quantum Dilated Convolutional Neural Network

Road network extraction is a significant challenge in remote sensing (RS). Automated techniques for interpreting RS imagery offer a cost-effective solution for obtaining road network data quickly, surpassing traditional visual interpretation methods. However, the diverse characteristics of road networks, such as varying lengths, widths, materials, and geometries across different regions, pose a formidable obstacle for road extraction from RS imagery. The issue of road extraction can be defined as a task that involves capturing contextual and complex elements while also preserving boundary information and producing high-resolution road segmentation maps for RS data. The objective of the proposed Archimedes tuning process quantum dilated convolutional neural network for road Extraction (ATP-QDCNNRE) technology is to tackle the aforementioned issues by enhancing the efficacy of image segmentation outcomes that exploit remote sensing imagery, coupled with Archimedes optimization algorithm methods (AOA). The findings of this study demonstrate the enhanced road-extraction capabilities achieved by the ATP-QDCNNRE method when used with remote sensing imagery. The ATP-QDCNNRE method employs DL and a hyperparameter tuning process to generate high-resolution road segmentation maps. The basis of this approach lies in the QDCNN model, which incorporates quantum computing (QC) concepts and dilated convolutions to enhance the network's ability to capture both local and global contextual information. Dilated convolutions also enhance the receptive field while maintaining spatial resolution, allowing fine road features to be extracted. ATP-based hyperparameter modifications improve QDCNNRE road extraction. To evaluate the effectiveness of the ATP-QDCNNRE system, benchmark databases are used to assess its simulation results. The experimental results show that ATP-QDCNNRE performed with an intersection over union (IoU) of 75.28%, mean intersection over union (MIoU) of 95.19%, F1 of 90.85%, precision of 87.54%, and recall of 94.41% in the Massachusetts road dataset. These findings demonstrate the superior efficiency of this technique compared to more recent methods.

A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems Based on Technical and Vocational Education and Training

In this paper, a new human-based metaheuristic algorithm called Technical and Vocational Education and Training-Based Optimizer (TVETBO) is introduced to solve optimization problems. The fundamental inspiration for TVETBO is taken from the process of teaching work-related skills to applicants in technical and vocational education and training schools. The theory of TVETBO is expressed and mathematically modeled in three phases: (i) theory education, (ii) practical education, and (iii) individual skills development. The performance of TVETBO when solving optimization problems is evaluated on the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that TVETBO, with its high abilities to explore, exploit, and create a balance between exploration and exploitation during the search process, is able to provide effective solutions for the benchmark functions. The results obtained from TVETBO are compared with the performances of twelve well-known metaheuristic algorithms. A comparison of the simulation results and statistical analysis shows that the proposed TVETBO approach provides better results in most of the benchmark functions and provides a superior performance in competition with competitor algorithms. Furthermore, in order to measure the effectiveness of the proposed approach in dealing with real-world applications, TVETBO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite. The simulation results show that TVETBO provides an effective and superior performance when solving constrained optimization problems of real-world applications compared to competitor algorithms.

Lyrebird Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

In this paper, a new bio-inspired metaheuristic algorithm called the Lyrebird Optimization Algorithm (LOA) that imitates the natural behavior of lyrebirds in the wild is introduced. The fundamental inspiration of LOA is the strategy of lyrebirds when faced with danger. In this situation, lyrebirds scan their surroundings carefully, then either run away or hide somewhere, immobile. LOA theory is described and then mathematically modeled in two phases: (i) exploration based on simulation of the lyrebird escape strategy and (ii) exploitation based on simulation of the hiding strategy. The performance of LOA was evaluated in optimization of the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that the proposed LOA approach has high ability in terms of exploration, exploitation, and balancing them during the search process in the problem-solving space. In order to evaluate the capability of LOA in dealing with optimization tasks, the results obtained from the proposed approach were compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that LOA has superior performance compared to competitor algorithms by providing better results in the optimization of most of the benchmark functions, achieving the rank of first best optimizer. A statistical analysis of the performance of the metaheuristic algorithms shows that LOA has significant statistical superiority in comparison with the compared algorithms. In addition, the efficiency of LOA in handling real-world applications was investigated through dealing with twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. The simulation results show that LOA has effective performance in handling optimization tasks in real-world applications while providing better results compared to competitor algorithms.

An automated system of intrusion detection by IoT-aided MQTT using improved heuristic-aided autoencoder and LSTM-based Deep Belief Network

The IoT offered an enormous number of services with the help of multiple applications so it faces various security-related problems and also heavy malicious attacks. Initially, the IoT data are gathered from the standard dataset as Message Queuing Telemetry Transport (MQTT) set. Further, the collected data are undergone the pre-processing stage, which is accomplished by using data cleaning and data transformation. The resultant processed data is given into two models named (i) Autoencoder with Deep Belief Network (DBN), in which the optimal features are selected from Autoencoder with the aid of Modified Archimedes Optimization Algorithm (MAOA). Further, the optimal features are subjected to the AL-DBN model, where the first classified outcomes are obtained with the parameter optimization of MAOA. Similarly, (ii) Long Short-Term Memory (LSTM) with DBN, in this model, the optimal features are chosen from LSTM with the aid of MAOA. Consequently, the optimal features are subjected into the AL-DBN model, where the second classified outcomes are acquired. Finally, the average score is estimated by two outcomes to provide the final classified result. Thus, the findings reveal that the suggested system achieves outstanding results to detect the attack significantly.

Hybrid Whale Archimedes Optimization-based MLPNN model for soil nutrient classification and pH prediction

Soil fertility and environmental factors play an important role in improving productivity and cropland quality in the agricultural sector. A new prediction and classification model for the potential of soil nutrients and hydrogen (pH) levels is proposed. The proposed model, Hybrid Whale Archimedes Optimization-based Multilayer Perceptron Neural Network (HWAO-MLPNN), is utilized for soil features classification of pH levels, and the soils are collected from the villages such as phosphorous (P), organic carbon (OC), boron (B), and potassium (K). The village-wise soil fertility prediction and classification model aims to improve soil health, reduce harmful fertilizer usage, enhance environmental quality, and achieve more profits. The proposed model combines the Multilayer Perceptron Neural Network (MLPNN) model and the Hybrid Whale Archimedes Optimization (HWAO) algorithm to enhance the classification performance on the validation data. The Marathwada dataset is selected to validate the soil nutrient prediction and classification model, and various measuring units such as cross-validation accuracy, Area Under Curve (AUC), accuracy, Mean Squared Error (MSE), G-mean, precision, specificity, and sensitivity are used for evaluation. The comparative study of this paper shows that the proposed HWAO-MLPNN achieved more classification accuracy of 98.1%, cross-validation accuracy of 98.3% for pH classification, and cross-validation accuracy of 97.9% for soil nutrient classification. The proposed model can be utilized to accurately classify soil nutrients and pH levels, which can have a significant impact on improving soil health, reducing harmful fertilizer usage, enhancing environmental quality, and ultimately increasing profitability in the agricultural sector.

Kookaburra Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems

In this paper, a new bio-inspired metaheuristic algorithm named the Kookaburra Optimization Algorithm (KOA) is introduced, which imitates the natural behavior of kookaburras in nature. The fundamental inspiration of KOA is the strategy of kookaburras when hunting and killing prey. The KOA theory is stated, and its mathematical modeling is presented in the following two phases: (i) exploration based on the simulation of prey hunting and (ii) exploitation based on the simulation of kookaburras' behavior in ensuring that their prey is killed. The performance of KOA has been evaluated on 29 standard benchmark functions from the CEC 2017 test suite for the different problem dimensions of 10, 30, 50, and 100. The optimization results show that the proposed KOA approach, by establishing a balance between exploration and exploitation, has good efficiency in managing the effective search process and providing suitable solutions for optimization problems. The results obtained using KOA have been compared with the performance of 12 well-known metaheuristic algorithms. The analysis of the simulation results shows that KOA, by providing better results in most of the benchmark functions, has provided superior performance in competition with the compared algorithms. In addition, the implementation of KOA on 22 constrained optimization problems from the CEC 2011 test suite, as well as 4 engineering design problems, shows that the proposed approach has acceptable and superior performance compared to competitor algorithms in handling real-world applications.

Liver Cancer Algorithm: A novel bio-inspired optimizer

This paper introduces a new bio-inspired optimization algorithm named the Liver Cancer Algorithm (LCA), which mimics the liver tumor growth and takeover process. It uses an evolutionary search approach that simulates the behavior of liver tumors when taking over the liver organ. The tumor's ability to replicate and spread to other organs inspires the algorithm. LCA algorithm is developed using genetic operators and a Random Opposition-Based Learning (ROBL) strategy to efficiently balance local and global searches and explore the search space. The algorithm's efficiency is tested on the IEEE Congress of Evolutionary Computation in 2020 (CEC'2020) benchmark functions and compared to seven widely used metaheuristic algorithms, including Genetic Algorithm (GA), particle swarm optimization (PSO), Differential Evolution (DE), Adaptive Guided Differential Evolution Algorithm (AGDE), Improved Multi-Operator Differential Evolution (IMODE), Harris Hawks Optimization (HHO), Runge-Kutta Optimization Algorithm (RUN), weIghted meaN oF vectOrs (INFO), and Coronavirus Herd Immunity Optimizer (CHIO). The statistical results of the convergence curve, boxplot, parameter space, and qualitative metrics show that the LCA algorithm performs competitively compared to well-known algorithms. Moreover, the versatility of the LCA algorithm extends beyond mathematical benchmark problems. It was also successfully applied to tackle the feature selection problem and optimize the support vector machine for various biomedical data classifications, resulting in the creation of the LCA-SVM model. The LCA-SVM model was evaluated in a total of twelve datasets, among which the MonoAmine Oxidase (MAO) dataset stood out, showing the highest performance compared to the other datasets. In particular, the LCA-SVM model achieved an impressive accuracy of 98.704% on the MAO dataset. This outstanding result demonstrates the efficacy and potential of the LCA-SVM approach in handling complex datasets and producing highly accurate predictions. The experimental results indicate that the LCA algorithm surpasses other methods to solve mathematical benchmark problems and feature selection.

Integrative soft computing approaches for optimizing thermal energy performance in residential buildings

As is known, early prediction of thermal load in buildings can give valuable insight to engineers and energy experts in order to optimize the building design. Although different machine learning models have been promisingly employed for this problem, newer sophisticated techniques still require proper attention. This study aims at introducing novel hybrid algorithms for estimating building thermal load. The predictive models are artificial neural networks exposed to five optimizer algorithms, namely Archimedes optimization algorithm (AOA), Beluga whale optimization (BWO), forensic-based investigation (FBI), snake optimizer (SO), and transient search algorithm (TSO), for attaining optimal trainings. These five integrations aim at predicting the annual thermal energy demand. The accuracy of the models is broadly assessed using mean absolute percentage error (MAPE), root mean square error (RMSE), and coefficient of determination (R2) indicators and a ranking system is accordingly developed. As the MAPE and R2 reported, all obtained relative errors were below 5% and correlations were above 92% which confirm the general acceptability of the results and all used models. While the models exhibited different performances in training and testing stages, referring to the overall results, the BWO emerged as the most accurate algorithm, followed by the AOA and SO simultaneously in the second position, the FBI as the third, and TSO as the fourth accurate model. Mean absolute error (MAPE) and Considering the wide variety of artificial intelligence techniques that are used nowadays, the findings of this research may shed light on the selection of proper techniques for reliable energy performance analysis in complex buildings.

Dynamic Coati Optimization Algorithm for Biomedical Classification Tasks

Medical datasets are primarily made up of numerous pointless and redundant elements in a collection of patient records. None of these characteristics are necessary for a medical decision-making process. Conversely, a large amount of data leads to increased dimensionality and decreased classifier performance in terms of machine learning. Numerous approaches have recently been put out to address this issue, and the results indicate that feature selection can be a successful remedy. To meet the various needs of input patterns, medical diagnostic tasks typically involve learning a suitable categorization model. The k-Nearest Neighbors algorithm (kNN) classifier's classification performance is typically decreased by the input variables' abundance of irrelevant features. To simplify the kNN classifier, essential attributes of the input variables have been searched using the feature selection approach. This paper presents the Coati Optimization Algorithm (DCOA) in a dynamic form as a feature selection technique where each iteration of the optimization process involves the introduction of a different feature. We enhance the exploration and exploitation capability of DCOA by employing dynamic opposing candidate solutions. The most impressive feature of DCOA is that it does not require any preparatory parameter fine-tuning to the most popular metaheuristic algorithms. The CEC'22 test suite and nine medical datasets with various dimension sizes were used to evaluate the performance of the original COA and the proposed dynamic version. The statistical results were validated using the Bonferroni-Dunn test and Kendall's W test and showed the superiority of DCOA over seven well-known metaheuristic algorithms with an overall accuracy of 89.7%, a feature selection of 24%, a sensitivity of 93.35% a specificity of 96.81%, and a precision of 93.90%.

Dispersed differential hunger games search for high dimensional gene data feature selection

The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode.

Adaptive Guided Equilibrium Optimizer with Spiral Search Mechanism to Solve Global Optimization Problems

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

A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection

Metaheuristic optimization algorithms manage the search process to explore search domains efficiently and are used efficiently in large-scale, complex problems. Transient Search Algorithm (TSO) is a recently proposed physics-based metaheuristic method inspired by the transient behavior of switched electrical circuits containing storage elements such as inductance and capacitance. TSO is still a new metaheuristic method; it tends to get stuck with local optimal solutions and offers solutions with low precision and a sluggish convergence rate. In order to improve the performance of metaheuristic methods, different approaches can be integrated and methods can be hybridized to achieve faster convergence with high accuracy by balancing the exploitation and exploration stages. Chaotic maps are effectively used to improve the performance of metaheuristic methods by escaping the local optimum and increasing the convergence rate. In this study, chaotic maps are included in the TSO search process to improve performance and accelerate global convergence. In order to prevent the slow convergence rate and the classical TSO algorithm from getting stuck in local solutions, 10 different chaotic maps that generate chaotic values instead of random values in TSO processes are proposed for the first time. Thus, ergodicity and non-repeatability are improved, and convergence speed and accuracy are increased. The performance of Chaotic Transient Search Algorithm (CTSO) in global optimization was investigated using the IEEE Congress on Evolutionary Computation (CEC)'17 benchmarking functions. Its performance in real-world engineering problems was investigated for speed reducer, tension compression spring, welded beam design, pressure vessel, and three-bar truss design problems. In addition, the performance of CTSO as a feature selection method was evaluated on 10 different University of California, Irvine (UCI) standard datasets. The results of the simulation showed that Gaussian and Sinusoidal maps in most of the comparison functions, Sinusoidal map in most of the real-world engineering problems, and finally the generally proposed CTSOs in feature selection outperform standard TSO and other competitive metaheuristic methods. Real application results demonstrate that the suggested approach is more effective than standard TSO.

AOBLMOA: A Hybrid Biomimetic Optimization Algorithm for Numerical Optimization and Engineering Design Problems

The Mayfly Optimization Algorithm (MOA), as a new biomimetic metaheuristic algorithm with superior algorithm framework and optimization methods, plays a remarkable role in solving optimization problems. However, there are still shortcomings of convergence speed and local optimization in this algorithm. This paper proposes a metaheuristic algorithm for continuous and constrained global optimization problems, which combines the MOA, the Aquila Optimizer (AO), and the opposition-based learning (OBL) strategy, called AOBLMOA, to overcome the shortcomings of the MOA. The proposed algorithm first fuses the high soar with vertical stoop method and the low flight with slow descent attack method in the AO into the position movement process of the male mayfly population in the MOA. Then, it incorporates the contour flight with short glide attack and the walk and grab prey methods in the AO into the positional movement of female mayfly populations in the MOA. Finally, it replaces the gene mutation behavior of offspring mayfly populations in the MOA with the OBL strategy. To verify the optimization ability of the new algorithm, we conduct three sets of experiments. In the first experiment, we apply AOBLMOA to 19 benchmark functions to test whether it is the optimal strategy among multiple combined strategies. In the second experiment, we test AOBLMOA by using 30 CEC2017 numerical optimization problems and compare it with state-of-the-art metaheuristic algorithms. In the third experiment, 10 CEC2020 real-world constrained optimization problems are used to demonstrate the applicability of AOBLMOA to engineering design problems. The experimental results show that the proposed AOBLMOA is effective and superior and is feasible in numerical optimization problems and engineering design problems.

PSO-Incorporated Hybrid Artificial Hummingbird Algorithm with Elite Opposition-Based Learning and Cauchy Mutation: A Case Study of Shape Optimization for CSGC-Ball Curves

With the rapid development of the geometric modeling industry and computer technology, the design and shape optimization of complex curve shapes have now become a very important research topic in CAGD. In this paper, the Hybrid Artificial Hummingbird Algorithm (HAHA) is used to optimize complex composite shape-adjustable generalized cubic Ball (CSGC-Ball, for short) curves. Firstly, the Artificial Hummingbird algorithm (AHA), as a newly proposed meta-heuristic algorithm, has the advantages of simple structure and easy implementation and can quickly find the global optimal solution. However, there are still limitations, such as low convergence accuracy and the tendency to fall into local optimization. Therefore, this paper proposes the HAHA based on the original AHA, combined with the elite opposition-based learning strategy, PSO, and Cauchy mutation, to increase the population diversity of the original algorithm, avoid falling into local optimization, and thus improve the accuracy and rate of convergence of the original AHA. Twenty-five benchmark test functions and the CEC 2022 test suite are used to evaluate the overall performance of HAHA, and the experimental results are statistically analyzed using Friedman and Wilkerson rank sum tests. The experimental results show that, compared with other advanced algorithms, HAHA has good competitiveness and practicality. Secondly, in order to better realize the modeling of complex curves in engineering, the CSGC-Ball curves with global and local shape parameters are constructed based on SGC-Ball basis functions. By changing the shape parameters, the whole or local shape of the curves can be adjusted more flexibly. Finally, in order to make the constructed curve have a more ideal shape, the CSGC-Ball curve-shape optimization model is established based on the minimum curve energy value, and the proposed HAHA is used to solve the established shape optimization model. Two representative numerical examples comprehensively verify the effectiveness and superiority of HAHA in solving CSGC-Ball curve-shape optimization problems.

Automatic breast cancer diagnosis based on hybrid dimensionality reduction technique and ensemble classification

INTRODUCTION

Feature selection in the face of high-dimensional data can reduce overfitting and learning time, and at the same time improve the accuracy and efficiency of the system. Since there are many irrelevant and redundant features in breast cancer diagnosis, removing such features leads to more accurate prediction and reduced decision time when dealing with large-scale data. Meanwhile, ensemble classifiers are powerful techniques to improve the prediction performance of classification models, where several individual classifier models are combined to achieve higher accuracy.

METHODS

In this paper, an ensemble classifier algorithm based on multilayer perceptron neural network is proposed for the classification task, in which the parameters (e.g., number of hidden layers, number of neurons in each hidden layer, and weights of links) are adjusted based on an evolutionary approach. Meanwhile, this paper uses a hybrid dimensionality reduction technique based on principal component analysis and information gain to address this problem.

RESULTS

The effectiveness of the proposed algorithm was evaluated based on the Wisconsin breast cancer database. In particular, the proposed algorithm provides an average of 17% better accuracy compared to the best results obtained from the existing state-of-the-art methods.

CONCLUSION

Experimental results show that the proposed algorithm can be used as an intelligent medical assistant system for breast cancer diagnosis.

A Subtraction-Average-Based Optimizer for Solving Engineering Problems with Applications on TCSC Allocation in Power Systems

The present study introduces a subtraction-average-based optimization algorithm (SAOA), a unique enhanced evolutionary technique for solving engineering optimization problems. The typical SAOA works by subtracting the average of searcher agents from the position of population members in the search space. To increase searching capabilities, this study proposes an improved SAO (ISAO) that incorporates a cooperative learning technique based on the leader solution. First, after considering testing on different standard mathematical benchmark functions, the proposed ISAOA is assessed in comparison to the standard SAOA. The simulation results declare that the proposed ISAOA establishes great superiority over the standard SAOA. Additionally, the proposed ISAOA is adopted to handle power system applications for Thyristor Controlled Series Capacitor (TCSC) allocation-based losses reduction in electrical power grids. The SAOA and the proposed ISAOA are employed to optimally size the TCSCs and simultaneously select their installed transmission lines. Both are compared to two recent algorithms, the Artificial Ecosystem Optimizer (AEO) and AQuila Algorithm (AQA), and two other effective and well-known algorithms, the Grey Wolf Optimizer (GWO) and Particle Swarm Optimizer (PSO). In three separate case studies, the standard IEEE-30 bus system is used for this purpose while considering varying numbers of TCSC devices that will be deployed. The suggested ISAOA's simulated implementations claim significant power loss reductions for the three analyzed situations compared to the GWO, AEO, PSO, and AQA.

Improved Environmental Stimulus and Biological Competition Tactics Interactive Artificial Ecological Optimization Algorithm for Clustering

An interactive artificial ecological optimization algorithm (SIAEO) based on environmental stimulus and a competition mechanism was devised to find the solution to a complex calculation, which can often become bogged down in local optimum because of the sequential execution of consumption and decomposition stages in the artificial ecological optimization algorithm. Firstly, the environmental stimulus defined by population diversity makes the population interactively execute the consumption operator and decomposition operator to abate the inhomogeneity of the algorithm. Secondly, the three different types of predation modes in the consumption stage were regarded as three different tasks, and the task execution mode was determined by the maximum cumulative success rate of each individual task execution. Furthermore, the biological competition operator is recommended to modify the regeneration strategy so that the SIAEO algorithm can provide consideration to the exploitation in the exploration stage, break the equal probability execution mode of the AEO, and promote the competition among operators. Finally, the stochastic mean suppression alternation exploitation problem is introduced in the later exploitation process of the algorithm, which can tremendously heighten the SIAEO algorithm to run away the local optimum. A comparison between SIAEO and other improved algorithms is performed on the CEC2017 and CEC2019 test set.

An efficient multilevel image thresholding method based on improved heap-based optimizer

Image segmentation is the process of separating pixels of an image into multiple classes, enabling the analysis of objects in the image. Multilevel thresholding (MTH) is a method used to perform this task, and the problem is to obtain an optimal threshold that properly segments each image. Methods such as the Kapur entropy or the Otsu method, which can be used as objective functions to determine the optimal threshold, are efficient in determining the best threshold for bi-level thresholding; however, they are not effective for MTH due to their high computational cost. This paper integrates an efficient method for MTH image segmentation called the heap-based optimizer (HBO) with opposition-based learning termed improved heap-based optimizer (IHBO) to solve the problem of high computational cost for MTH and overcome the weaknesses of the original HBO. The IHBO was proposed to improve the convergence rate and local search efficiency of search agents of the basic HBO, the IHBO is applied to solve the problem of MTH using the Otsu and Kapur methods as objective functions. The performance of the IHBO-based method was evaluated on the CEC'2020 test suite and compared against seven well-known metaheuristic algorithms including the basic HBO, salp swarm algorithm, moth flame optimization, gray wolf optimization, sine cosine algorithm, harmony search optimization, and electromagnetism optimization. The experimental results revealed that the proposed IHBO algorithm outperformed the counterparts in terms of the fitness values as well as other performance indicators, such as the structural similarity index (SSIM), feature similarity index (FSIM), peak signal-to-noise ratio. Therefore, the IHBO algorithm was found to be superior to other segmentation methods for MTH image segmentation.

SqueezeNet for the forecasting of the energy demand using a combined version of the sewing training-based optimization algorithm

With the introduction of various loads and dispersed production units to the system in recent years, the significance of precise forecasting for short, long, and medium loads have already been recognized. It is important to analyze the power system's performance in real-time and the appropriate response to changes in the electric load to make the best use of energy systems. Electric load forecasting for a long period in the time domain enables energy producers to increase grid stability, reduce equipment failures and production unit outages, and guarantee the dependability of electricity output. In this study, SqueezeNet is first used to obtain the required power demand forecast at the user end. The structure of the SqueezeNet is then enhanced using a customized version of the Sewing Training-Based Optimizer. A comparison between the results of the suggested method and those of some other published techniques is then implemented after the method has been applied to a typical case study with three different types of demands-short, long, and medium-term. A time window has been set up to collect the objective and input data from the customer at intervals of 20 min, allowing for highly effective neural network training. The results showed that the proposed method with 0.48, 0.49, and 0.53 MSE for Forecasting the short-term, medium-term, and long-term electricity provided the best results with the highest accuracy. The outcomes show that employing the suggested technique is a viable option for energy consumption forecasting.

Normal vibration distribution search-based differential evolution algorithm for multimodal biomedical image registration

In linear registration, a floating image is spatially aligned with a reference image after performing a series of linear metric transformations. Additionally, linear registration is mainly considered a preprocessing version of nonrigid registration. To better accomplish the task of finding the optimal transformation in pairwise intensity-based medical image registration, in this work, we present an optimization algorithm called the normal vibration distribution search-based differential evolution algorithm (NVSA), which is modified from the Bernstein search-based differential evolution (BSD) algorithm. We redesign the search pattern of the BSD algorithm and import several control parameters as part of the fine-tuning process to reduce the difficulty of the algorithm. In this study, 23 classic optimization functions and 16 real-world patients (resulting in 41 multimodal registration scenarios) are used in experiments performed to statistically investigate the problem solving ability of the NVSA. Nine metaheuristic algorithms are used in the conducted experiments. When compared to the commonly utilized registration methods, such as ANTS, Elastix, and FSL, our method achieves better registration performance on the RIRE dataset. Moreover, we prove that our method can perform well with or without its initial spatial transformation in terms of different evaluation indicators, demonstrating its versatility and robustness for various clinical needs and applications. This study establishes the idea that metaheuristic-based methods can better accomplish linear registration tasks than the frequently used approaches; the proposed method demonstrates promise that it can solve real-world clinical and service problems encountered during nonrigid registration as a preprocessing approach.The source code of the NVSA is publicly available at https://github.com/PengGui-N/NVSA.