Hybridizing salp swarm algorithm with particle swarm optimization algorithm for recent optimization functions

Chaotic RIME optimization algorithm with adaptive mutualism for feature selection problems

The RIME optimization algorithm is a newly developed physics-based optimization algorithm used for solving optimization problems. The RIME algorithm proved high-performing in various fields and domains, providing a high-performance solution. Nevertheless, like many swarm-based optimization algorithms, RIME suffers from many limitations, including the exploration-exploitation balance not being well balanced. In addition, the likelihood of falling into local optimal solutions is high, and the convergence speed still needs some work. Hence, there is room for enhancement in the search mechanism so that various search agents can discover new solutions. The authors suggest an adaptive chaotic version of the RIME algorithm named ACRIME, which incorporates four main improvements, including an intelligent population initialization using chaotic maps, a novel adaptive modified Symbiotic Organism Search (SOS) mutualism phase, a novel mixed mutation strategy, and the utilization of restart strategy. The main goal of these improvements is to improve the variety of the population, achieve a better balance between exploration and exploitation, and improve RIME's local and global search abilities. The study assesses the effectiveness of ACRIME by using the standard benchmark functions of the CEC2005 and CEC2019 benchmarks. The proposed ACRIME is also applied as a feature selection to fourteen various datasets to test its applicability to real-world problems. Besides, the ACRIME algorithm is applied to the COVID-19 classification real problem to test its applicability and performance further. The suggested algorithm is compared to other sophisticated classical and advanced metaheuristics, and its performance is assessed using statistical tests such as Wilcoxon rank-sum and Friedman rank tests. The study demonstrates that ACRIME exhibits a high level of competitiveness and often outperforms competing algorithms. It discovers the optimal subset of features, enhancing the accuracy of classification and minimizing the number of features employed. This study primarily focuses on enhancing the equilibrium between exploration and exploitation, extending the scope of local search.

Enhanced chimp optimization algorithm for high level synthesis of digital filters

The HLS of digital filters is a complex optimization task in electronic design automation that increases the level of abstraction for designing and scheming digital circuits. The complexity of this issue attracting the interest of the researcher and solution of this issue is a big challenge for the researcher. The scientists are trying to present the various most powerful methods for this issue, but keep in mind these methods could be trapped in the complex space of this problem due to own weaknesses. Due to shortcomings of these methods, we are trying to design a new framework with the mixture of the phases of the powerful approaches for high level synthesis of digital filters in this work. This modification has been done by merging the chimp optimizer with sine cosine functions. The sine cosine phases helped in enhancing the exploitation phase of the chimp optimizer and also ignored the local optima in the search area during the searching of new shortest paths. The algorithms have been applied on 23-standard test suites and 14-digital filters for verifying the performance of the algorithms. Experimental results of single and multi-objective functions have been compared in terms of best score, best maxima, average, standard deviation, execution time, occupied area and speed respectively. Furthermore, by analyzing the effectiveness of the proposed algorithm with the recent algorithms for the HLS digital filters design, this can be concluded that the proposed method dominates the other two methods in HLS digital filters design. Another prominent feature of the proposed system in addition to the stated enhancement, is its rapid runtime, lowest delay, occupied area and lowest power in achieving an appropriate response. This could greatly reduce the cost of systems with broad dimensions while increasing the design speed.

Insight into breast cancer detection: new hybrid feature selection method

Breast cancer, which is also the leading cause of death among women, is one of the most common forms of the disease that affects females all over the world. The discovery of breast cancer at an early stage is extremely important because it allows selecting appropriate treatment protocol and thus, stops the development of cancer cells. In this paper, a new patients detection strategy has been presented to identify patients with the disease earlier. The proposed strategy composes of two parts which are data preprocessing phase and patient detection phase (PDP). The purpose of this study is to introduce a feature selection methodology for determining the most efficient and significant features for identifying breast cancer patients. This method is known as new hybrid feature selection method (NHFSM). NHFSM is made up of two modules which are quick selection module that uses information gain, and feature selection module that uses hybrid bat algorithm and particle swarm optimization. Consequently, NHFSM is a hybrid method that combines the advantages of bat algorithm and particle swarm optimization based on filter method to eliminate many drawbacks such as being stuck in a local optimal solution and having unbalanced exploitation. The preprocessed data are then used during PDP in order to enable a quick and accurate detection of patients. Based on experimental results, the proposed NHFSM improves the efficiency of patients’ classification in comparison with state-of-the-art feature selection approaches by roughly 0.97, 0.76, 0.75, and 0.716 in terms of accuracy, precision, sensitivity/recall, and F-measure. In contrast, it has the lowest error rate value of 0.03.

Machine Leaning-Based Optimization Algorithm for Myocardial Injury under High-Intensity Exercise in Track and Field Athletes

In order to train at high-intensity, athletics can again cause varying degrees of myocardial damage. Evaluating the balance between exercise myocardial injury and exercise intensity should actively prevent myocardial injury caused by high-intensity athletic training. In this paper, an intelligent optimization algorithm is used to investigate the degree of myocardial injury. The basic idea is to define the measured data and the output of the numerical model as an objective function of the structural parameters, to obtain the structural parameters by finding ways to continuously optimize the objective function to be close to the observed values, and to identify the injury based on the changes in these parameters before and after myocardial injury. The objective function can be defined in various ways, and the myocardial injury optimization algorithm can be chosen. In order to obtain the best computational results, numerical simulations of damage identification are performed using the objective function and three machine learning-based optimization algorithms. The computational results show that the combination of the objective function and the machine learning algorithms provides good accuracy and computational speed in identifying myocardial injury.

