Your search

Modeling lipase activity aids researchers in optimizing features such as temperature, pH, and substrate concentration to boost enzyme performance. This is essential in biotechnology for progressing the productivity and yield of processes such as fermentation, biodiesel production, and bioremediation. Fermentation is a highly complex, multivariable, and non-linear biotechnological process that produces bioactive materials. This study leverages artificial neural networks (ANN) to predict lipase activity in batch fermentation processes, addressing the inherent challenges in weight learning optimization often encountered with traditional algorithms like Backpropagation (BP). Several metaheuristic algorithms were employed to optimize the Multilayered Perceptron (MLP) structure and weights, including moth-frequency optimization (MFO), Particle Swarm Optimization (PSO), Dandelion Optimizer Algorithm (DO), Crow Search Algorithm (CSA), and Salp Swarm Algorithm (SSA) to overcome these limitations. Among the tested algorithms, MFO emerged as the most effective approach, achieving superior performance in weight learning with the best fitness value (i.e., mean square error (MSE)) of 0.6006. MFO-optimized ANN models deliver the most accurate predictions for lipase activity, highlighting their potential as a powerful tool for advancing industrial fermentation process optimization. © 2025 IEEE.

Economic load dispatch (ELD) is a challenge optimization problem to minimize the total cost of the thermally generated power that satisfies a set of equality and inequality constraints. We need to maximize the power network load under several operational constraints to solve this problem. Meanwhile, we need to minimize the cost of power generation and minimize the loss in the network transmission. Traditional optimization methods were used to solve such problems as linear programming. Meta-heuristic search algorithms have shown encouraging performance in solving various real-life engineering problems. This paper attempts to provide a comprehensive comparison between nine meta-heuristic search algorithms, including Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Crow Search Algorithm (CSA), Differential Evolution (DE), Salp Swarm Algorithm (SSA), Harmony Search (HS), Sine Cosine Algorithm (SCA), Multi-Verse Optimizer (MVO), and Moth-Flame Optimization Algorithm (MFO) for solving the economic load dispatch problem. Our developed results demonstrated that meta-heuristics search algorithms (i.e., CSA and DE) offer the optimal power set for each power station. These computed power fulfill the supply needs and maintain both minimum power costs and power losses in power transmission.

Roads should always be in a reliable con-dition and maintained regularly. One of the problems that should be maintained well is the pavement cracks problem. This a challenging problem that faces road engineers, since maintaining roads in a stable condition is needed for both drivers and pedestrians. Many meth-ods have been proposed to handle this problem to save time and cost. In this paper, we proposed a two-stage method to detect pavement cracks based on Principal Component Analysis (PCA) and Convolutional Neural Network (CNN) to solve this classification problem. We employed a Principal Component Analysis (PCA) method to extract the most significant features with a di˙erent number of PCA components. The proposed approach was trained using a Mendeley Asphalt Crack dataset, which contains 400 images of road cracks with a 480×480 resolution. The obtained results show how PCA helped in speeding up the learning process of CNN.

Image reconstruction for industrial applications based on Electrical Capacitance Tomography (ECT) has been broadly applied. The goal of image reconstruction based ECT is to locate the distribution of permittivity for the dielectric substances along the cross-section based on the collected capacitance data. In the ECT-based image reconstruction process: (1) the relationship between capacitance measurements and permittivity distribution is nonlinear, (2) the capacitance measurements collected during image reconstruction are inadequate due to the limited number of electrodes, and (3) the reconstruction process is subject to noise leading to an ill-posed problem. Thence, constructing an accurate algorithm for real images is critical to overcoming such restrictions. This paper presents novel image reconstruction methods using Deep Learning for solving the forward and inverse problems of the ECT system for generating high-quality images of conductive materials in the Lost Foam Casting (LFC) process. Here, Long Short-Term Memory Recurrent Neural Network (LSTM-RNN) models were implemented to predict the distribution of metal filling for the LFC process-based ECT. The recurrent connection and the gating mechanism of the LSTM is capable of extracting the contextual information that is repeatedly passing through the neural network while filtering out the noise caused by adverse factors. Experimental results showed that the presented ECT-LSTM-RNN model is highly reliable for industrial applications and can be utilized for other manufacturing processes. © 2013 IEEE.

