DRPSO:A multi-strategy fusion particle swarm optimization algorithm with a replacement mechanisms for colon cancer pathology image segmentation.

Colon adenocarcinoma (COAD) is a type of colon cancers with a high mortality rate. Its early symptoms are not obvious, and its late stage is accompanied by various complications that seriously endanger patients' lives. To assist in the early diagnosis of COAD and improve the detection efficiency of COAD, this paper proposes a multi-level threshold image segmentation (MIS) method based on an enhanced particle swarm algorithm for segmenting COAD images. Firstly, this paper proposes a multi-strategy fusion particle swarm optimization algorithm (DRPSO) with a replacement mechanism. The non-linear inertia weight and sine-cosine learning factors in DRPSO help balance the exploration and exploitation phases of the algorithm. The population reorganization strategy incorporating MGO enhances population diversity and effectively prevents the algorithm from stagnating prematurely. The mutation-based final replacement mechanism enhances the algorithm's ability to escape local optima and helps the algorithm to obtain highly accurate solutions. In addition, comparison experiments on the CEC2020 and CEC2022 test sets show that DRPSO outperforms other state-of-the-art algorithms in terms of convergence accuracy and speed. Secondly, by combining the non-local mean 2D histogram and 2D Renyi entropy, this paper proposes a DRPSO algorithm based MIS method, which is successfully applied to the segments the COAD pathology image problem. The results of segmentation experiments show that the above method obtains relatively higher quality segmented images with superior performance metrics: PSNR = 23.556, SSIM = 0.825, and FSIM = 0.922. In conclusion, the MIS method based on the DRPSO algorithm shows great potential in assisting COAD diagnosis and in pathology image segmentation.

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.

Accurate multilevel thresholding image segmentation via oppositional Snake Optimization algorithm: Real cases with liver disease.

Liver-related diseases significantly contribute to global mortality rates. Accurate segmentation of liver disease from CT scans is essential for early diagnosis and treatment selection, particularly in computer-aided diagnosis (CAD) systems. To address challenges posed by inconsistent liver presence and unclear boundaries, an enhanced Snake Optimization (SO) algorithm is proposed that integrates with opposition-based learning (OBL) called (SO-OBL), proving effective in global optimization and multilevel image segmentation. Experiments using CEC'2022 test functions compare SO-OBL with eleven recent and state-of-the-art metaheuristic algorithms, demonstrating its superior performance. Additionally, an advanced liver disease segmentation model based on SO-OBL incorporates an optimized multilevel thresholding technique, leveraging Otsu's function. Notable segmentation metric results, including FSIM = 0.947, SSIM = 0.941, PSNR = 24.876, MSE = 236.88, and execution time = 0.281, underscore the model's efficiency and potential for accurate diagnosis in CAD systems.

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.

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.

Using deep DenseNet with cyclical learning rate to classify leukocytes for leukemia identification.

Background: The examination, counting, and classification of white blood cells (WBCs), also known as leukocytes, are essential processes in the diagnosis of many disorders, including leukemia, a kind of blood cancer characterized by the uncontrolled proliferation of carcinogenic leukocytes in the marrow of the bone. Blood smears can be chemically or microscopically studied to better understand hematological diseases and blood disorders. Detecting, identifying, and categorizing the many blood cell types are essential for disease diagnosis and therapy planning. A theoretical and practical issue. However, methods based on deep learning (DL) have greatly helped blood cell classification. Materials and Methods: Images of blood cells in a microscopic smear were collected from GitHub, a public source that uses the MIT license. An end-to-end computer-aided diagnosis (CAD) system for leukocytes has been created and implemented as part of this study. The introduced system comprises image preprocessing and enhancement, image segmentation, feature extraction and selection, and WBC classification. By combining the DenseNet-161 and the cyclical learning rate (CLR), we contribute an approach that speeds up hyperparameter optimization. We also offer the one-cycle technique to rapidly optimize all hyperparameters of DL models to boost training performance. Results: The dataset has been split into two sets: approximately 80% of the data (9,966 images) for the training set and 20% (2,487 images) for the validation set. The validation set has 623, 620, 620, and 624 eosinophil, lymphocyte, monocyte, and neutrophil images, whereas the training set has 2,497, 2,483, 2,487, and 2,499, respectively. The suggested method has 100% accuracy on the training set of images and 99.8% accuracy on the testing set. Conclusion: Using a combination of the recently developed pretrained convolutional neural network (CNN), DenseNet, and the one fit cycle policy, this study describes a technique of training for the classification of WBCs for leukemia detection. The proposed method is more accurate compared to the state of the art.

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%.

