Black hole: A new heuristic optimization approach for data clustering

Comprehensive applications of the artificial intelligence technology in new drug research and development

Purpose

Target-based strategy is a prevalent means of drug research and development (R&D), since targets provide effector molecules of drug action and offer the foundation of pharmacological investigation. Recently, the artificial intelligence (AI) technology has been utilized in various stages of drug R&D, where AI-assisted experimental methods show higher efficiency than sole experimental ones. It is a critical need to give a comprehensive review of AI applications in drug R &D for biopharmaceutical field.

Methods

Relevant literatures about AI-assisted drug R&D were collected from the public databases (Including Google Scholar, Web of Science, PubMed, IEEE Xplore Digital Library, Springer, and ScienceDirect) through a keyword searching strategy with the following terms [("Artificial Intelligence" OR "Knowledge Graph" OR "Machine Learning") AND ("Drug Target Identification" OR "New Drug Development")].

Results

In this review, we first introduced common strategies and novel trends of drug R&D, followed by characteristic description of AI algorithms widely used in drug R&D. Subsequently, we depicted detailed applications of AI algorithms in target identification, lead compound identification and optimization, drug repurposing, and drug analytical platform construction. Finally, we discussed the challenges and prospects of AI-assisted methods for drug discovery.

Conclusion

Collectively, this review provides comprehensive overview of AI applications in drug R&D and presents future perspectives for biopharmaceutical field, which may promote the development of drug industry.

Predicting the compressive strength of self-compacting concrete by developed African vulture optimization algorithm-Elman neural networks

The compressive strength of concrete depends on various factors. Since these parameters can be in a relatively wide range, it is difficult for predicting the behavior of concrete. Therefore, to solve this problem, an advanced modeling is needed. The aim of the literature is to achieve an ideal and flexible solution for predicting the behavior of concrete. Therefore, it is necessary to develop new approaches. Artificial Neural Networks (ANNs) have evolved from a theoretical method to a widely utilized technology by successful applications for a variety of issues. Actually, ANNs are a strong computing tool that provides the right solutions to problems that are difficult to use conventional methods. Inspired by the biological neural system, these networks are now widely used for solving a wide range of complicated problems in civil engineering. This study''s target is evaluating the performance of developed African vulture optimization algorithm (DAVOA)-Elman neural networks (ENNs) by considering different input parameters in predicting the self-compacting concrete compressive strength. Hence, once 8 parameters and again to get as close as possible to the prediction conditions in the laboratory, 140 parameters entered to the improved version of Elman Neural Networks as input. According to the results, the element network has the lowest mean squares of the test error in predicting the compressive strength of 7 and 28 days in 100 repetitions. Further, in predicting both compressive strengths, the element grid with the Logsig-Purelin interlayer transfer function has the lowest test error, which determines the optimal transfer function. Moreover, the results showed that DAVOA as a reliable tool with time and cost savings have high power in predicting the desired characteristics. Also, in predicting both 7-day and 28-day compressive strength, networks built with 140 parameters have a 74.54 and 70.44% improvement in test error over 8-parameter networks, respectively, which directly affects this effect. Further parameters are considered as input to the network error rate in predicting the desired properties.

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 Cooperative Intrusion Detection System for the Internet of Things Using Convolutional Neural Networks and Black Hole Optimization

Maintaining security in communication networks has long been a major concern. This issue has become increasingly crucial due to the emergence of new communication architectures like the Internet of Things (IoT) and the advancement and complexity of infiltration techniques. For usage in networks based on the Internet of Things, previous intrusion detection systems (IDSs), which often use a centralized design to identify threats, are now ineffective. For the resolution of these issues, this study presents a novel and cooperative approach to IoT intrusion detection that may be useful in resolving certain current security issues. The suggested approach chooses the most important attributes that best describe the communication between objects by using Black Hole Optimization (BHO). Additionally, a novel method for describing the network's matrix-based communication properties is put forward. The inputs of the suggested intrusion detection model consist of these two feature sets. The suggested technique splits the network into a number of subnets using the software-defined network (SDN). Monitoring of each subnet is done by a controller node, which uses a parallel combination of convolutional neural networks (PCNN) to determine the presence of security threats in the traffic passing through its subnet. The proposed method also uses the majority voting approach for the cooperation of controller nodes in order to more accurately detect attacks. The findings demonstrate that, in comparison to the prior approaches, the suggested cooperative strategy can detect assaults in the NSLKDD and NSW-NB15 datasets with an accuracy of 99.89 and 97.72 percent, respectively. This is a minimum 0.6 percent improvement.

Multi-kernel support vector regression with improved moth-flame optimization algorithm for software effort estimation

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

Universe-inspired algorithms for control engineering: A review