In this study, we conducted experiments to model the temperature of two manufacturing processes using various metaheuristic search algorithms. The two processes adopted were the P05 horny steel tool and the AISI304 stainless steel castings machines. Our approach involves building a data-driven model, as traditional search methods for modeling manufac-turing problems often need help finding the global optimum when faced with a complex objective function and numerous decision variables. Bio-inspired metaheuristic search algorithms have shown promising performance in handling multi-model optimization functions, and efficiently exploring the search space to attain more global results. We applied several metaheuristic search algorithms to find the optimal tuning parameters of a temperature-based model. The results from the case studies demonstrate that Particle Swarm Optimization (PSO) provided the best performance in tuning model parameters, resulting in minimum modeling error.

Establishing an optimal datacenter selection policy within the cloud environment is paramount to maximize the performance of the cloud services. Service broker policy governs the selection of datacenters for user requests. In our research, we introduce an innovative approach incorporating the genetic algorithm with service broker policy to assist cloud services in identifying the most suitable datacenters for specific userbases. The effectiveness of our proposed genetic algorithm was rigorously evaluated through experiments conducted on CloudAnalyst platform. The results clearly indicate that our proposed algorithm surpasses existing service broker policies and previous research works done in this field in terms of reducing response time and data processing time. The results analysis validates its efficacy and potential for enhancing cloud service performance and reducing the cost of overall cloud infrastructure.

Meta-heuristic search algorithms were successfully used to solve a variety of problems in engineering, science, business, and finance. Meta-heuristic algorithms share common features since they are population-based approaches that use a set of tuning parameters to evolve new solutions based on the natural behavior of creatures. In this paper, we present a novel nature-inspired search optimization algorithm called the capuchin search algorithm (CapSA) for solving constrained and global optimization problems. The key inspiration of CapSA is the dynamic behavior of capuchin monkeys.The basic optimization characteristics of this new algorithm are designed by modeling the social actions of capuchins during wandering and foraging over trees and riverbanks in forests while searching for food sources. Some of the common behaviors of capuchins during foraging that are implemented in this algorithm are leaping, swinging, and climbing. Jumping is an effective mechanism used by capuchins to jump from tree to tree. The other foraging mechanisms exercised by capuchins, known as swinging and climbing, allow the capuchins to move small distances over trees, tree branches, and the extremities of the tree branches. These locomotion mechanisms eventually lead to feasible solutions of global optimization problems. The proposed algorithm is benchmarked on 23 well-known benchmark functions, as well as solving several challenging and computationally costly engineering problems. A broad comparative study is conducted to demonstrate the efficacy of CapSA over several prominent meta-heuristic algorithms in terms of optimization precision and statistical test analysis. Overall results show that CapSA renders more precise solutions with a high convergence rate compared to competitive meta-heuristic methods. © 2020, Springer-Verlag London Ltd., part of Springer Nature.

Ozone is a toxic gas with massive distinct chemical components from oxygen. Breathing ozone in the air can cause severe effects on human health, especially people who have asthma. It can cause long-lasting damage to the lungs and heart attacks and might lead to death. Forecasting the ozone concentration levels and related pollutant attribute is critical for developing sophisticated environment safety policies. In this paper, we present three artificial neural network (ANN) models to forecast the daily ozone (O3), coarse particulate matter (PM10), and particulate matter (PM2.5) concentrations in a highly polluted city in the Republic of China. The proposed models are (1) recurrent multilayer perceptron (RMLP), (2) recurrent fuzzy neural network (RFNN), and (3) hybridization of RFNN and grey wolf optimizer (GWO), which are referred to as RMLP-ANN, RFNN, and RFNN-GWO models, respectively. The performance of the proposed models is compared with other conventional models previously reported in the literature. The comparative results showed that the proposed models presented outstanding performance. The RFNN-GWO model revealed superior results in the modeling of O3, PM10, and PM2.5 compared with the RMLP-ANN and RFNN models. © 2020, Springer Nature B.V.

