Search

Expanding the capacity of optimization algorithms for simultaneous optimization of multiple competing objectives is a crucial aspect of research. This study presents MnMOMFO, a novel non-dominated sorting (NDS) and crowding distance (CD)-based multi-objective variant of the moth-flame optimization (MFO) algorithm for multi-objective optimization problems. The algorithm incorporates arithmetic and geometric mean concepts to address MFO's limitations and to improve its performance. Subsequently, we extend this enhanced MFO into a multi-objective variant, leveraging NDS and CD strategies to achieve a well-distributed Pareto optimal front. The effectiveness of the proposed MnMOMFO algorithm is rigorously evaluated across three distinct phases. In the initial phase, we scrutinize its performance on four ZDT multi-objective optimization problems, employing four performance metrics—general distance, inverted general distance, spacing, and spread metric. Comparative analyses with select competitive multi-objective optimization algorithms comprehensively understand MnMOMFO's efficacy. Secondly, 24 complex multi-objective IEEE CEC 2020 test suits are considered on two performance metrics. Namely, Pareto sets proximity and the inverted generational distance in decision space. In the third phase, five real-world engineering problems are considered to measure the problem-solving ability of the MnMOMFO algorithm. The results from the experiments indicated that the MnMOMFO was the best candidate algorithm, achieving more than 95% superior results for multi-objective ZDT benchmark problems, IEEE CEC 2020 test functions, and real-life issues in contrast to several other algorithms. The experimental outcomes substantiate MnMOMFO's superiority, establishing it as a robust and efficient algorithm for multi-objective optimization challenges with broad applicability to real-world engineering problems. [ABSTRACT FROM AUTHOR]

Global optimization and biomedical image segmentation are crucial in diverse scientific and medical fields. The Honey Badger Algorithm (HBA) is a newly developed metaheuristic that draws inspiration from the foraging behavior of honey badgers. Similar to other metaheuristic algorithms, HBA encounters difficulties associated with exploitation, being trapped in local optima, and the pace at which it converges. This study aims to improve the performance of the original HBA by implementing the Enhanced Solution Quality (ESQ) method. This strategy helps to prevent becoming stuck in local optima and speeds up the convergence process. We conducted an assessment of the enhanced algorithm, mHBA, by utilizing a comprehensive collection of benchmark functions from IEEE CEC'2020. In this evaluation, we compared mHBA with well-established metaheuristic algorithms. mHBA demonstrates exceptional performance, as shown by both qualitative and quantitative assessments. Our study not only focuses on global optimization but also investigates the field of biomedical image segmentation, which is a crucial process in numerous applications involving digital image analysis and comprehension. We specifically focus on the problem of multi-level thresholding (MT) for medical image segmentation, which is a difficult process that becomes more challenging as the number of thresholds needed increases. In order to tackle this issue, we suggest a revised edition of the standard HBA, known as mHBA, which utilizes the ESQ approach. We utilized this methodology for the segmentation of Magnetic Resonance Images (MRI). The evaluation of mHBA utilizes existing metrics to gauge the quality and performance of its segmentation. This evaluation showcases the resilience of mHBA in comparison to many established optimization algorithms, emphasizing the effectiveness of the suggested technique. [ABSTRACT FROM AUTHOR]

