ABSTRACT In this paper, the improved chameleon swarm algorithm (ICSA) enhances the exploration–exploitation balance while optimizing feature subset selection. The integration of Lévy flight‐based exploration refines ICSA's search strategy, complemented by rotation‐type refinement and adaptive parameter‐setting mechanisms. These modifications ensure that exploration aligns effectively with the feature selection process, leading to a more adaptive and efficient approach. To evaluate ICSA's effectiveness, it is tested on the NSL‐KDD benchmark, a well‐established dataset in intrusion detection systems. Performance is assessed based on key metrics, including accuracy, detection rate, false alarm rate, execution time, and the number of selected features. Comparative analysis against six advanced classifiers demonstrates that ICSA achieves superior results with minimal computational overhead. The algorithm attains the highest accuracy (97.91%) and detection rate (98.75%), the fastest execution time, and the lowest false alarm rate (0.0021), eliminating the need for excessive feature selection. These results confirm that modifying feature selection mechanisms within ICSA significantly enhances computational efficiency and detection performance, as validated through rigorous experimental testing at the classifier level.

This paper reviews the application of metaheuristics for optimized sustainable supply chain management (SSCM). This paper explores the potential of metaheuristics to improve the supply chain’s sustainability while enhancing its efficiency and competitiveness. The paper provides an overview of the principles of SSCM and the challenges businesses face in achieving sustainable supply chain management. It then introduces the concept of metaheuristics and describes their use in solving complex optimization problems. The paper reviews various metaheuristics algorithms applied to sustainable supply chain management and analyzes their effectiveness in addressing the challenges of SSCM. The paper also identifies the key factors that influence the success of using metaheuristics for SSCM, such as the choice of algorithm, problem complexity, and data quality. Finally, the paper provides recommendations for future research in this area and highlights the potential of metaheuristics to promote sustainable supply chain management. The review suggests that metaheuristics can be a valuable tool for optimizing sustainable supply chain management and improving supply chain operations’ sustainability, efficiency, and competitiveness.

COVID-19 is the disease evoked by a new breed of coronavirus called the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Recently, COVID-19 has become a pandemic by infecting more than 152 million people in over 216 countries and territories. The exponential increase in the number of infections has rendered traditional diagnosis techniques inefficient. Therefore, many researchers have developed several intelligent techniques, such as deep learning (DL) and machine learning (ML), which can assist the healthcare sector in providing quick and precise COVID-19 diagnosis. Therefore, this paper provides a comprehensive review of the most recent DL and ML techniques for COVID-19 diagnosis. The studies are published from December 2019 until April 2021. In general, this paper includes more than 200 studies that have been carefully selected from several publishers, such as IEEE, Springer and Elsevier. We classify the research tracks into two categories: DL and ML and present COVID-19 public datasets established and extracted from different countries. The measures used to evaluate diagnosis methods are comparatively analysed and proper discussion is provided. In conclusion, for COVID-19 diagnosing and outbreak prediction, SVM is the most widely used machine learning mechanism, and CNN is the most widely used deep learning mechanism. Accuracy, sensitivity, and specificity are the most widely used measurements in previous studies. Finally, this review paper will guide the research community on the upcoming development of machine learning for COVID-19 and inspire their works for future development. This review paper will guide the research community on the upcoming development of ML and DL for COVID-19 and inspire their works for future development.

This work presents a novel system based on artificial immune system for spam detection. A relatively new machine learning method inspired by the human immune system called Artificial Immune System (AIS) has been emerging recently. This method is currently undergoing intense investigation and demonstration. Core modifications were applied on the standard AIS with the aid of the Genetic Algorithm (GA). SpamAssassin corpus is used in all our simulations. Spam is a serious universal problem which causes problems for almost all computer users. This issue affects not only normal users of the internet, but also causes problems for companies and organizations due to expensive costs in lost productivity, wasting users' time and network bandwidth. Many studies on spam indicate that it costs organizations billions of dollars annually. We introduce a GA assisted AIS in spam detection, and compare between two methods. Encouraging results were achieved when comparing to commercially available anti-spam software.