The rapid growth of technology has brought about many advantages, but has also made networks more susceptible to security threats. Intrusion Detection Systems (IDS) play a vital role in protecting computer networks against malicious activities. Given the dynamic and constantly evolving nature of cyber threats, these systems must continuously adapt to maintain their effectiveness. Machine Learning (ML) methods have gained prominence as effective tools for constructing IDS that offer both high accuracy and efficiency. This study conducts a performance assessment of several machine learning classifiers, including Random Forests (RF), Decision Trees (DT), and Support Vector Machines (SVM), in addressing multiclass intrusion detection as a means to counter cybersecurity threats. The NSL-KDD dataset, which includes various network attacks, served as the basis for our experimental evaluation. The research explores two classification scenarios: a five-class and a three-class model, analyzing their impact on detection performance. The results demonstrate that RF consistently achieves the highest accuracy (85.42%) on the three-class scenario testing set, highlighting its effectiveness in handling patterns and non-linear relationships within the intrusion data. Furthermore, reducing the classification complexity (three classes vs. five classes) significantly improves model generalization, as evidenced by the reduced performance gap between training and testing data. Friedman’s rank test and Holm’s post-hoc analysis were applied to ensure statistical rigor, confirming that RF outperforms DT and SVM in all evaluation metrics. These findings establish RF as the most robust classifier for intrusion detection and underscore the importance of simplifying classification tasks for improved IDS performance. © (2025), (Science Publications). All rights reserved.

Obstructive sleep apnea syndrome (OSAS) is a pervasive disorder with an incidence estimated at 5–14 percent among adults aged 30–70 years. It carries significant morbidity and mortality risk from cardiovascular disease, including ischemic heart disease, atrial fibrillation, and cerebrovascular disease, and risks related to excessive daytime sleepiness. The gold standard for diagnosis of OSAS is the polysomnography (PSG) test which requires overnight evaluation in a sleep laboratory and expensive infrastructure, which renders it unsuitable for mass screening and diagnosis. Alternatives such as home sleep testing need patients to wear diagnostic instruments overnight, but accuracy continues to be suboptimal while access continues to be a barrier for many. Hence, there is a continued significant underdiagnosis and under-recognition of sleep apnea in the community, with at least one study suggesting that 80–90% of middle-aged adults with moderate to severe sleep apnea remain undiagnosed. Recently, we have seen a surge in applications of artificial intelligence and neural networks in healthcare diagnostics. Several studies have attempted to examine its application in the diagnosis of OSAS. Signals included in data analytics include Electrocardiogram (ECG), photo-pletysmography (PPG), peripheral oxygen saturation (SpO2), and audio signals. A different approach is to study the application of machine learning to use demographic and standard clinical variables and physical findings to try and synthesize predictive models with high accuracy in assisting in the triage of high-risk patients for sleep testing. The current paper will review this latter approach and identify knowledge gaps that may serve as potential avenues for future research.

Identification of the optimal subset of features for Feature Selection (FS) problems is a demanding problem in machine learning and data mining. A trustworthy optimization approach is required to cope with the concerns involved in such a problem. Here, a Binary version of the Capuchin Search Algorithm (CSA), referred to as BCSA, was developed to select the optimal feature combination. Owing to the imbalance of parameters and random nature of BCSA, it may sometimes fall into the trap of an issue called local maxima. To beat this problem, the BCSA could be further improved with the resettlement of its individuals by adopting some methods of repopulating the individuals during foraging. Lévy flight was applied to augment the exploitation and exploration abilities of BCSA, a method referred to as LBCSA. A Chaotic strategy is used to reinforce search behavior for both exploration and exploitation potentials of BCSA, which is referred to as CBCSA. Finally, Lévy flight and chaotic sequence are integrated with BCSA, referred to as LCBCSA, to increase solution diversity and boost the openings of finding the global optimal solutions. The proposed methods were assessed on twenty-six datasets collected from the UCI repository. The results of these methods were compared with those of other FS methods. Overall results show that the proposed methods render more precise solutions in terms of accuracy rates and fitness scores than other methods.

This paper introduces an enhanced version of the Capuchin Search Algorithm (CapSA) called ECapSA. CapSA draws inspiration from the collective intelligence of Capuchin monkeys and has shown success in solving real-world problems. However, it may encounter challenges handling complex optimization tasks, such as premature convergence or being trapped in local optima. ECapSA employs a local escaping mechanism operating the abandonment limit concept to exploit potential solutions and introduce diversification trends. Additionally, the ECapSA algorithm is improved by integrating the principles of the cooperative island model, resulting in the iECapSA. This modification enables better management of population diversity and a more optimal balance between exploration and exploitation. The efficiency of iECapSA is validated through a series of experiments, including the IEEE-CEC2014 benchmark functions and training the feedforward neural network (FNN) on seven biomedical datasets. The performance of iECapSA is compared to other metaheuristic techniques, namely differential evolution (DE), sine cosine algorithm (SCA), and whale optimization algorithm (WOA). The results of the comparative study demonstrate that iECapSA is a strong contender and surpasses other training algorithms in most datasets, particularly in terms of its ability to avoid local optima and its improved convergence speed.

