Nature-inspired metaheuristics have been extensively investigated to solve challenging optimization problems. Particle Swarm Optimization (PSO) is one of the most famous nature-inspired algorithms owing to its simplicity and ability to be used in a wide range of applications. This paper presents an extended PSO variant, namely, Exponential Particle Swarm Optimization (ExPSO). To effectively explore the whole search space, the proposed algorithm divides the swarm population into three equal subpopulations and employs a new search strategy based on an exponential function (permitting particles to make leaps in the search space) and an adapted control of the velocity range of each particle (to balance the exploration and exploitation search phases). The leaping strategy is integrated into the velocity equation and a new linear decreasing cognitive parameter (including a dynamic inertia weight strategy) is integrated into the proposed method. The developed algorithm allows large jumps at the beginning of the search, and then small jumps for further improvements in specific regions of the solution search space. Our variant approach, ExPSO, has been intensively tested through a comparison with eight other well-known heuristic search algorithms, over 29 benchmark problems, and real optimization engineering problems. The Wilcoxon signed-rank test and Friedman rank have been applied to analyze the search performance of the algorithms. The comparisons and statistical results show that the exponential search strategy significantly contributes to the search process and proves the superiority of ExPSO in terms of the convergence velocity and optimization accuracy.

Epilepsy is characterized by recurring seizures that result from abnormal electrical activity in the brain. These seizures manifest as various symptoms including muscle contractions and loss of consciousness. The challenging task of detecting epileptic seizures involves classifying electroencephalography (EEG) signals into ictal (seizure) and interictal (non-seizure) classes. This classification is crucial because it distinguishes between the states of seizure and seizure-free periods in patients with epilepsy. Our study presents an innovative approach for detecting seizures and neurological diseases using EEG signals by leveraging graph neural networks. This method effectively addresses EEG data processing challenges. We construct a graph representation of EEG signals by extracting features such as frequency-based, statistical-based, and Daubechies wavelet transform features. This graph representation allows for potential differentiation between seizure and non-seizure signals through visual inspection of the extracted features. To enhance seizure detection accuracy, we employ two models: one combining a graph convolutional network (GCN) with long short-term memory (LSTM) and the other combining a GCN with balanced random forest (BRF). Our experimental results reveal that both models significantly improve seizure detection accuracy, surpassing previous methods. Despite simplifying our approach by reducing channels, our research reveals a consistent performance, showing a significant advancement in neurodegenerative disease detection. Our models accurately identify seizures in EEG signals, underscoring the potential of graph neural networks. The streamlined method not only maintains effectiveness with fewer channels but also offers a visually distinguishable approach for discerning seizure classes. This research opens avenues for EEG analysis, emphasizing the impact of graph representations in advancing our understanding of neurodegenerative diseases.

Simultaneous allocation of service times and buffer capacities in manufacturing systems in a random environment is a NP-hard combinatorial optimisation problem. This paper presents a sophisticated simulation-based optimisation approach for the design of unreliable production lines to maximise the production rate. The proposed method allows for a global search using a Genetic Algorithm (GA), which is coupled with Finite Perturbation Analysis (FPA) as a local search technique. Traditional techniques based on perturbation analysis optimise decision variables of the same nature (e.g. service time only, buffer capacity only), whereas the proposed technique simultaneously provides an allocation of service times and buffer capacities. One of the main focuses of this paper is the investigation of the persistence or absence of the buffer and service rate allocation patterns which are among the most essential insights that come from designing production lines. The results show the superiority of the combined GA-FPA approach regarding GA and FPA in terms of solution quality and convergence behaviour. Moreover, considering instances ranging from 3 to 100 machines, our numerical experiments are in line with the literature for small instances (as similar allocation patterns are identified in our work), but important differences are highlighted for medium/large instances.

This paper presents the Progressive Moving Average Transform (PMAT), a novel signal transformation method for converting time-domain signals into 2D representations by progressively computing Moving Averages (MAs) with varying window sizes. The approach aims to enhance signal analysis and classification, particularly in the context of heartbeat classification. Our approach integrates PMAT with a 2D-Convolutional Neural Network (CNN) model for the classification of ECG heartbeat signals. The 2D-CNN model is employed to extract meaningful features from the transformed 2D representations and classify them efficiently. To assess the effectiveness of our approach, we conducted extensive simulations utilizing three widely-used databases: the MIT-BIH database and the INCART database, chosen to cover a wide range of heartbeats. Our experiments involved classifying more than 6 heartbeat types grouped into three main classes. Results indicate high accuracy and F1-scores, with 99.09% accuracy and 92.13% F1-score for MIT-BIH, and 98.37% accuracy and 79.37% F1-score for INCART. Notably, the method demonstrates robustness when trained on one database and tested on another, achieving accuracy rates exceeding 95% in both cases. Specifically, the method achieves 96% accuracy when trained on MIT-BIH and tested on the ST-T European database. These findings underscore the effectiveness and stability of the proposed approach in accurately classifying heartbeats across different datasets, suggesting its potential for practical implementation in medical diagnostics and healthcare systems.

In machine learning, an informative dataset is crucial for accurate predictions. However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. To tackle this challenge, the Bird’s Eye View (BEV) feature selection technique is introduced. This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. The proposed strategy in this paper leads to improved classification performance and a reduced number of features compared to conventional methods, as demonstrated by outperforming state-of-the-art feature selection techniques across multiple benchmark datasets.