Boosted federated learning based on improved Particle Swarm Optimization for healthcare IoT devices.

As healthcare data becomes increasingly available from various sources, including clinical institutions, patients, insurance companies, and pharmaceutical industries, machine learning (ML) services are becoming more significant in healthcare-facing domains. Therefore, it is imperative to ensure the integrity and reliability of ML models to maintain the quality of healthcare services. Particularly due to the growing need for privacy and security, healthcare data has resulted in each Internet of Things (IoT) device being treated as an independent source of data, isolated from other devices. Moreover, the limited computational and communication capabilities of wearable healthcare devices hinder the applicability of traditional ML. Federated Learning (FL) is a paradigm that maintains data privacy by storing only learned models on a server and advances with data from scattered clients, making it ideal for healthcare applications where patient data must be safeguarded. The potential of FL to transform healthcare is significant, as it can enable the development of new ML-powered applications that can enhance the quality of care, lower costs, and improve patient outcomes. However, the accuracy of current Federated Learning aggregation methods suffers greatly in unstable network situations due to the high volume of weights transmitted and received. To address this issue, we propose an alternative approach to Federated Average (FedAvg) that updates the global model by gathering score values from learned models primarily utilized in Federated Learning, using an improved version of Particle Swarm Optimization (PSO) called FedImpPSO. This approach boosts the robustness of the algorithm in erratic network conditions. To further enhance the speed and efficiency of data exchange within a network, we modify the format of the data clients send to servers using the FedImpPSO method. The proposed approach is evaluated using the CIFAR-10 and CIFAR-100 datasets and a Convolutional Neural Network (CNN). We found that it yielded an average accuracy improvement of 8.14% over FedAvg and 2.5% over Federated PSO (FedPSO). This study evaluates the use of FedImpPSO in healthcare by training a deep-learning model over two case studies to evaluate the effectiveness of our approach in healthcare. The first case study involves the classification of COVID-19 using public datasets (Ultrasound and X-ray) and achieved an F1-measure of 77.90% and 92.16%, respectively. The second case study was conducted over the cardiovascular dataset, where our proposed FedImpPSO achieves 91.18% and 92% accuracy in predicting the existence of heart diseases. As a result, our approach demonstrates the effectiveness of using FedImpPSO to improve the accuracy and robustness of Federated Learning in unstable network conditions and has potential applications in healthcare and other domains where data privacy is critical.

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.

An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation.