Control algorithms have been proposed based on knowledge related to nature-inspired mechanisms, including those based on the behavior of living beings. This paper presents a review focused on major breakthroughs carried out in the scope of applied control inspired by the gravitational attraction between bodies. A control approach focused on Artificial Potential Fields was identified, as well as four optimization metaheuristics: Gravitational Search Algorithm, Black-Hole algorithm, Multi-Verse Optimizer, and Galactic Swarm Optimization. A thorough analysis of ninety-one relevant papers was carried out to highlight their performance and to identify the gravitational and attraction foundations, as well as the universe laws supporting them. Included are their standard formulations, as well as their improved, modified, hybrid, cascade, fuzzy, chaotic and adaptive versions. Moreover, this review also deeply delves into the impact of universe-inspired algorithms on control problems of dynamic systems, providing an extensive list of control-related applications, and their inherent advantages and limitations. Strong evidence suggests that gravitation-inspired and black-hole dynamic-driven algorithms can outperform other well-known algorithms in control engineering, even though they have not been designed according to realistic astrophysical phenomena and formulated according to astrophysics laws. Even so, they support future research directions towards the development of high-sophisticated control laws inspired by Newtonian/Einsteinian physics, such that effective control-astrophysics bridges can be established and applied in a wide range of applications.

Different type of pay later facility for green product with selling price dependent demand using grey wolf optimizer

The use of trade credit finance is becoming more widely acknowledged as a crucial approach to improving inventory system profitability. We review an inventory model with depending on permitted payment delays for which, if the retailer place an orders higher than or equal to a predefined quantityS 1 , then the supplier will provide a fully pay in later facility of ξ periods (i.e., there will be no charge of interest until ξ ). On the other hand the retailer need to pay a partial amount of payment to the supplier if the order quantity is less thanS 1 , and the remaining amount may be deferred for up to ξ periods. Main objective of this study is to investigate the inventory model with different situations under delayed payment facility. In addition, determining the product's demand also involves taking into account the item's greenness and selling price. We have also considered the fact that the cost of buying is influenced by the product's degree of greenness. We employ the meta heuristic algorithm Grey Wolf Optimizar (GWO) to assist us in solving the problem, and we compare the outcomes with the aid of a few other algorithms (Whale optimisation algorithm (WOA) and Artificial electric field algorithm (AEFA)). In the end, we resolve several numerical cases to support the model. The concavity of the desired function is graphically displayed using MATLAB software.

A fast correction method of the scattering contributions in the area gamma dosemeter calibration field

In the calibration procedure of area gamma dosemeters, how to accurately evaluate and correct the scattering contribution from the complex environmental factors to the point of test is the key problem to ensure the calibration accuracy. This paper proposed a fast correction method of the scattering contributions in the area gamma dosemeter calibration field. First, Monte Carlo method is employed to simulate the influence of scattering caused by different environmental factors in the calibration field, which is named as semi-panoramic reference radiation field. Then, a prediction model of the relationship between environmental factors and environmental scattering contribution is constructed based on the simulation data through the least squares support vector machine. With the model, the scattering contribution from the environmental factors can be fast estimated to correct the calibration results of the area gamma dosemeters, which will improve the accuracy of the calibration.

Brain tumor recognition by an optimized deep network utilizing ammended grasshopper optimization

Brain tumors are abnormal cell masses that can get originated in the brain spread from other organs. They can be categorized as either malignant (cancerous) or benign (noncancerous), and their growth rates and locations can impact the functioning of the nerve system. The timely detection of brain tumors is crucial for effective treatment and prognosis. In this study, a new approach has been proposed for diagnosing brain tumors using deep learning and a meta-heuristic algorithm. The method involves three main steps: (1) extracting features from brain MRI images using AlexNet, (2) reducing the complexity of AlexNet by employing an Extreme Learning Machine (ELM) network as a classification layer, and (3) fine-tuning the parameters of the ELM network using an Amended Grasshopper Optimization Algorithm (AGOA). The performance of the method has been evaluated on a publicly available dataset consisting of 20 patients with newly diagnosed glioblastoma that is compared with several state-of-the-art techniques. Experimental results demonstrate that the method achieves the highest accuracy, precision, specificity, F1-score, sensitivity, and MCC with values of 0.96, 0.94, 0.96, 0.96, 0.94, and 0.90, respectively. Furthermore, the robustness and stability of the method have been illustrated when subjected to different levels of noise and image resolutions. The proposed approach offers a rapid, accurate, and dependable diagnosis of brain tumors and holds potential for application in other medical image analysis tasks.

Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm

The novelty of this article lies in introducing a novel stochastic technique named the Hippopotamus Optimization (HO) algorithm. The HO is conceived by drawing inspiration from the inherent behaviors observed in hippopotamuses, showcasing an innovative approach in metaheuristic methodology. The HO is conceptually defined using a trinary-phase model that incorporates their position updating in rivers or ponds, defensive strategies against predators, and evasion methods, which are mathematically formulated. It attained the top rank in 115 out of 161 benchmark functions in finding optimal value, encompassing unimodal and high-dimensional multimodal functions, fixed-dimensional multimodal functions, as well as the CEC 2019 test suite and CEC 2014 test suite dimensions of 10, 30, 50, and 100 and Zigzag Pattern benchmark functions, this suggests that the HO demonstrates a noteworthy proficiency in both exploitation and exploration. Moreover, it effectively balances exploration and exploitation, supporting the search process. In light of the results from addressing four distinct engineering design challenges, the HO has effectively achieved the most efficient resolution while concurrently upholding adherence to the designated constraints. The performance evaluation of the HO algorithm encompasses various aspects, including a comparison with WOA, GWO, SSA, PSO, SCA, FA, GOA, TLBO, MFO, and IWO recognized as the most extensively researched metaheuristics, AOA as recently developed algorithms, and CMA-ES as high-performance optimizers acknowledged for their success in the IEEE CEC competition. According to the statistical post hoc analysis, the HO algorithm is determined to be significantly superior to the investigated algorithms. The source codes of the HO algorithm are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/160088-hippopotamus-optimization-algorithm-ho .

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.