The Crow Search Algorithm (CSA) is a swarm-based metaheuristic algorithm that simulates the intelligent foraging behaviors of crows. While CSA effectively handles global optimization problems, it suffers from certain limitations, such as low search accuracy and a tendency to converge to local optima. To address these shortcomings, researchers have proposed modifications and enhancements to CSA’s search mechanism. One widely explored approach is the structured population mechanism, which maintains diversity during the search process to mitigate premature convergence. The island model, a common structured population method, divides the population into smaller independent sub-populations called islands, each running in parallel. Migration, the primary technique for promoting population diversity, facilitates the exchange of relevant and useful information between islands during iterations. This paper introduces an enhanced variant of CSA, called Enhanced CSA (ECSA), which incorporates the cooperative island model (iECSA) to improve its search capabilities and avoid premature convergence. The proposed iECSA incorporates two enhancements to CSA. Firstly, an adaptive tournament-based selection mechanism is employed to choose the guided solution. Secondly, the basic random movement in CSA is replaced with a modified operator to enhance exploration. The performance of iECSA is evaluated on 53 real-valued mathematical problems, including 23 classical benchmark functions and 30 IEEE-CEC2014 benchmark functions. A sensitivity analysis of key iECSA parameters is conducted to understand their impact on convergence and diversity. The efficacy of iECSA is validated by conducting an extensive evaluation against a comprehensive set of well-established and recently introduced meta-heuristic algorithms, encompassing a total of seventeen different algorithms. Significant differences among these comparative algorithms are established utilizing statistical tests like Wilcoxon’s rank-sum and Friedman’s tests. Experimental results demonstrate that iECSA outperforms the fundamental ECSA algorithm on 82.6% of standard test functions, providing more accurate and reliable outcomes compared to other CSA variants. Furthermore, Extensive experimentation consistently showcases that the iECSA outperforms its comparable algorithms across a diverse set of benchmark functions.

The performance of any meta-heuristic algorithm depends highly on the setting of dependent parameters of the algorithm. Different parameter settings for an algorithm may lead to different outcomes. An optimal parameter setting should support the algorithm to achieve a convincing level of performance or optimality in solving a range of optimization problems. This paper presents a novel enhancement method for the salp swarm algorithm (SSA), referred to as enhanced SSA (ESSA). In this ESSA, the following enhancements are proposed: First, a new position updating process was proposed. Second, a new dominant parameter different from that used in SSA was presented in ESSA. Third, a novel lifetime convergence method for tuning the dominant parameter of ESSA using ESSA itself was presented to enhance the convergence performance of ESSA. These enhancements to SSA were proposed in ESSA to augment its exploration and exploitation capabilities to achieve optimal global solutions, in which the dominant parameter of ESSA is updated iteratively through the evolutionary process of ESSA so that the positions of the search agents of ESSA are updated accordingly. These improvements on SSA through ESSA support it to avoid premature convergence and efficiently find the global optimum solution for many real-world optimization problems. The efficiency of ESSA was verified by testing it on several basic benchmark test functions. A comparative performance analysis between ESSA and other meta-heuristic algorithms was performed. Statistical test methods have evidenced the significance of the results obtained by ESSA. The efficacy of ESSA in solving real-world problems and applications is also demonstrated with five well-known engineering design problems and two real industrial problems. The comparative results show that ESSA imparts better performance and convergence than SSA and other meta-heuristic algorithms.

Sleep apnea is a sleeping disorder affecting more than 20 % of all American adults, associated with intermittent air passageway obstruction during sleep. This results in intermittent hypoxia, sympathetic activation, and an interruption of sleep with various health consequences. The diagnosis of sleep apnea traditionally involves the performance of overnight polysomnography, where oxygen, heart rate, and breathing, among other physiologic variables, are continuously monitored during sleep at a sleep center. However, these sleep studies are expensive and impose access issues, given the number of patients who need to be diagnosed. There is hence utility in having an effective triage system to screen for OSA to utilize polysomnography better. In this study, we plan to explore using several machine learning algorithms to utilize pre-screening symptoms to diagnose obstructive sleep apnea (OSA). Per our experimental results, it was found that Decision Tree Classifier (DTC) and Random Forest (RF) provided the highest classification accuracies compared to other algorithms such as Logistic Regression (LR), Support Vector Machines (SVM), Gradient Boosting Classifier (GBC), Gaussian Naive Bayes (GNB), K Neighbors Classifier (KNC), and Artificial Neural Networks (ANN).