Image segmentation has been one of the most active research areas in the last decade. The traditional multi-level thresholding techniques are effective for bi-level thresholding because of their resilience, simplicity, accuracy, and low convergence time, but these traditional techniques are not effective in determining the optimal multi-level thresholding for image segmentation. Therefore, an efficient version of the search and rescue optimization algorithm (SAR) based on opposition-based learning (OBL) is proposed in this paper to segment blood-cell images and solve problems of multi-level thresholding. The SAR algorithm is one of the most popular meta-heuristic algorithms (MHs) that mimics humans' exploration behavior during search and rescue operations. The SAR algorithm, which utilizes the OBL technique to enhance the algorithm's ability to jump out of the local optimum and enhance its search efficiency, is termed mSAR. A set of experiments is applied to evaluate the performance of mSAR, solve the problem of multi-level thresholding for image segmentation, and demonstrate the impact of combining the OBL technique with the original SAR for improving solution quality and accelerating convergence speed. The effectiveness of the proposed mSAR is evaluated against other competing algorithms, including the L'evy flight distribution (LFD), Harris hawks optimization (HHO), sine cosine algorithm (SCA), equilibrium optimizer (EO), gravitational search algorithm (GSA), arithmetic optimization algorithm (AOA), and the original SAR. Furthermore, a set of experiments for multi-level thresholding image segmentation is performed to prove the superiority of the proposed mSAR using fuzzy entropy and the Otsu method as two objective functions over a set of benchmark images with different numbers of thresholds based on a set of evaluation matrices. Finally, analysis of the experiments' outcomes indicates that the mSAR algorithm is highly efficient in terms of the quality of the segmented image and feature conservation, compared with the other competing algorithms.

A Novel Hybrid Runge Kutta Optimizer with Support Vector Machine on Gene Expression Data for Cancer Classification.

It is crucial to accurately categorize cancers using microarray data. Researchers have employed a variety of computational intelligence approaches to analyze gene expression data. It is believed that the most difficult part of the problem of cancer diagnosis is determining which genes are informative. Therefore, selecting genes to study as a starting point for cancer classification is common practice. We offer a novel approach that combines the Runge Kutta optimizer (RUN) with a support vector machine (SVM) as the classifier to select the significant genes in the detection of cancer tissues. As a means of dealing with the high dimensionality that characterizes microarray datasets, the preprocessing stage of the ReliefF method is implemented. The proposed RUN-SVM approach is tested on binary-class microarray datasets (Breast2 and Prostate) and multi-class microarray datasets in order to assess its efficacy (i.e., Brain Tumor1, Brain Tumor2, Breast3, and Lung Cancer). Based on the experimental results obtained from analyzing six different cancer gene expression datasets, the proposed RUN-SVM approach was found to statistically beat the other competing algorithms due to its innovative search technique.

Self-adaptive moth flame optimizer combined with crossover operator and Fibonacci search strategy for COVID-19 CT image segmentation.

The COVID-19 is one of the most significant obstacles that humanity is now facing. The use of computed tomography (CT) images is one method that can be utilized to recognize COVID-19 in early stage. In this study, an upgraded variant of Moth flame optimization algorithm (Es-MFO) is presented by considering a nonlinear self-adaptive parameter and a mathematical principle based on the Fibonacci approach method to achieve a higher level of accuracy in the classification of COVID-19 CT images. The proposed Es-MFO algorithm is evaluated using nineteen different basic benchmark functions, thirty and fifty dimensional IEEE CEC'2017 test functions, and compared the proficiency with a variety of other fundamental optimization techniques as well as MFO variants. Moreover, the suggested Es-MFO algorithm's robustness and durability has been evaluated with tests including the Friedman rank test and the Wilcoxon rank test, as well as a convergence analysis and a diversity analysis. Furthermore, the proposed Es-MFO algorithm resolves three CEC2020 engineering design problems to examine the problem-solving ability of the proposed method. The proposed Es-MFO algorithm is then used to solve the COVID-19 CT image segmentation problem using multi-level thresholding with the help of Otsu's method. Comparison results of the suggested Es-MFO with basic and MFO variants proved the superiority of the newly developed algorithm.

Heart disease risk factors detection from electronic health records using advanced NLP and deep learning techniques.