Optimizing the configuration of deep learning models for music genre classification

Music genre categorization is a fundamental use of sound processing methods in the realm of music retrieval. Typically, people are responsible for categorizing music genres. Machine learning approaches can automate this procedure. Therefore, in recent years, several approaches have been suggested to achieve this objective. Nevertheless, the given findings indicate that there is still a discrepancy between the observed results and an optimal categorization method. Hence, this paper introduces a novel approach for accurately forecasting music genres by using deep learning methodologies. The proposed approach involves preprocessing the input signals and then representing the characteristics of each signal using a combination of Mel Frequency Cepstral Coefficients (MFCC) and Short-Time Fourier Transform (STFT) features. Subsequently, a convolutional neural network (CNN) is applied to process each group of these characteristics. The proposed technique utilizes two CNN models to analyze MFCC and STFT data. Although the structure of these models is identical, the hyper-parameters of each model are individually adjusted using the black hole optimization (BHO) algorithm. Here, the optimization method fine-tunes the hyperparameters of each CNN model to minimize their training error. Ultimately, the results of two Convolutional Neural Network (CNN) models are combined to determine the music genre using a classifier based on SoftMax. The efficacy of the suggested methodology in categorizing music genres has been assessed using the GTZAN and Extended-Ballroom datasets. The experimental findings demonstrated that the suggested approach achieved classification accuracies of 95.2 % and 95.7 % in the two datasets, respectively, indicating its superiority over earlier efforts.

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.

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.

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.

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.

Evaluating teaching quality in colleges using combination of artificial neural networks (ANNs) and black hole optimization (BHO)

Automated evaluation of educational quality can be an effective measure of the efficiency of teaching methods, enabling the determination of the best teaching approach based on the educational environment conditions. Machine learning techniques have been used in various research studies as tools for automated evaluation of teaching quality. However, the low accuracy of classical learning models in quantitative quality estimation remains a challenge. To address this issue, one can utilize optimization strategies for learning models or combine multiple learning models as an ensemble system. These aspects are studied in the current paper. In the proposed method, automated evaluation of English teaching quality is performed through two phases: "identification of prominent quality evaluation indicators" and "quality estimation based on ensemble learning." In the first phase, the Black Hole Optimization (BHO) algorithm is used to determine the minimum number of indicators required for accurate quality estimation. In the second phase, the proposed method combines multiple artificial neural networks (ANNs) to predict education quality. In this ensemble model, the configuration and weight vector of each ANN are adjusted by the BHO algorithm to minimize training error. Then, an averaging strategy is employed to determine the final output of the ensemble system. The performance of the proposed method is evaluated using real English teaching data. Based on the results, the proposed method can achieve an average accuracy of 98.53 % in estimating English teaching quality, which represents a 2.19 % improvement compared to previous methods.

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.

A distributed SDN-based intrusion detection system for IoT using optimized forests

Along with the expansion of Internet of Things (IoT), the importance of security and intrusion detection in this network also increases, and the need for new and architecture-specific intrusion detection systems (IDS) is felt. In this article, a distributed intrusion detection system based on a software defined networking (SDN) is presented. In this method, the network structure is divided into a set of sub-networks using the SDN architecture, and intrusion detection is performed in each sub-network using a controller node. In order to detect intrusion in each sub-network, a decision tree optimized by black hole optimization (BHO) algorithm is used. Thus, the decision tree deployed in each sub-network is pruned by BHO, and the split points in its decision nodes are also determined in such a way that the accuracy of each tree in detecting sub-network attacks is maximized. The performance of the proposed method is evaluated in a simulated environment and its performance in detecting attacks using the NSLKDD and NSW-NB15 databases is examined. The results show that the proposed method can identify attacks in the NSLKDD and NSW-NB15 databases with an accuracy of 99.2% and 97.2%, respectively, which indicates an increase compared to previous methods.

Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation

The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later iteration stage is weak, making it difficult to find the optimal position in complex functions. The arithmetic optimization algorithm utilizes multiplication and division operators for position updates, which have strong randomness and good convergence ability. For the above, this paper integrates the two algorithms and adds a random central solution strategy, a mutation strategy, and a restart strategy. A hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation (RCLSMAOA) is proposed. The improved algorithm retains the position update formula of the slime mold algorithm in the global exploration section. It replaces the convergence stage of the slime mold algorithm with the multiplication and division algorithm in the local exploitation stage. At the same time, the stochastic center learning strategy is adopted to improve the global search efficiency and the diversity of the algorithm population. In addition, the restart strategy and mutation strategy are also used to improve the convergence accuracy of the algorithm and enhance the later optimization ability. In comparison experiments, different kinds of test functions are used to test the specific performance of the improvement algorithm. We determine the final performance of the algorithm by analyzing experimental data and convergence images, using the Wilcoxon rank sum test and Friedman test. The experimental results show that the improvement algorithm, which combines the slime mold algorithm and arithmetic optimization algorithm, is effective. Finally, the specific performance of the improvement algorithm on practical engineering problems was evaluated.