Over recent decades, research in Artificial Intelligence (AI) has developed a broad range of approaches and methods that can be utilized or adapted to address complex optimization problems. As real-world problems get increasingly complicated, this requires an effective optimization method. Various meta-heuristic algorithms have been developed and applied in the optimization domain. This paper used and ameliorated a promising meta-heuristic approach named Crow Search Algorithm (CSA) to address numerical optimization problems. Although CSA can efficiently optimize many problems, it needs more searchability and early convergence. Its positioning updating process was improved by supporting two adaptive parameters: flight length (fl) and awareness probability (AP) to tackle these curbs. This is to manage the exploration and exploitation conducts of CSA in the search space. This process takes advantage of the randomization of crows in CSA and the adoption of well-known growth functions. These functions were recognized as exponential, power, and S-shaped functions to develop three different improved versions of CSA, referred to as Exponential CSA (ECSA), Power CSA (PCSA), and S-shaped CSA (SCSA). In each of these variants, two different functions were used to amend the values of fl and AP. A new dominant parameter was added to the positioning updating process of these algorithms to enhance exploration and exploitation behaviors further. The reliability of the proposed algorithms was evaluated on 67 benchmark functions, and their performance was quantified using relevant assessment criteria. The functionality of these algorithms was illustrated by tackling four engineering design problems. A comparative study was made to explore the efficacy of the proposed algorithms over the standard one and other methods. Overall results showed that ECSA, PCSA, and SCSA have convincing merits with superior performance compared to the others.

The goal of the ambient intelligence system is not only to enhance the way people communicate with the surrounding environment but also to advance safety measures and enrich human lives. In this paper, we introduce an integrated ambient intelligence system (IAmIS) to perceive the presence of people, identify them, determine their locations, and provide suitable interaction with them. The proposed framework can be applied in various application domains such as a smart house, authorisation, surveillance, crime prevention, and many others. The proposed system has five components: body detection and tracking, face recognition, controller, monitor system, and interaction modules. The system deploys RGB cameras and Kinect depth sensors to monitor human activity. The developed system is designed to be fast and reliable for indoor environments. The proposed IAmIS can interact directly with the environment or communicate with humans acting on the environment. Thus, the system behaves as an intelligent agent. The system has been deployed in our research lab and can recognise lab members and guests to the lab as well as track their movements and have interactions with them depending upon their identity and location within the lab.

Barcode-less fruit recognition technology has revolutionized the checkout process by eliminating manual barcode scanning. This technology automatically identifies and adds fruit items to the purchase list, significantly reducing waiting times at the cash register. Faster checkouts enhance customer convenience and optimize operational efficiency for retailers. Adding barcode to fruits require using adhesives on the fruit surface that may cause health hazards. Leveraging deep learning techniques for barcode-less fruit recognition brings valuable advantages to industries, including advanced automation, enhanced accuracy, and increased efficiency. These benefits translate into improved productivity, cost reduction, and superior quality control. This study introduces a Convolutional Neural Network (CNN) designed explicitly for automatic fruit recognition, even in challenging real-world scenarios. The proposed method assists fruit sellers in accurately identifying and distinguishing between different types of fruit that may exhibit similarities. A dataset that includes 44,406 images of different fruit types is used to train and test our technique. Employing a CNN, the developed model achieves an impressive classification accuracy of 97.4% during the training phase and 88.6% during the testing phase respectively, showcasing its effectiveness in precise fruit recognition.

Data classification is a challenging problem. Data classification is very sensitive to the noise and high dimensionality of the data. Being able to reduce the model complexity can help to improve the accuracy of the classification model performance. Therefore, in this research, we propose a novel feature selection technique based on Binary Harris Hawks Optimizer with Time-Varying Scheme (BHHO-TVS). The proposed BHHO-TVS adopts a time-varying transfer function that is applied to leverage the influence of the location vector to balance the exploration and exploitation power of the HHO. Eighteen well-known datasets provided by the UCI repository were utilized to show the significance of the proposed approach. The reported results show that BHHO-TVS outperforms BHHO with traditional binarization schemes as well as other binary feature selection methods such as binary gravitational search algorithm (BGSA), binary particle swarm optimization (BPSO), binary bat algorithm (BBA), binary whale optimization algorithm (BWOA), and binary salp swarm algorithm (BSSA). Compared with other similar feature selection approaches introduced in previous studies, the proposed method achieves the best accuracy rates on 67% of datasets.