Medical image segmentation is crucial in using digital images for disease diagnosis, particularly in post-processing tasks such as analysis and disease identification. Segmentation of magnetic resonance imaging (MRI) and computed tomography images pose distinctive challenges attributed to factors such as inadequate illumination during the image acquisition process. Multilevel thresholding is a widely adopted method for image segmentation due to its effectiveness and ease of implementation. However, the primary challenge lies in selecting the optimal set of thresholds to achieve accurate segmentation. While Otsu's between-class variance and Kapur's entropy assist in identifying optimal thresholds, their application to cases requiring more than two thresholds can be computationally intensive. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. In this paper, we introduce an improved chameleon swarm algorithm (ICSA) to address these limitations. ICSA is designed for image segmentation and global optimization tasks, aiming to improve the precision and efficiency of threshold selection in medical image segmentation. ICSA introduces the concept of the "best random mutation strategy" to enhance the search capabilities of the standard chameleon swarm algorithm (CSA). This strategy leverages three distribution functions—Levy, Gaussian, and Cauchy—for mutating search individuals. These diverse distributions contribute to improved solution quality and help prevent premature convergence. We conduct comprehensive experiments using the IEEE CEC'20 complex optimization benchmark test suite to evaluate ICSA's performance. Additionally, we employ ICSA in image segmentation, utilizing Otsu's approach and Kapur's entropy as fitness functions to determine optimal threshold values for a set of MRI images. Comparative analysis reveals that ICSA outperforms well-known metaheuristic algorithms when applied to the CEC'20 test suite and significantly improves image segmentation performance, proving its ability to avoid local optima and overcome the original algorithm's drawbacks. Medical image segmentation is essential for employing digital images for disease diagnosis, particularly for post-processing activities such as analysis and disease identification. Due to poor illumination and other acquisition-related difficulties, radiologists are especially concerned about the optimal segmentation of brain magnetic resonance imaging (MRI). Multilevel thresholding is the most widely used image segmentation method due to its efficacy and simplicity of implementation. The issue, however, is selecting the optimum set of criteria to effectively segment each image. Although methods like Otsu's between-class variance and Kapur's entropy help locate the optimal thresholds, using them for more than two thresholds requires a significant amount of processing resources. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. Due to the aforementioned, we present an improved chameleon swarm algorithm (ICSA) in this paper for image segmentation and global optimization tasks to be able to address these weaknesses. In the ICSA method, the best random mutation strategy has been introduced to improve the searchability of the standard CSA. The best random strategy utilizes three different types of distribution: Levy, Gaussian, and Cauchy to mutate the search individuals. These distributions have different functions, which help enhance the quality of the solutions and avoid premature convergence. Using the IEEE CEC'20 test suite as a recent complex optimization benchmark, a comprehensive set of experiments is carried out in order to evaluate the ICSA method and demonstrate the impact of combining the best random mutation strategy with the original CSA in improving both the performance of the solutions and the rate at which they converge. Furthermore, utilizing the Otsu approach and Kapur's entropy as a fitness function, ICSA is used as an image segmentation method to select the ideal threshold values for segmenting a set of MRI images. Within the experiments, the ICSA findings are compared with well-known metaheuristic algorithms. The comparative findings showed that ICSA performs better than other competitors in solving the CEC'20 test suite and has a significant performance boost in image segmentation. [ABSTRACT FROM AUTHOR]