Binary Sand Cat Swarm Optimization Algorithm for Wrapper Feature Selection on Biological Data

In large datasets, irrelevant, redundant, and noisy attributes are often present. These attributes can have a negative impact on the classification model accuracy. Therefore, feature selection is an effective pre-processing step intended to enhance the classification performance by choosing a small number of relevant or significant features. It is important to note that due to the NP-hard characteristics of feature selection, the search agent can become trapped in the local optima, which is extremely costly in terms of time and complexity. To solve these problems, an efficient and effective global search method is needed. Sand cat swarm optimization (SCSO) is a newly introduced metaheuristic algorithm that solves global optimization algorithms. Nevertheless, the SCSO algorithm is recommended for continuous problems. bSCSO is a binary version of the SCSO algorithm proposed here for the analysis and solution of discrete problems such as wrapper feature selection in biological data. It was evaluated on ten well-known biological datasets to determine the effectiveness of the bSCSO algorithm. Moreover, the proposed algorithm was compared to four recent binary optimization algorithms to determine which algorithm had better efficiency. A number of findings demonstrated the superiority of the proposed approach both in terms of high prediction accuracy and small feature sizes.

Reptile Search Algorithm Considering Different Flight Heights to Solve Engineering Optimization Design Problems

The reptile search algorithm is an effective optimization method based on the natural laws of the biological world. By restoring and simulating the hunting process of reptiles, good optimization results can be achieved. However, due to the limitations of natural laws, it is easy to fall into local optima during the exploration phase. Inspired by the different search fields of biological organisms with varying flight heights, this paper proposes a reptile search algorithm considering different flight heights. In the exploration phase, introducing the different flight altitude abilities of two animals, the northern goshawk and the African vulture, enables reptiles to have better search horizons, improve their global search ability, and reduce the probability of falling into local optima during the exploration phase. A novel dynamic factor (DF) is proposed in the exploitation phase to improve the algorithm's convergence speed and optimization accuracy. To verify the effectiveness of the proposed algorithm, the test results were compared with ten state-of-the-art (SOTA) algorithms on thirty-three famous test functions. The experimental results show that the proposed algorithm has good performance. In addition, the proposed algorithm and ten SOTA algorithms were applied to three micromachine practical engineering problems, and the experimental results show that the proposed algorithm has good problem-solving ability.

A Compact Snake Optimization Algorithm in the Application of WKNN Fingerprint Localization

Indoor localization has broad application prospects, but accurately obtaining the location of test points (TPs) in narrow indoor spaces is a challenge. The weighted K-nearest neighbor algorithm (WKNN) is a powerful localization algorithm that can improve the localization accuracy of TPs. In recent years, with the rapid development of metaheuristic algorithms, it has shown efficiency in solving complex optimization problems. The main research purpose of this article is to study how to use metaheuristic algorithms to improve indoor positioning accuracy and verify the effectiveness of heuristic algorithms in indoor positioning. This paper presents a new algorithm called compact snake optimization (cSO). The novel algorithm introduces a compact strategy to the snake optimization (SO) algorithm, which ensures optimal performance in situations with limited computing and memory resources. The performance of cSO is evaluated on 28 test functions of CEC2013 and compared with several intelligent computing algorithms. The results demonstrate that cSO outperforms these algorithms. Furthermore, we combine the cSO algorithm with WKNN fingerprint positioning and RSSI positioning. The simulation experiments demonstrate that the cSO algorithm can effectively reduce positioning errors.

Mother optimization algorithm: a new human-based metaheuristic approach for solving engineering optimization

This article's innovation and novelty are introducing a new metaheuristic method called mother optimization algorithm (MOA) that mimics the human interaction between a mother and her children. The real inspiration of MOA is to simulate the mother's care of children in three phases education, advice, and upbringing. The mathematical model of MOA used in the search process and exploration is presented. The performance of MOA is assessed on a set of 52 benchmark functions, including unimodal and high-dimensional multimodal functions, fixed-dimensional multimodal functions, and the CEC 2017 test suite. The findings of optimizing unimodal functions indicate MOA's high ability in local search and exploitation. The findings of optimization of high-dimensional multimodal functions indicate the high ability of MOA in global search and exploration. The findings of optimization of fixed-dimension multi-model functions and the CEC 2017 test suite show that MOA with a high ability to balance exploration and exploitation effectively supports the search process and can generate appropriate solutions for optimization problems. The outcomes quality obtained from MOA has been compared with the performance of 12 often-used metaheuristic algorithms. Upon analysis and comparison of the simulation results, it was found that the proposed MOA outperforms competing algorithms with superior and significantly more competitive performance. Precisely, the proposed MOA delivers better results in most objective functions. Furthermore, the application of MOA on four engineering design problems demonstrates the efficacy of the proposed approach in solving real-world optimization problems. The findings of the statistical analysis from the Wilcoxon signed-rank test show that MOA has a significant statistical superiority compared to the twelve well-known metaheuristic algorithms in managing the optimization problems studied in this paper.

An improved multi-strategy beluga whale optimization for global optimization problems