Heart disease remains the major cause of death, despite recent improvements in prediction and prevention. Risk factor identification is the main step in diagnosing and preventing heart disease. Automatically detecting risk factors for heart disease in clinical notes can help with disease progression modeling and clinical decision-making. Many studies have attempted to detect risk factors for heart disease, but none have identified all risk factors. These studies have proposed hybrid systems that combine knowledge-driven and data-driven techniques, based on dictionaries, rules, and machine learning methods that require significant human effort. The National Center for Informatics for Integrating Biology and Beyond (i2b2) proposed a clinical natural language processing (NLP) challenge in 2014, with a track (track2) focused on detecting risk factors for heart disease risk factors in clinical notes over time. Clinical narratives provide a wealth of information that can be extracted using NLP and Deep Learning techniques. The objective of this paper is to improve on previous work in this area as part of the 2014 i2b2 challenge by identifying tags and attributes relevant to disease diagnosis, risk factors, and medications by providing advanced techniques of using stacked word embeddings. The i2b2 heart disease risk factors challenge dataset has shown significant improvement by using the approach of stacking embeddings, which combines various embeddings. Our model achieved an F1 score of 93.66% by using BERT and character embeddings (CHARACTER-BERT Embedding) stacking. The proposed model has significant results compared to all other models and systems that we developed for the 2014 i2b2 challenge.

Optimized deep learning architecture for brain tumor classification using improved Hunger Games Search Algorithm.

One of the worst diseases is a brain tumor, which is defined by abnormal development of synapses in the brain. Early detection of brain tumors is essential for improving prognosis, and classifying tumors is a vital step in the disease's treatment. Different classification strategies using deep learning have been presented for the diagnosis of brain tumors. However, several challenges exist, such as the need for a competent specialist in classifying brain cancers by deep learning models and the problem of building the most precise deep learning model for categorizing brain tumors. We propose an evolved and highly efficient model based on deep learning and improved metaheuristic algorithms to address these challenges. Specifically, we develop an optimized residual learning architecture for classifying multiple brain tumors and propose an improved variant of the Hunger Games Search algorithm (I-HGS) based on combining two enhancing strategies: Local Escaping Operator (LEO) and Brownian motion. These two strategies balance solution diversity and convergence speed, boosting the optimization performance and staying away from the local optima. First, we have evaluated the I-HGS algorithm on the IEEE Congress on Evolutionary Computation held in 2020 (CEC'2020) test functions, demonstrating that I-HGS outperformed the basic HGS and other popular algorithms regarding statistical convergence, and various measures. The suggested model is then applied to the optimization of the hyperparameters of the Residual Network 50 (ResNet50) model (I-HGS-ResNet50) for brain cancer identification, proving its overall efficacy. We utilize several publicly available, gold-standard datasets of brain MRI images. The proposed I-HGS-ResNet50 model is compared with other existing studies as well as with other deep learning architectures, including Visual Geometry Group 16-layer (VGG16), MobileNet, and Densely Connected Convolutional Network 201 (DenseNet201). The experiments demonstrated that the proposed I-HGS-ResNet50 model surpasses the previous studies and other well-known deep learning models. I-HGS-ResNet50 acquired an accuracy of 99.89%, 99.72%, and 99.88% for the three datasets. These results efficiently prove the potential of the proposed I-HGS-ResNet50 model for accurate brain tumor classification.

A modified weighted mean of vectors optimizer for Chronic Kidney disease classification.

Chronic kidney Disease (CKD), also known as chronic renal disease, is an illness that affects the majority of adults and is defined by a progressive decrease in kidney function over time, particularly in those with diabetes and high blood pressure. Metaheuristic (MH) algorithms based machine learning classifiers have become reliable for medical treatment. The weIghted meaN oF vectOrs (INFO) is a recently developed MH but suffers from a fall into local optimal and slow convergence speed. Therefore, to improve INFO, a modified INFO (mINFO) with two enhancement strategies has been developed. The developed variant utilizes the Opposition-Based Learning (OBL) to improve the local search ability to avoid trapping into the local optimum, and the Dynamic Candidate Solution (DCS) is used to overcome the premature convergence problem in INFO and achieve the appropriate balance between exploration and exploitation ability. The performance of the proposed mINFO based on the k-Nearest Neighbor (kNN) classifier is evaluated on the complex CEC'22 test suite and applied to predict Chronic Kidney Disease (CKD) on datasets extracted from UCI. The statistical results revealed the superiority of mINFO compared with several well-known MH algorithms, including the Harris Hawks Optimization (HHO), the Hunger Games Search (HGS) algorithm, the Moth-Flame Optimization (MFO) algorithm, the Whale Optimization Algorithm (WOA), the Sine Cosine Algorithm (SCA), the Gradient-Based Optimizer (GBO), and the original INFO algorithm. According to our knowledge, this paper is the first of its sort to try employing the proposed mINFO for solving the CEC'22 test suite. Furthermore, the experimental results of mINFO-kNN for classifying two CKD datasets demonstrated its superiority with an overall classification accuracy of 93.17% on two CKD datasets over other competitors.

