Enhanced Runge-Kutta-driven feature selection model for early detection of gastroesophageal reflux disease

Gastroesophageal reflux disease (GERD) profoundly compromises the quality of life, with prolonged untreated cases posing a heightened risk of severe complications such as esophageal injury and esophageal carcinoma. The imperative for early diagnosis is paramount in averting progressive pathological developments. This study introduces a wrapper-based feature selection model based on the enhanced Runge Kutta algorithm (SCCRUN) and fuzzy k-nearest neighbors (FKNN) for GERD prediction, named bSCCRUN-FKNN-FS. Runge Kutta algorithm (RUN) is a metaheuristic algorithm designed based on the Runge-Kutta method. However, RUN's effectiveness in local search capabilities is insufficient, and it exhibits insufficient convergence accuracy. To enhance the convergence accuracy of RUN, spiraling communication and collaboration (SCC) is introduced. By facilitating information exchange among population individuals, SCC expands the solution search space, thereby improving convergence accuracy. The optimization capabilities of SCCRUN are experimentally validated through comparisons with classical and state-of-the-art algorithms on the IEEE CEC 2017 benchmark. Subsequently, based on SCCRUN, the bSCCRUN-FKNN-FS model is proposed. During the period from 2019 to 2023, a dataset comprising 179 cases of GERD, including 110 GERD patients and 69 healthy individuals, was collected from Zhejiang Provincial People's Hospital. This dataset was utilized to compare our proposed model against similar algorithms in order to evaluate its performance. Concurrently, it was determined that features such as the internal diameter of the esophageal hiatus during distention, esophagogastric junction diameter during distention, and external diameter of the esophageal hiatus during non-distention play crucial roles in influencing GERD prediction. Experimental findings demonstrate the outstanding performance of the proposed model, with a predictive accuracy reaching as high as 93.824 %. These results underscore the significant advantage of the proposed model in both identifying and predicting GERD patients.

Fuzzy logic controller for UAV with gains optimized via genetic algorithm

A gains optimizer of a fuzzy controller system for an Unmanned Aerial Vehicle (UAV) based on a metaheuristic algorithm is developed in the present investigation. The contribution of the work is the adjustment by the Genetic Algorithm (GA) to tune the gains at the input of a fuzzy controller. First, a typical fuzzy controller was modeled, designed, and implemented in a mathematical model obtained by Newton-Euler methodology. Subsequently, the control gains were optimized using a metaheuristic algorithm. The control objective is that the UAV consumes the least amount of energy. With this basis, the Genetic Algorithm finds the necessary gains to meet the design parameters. The tests were performed using the Matlab-Simulink environment. The results indicate an improvement, reducing the error in tracking trajectories from 30% in some tasks and following trajectories that could not be completed without a tuned controller in other tasks.

An interval water demand prediction method to reduce uncertainty: A case study of Sichuan Province, China

Effective prediction of water demand is a prerequisite for decision makers to achieve reliable management of water supply. Currently, the research on water demand prediction focuses on point prediction method. In this study, we constructed a GA-BP-KDE hybrid interval water demand prediction model by combining non-parametric estimation and point prediction. Multiple metaheuristic algorithms were used to optimize the Back-Propagation Neural Network (BP) and Kernel Extreme Learning Machine (KELM) network structures. The performance of the water demand point prediction models was compared by the Root Mean Squared Error (RMSE), Mean Absolute Percentage Error (MAPE), Kling-Gupta Efficiency (KGE), computation time, and fitness convergence curves. The kernel density estimation method (KDE) and the normal distribution method were used to fit the distribution of errors. The probability density function with the best fitting degree was selected based on the index G. The shortest confidence interval under 95% confidence was calculated according to the asymmetry of the error distribution. We predicted the impact indicator values for 2025 using the exponential smoothing method, and obtained water demand prediction intervals for various water use sectors. The results showed that the GA-BP model was the optimal model as it exhibited the highest computational efficiency, algorithmic stability, and prediction accuracy. The three prediction intervals estimated after adjusting the KDE bandwidth parameter covered most of the sample points in the test set. The prediction intervals of the four water use sectors were evaluated as F values of 1.6845, 1.3294, 1.6237, and 1.3600, which indicates high accuracy and quality of the prediction intervals. The mixed water demand interval prediction based on GA-BP-KDE reduces the uncertainty of the point prediction results and can provide a basis for water resource management by decision makers.

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.