This paper presents an improved beluga whale optimization (IBWO) algorithm, which is mainly used to solve global optimization problems and engineering problems. This improvement is proposed to solve the imbalance between exploration and exploitation and to solve the problem of insufficient convergence accuracy and speed of beluga whale optimization (BWO). In IBWO, we use a new group action strategy (GAS), which replaces the exploration phase in BWO. It was inspired by the group hunting behavior of beluga whales in nature. The GAS keeps individual belugas whales together, allowing them to hide together from the threat posed by their natural enemy, the tiger shark. It also enables the exchange of location information between individual belugas whales to enhance the balance between local and global lookups. On this basis, the dynamic pinhole imaging strategy (DPIS) and quadratic interpolation strategy (QIS) are added to improve the global optimization ability and search rate of IBWO and maintain diversity. In a comparison experiment, the performance of the optimization algorithm (IBWO) was tested by using CEC2017 and CEC2020 benchmark functions of different dimensions. Performance was analyzed by observing experimental data, convergence curves, and box graphs, and the results were tested using the Wilcoxon rank sum test. The results show that IBWO has good optimization performance and robustness. Finally, the applicability of IBWO to practical engineering problems is verified by five engineering problems.

Drawer Algorithm: A New Metaheuristic Approach for Solving Optimization Problems in Engineering

Metaheuristic optimization algorithms play an essential role in optimizing problems. In this article, a new metaheuristic approach called the drawer algorithm (DA) is developed to provide quasi-optimal solutions to optimization problems. The main inspiration for the DA is to simulate the selection of objects from different drawers to create an optimal combination. The optimization process involves a dresser with a given number of drawers, where similar items are placed in each drawer. The optimization is based on selecting suitable items, discarding unsuitable ones from different drawers, and assembling them into an appropriate combination. The DA is described, and its mathematical modeling is presented. The performance of the DA in optimization is tested by solving fifty-two objective functions of various unimodal and multimodal types and the CEC 2017 test suite. The results of the DA are compared to the performance of twelve well-known algorithms. The simulation results demonstrate that the DA, with a proper balance between exploration and exploitation, produces suitable solutions. Furthermore, comparing the performance of optimization algorithms shows that the DA is an effective approach for solving optimization problems and is much more competitive than the twelve algorithms against which it was compared to. Additionally, the implementation of the DA on twenty-two constrained problems from the CEC 2011 test suite demonstrates its high efficiency in handling optimization problems in real-world applications.

A Hybrid Parallel Balanced Phasmatodea Population Evolution Algorithm and Its Application in Workshop Material Scheduling

The phasmatodea population evolution algorithm (PPE) is a recently proposed meta-heuristic algorithm based on the evolutionary characteristics of the stick insect population. The algorithm simulates the features of convergent evolution, population competition, and population growth in the evolution process of the stick insect population in nature and realizes the above process through the population competition and growth model. Since the algorithm has a slow convergence speed and falls easily into local optimality, in this paper, it is mixed with the equilibrium optimization algorithm to make it easier to avoid the local optimum. Based on the hybrid algorithm, the population is grouped and processed in parallel to accelerate the algorithm's convergence speed and achieve better convergence accuracy. On this basis, we propose the hybrid parallel balanced phasmatodea population evolution algorithm (HP_PPE), and this algorithm is compared and tested on the CEC2017, a novel benchmark function suite. The results show that the performance of HP_PPE is better than that of similar algorithms. Finally, this paper applies HP_PPE to solve the AGV workshop material scheduling problem. Experimental results show that HP_PPE can achieve better scheduling results than other algorithms.

An Opposition-Based Learning Black Hole Algorithm for Localization of Mobile Sensor Network

The mobile node location method can find unknown nodes in real time and capture the movement trajectory of unknown nodes in time, which has attracted more and more attention from researchers. Due to their advantages of simplicity and efficiency, intelligent optimization algorithms are receiving increasing attention. Compared with other algorithms, the black hole algorithm has fewer parameters and a simple structure, which is more suitable for node location in wireless sensor networks. To address the problems of weak merit-seeking ability and slow convergence of the black hole algorithm, this paper proposed an opposition-based learning black hole (OBH) algorithm and utilized it to improve the accuracy of the mobile wireless sensor network (MWSN) localization. To verify the performance of the proposed algorithm, this paper tests it on the CEC2013 test function set. The results indicate that among the several algorithms tested, the OBH algorithm performed the best. In this paper, several optimization algorithms are applied to the Monte Carlo localization algorithm, and the experimental results show that the OBH algorithm can achieve the best optimization effect in advance.

Multistrategy-Boosted Carnivorous Plant Algorithm: Performance Analysis and Application in Engineering Designs

Many pivotal and knotty engineering problems in practical applications boil down to optimization problems, which are difficult to resolve using traditional mathematical optimization methods. Metaheuristics are efficient algorithms for solving complex optimization problems while keeping computational costs reasonable. The carnivorous plant algorithm (CPA) is a newly proposed metaheuristic algorithm, inspired by its foraging strategies of attraction, capture, digestion, and reproduction. However, the CPA is not without its shortcomings. In this paper, an enhanced multistrategy carnivorous plant algorithm called the UCDCPA is developed. In the proposed framework, a good point set, Cauchy mutation, and differential evolution are introduced to increase the algorithm's calculation precision and convergence speed as well as heighten the diversity of the population and avoid becoming trapped in local optima. The superiority and practicability of the UCDCPA are illustrated by comparing its experimental results with several algorithms against the CEC2014 and CEC2017 benchmark functions, and five engineering designs. Additionally, the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank-sum tests. The findings show that these introduced strategies provide some improvements in the performance of the CPA, and the accuracy and stability of the optimization results provided by the proposed UCDCPA are competitive against all algorithms. To conclude, the proposed UCDCPA offers a good alternative to solving optimization issues.