A modified reptile search algorithm for global optimization and image segmentation: Case study brain MRI images.

In this paper, we proposed an enhanced reptile search algorithm (RSA) for global optimization and selected optimal thresholding values for multilevel image segmentation. RSA is a recent metaheuristic optimization algorithm depending on the hunting behavior of crocodiles. RSA is inclined to inadequate diversity, local optima, and unbalanced exploitation abilities as other metaheuristic algorithms. The RUNge Kutta optimizer (RUN) is a novel metaheuristic algorithm that has demonstrated effectiveness in solving real-world optimization problems. The enhanced solution quality (ESQ) in RUN utilizes the thus-far best solution to promote the quality of solutions, improve the convergence speed, and effectively balance the exploration and exploitation steps. Also, the Scale factor (SF) has a randomized adaptation nature, which helps RUN in further improving the exploration and exploitation steps. This parameter ensures a smooth transition from exploration to exploitation. In order to mitigate the drawbacks of the RSA algorithm, this paper proposed a modified RSA (mRSA), which combines the RSA algorithm with the RUN. The ESQ mechanism and the scale factor boost the original RSA's performance, enhance convergence speed, bypass local optimum, and enhance the balance between exploitation and exploration. The validity of mRSA was verified using two experimental sequences. First, we applied mRSA to CEC'2020 benchmark functions of various types and dimensions, showing that mRSA has more robust search capabilities than the original RSA and popular counterpart algorithms concerning statistical, convergence, and diversity measurements. The second experiment evaluated mRSA for a real-world application to solve magnetic resonance imaging (MRI) brain image segmentation. Overall experimental results confirm that the mRSA has a strong optimization ability. Also, mRSA method is a more successful multilevel thresholding segmentation and outperforms comparison methods according to different performance measures.

Development and application of equilibrium optimizer for optimal power flow calculation of power system.

This paper proposes an enhanced version of Equilibrium Optimizer (EO) called (EEO) for solving global optimization and the optimal power flow (OPF) problems. The proposed EEO algorithm includes a new performance reinforcement strategy with the Lévy Flight mechanism. The algorithm addresses the shortcomings of the original Equilibrium Optimizer (EO) and aims to provide better solutions (than those provided by EO) to global optimization problems, especially OPF problems. The proposed EEO efficiency was confirmed by comparing its results on the ten functions of the CEC'20 test suite, to those of other algorithms, including high-performance algorithms, i.e., CMA-ES, IMODE, AGSK and LSHADE_cnEpSin. Moreover, the statistical significance of these results was validated by the Wilcoxon's rank-sum test. After that, the proposed EEO was applied to solve the the OPF problem. The OPF is formulated as a nonlinear optimization problem with conflicting objectives and subjected to both equality and inequality constraints. The performance of this technique is deliberated and evaluated on the standard IEEE 30-bus test system for different objectives. The obtained results of the proposed EEO algorithm is compared to the original EO algorithm and those obtained using other techniques mentioned in the literature. These Simulation results revealed that the proposed algorithm provides better optimized solutions than 20 published methods and results as well as the original EO algorithm. The EEO superiority was demonstrated through six different cases, that involved the minimization of different objectives: fuel cost, fuel cost with valve-point loading effect, emission, total active power losses, voltage deviation, and voltage instability. Also, the comparison results indicate that EEO algorithm can provide a robust, high-quality feasible solutions for different OPF problems.