For the simultaneous optimization of many conflicting objectives, the capability of optimization algorithms must be increased. In this research, a non-dominated sorting (NDS) and crowding distance (CD)-based multi-objective variant of an advanced moth flame optimization (MFO) has been offered. Firstly, a mathematical quasi-reflection-based learning (QRL) strategy and weight strategy (WS) have been added to the classical MFO to alleviate the drawbacks of MFO. Next, this advanced MFO has been extended into multi-objective variant, namely MOQRMFO, with the help of NDS and CD approaches for well-distributed Pareto optimal front. The efficiency of the suggested MOQRMFO algorithm is tested in three phases. In the first phase, five ZDT multi-objective optimization problems (MOOPs) were considered under four performance metrics, namely general distance (GD), inverted general distance (IGD), spacing (S) and spread metric (Δ ) and then compared it with competitive multi-objective optimization algorithms. Secondly, six problems from the DTLZ test suite are considered under the above performance metrics to examine the effectiveness of the suggested MOQRMFO algorithm. The MOQRMFO algorithm's capacity to solve real-world problems has been evaluated by considering four multi-objective real-world engineering design issues in the third phase using several performance metrics. The experimental outcomes show that the MOQRMFO is a better candidate algorithm achieving more than 95% superior results for multi-objective benchmarks and real-life problems in contrast to several other algorithms. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In recent years, medical data analysis has become paramount in delivering accurate diagnoses for various diseases. The plethora of medical data sources, encompassing disease types, disease-related proteins, ligands for proteins, and molecular drug components, necessitates adopting effective disease analysis and diagnosis methods. Soft computing techniques, including swarm algorithms and machine learning (ML) methods, have emerged as superior approaches. While ML techniques such as classification and clustering have gained prominence, feature selection methods are crucial in extracting optimal features and reducing data dimensions. This review paper presents a comprehensive overview of soft computing techniques for tackling medical data problems through classifying and analyzing medical data. The focus lies mainly on the classification of medical data resources. A detailed examination of various techniques developed for classifying numerous diseases is provided. The review encompasses an in-depth exploration of multiple ML methods designed explicitly for disease detection and classification. Additionally, the review paper offers insights into the underlying biological disease mechanisms and highlights several medical and chemical databases that facilitate research in this field. Furthermore, the review paper outlines emerging trends and identifies the key challenges in biomedical data analysis. It sheds light on this research domain's exciting possibilities and future directions. The enhanced understanding of soft computing techniques and their practical applications and limitations will contribute to advancing biomedical data analysis and support healthcare professionals in making accurate diagnoses. [ABSTRACT FROM AUTHOR]

This paper provides a novel, unique, and improved optimization algorithm called the modified Orca Predation Algorithm (mOPA). The mOPA is based on the original Orca Predation Algorithm (OPA), which combines two enhancing strategies: Lévy flight and opposition-based learning. The mOPA method is proposed to enhance search efficiency and avoid the limitations of the original OPA. This mOPA method sets up to solve the global optimization issues. Additionally, its effectiveness is compared with various well-known metaheuristic methods, and the CEC'20 test suite challenges are used to illustrate how well the mOPA performs. Case analysis demonstrates that the proposed mOPA method outperforms the benchmark regarding computational speed and yields substantially higher performance than other methods. The mOPA is applied to ensure that all load demand is met with high reliability and the lowest energy cost of an isolated hybrid system. The optimal size of this hybrid system is determined through simulation and analysis in order to service a tiny distant location in Egypt while reducing costs. Photovoltaic panels, biomass gasifier, and fuel cell units compose the majority of this hybrid system's configuration. To confirm the mOPA technique's superiority, its outcomes have been compared with the original OPA and other well-known metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

Biological data generally contain complex and high-dimensional samples. In addition, the number of samples in biological datasets is much fewer than the number of features, so the vast number of features should be selected carefully and determine the optimal subset of features. Feature selection (FS) is a vital stage in biological data mining applications (e.g., classification) for dealing with the curse of dimensionality problems and finding highly informative features. This work proposes an effective FS approach based on a new version of Gray Wolf Optimizer (GWO) called Multi-strategy Gray Wolf Optimizer (MSGWO) for better features selection for biological data classification. The use of MSGWO in feature selection is to find the optimal subset of features between classes, solve premature convergence, and enhance the local search ability of the GWO algorithm. Multiple exploration and exploitation strategies are proposed to enhance the global search and local search abilities of the GWO algorithm through the optimization process. The support vector machine (SVM) classifier is used to evaluate the proposed GWO-based FS approaches. MSGWO was evaluated on thirteen high-dimensional biological datasets obtained from the UCI repository with a smaller number of instances. The reported results confirm that employing multiple exploration and multiple exploitation strategies is highly useful for enhancing the search tendency of the MSGWO in the FS domain. Statistical tests proved that the superiority of the proposed approach is statistically significant as compared to the basic GWO and similar wrapper-based FS techniques, including binary particle swarm optimization (BPSO), binary bat algorithm (BBA), binary gravitational search algorithm (BGSA), and binary whale optimization algorithm (BWOA). In terms of classification accuracy, MSGWO yielded better accuracy rates than the standard GWO algorithm on 84% of applied biological datasets. MSGWO also recorded better accuracy rates than its other competitors in all 13 cases. In terms of the lowest number of selected features, MSGWO yielded excellent reduction rates compared to its peers. [ABSTRACT FROM AUTHOR]