An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges

As the world moves towards industrialization, optimization problems become more challenging to solve in a reasonable time. More than 500 new metaheuristic algorithms (MAs) have been developed to date, with over 350 of them appearing in the last decade. The literature has grown significantly in recent years and should be thoroughly reviewed. In this study, approximately 540 MAs are tracked, and statistical information is also provided. Due to the proliferation of MAs in recent years, the issue of substantial similarities between algorithms with different names has become widespread. This raises an essential question: can an optimization technique be called 'novel' if its search properties are modified or almost equal to existing methods? Many recent MAs are said to be based on 'novel ideas', so they are discussed. Furthermore, this study categorizes MAs based on the number of control parameters, which is a new taxonomy in the field. MAs have been extensively employed in various fields as powerful optimization tools, and some of their real-world applications are demonstrated. A few limitations and open challenges have been identified, which may lead to a new direction for MAs in the future. Although researchers have reported many excellent results in several research papers, review articles, and monographs during the last decade, many unexplored places are still waiting to be discovered. This study will assist newcomers in understanding some of the major domains of metaheuristics and their real-world applications. We anticipate this resource will also be useful to our research community.

Subtraction-Average-Based Optimizer: A New Swarm-Inspired Metaheuristic Algorithm for Solving Optimization Problems

This paper presents a new evolutionary-based approach called a Subtraction-Average-Based Optimizer (SABO) for solving optimization problems. The fundamental inspiration of the proposed SABO is to use the subtraction average of searcher agents to update the position of population members in the search space. The different steps of the SABO’s implementation are described and then mathematically modeled for optimization tasks. The performance of the proposed SABO approach is tested for the optimization of fifty-two standard benchmark functions, consisting of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results show that the proposed SABO approach effectively solves the optimization problems by balancing the exploration and exploitation in the search process of the problem-solving space. The results of the SABO are compared with the performance of twelve well-known metaheuristic algorithms. The analysis of the simulation results shows that the proposed SABO approach provides superior results for most of the benchmark functions. Furthermore, it provides a much more competitive and outstanding performance than its competitor algorithms. Additionally, the proposed approach is implemented for four engineering design problems to evaluate the SABO in handling optimization tasks for real-world applications. The optimization results show that the proposed SABO approach can solve for real-world applications and provides more optimal designs than its competitor algorithms.

A smart privacy preserving framework for industrial IoT using hybrid meta-heuristic algorithm

Industrial Internet of Things (IIoT) seeks more attention in attaining enormous opportunities in the field of Industry 4.0. But there exist severe challenges related to data privacy and security when processing the automatic and practical data collection and monitoring over industrial applications in IIoT. Traditional user authentication strategies in IIoT are affected by single factor authentication, which leads to poor adaptability along with the increasing users count and different user categories. For addressing such issue, this paper aims to implement the privacy preservation model in IIoT using the advancements of artificial intelligent techniques. The two major stages of the designed system are the sanitization and restoration of IIoT data. Data sanitization hides the sensitive information in IIoT for preventing it from leakage of information. Moreover, the designed sanitization procedure performs the optimal key generation by a new Grasshopper-Black Hole Optimization (G-BHO) algorithm. A multi-objective function involving the parameters like degree of modification, hiding rate, correlation coefficient between the actual data and restored data, and information preservation rate was derived and utilized for generating optimal key. The simulation result establishes the dominance of the proposed model over other state-of the-art models in terms of various performance metrics. In respect of privacy preservation, the proposed G-BHO algorithm has achieved 1%, 15.2%, 12.6%, and 1% enhanced result than JA, GWO, GOA, and BHO, respectively.

Memetic Spider Monkey Optimization for Spam Review Detection Problem

Spider monkey optimization (SMO) algorithm imitates the spider monkey's fission-fusion social behavior. It is evident through literature that the SMO is a competitive swarm-based algorithm that is used to solve difficult real-life problems. The SMO's search process is a little bit biased by the random component that drives it with high explorative searching steps. A hybridized SMO with a memetic search to improve the local search ability of SMO is proposed here. The newly developed strategy is titled Memetic SMO (MeSMO). Further, the proposed MeSMO-based clustering approach is applied to solve a big data problem, namely, the spam review detection problem. A customer usually makes decisions to purchase something or make an image of someone based on online reviews. Therefore, there is a good chance that the individuals or companies may write spam reviews to upgrade or degrade the stature or value of a trader/product/company. Therefore, an efficient spam detection algorithm, MeSMO, is proposed and tested over four complex spam datasets. The reported results of MeSMO are compared with the outcomes obtained from the six state-of-art strategies. A comparative analysis of the results proved that MeSMO is a good technique to solve the spam review detection problem and improved precision by 3.68%.