Fuzzy-based hunger games search algorithm for global optimization and feature selection using medical data.

Feature selection (FS) is one of the basic data preprocessing steps in data mining and machine learning. It is used to reduce feature size and increase model generalization. In addition to minimizing feature dimensionality, it also enhances classification accuracy and reduces model complexity, which are essential in several applications. Traditional methods for feature selection often fail in the optimal global solution due to the large search space. Many hybrid techniques have been proposed depending on merging several search strategies which have been used individually as a solution to the FS problem. This study proposes a modified hunger games search algorithm (mHGS), for solving optimization and FS problems. The main advantages of the proposed mHGS are to resolve the following drawbacks that have been raised in the original HGS; (1) avoiding the local search, (2) solving the problem of premature convergence, and (3) balancing between the exploitation and exploration phases. The mHGS has been evaluated by using the IEEE Congress on Evolutionary Computation 2020 (CEC'20) for optimization test and ten medical and chemical datasets. The data have dimensions up to 20000 features or more. The results of the proposed algorithm have been compared to a variety of well-known optimization methods, including improved multi-operator differential evolution algorithm (IMODE), gravitational search algorithm, grey wolf optimization, Harris Hawks optimization, whale optimization algorithm, slime mould algorithm and hunger search games search. The experimental results suggest that the proposed mHGS can generate effective search results without increasing the computational cost and improving the convergence speed. It has also improved the SVM classification performance.

Fuzzy Clustering Algorithm Based on Improved Global Best-Guided Artificial Bee Colony with New Search Probability Model for Image Segmentation.

Clustering using fuzzy C-means (FCM) is a soft segmentation method that has been extensively investigated and successfully implemented in image segmentation. FCM is useful in various aspects, such as the segmentation of grayscale images. However, FCM has some limitations in terms of its selection of the initial cluster center. It can be easily trapped into local optima and is sensitive to noise, which is considered the most challenging issue in the FCM clustering algorithm. This paper proposes an approach to solve FCM problems in two phases. Firstly, to improve the balance between the exploration and exploitation of improved global best-guided artificial bee colony algorithm (IABC). This is achieved using a new search probability model called PIABC that improves the exploration process by choosing the best source of food which directly affects the exploitation process in IABC. Secondly, the fuzzy clustering algorithm based on PIABC, abbreviated as PIABC-FCM, uses the balancing of PIABC to avoid getting stuck into local optima while searching for the best solution having a set of cluster center locations of FCM. The proposed method was evaluated using grayscale images. The performance of the proposed approach shows promising outcomes when compared with other related works.

An efficient image segmentation method for skin cancer imaging using improved golden jackal optimization algorithm.

Skin cancer is one of the worst cancers nowadays that poses a severe threat to the health and safety of individuals. Therefore, skin cancer classification and early diagnosis are recommended to preserve human life. Multilevel thresholding image segmentation is well-known and influential technique for extracting regions of interest from skin cancer images to improve the classification process. Therefore, this paper proposes an efficient version of the recently developed golden jackal optimization (GJO) algorithm, the opposition-based golden jackal optimizer (IGJO). The IGJO algorithm is used to solve the multilevel thresholding problem using Otsu's method as an objective function. The proposed algorithm is compared with seven other meta-heuristic algorithms: whale optimization algorithm, seagull optimization algorithm, salp swarm algorithm, Harris hawks optimization, artificial gorilla troops optimizer, marine predators' algorithms, and original GJO algorithm. The performance of the proposed algorithm is evaluated using four popular performance measures: peak signal-to-noise ratio, structure similarity index, feature similarity index, and mean square error. Experimental results show that the proposed algorithm outperforms other alternative algorithms in terms of PSNR, SSIM, FSIM, and MSE segmentation metrics and effectively resolves the segmentation problem.