Multi-strategy improved salp swarm algorithm and its application in reliability optimization

To improve the convergence speed and solution precision of the standard Salp Swarm Algorithm (SSA), a hybrid Salp Swarm Algorithm based on Dimension-by-dimension Centroid Opposition-based learning strategy, Random factor and Particle Swarm Optimization's social learning strategy (DCORSSA-PSO) is proposed. Firstly, a dimension-by-dimension centroid opposition-based learning strategy is added in the food source update stage of SSA to increase the population diversity and reduce the inter-dimensional interference. Secondly, in the followers' position update equation of SSA, constant 1 is replaced by a random number between 0 and 1 to increase the randomness of the search and the ability to jump out of local optima. Finally, the social learning strategy of PSO is also added to the followers' position update equation to accelerate the population convergence. The statistical results on ten classical benchmark functions by the Wilcoxon test and Friedman test show that compared with SSA and other well-known optimization algorithms, the proposed DCORSSA-PSO has significantly improved the precision of the solution and the convergence speed, as well as its robustness. The DCORSSA-PSO is applied to system reliability optimization design based on the T-S fault tree. The simulation results show that the failure probability of the designed system under the cost constraint is less than other algorithms, which illustrates that the application of DCORSSA-PSO can effectively improve the design level of reliability optimization.

An enhanced version of Harris Hawks Optimization by dimension learning-based hunting for Breast Cancer Detection

Swarm intelligence techniques have a vast range of real world applications.Some applications are in the domain of medical data mining where, main attention is on structure models for the classification and expectation of numerous diseases. These biomedical applications have grabbed the interest of numerous researchers because these are most serious and prevalent causes of death among the human whole world out of which breast cancer is the most serious issue. Mammography is the initial screening assessment of breast cancer. In this study, an enhanced version of Harris Hawks Optimization (HHO) approach has been developed for biomedical databases, known as DLHO. This approach has been introduced by integrating the merits of dimension learning-based hunting (DLH) search strategy with HHO. The main objective of this study is to alleviate the lack of crowd diversity, premature convergence of the HHO and the imbalance amid the exploration and exploitation. DLH search strategy utilizes a dissimilar method to paradigm a neighborhood for each search member in which the neighboring information can be shared amid search agents. This strategy helps in maintaining the diversity and the balance amid global and local search. To evaluate the DLHO lot of experiments have been taken such as (i) the performance of optimizers have analysed by using 29-CEC -2017 test suites, (ii) to demonstrate the effectiveness of the DLHO it has been tested on different biomedical databases out of which we have used two different databases for Breast i.e. MIAS and second database has been taken from the University of California at Irvine (UCI) Machine Learning Repository.Also to test the robustness of the proposed method its been tested on two other databases of such as Balloon and Heart taken from the UCI Machine Learning Repository. All the results are in the favour of the proposed technique.

A Hybrid SSA and SMA with Mutation Opposition-Based Learning for Constrained Engineering Problems

Based on Salp Swarm Algorithm (SSA) and Slime Mould Algorithm (SMA), a novel hybrid optimization algorithm, named Hybrid Slime Mould Salp Swarm Algorithm (HSMSSA), is proposed to solve constrained engineering problems. SSA can obtain good results in solving some optimization problems. However, it is easy to suffer from local minima and lower density of population. SMA specializes in global exploration and good robustness, but its convergence rate is too slow to find satisfactory solutions efficiently. Thus, in this paper, considering the characteristics and advantages of both the above optimization algorithms, SMA is integrated into the leader position updating equations of SSA, which can share helpful information so that the proposed algorithm can utilize these two algorithms' advantages to enhance global optimization performance. Furthermore, Levy flight is utilized to enhance the exploration ability. It is worth noting that a novel strategy called mutation opposition-based learning is proposed to enhance the performance of the hybrid optimization algorithm on premature convergence avoidance, balance between exploration and exploitation phases, and finding satisfactory global optimum. To evaluate the efficiency of the proposed algorithm, HSMSSA is applied to 23 different benchmark functions of the unimodal and multimodal types. Additionally, five classical constrained engineering problems are utilized to evaluate the proposed technique's practicable abilities. The simulation results show that the HSMSSA method is more competitive and presents more engineering effectiveness for real-world constrained problems than SMA, SSA, and other comparative algorithms. In the end, we also provide some potential areas for future studies such as feature selection and multilevel threshold image segmentation.

A multi-sample particle swarm optimization algorithm based on electric field force

Aiming at the premature convergence problem of particle swarm optimization algorithm, a multi-sample particle swarm optimization (MSPSO) algorithm based on electric field force is proposed. Firstly, we introduce the concept of the electric field into the particle swarm optimization algorithm. The particles are affected by the electric field force, which makes the particles exhibit diverse behaviors. Secondly, MSPSO constructs multiple samples through two new strategies to guide particle learning. An electric field force-based comprehensive learning strategy (EFCLS) is proposed to build attractive samples and repulsive samples, thus improving search efficiency. To further enhance the convergence accuracy of the algorithm, a segment-based weighted learning strategy (SWLS) is employed to construct a global learning sample so that the particles learn more comprehensive information. In addition, the parameters of the model are adjusted adaptively to adapt to the population status in different periods. We have verified the effectiveness of these newly proposed strategies through experiments. Sixteen benchmark functions and eight well-known particle swarm optimization algorithm variants are employed to prove the superiority of MSPSO. The comparison results show that MSPSO has better performance in terms of accuracy, especially for high-dimensional spaces, while maintaining a faster convergence rate. Besides, a real-world problem also verified that MSPSO has practical application value.