Many techniques and algorithms for automatic text categorization had been devised and proposed in the literature. However, there is still much space for researchers in this area to improve existing algorithms or come up with new techniques for text categorization (TC). Polynomial Networks (PNs) were never used before in TC. This can be attributed to the huge datasets used in TC, as well as the technique itself which has high computational demands. In this paper, we investigate and propose using PNs in TC. The proposed PN classifier has achieved a competitive classification performance in our experiments. More importantly, this high performance is achieved in one shot training (noniteratively) and using just 0.25%–0.5% of the corpora features. Experiments are conducted on the two benchmark datasets in TC: Reuters-21578 and the 20 Newsgroups. Five well-known classifiers are experimented on the same data and feature subsets: the state-of-the-art Support Vector Machines (SVM), Logistic Regression (LR), the k-nearest-neighbor (kNN), Naive Bayes (NB), and the Radial Basis Function (RBF) networks.

Many techniques have been reported for handwriting-based writer identification. None of these techniques assume that the written text is in Arabic. In this paper we present a new technique for feature extraction based on hybrid spectral–statistical measures (SSMs) of texture. We show its effectiveness compared with multiple-channel (Gabor) filters and the grey-level co-occurrence matrix (GLCM), which are well-known techniques yielding a high performance in writer identification in Roman handwriting. Texture features were extracted for wide range of frequency and orientation because of the nature of the spread of Arabic handwriting compared with Roman handwriting, and the most discriminant features were selected with a model for feature selection using hybrid support vector machine–genetic algorithm techniques. Four classification techniques were used: linear discriminant classifier (LDC), support vector machine (SVM), weighted Euclidean distance (WED), and the K nearest neighbours (K_NN) classifier. Experiments were performed using Arabic handwriting samples from 20 different people and very promising results of 90.0% correct identification were achieved.

A novel approach for trajectory planning of a mobile robot is presented. The mobile robot is assumed to move in a two-dimensional workspace with continuous input from the surrounding environment. The input is a signal that reflects the distance and position of an obstacle momentarily. The first part consists of using a neural network to direct the robot that moves from some initial point to a given target with constant speed. The neural network uses an original approach of hybrid instantaneous reinforcement learning in addition to a long-term backpropagation through time learning. Both techniques complement each other by providing online and offline learning. The second stage is to test the learned neural network with different obstacles than the ones used in learning. The neural network should be capable of discovering a strategy to steer the robot. The robot is assumed to move with constant speed and zero acceleration; consequently, the neural network output is just the direction of motion. Future work may include robot dynamics such that the output of the neural network will not only be a direction but also amount of motion.

Genetic Algorithms (GAs) and Evolutionary Programming (EP) are investigated here in both optimization and machine learning. Adaptive and standard versions of the two algorithms are used to solve novel applications in search and rule extraction. Simulations and analysis show that while both algorithms may look similar in many ways their performance may differ for some applications. Mathematical modeling helps in gaining better understanding for GA and EP applications. Proper tuning and loading is a key for acceptable results. The ability to instantly adapt within an unpredictable and unstable search or learning environment is the most important feature of evolution-based techniques such as GAs and EP.

This paper proposes a novel system for rule extraction of temporal control problems and presents a new way of designing neurocontrollers. The system employs a hybrid genetic search and reinforcement learning strategy for extracting the rules. The learning strategy requires no supervision and no reference model. The extracted rules are weighted micro rules that operate on small neighborhoods of the admissable control space. A further refinement of the extracted rules is achieved by applying additional genetic search and reinforcement to reduce the number of extracted micro rules. This process results in a smaller set of macro rules which can be used to train a feedforward multilayer perceptron neurocontroller. The micro rules or the macro rules may also be utilized directly in a table look-up controller. As an example of the macro rules-based neurocontroller, we chose four benchmarks. In the first application we verify the capability of our system to learn optimal linear control strategies. The other three applications involve engine idle speed control, bioreactor control, and stabilizing two poles on a moving cart. These problems are highly nonlinear, unstable, and may include noise and delays in the plant dynamics. In terms of retrievals; the neurocontrollers generally outperform the controllers using a table look-up method. Both controllers, though, show robustness against noise disturbances and plant parameter variations.