Breast cancer is the second leading cause of death in women; therefore, effective early detection of this cancer can reduce its mortality rate. Breast cancer detection and classification in the early phases of development may allow for optimal therapy. Convolutional neural networks (CNNs) have enhanced tumor detection and classification efficiency in medical imaging compared to traditional approaches. This paper proposes a novel classification model for breast cancer diagnosis based on a hybridized CNN and an improved optimization algorithm, along with transfer learning, to help radiologists detect abnormalities efficiently. The marine predators algorithm (MPA) is the optimization algorithm we used, and we improve it using the opposition-based learning strategy to cope with the implied weaknesses of the original MPA. The improved marine predators algorithm (IMPA) is used to find the best values for the hyperparameters of the CNN architecture. The proposed method uses a pretrained CNN model called ResNet50 (residual network). This model is hybridized with the IMPA algorithm, resulting in an architecture called IMPA-ResNet50. Our evaluation is performed on two mammographic datasets, the mammographic image analysis society (MIAS) and curated breast imaging subset of DDSM (CBIS-DDSM) datasets. The proposed model was compared with other state-of-the-art approaches. The obtained results showed that the proposed model outperforms the compared state-of-the-art approaches, which are beneficial to classification performance, achieving 98.32% accuracy, 98.56% sensitivity, and 98.68% specificity on the CBIS-DDSM dataset and 98.88% accuracy, 97.61% sensitivity, and 98.40% specificity on the MIAS dataset. To evaluate the performance of IMPA in finding the optimal values for the hyperparameters of ResNet50 architecture, it compared to four other optimization algorithms including gravitational search algorithm (GSA), Harris hawks optimization (HHO), whale optimization algorithm (WOA), and the original MPA algorithm. The counterparts algorithms are also hybrid with the ResNet50 architecture produce models named GSA-ResNet50, HHO-ResNet50, WOA-ResNet50, and MPA-ResNet50, respectively. The results indicated that the proposed IMPA-ResNet50 is achieved a better performance than other counterparts. [ABSTRACT FROM AUTHOR]

Coronavirus disease 2019 (COVID-19) is pervasive worldwide, posing a high risk to people's safety and health. Many algorithms were developed to identify COVID-19. One way of identifying COVID-19 is by computed tomography (CT) images. Some segmentation methods are proposed to extract regions of interest from COVID-19 CT images to improve the classification. In this paper, an efficient version of the recent manta ray foraging optimization (MRFO) algorithm is proposed based on the oppositionbased learning called the MRFO-OBL algorithm. The original MRFO algorithm can stagnate in local optima and requires further exploration with adequate exploitation. Thus, to improve the population variety in the search space, we applied Opposition-based learning (OBL) in the MRFO's initialization step. MRFO-OBL algorithm can solve the image segmentation problem using multilevel thresholding. The proposed MRFO-OBL is evaluated using Otsu's method over the COVID-19 CT images and compared with six meta-heuristic algorithms: sine-cosine algorithm, moth flame optimization, equilibrium optimization, whale optimization algorithm, slap swarm algorithm, and original MRFO algorithm. MRFO-OBL obtained useful and accurate results in quality, consistency, and evaluation matrices, such as peak signal-to-noise ratio and structural similarity index. Eventually, MRFO-OBL obtained more robustness for the segmentation than all other algorithms compared. The experimental results demonstrate that the proposed method outperforms the original MRFO and the other compared algorithms under Otsu's method for all the used metrics. [ABSTRACT FROM AUTHOR]