Coronavirus Mask Protection Algorithm: A New Bio-inspired Optimization Algorithm and Its Applications

Nowadays, meta-heuristic algorithms are attracting widespread interest in solving high-dimensional nonlinear optimization problems. In this paper, a COVID-19 prevention-inspired bionic optimization algorithm, named Coronavirus Mask Protection Algorithm (CMPA), is proposed based on the virus transmission of COVID-19. The main inspiration for the CMPA originated from human self-protection behavior against COVID-19. In CMPA, the process of infection and immunity consists of three phases, including the infection stage, diffusion stage, and immune stage. Notably, wearing masks correctly and safe social distancing are two essential factors for humans to protect themselves, which are similar to the exploration and exploitation in optimization algorithms. This study simulates the self-protection behavior mathematically and offers an optimization algorithm. The performance of the proposed CMPA is evaluated and compared to other state-of-the-art metaheuristic optimizers using benchmark functions, CEC2020 suite problems, and three truss design problems. The statistical results demonstrate that the CMPA is more competitive among these state-of-the-art algorithms. Further, the CMPA is performed to identify the parameters of the main girder of a gantry crane. Results show that the mass and deflection of the main girder can be improved by 16.44% and 7.49%, respectively.

Multiclass feature selection with metaheuristic optimization algorithms: a review

Selecting relevant feature subsets is vital in machine learning, and multiclass feature selection is harder to perform since most classifications are binary. The feature selection problem aims at reducing the feature set dimension while maintaining the performance model accuracy. Datasets can be classified using various methods. Nevertheless, metaheuristic algorithms attract substantial attention to solving different problems in optimization. For this reason, this paper presents a systematic survey of literature for solving multiclass feature selection problems utilizing metaheuristic algorithms that can assist classifiers selects optima or near optima features faster and more accurately. Metaheuristic algorithms have also been presented in four primary behavior-based categories, i.e., evolutionary-based, swarm-intelligence-based, physics-based, and human-based, even though some literature works presented more categorization. Further, lists of metaheuristic algorithms were introduced in the categories mentioned. In finding the solution to issues related to multiclass feature selection, only articles on metaheuristic algorithms used for multiclass feature selection problems from the year 2000 to 2022 were reviewed about their different categories and detailed descriptions. We considered some application areas for some of the metaheuristic algorithms applied for multiclass feature selection with their variations. Popular multiclass classifiers for feature selection were also examined. Moreover, we also presented the challenges of metaheuristic algorithms for feature selection, and we identified gaps for further research studies.

ST-AL: a hybridized search based metaheuristic computational algorithm towards optimization of high dimensional industrial datasets

The rapid growth of data generated by several applications like engineering, biotechnology, energy, and others has become a crucial challenge in the high dimensional data mining. The large amounts of data, especially those with high dimensions, may contain many irrelevant, redundant, or noisy features, which may negatively affect the accuracy and efficiency of the industrial data mining process. Recently, several meta-heuristic optimization algorithms have been utilized to evolve feature selection techniques for dealing with the vast dimensionality problem. Despite optimization algorithms' ability to find the near-optimal feature subset of the search space, they still face some global optimization challenges. This paper proposes an improved version of the sooty tern optimization (ST) algorithm, namely the ST-AL method, to improve the search performance for high-dimensional industrial optimization problems. ST-AL method is developed by boosting the performance of STOA by applying four strategies. The first strategy is the use of a control randomization parameters that ensure the balance between the exploration-exploitation stages during the search process; moreover, it avoids falling into local optimums. The second strategy entails the creation of a new exploration phase based on the Ant lion (AL) algorithm. The third strategy is improving the STOA exploitation phase by modifying the main equation of position updating. Finally, the greedy selection is used to ignore the poor generated population and keeps it from diverging from the existing promising regions. To evaluate the performance of the proposed ST-AL algorithm, it has been employed as a global optimization method to discover the optimal value of ten CEC2020 benchmark functions. Also, it has been applied as a feature selection approach on 16 benchmark datasets in the UCI repository and compared with seven well-known optimization feature selection methods. The experimental results reveal the superiority of the proposed algorithm in avoiding local minima and increasing the convergence rate. The experimental result are compared with state-of-the-art algorithms, i.e., ALO, STOA, PSO, GWO, HHO, MFO, and MPA and found that the mean accuracy achieved is in range 0.94-1.00.

Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems

The simplicity, transparency, reliability, high efficiency and robust nature of PID controllers are some of the reasons for their high popularity and acceptance for control in process industries around the world today. Tuning of PID control parameters has been a field of active research and still is. The primary objectives of PID control parameters are to achieve minimal overshoot in steady state response and lesser settling time. With exception of two popular conventional tuning strategies (Ziegler Nichols closed loop oscillation and Cohen-Coon's process reaction curve) several other methods have been employed for tuning. This work accords a thorough review of state-of-the-art and classical strategies for PID controller parameters tuning using metaheuristic algorithms. Methods appraised are categorized into classical and metaheuristic optimization methods for PID parameters tuning purposes. Details of some metaheuristic algorithms, methods of application, equations and implementation flowcharts/algorithms are presented. Some open problems for future research are also presented. The major goal of this work is to proffer a comprehensive reference source for researchers and scholars working on PID controllers.

Symmetry-based representation for registration of multimodal images

We propose a new two-dimensional structural representation method for registration of multimodal images by using the local structural symmetry of images, which is similar at different modalities. The symmetry is measured in various orientations and the best is mapped and used for the representation image. The optimum performance is obtained when using only two different orientations, which is called binary dominant symmetry representation (BDSR). This representation is highly robust to noise and intensity non-uniformity. We also propose a new objective function based on L2 distance with low sensitivity to the overlapping region. Then, five different meta-heuristic algorithms are comparatively applied. Two of them have been used for the first time on image registration. BDSR remarkably outperforms the previous successful representations, such as entropy images, self-similarity context, and modality-independent local binary pattern, as well as mutual information-based registration, in terms of success rate, runtime, convergence error, and representation construction.

Application of MCAT to provide multi-objective optimization model for municipal waste management system

Choosing an appropriate municipal waste management method is a very complicated environmental problem in cities. This research introduces an optimization model for waste management in the southwest region of Tehran province. It was developed by a metaheuristic algorithm that was used to minimize the economic and environmental costs. Incineration, composting, recycling and landfilling waste management methods were considered. Three scenarios were developed to determine the optimum allocation of waste to each method such to fulfill the objective of overall minimum of environmental burdens and costs. A multi-objective scenario selection model was implemented by the compromise programming method in MCAT software. Considering the budget limitation and available facilities on site, optimum allocations to recycling, composting, incineration and landfilling methods were obtained as 115,486, 132,094, 71,905 and 45,516 tons/year, respectively. The results of this study indicated that the metaheuristic algorithm in MCAT software was an efficient tool in decision making about waste management systems and thus, it was suggested to municipality managers and regional planning authorities.

Groundwater vulnerability mapping using the modified DRASTIC model: the metaheuristic algorithm approach

Vulnerability assessment and mapping is a significant tool for sustainable management of the precious natural groundwater resources. DRASTIC is an extensively used index model to map groundwater vulnerable zones. However, the original DRASTIC model rates and weights used in most of the research depict the poor correlation between nitrate concentration and groundwater vulnerability index. Wilcoxon test and five population-based metaheuristic (MH) algorithms, namely, firefly algorithm (FA), invasive weed optimization (IWO), teaching learning-based optimization (TLBO), shuffled frog leaping algorithm (SFLA), and particle swarm optimization (PSO), were used to optimize the rates and weights of the DRASTIC model to improve its accuracy. The performance of all the employed metaheuristic algorithms converges to a global optimal solution at different iterations, and to choose the best algorithm for DRASTIC weights optimization, a ranking methodology was proposed. The algorithms were ranked by calculating the relative closeness of alternatives with computational speed and the number of iterations as attributes in the TOPSIS method. This study identifies FA as the outperforming algorithm among the employed for this specified weight optimization problem based on ranking. The result of the optimization model proposed depicts significant improvement in the correlation coefficient between the groundwater vulnerability index and nitrate concentration from 0.0545 for the original DRASTIC model to 0.7247 for the Wilcoxon-MH- DRASTIC. Hence, this ranking approach can be adopted when global optimal solution is found by all employed algorithms in DRASTIC weight optimization.

A systematic review of emerging feature selection optimization methods for optimal text classification: the present state and prospective opportunities

Specialized data preparation techniques, ranging from data cleaning, outlier detection, missing value imputation, feature selection (FS), amongst others, are procedures required to get the most out of data and, consequently, get the optimal performance of predictive models for classification tasks. FS is a vital and indispensable technique that enables the model to perform faster, eliminate noisy data, remove redundancy, reduce overfitting, improve precision and increase generalization on testing data. While conventional FS techniques have been leveraged for classification tasks in the past few decades, they fail to optimally reduce the high dimensionality of the feature space of texts, thus breeding inefficient predictive models. Emerging technologies such as the metaheuristics and hyper-heuristics optimization methods provide a new paradigm for FS due to their efficiency in improving the accuracy of classification, computational demands, storage, as well as functioning seamlessly in solving complex optimization problems with less time. However, little details are known on best practices for case-to-case usage of emerging FS methods. The literature continues to be engulfed with clear and unclear findings in leveraging effective methods, which, if not performed accurately, alters precision, real-world-use feasibility, and the predictive model's overall performance. This paper reviews the present state of FS with respect to metaheuristics and hyper-heuristic methods. Through a systematic literature review of over 200 articles, we set out the most recent findings and trends to enlighten analysts, practitioners and researchers in the field of data analytics seeking clarity in understanding and implementing effective FS optimization methods for improved text classification tasks.

A new clustering method for the diagnosis of CoVID19 using medical images

With the spread of COVID-19, there is an urgent need for a fast and reliable diagnostic aid. For the same, literature has witnessed that medical imaging plays a vital role, and tools using supervised methods have promising results. However, the limited size of medical images for diagnosis of CoVID19 may impact the generalization of such supervised methods. To alleviate this, a new clustering method is presented. In this method, a novel variant of a gravitational search algorithm is employed for obtaining optimal clusters. To validate the performance of the proposed variant, a comparative analysis among recent metaheuristic algorithms is conducted. The experimental study includes two sets of benchmark functions, namely standard functions and CEC2013 functions, belonging to different categories such as unimodal, multimodal, and unconstrained optimization functions. The performance comparison is evaluated and statistically validated in terms of mean fitness value, Friedman test, and box-plot. Further, the presented clustering method tested against three different types of publicly available CoVID19 medical images, namely X-ray, CT scan, and Ultrasound images. Experiments demonstrate that the proposed method is comparatively outperforming in terms of accuracy, precision, sensitivity, specificity, and F1-score.

Generator Maintenance Scheduling using Exchange Market Algorithm

The Generator Maintenance Schedule model is formulated mathematically as a highly constrained combinatorial optimization problem and it is obligatory to implement a suitable optimization tool to determine the best feasible maintenance schedule. The maintenance schedule obtained has to meet a number of power system constraints. There is increased research in the development of approximate solution methodologies such as heuristic and meta-heuristic techniques [1]. Unlike mathematical methods, metaheuristics can obtain an optimal solution to a complex problem fast and are not subjected to limitations such as linearity, continuity, differentiability and convexity that are faced by mathematical programs [2]. This work presents the application of Exchange Market Algorithm (EMA) to find an optimal maintenance schedule. The algorithm is customized to achieve the following:•

Selecting the initial population within the maintenance window constraint to enable faster convergence.

•

Adapt the algorithm to give discrete solutions.

•

Penalty function included for constraint handling.

Genetic and firefly metaheuristic algorithms for an optimized neuro-fuzzy prediction modeling of wildfire probability

In the terrestrial ecosystems, perennial challenges of increased frequency and intensity of wildfires are exacerbated by climate change and unplanned human activities. Development of robust management and suppression plans requires accurate estimates of future burn probabilities. This study describes the development and validation of two hybrid intelligence predictive models that rely on an adaptive neuro-fuzzy inference system (ANFIS) and two metaheuristic optimization algorithms, i.e., genetic algorithm (GA) and firefly algorithm (FA), for the spatially explicit prediction of wildfire probabilities. A suite of ten explanatory variables (altitude, slope, aspect, land use, rainfall, soil order, temperature, wind effect, and distance to roads and human settlements) was investigated and a spatial database constructed using 32 fire events from the Zagros ecoregion (Iran). The frequency ratio model was used to assign weights to each class of variables that depended on the strength of the spatial association between each class and the probability of wildfire occurrence. The weights were then used for training the ANFIS-GA and ANFIS-FA hybrid models. The models were validated using the ROC-AUC method that indicated that the ANFIS-GA model performed better (AUC_successrate = 0.92; AUC_{predictionrate} = 0.91) than the ANFIS-FA model (AUC_successrate = 0.89; AUC_{predictionrate} = 0.88). The efficiency of these models was compared to a single ANFIS model and statistical analyses of paired comparisons revealed that the two meta-optimized predictive models significantly improved wildfire prediction accuracy compared to the single ANFIS model (AUC_successrate = 0.82; AUC_{predictionrate} = 0.78). We concluded that such predictive models may become valuable toolkits to effectively guide fire management plans and on-the-ground decisions on firefighting strategies.

Application of non-animal-inspired evolutionary algorithms to reservoir operation: an overview

Evolutionary algorithms (EAs) have been widely used to search for optimal strategies for the planning and management of water resources systems, particularly reservoir operation. This study provides a comprehensive diagnostic assessment of state of the art of the non-animal-inspired EA applications to reservoir optimization. This type of EAs does not mimic biologic traits and group strategies of animal (wild) species. A search of pertinent papers was applied to the journal citation reports (JCRs). A bibliometric survey identified 14 pertinent non-animal-inspired EAs, such as the genetic algorithm (GA), simulated annealing (SA), and differential evolution (DE) algorithms, most of which have a number of modified versions. The characteristics of non-animal-inspired EAs and their modified versions were discussed to identify the difference between EAs and how each EA was improved. Additionally, the type of application of non-animal-inspired EAs to different case studies was investigated, and comparisons were made between the performance of the applied EAs in the studied literature. The survey revealed that the GA is the most frequently applied algorithm, followed by the DE algorithm. Non-animal-inspired EAs are superior to the classical methods of reservoir optimization (e.g., the non-linear programming and dynamic programming) due to faster convergence, diverse solution space, and efficient objective function evaluation. Several non-animal-inspired EAs of recent vintage have been shown to outperform the classic GA, which was the first evolutionary algorithm applied to reservoir operation.

Predictive control of intersegmental tarsal movements in an insect

In many animals intersegmental reflexes are important for postural and movement control but are still poorly undesrtood. Mathematical methods can be used to model the responses to stimulation, and thus go beyond a simple description of responses to specific inputs. Here we analyse an intersegmental reflex of the foot (tarsus) of the locust hind leg, which raises the tarsus when the tibia is flexed and depresses it when the tibia is extended. A novel method is described to measure and quantify the intersegmental responses of the tarsus to a stimulus to the femoro-tibial chordotonal organ. An Artificial Neural Network, the Time Delay Neural Network, was applied to understand the properties and dynamics of the reflex responses. The aim of this study was twofold: first to develop an accurate method to record and analyse the movement of an appendage and second, to apply methods to model the responses using Artificial Neural Networks. The results show that Artificial Neural Networks provide accurate predictions of tarsal movement when trained with an average reflex response to Gaussian White Noise stimulation compared to linear models. Furthermore, the Artificial Neural Network model can predict the individual responses of each animal and responses to others inputs such as a sinusoid. A detailed understanding of such a reflex response could be included in the design of orthoses or functional electrical stimulation treatments to improve walking in patients with neurological disorders as well as the bio/inspired design of robots.

Improved system identification using artificial neural networks and analysis of individual differences in responses of an identified neuron

Mathematical modelling is used routinely to understand the coding properties and dynamics of responses of neurons and neural networks. Here we analyse the effectiveness of Artificial Neural Networks (ANNs) as a modelling tool for motor neuron responses. We used ANNs to model the synaptic responses of an identified motor neuron, the fast extensor motor neuron, of the desert locust in response to displacement of a sensory organ, the femoral chordotonal organ, which monitors movements of the tibia relative to the femur of the leg. The aim of the study was threefold: first to determine the potential value of ANNs as tools to model and investigate neural networks, second to understand the generalisation properties of ANNs across individuals and to different input signals and third, to understand individual differences in responses of an identified neuron. A metaheuristic algorithm was developed to design the ANN architectures. The performance of the models generated by the ANNs was compared with those generated through previous mathematical models of the same neuron. The results suggest that ANNs are significantly better than LNL and Wiener models in predicting specific neural responses to Gaussian White Noise, but not significantly different when tested with sinusoidal inputs. They are also able to predict responses of the same neuron in different individuals irrespective of which animal was used to develop the model, although notable differences between some individuals were evident.