American zebra optimization algorithm for global optimization problems

A novel bio-inspired meta-heuristic algorithm, namely the American zebra optimization algorithm (AZOA), which mimics the social behaviour of American zebras in the wild, is proposed in this study. American zebras are distinguished from other mammals by their distinct and fascinating social character and leadership exercise, which navies the baby zebras to leave the herd before maturity and join a separate herd with no family ties. This departure of the baby zebra encourages diversification by preventing intra-family mating. Moreover, the convergence is assured by the leadership exercise in American zebras, which directs the speed and direction of the group. This social lifestyle behaviour of American zebras is indigenous in nature and is the main inspiration for proposing the AZOA meta-heuristic algorithm. To examine the efficiency of the AZOA algorithm, the CEC-2005, CEC-2017, and CEC-2019 benchmark functions are considered, and compared with the several state-of-the-art meta-heuristic algorithms. The experimental outcomes and statistical analysis reveal that AZOA is capable of attaining the optimal solutions for maximum benchmark functions while maintaining a good balance between exploration and exploitation. Furthermore, numerous real-world engineering problems have been employed to demonstrate the robustness of AZOA. Finally, it is anticipated that the AZOA will accomplish domineeringly for forthcoming advanced CEC benchmark functions and other complex engineering problems.

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

A new metaheuristic algorithm called green anaconda optimization (GAO) which imitates the natural behavior of green anacondas has been designed. The fundamental inspiration for GAO is the mechanism of recognizing the position of the female species by the male species during the mating season and the hunting strategy of green anacondas. GAO’s mathematical modeling is presented based on the simulation of these two strategies of green anacondas in two phases of exploration and exploitation. The effectiveness of the proposed GAO approach in solving optimization problems is evaluated on twenty-nine objective functions from the CEC 2017 test suite and the CEC 2019 test suite. The efficiency of GAO in providing solutions for optimization problems is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that the proposed GAO approach has a high capability in exploration, exploitation, and creating a balance between them and performs better compared to competitor algorithms. In addition, the implementation of GAO on twenty-one optimization problems from the CEC 2011 test suite indicates the effective capability of the proposed approach in handling real-world applications.

Sand cat swarm optimization-based feedback controller design for nonlinear systems

The control of the open loop unstable systems with nonlinear structure is challenging work. In this paper, for the first time, we present a sand cat swarm optimization (SCSO) algorithm-based state feedback controller design for open-loop unstable systems. The SCSO algorithm is a newly proposed metaheuristic algorithm with an easy-to-implement structure that can efficiently find the optimal solution for optimization problems. The proposed SCSO-based state feedback controller can successfully optimize the control parameters with efficient convergence curve speed. In order to show the performance of the proposed method, three different nonlinear control systems such as an Inverted pendulum, a Furuta pendulum, and an Acrobat robot arm are considered. The control and optimization performances of the proposed SCSO algorithm are compared with well-known metaheuristic algorithms. The simulation results show that the proposed control method can either outperform the compared metaheuristic-based algorithms or have competitive results.

An Inclusive Survey on Marine Predators Algorithm: Variants and Applications

Marine Predators Algorithm (MPA) is the existing population-based meta-heuristic algorithms that falls under the category of Nature-Inspired Optimization Algorithm (NIOA) enthused by the foraging actions of the marine predators that principally pursues Levy or Brownian approach as its foraging strategy. Furthermore, it employs the optimal encounter rate stratagem involving both the predator as well as prey. Since its introduction by Faramarzi in the year 2020, MPA has gained enormous popularity and has been employed in numerous application areas ranging from Mathematical and Engineering Optimization problems to Fog Computing to Image Processing to Photovoltaic System to Wind-Solar Generation System for resolving continuous optimization problems. Such huge interest from the research fraternity or the massive recognition of MPA is due to several factors such as its simplicity, ease of application, realistic execution time, superior convergence acceleration rate, soaring effectiveness, its ability to unravel continuous, multi-objective and binary problems when compared with other renowned optimization algorithms existing in the literature. This paper offers a detailed summary of the Marine Predators Algorithm (MPA) and its variants. Furthermore, the applications of MPA in a number of spheres such as Image processing, classification, electrical power system, Photovoltaic models, structural damage detection, distribution networks, engineering applications, Task Scheduling, optimization problems etc., are illustrated. To conclude, the paper highlights and thereby advocates few of the potential future research directions for MPA.

Enhancement of K-means clustering in big data based on equilibrium optimizer algorithm

Data mining’s primary clustering method has several uses, including gene analysis. A set of unlabeled data is divided into clusters using data features in a clustering study, which is an unsupervised learning problem. Data in a cluster are more comparable to one another than to those in other groups. However, the number of clusters has a direct impact on how well the K-means algorithm performs. In order to find the best solutions for these real-world optimization issues, it is necessary to use techniques that properly explore the search spaces. In this research, an enhancement of K-means clustering is proposed by applying an equilibrium optimization approach. The suggested approach adjusts the number of clusters while simultaneously choosing the best attributes to find the optimal answer. The findings establish the usefulness of the suggested method in comparison to existing algorithms in terms of intra-cluster distances and Rand index based on five datasets. Through the results shown and a comparison of the proposed method with the rest of the traditional methods, it was found that the proposal is better in terms of the internal dimension of the elements within the same cluster, as well as the Rand index. In conclusion, the suggested technique can be successfully employed for data clustering and can offer significant support.

Firefly-SVM predictive model for breast cancer subgroup classification with clinicopathological parameters

Background

Breast cancer is a highly predominant destructive disease among women characterised with varied tumour biology, molecular subgroups and diverse clinicopathological specifications. The potentiality of machine learning to transform complex medical data into meaningful knowledge has led to its application in breast cancer detection and prognostic evaluation.

Objective

The emergence of data-driven diagnostic model for assisting clinicians in diagnostic decision making has gained an increasing curiosity in breast cancer identification and analysis. This motivated us to develop a breast cancer data-driven model for subtype classification more accurately.

Method

In this article, we proposed a firefly-support vector machine (SVM) breast cancer predictive model that uses clinicopathological and demographic data gathered from various tertiary care cancer hospitals or oncological centres to distinguish between patients with triple-negative breast cancer (TNBC) and non-triple-negative breast cancer (non-TNBC).

Results

The results of the firefly-support vector machine (firefly-SVM) predictive model were distinguished from the traditional grid search-support vector machine (Grid-SVM) model, particle swarm optimisation-support vector machine (PSO-SVM) and genetic algorithm-support vector machine (GA-SVM) hybrid models through hyperparameter tuning. The findings show that the recommended firefly-SVM classification model outperformed other existing models in terms of prediction accuracy (93.4%, 86.6%, 69.6%) for automated SVM parameter selection. The effectiveness of the prediction model was also evaluated using well-known metrics, such as the F1-score, mean square error, area under the ROC curve, logarithmic loss and precision-recall curve.

Conclusion

Firefly-SVM predictive model may be treated as an alternate tool for breast cancer subgroup classification that would benefit the clinicians for managing the patient with proper treatment and diagnostic outcome.

An Improved Chimp-Inspired Optimization Algorithm for Large-Scale Spherical Vehicle Routing Problem with Time Windows

The vehicle routing problem with time windows (VRPTW) is a classical optimization problem. There have been many related studies in recent years. At present, many studies have generally analyzed this problem on the two-dimensional plane, and few studies have explored it on spherical surfaces. In order to carry out research related to the distribution of goods by unmanned vehicles and unmanned aerial vehicles, this study carries out research based on the situation of a three-dimensional sphere and proposes a three-dimensional spherical VRPTW model. All of the customer nodes in this problem were mapped to the three-dimensional sphere. The chimp optimization algorithm is an excellent intelligent optimization algorithm proposed recently, which has been successfully applied to solve various practical problems and has achieved good results. The chimp optimization algorithm (ChOA) is characterized by its excellent ability to balance exploration and exploitation in the optimization process so that the algorithm can search the solution space adaptively, which is closely related to its outstanding adaptive factors. However, the performance of the chimp optimization algorithm in solving discrete optimization problems still needs to be improved. Firstly, the convergence speed of the algorithm is fast at first, but it becomes slower and slower as the number of iterations increases. Therefore, this paper introduces the multiple-population strategy, genetic operators, and local search methods into the algorithm to improve its overall exploration ability and convergence speed so that the algorithm can quickly find solutions with higher accuracy. Secondly, the algorithm is not suitable for discrete problems. In conclusion, this paper proposes an improved chimp optimization algorithm (MG-ChOA) and applies it to solve the spherical VRPTW model. Finally, this paper analyzes the performance of this algorithm in a multi-dimensional way by comparing it with many excellent algorithms available at present. The experimental result shows that the proposed algorithm is effective and superior in solving the discrete problem of spherical VRPTW, and its performance is superior to that of other algorithms.

Dynamic Chaotic Opposition-Based Learning-Driven Hybrid Aquila Optimizer and Artificial Rabbits Optimization Algorithm: Framework and Applications

Aquila Optimizer (AO) and Artificial Rabbits Optimization (ARO) are two recently developed meta-heuristic optimization algorithms. Although AO has powerful exploration capability, it still suffers from poor solution accuracy and premature convergence when addressing some complex cases due to the insufficient exploitation phase. In contrast, ARO possesses very competitive exploitation potential, but its exploration ability needs to be more satisfactory. To ameliorate the above-mentioned limitations in a single algorithm and achieve better overall optimization performance, this paper proposes a novel chaotic opposition-based learning-driven hybrid AO and ARO algorithm called CHAOARO. Firstly, the global exploration phase of AO is combined with the local exploitation phase of ARO to maintain the respective valuable search capabilities. Then, an adaptive switching mechanism (ASM) is designed to better balance the exploration and exploitation procedures. Finally, we introduce the chaotic opposition-based learning (COBL) strategy to avoid the algorithm fall into the local optima. To comprehensively verify the effectiveness and superiority of the proposed work, CHAOARO is compared with the original AO, ARO, and several state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Systematic comparisons demonstrate that CHAOARO can significantly outperform other competitor methods in terms of solution accuracy, convergence speed, and robustness. Furthermore, the promising prospect of CHAOARO in real-world applications is highlighted by resolving five industrial engineering design problems and photovoltaic (PV) model parameter identification problem.