Search Results (299)

Images often suffer from various types of noise during their collection and transmission, such as salt-and-pepper, speckle, and Gaussian noise. The wavelet transform (WT) is widely utilized for denoising. However, the decomposition level and threshold significantly impact the quality of the resulting images, but they are difficult to set. This paper uses a modified whale optimization algorithm (MWOA) to optimize the parameters of the WT to achieve better image denoising. The MWOA is enhanced through position updates and mutation to improve the solution quality of WOA and enlarge the search space of the WT. In benchmark images, experimental comparisons with other optimization algorithms like WOA, adaptive cuckoo search (ACS), and social spider optimization (SSO) show that the proposed denoising method achieves superior results in terms of the peak signal-to-noise ratio (PSNR), mean square error (MSE), and structural similarity index (SSIM). Full article

This study evaluates and compares the computational performance and practical applicability of advanced path planning algorithms for Unmanned Aerial Vehicles (UAVs) in dynamic and obstacle-rich environments. The Adaptive Multi-Objective Path Planning (AMOPP) framework is highlighted for its ability to balance multiple objectives, including path length, smoothness, collision avoidance, and real-time responsiveness. Through experimental analysis, AMOPP demonstrates superior performance, with a 15% reduction in path length compared to A*, achieving an average path length of 450 m. Its angular deviation of 8.0° ensures smoother trajectories than traditional methods like Genetic Algorithm and Particle Swarm Optimization (PSO). Moreover, AMOPP achieves a 0% collision rate across all simulations, surpassing heuristic-based methods like Cuckoo Search and Bee Colony Optimization, which exhibit higher collision rates. Real-time responsiveness is another key strength of AMOPP, with an average re-planning time of 0.75 s, significantly outperforming A* and RRT*. The computational complexities of each algorithm are analyzed, with AMOPP exhibiting a time complexity of $O(k·n)$ and a space complexity of $O\left(n\right)$, ensuring scalability and efficiency for large-scale operations. The study also presents a comprehensive qualitative and quantitative comparison of 14 algorithms using 3D visualizations, highlighting their strengths, limitations, and suitable application scenarios. By integrating weighted optimization with penalty-based strategies and spline interpolation, AMOPP provides a robust solution for UAV path planning, particularly in scenarios requiring smooth navigation and adaptive re-planning. This work establishes AMOPP as a promising framework for real-time, efficient, and safe UAV operations in dynamic environments. Full article

Background: Alzheimer’s disease (AD) is a progressive neurological disorder that significantly affects middle-aged and elderly adults, leading to cognitive deterioration and hindering daily activities. Notwithstanding progress, conventional diagnostic techniques continue to be susceptible to inaccuracies and inefficiencies. Timely and precise diagnosis is essential for early intervention. Methods: We present an enhanced hybrid deep learning framework that amalgamates the EfficientNetV2B3 with Inception-ResNetV2 models. The models were integrated using an adaptive weight selection process informed by the Cuckoo Search optimization algorithm. The procedure commences with the pre-processing of neuroimaging data to guarantee quality and uniformity. Features are subsequently retrieved from the neuroimaging data by utilizing the EfficientNetV2B3 and Inception-ResNetV2 models. The Cuckoo Search algorithm allocates weights to various models dynamically, contingent upon their efficacy in particular diagnostic tasks. The framework achieves balanced usage of the distinct characteristics of both models through the iterative optimization of the weight configuration. This method improves classification accuracy, especially for early-stage Alzheimer’s disease. A thorough assessment was conducted on extensive neuroimaging datasets to verify the framework’s efficacy. Results: The framework attained a Scott’s Pi agreement score of 0.9907, indicating exceptional diagnostic accuracy and dependability, especially in identifying the early stages of Alzheimer’s disease. The results show its superiority over current state-of-the-art techniques.Conclusions: The results indicate the substantial potential of the proposed framework as a reliable and scalable instrument for the identification of Alzheimer’s disease. This method effectively mitigates the shortcomings of conventional diagnostic techniques and current deep learning algorithms by utilizing the complementing capabilities of EfficientNetV2B3 and Inception-ResNetV2 by using an optimized weight selection mechanism. The adaptive characteristics of the Cuckoo Search optimization facilitate its application across many diagnostic circumstances, hence extending its utility to a wider array of neuroimaging datasets. The capacity to accurately identify early-stage Alzheimer’s disease is essential for facilitating prompt therapies, which are crucial for decelerating disease development and enhancing patient outcomes. Full article

Precise positioning of sensors is critical for the performance of various applications in the Internet of Things and wireless sensor networks. The efficiency of these networks heavily depends on the precision of sensor node locations. Among various localization approaches, DV-Hop is highly recommended for its simplicity and robustness. However, despite its popularity, DV-Hop suffers from significant accuracy issues, primarily due to its reliance on average hop size for distance estimation. This limitation often results in substantial localization errors, compromising the overall network effectiveness. To address this gap, we developed an enhanced DV-Hop approach that integrates the cuckoo search algorithm (CS). Our solution improves the accuracy of node localization by introducing a normalized average hop size calculation and leveraging the optimization capabilities of CS. This hybrid approach refines the distance estimation process, significantly reducing the errors inherent in traditional DV-Hop. Findings from simulations reveal that the developed approach surpasses the accuracy of both the original DV-Hop and multiple other current localization methods, providing a more precise and reliable localization method for IoT and WSN applications. Full article

The focus of this study is to introduce a hybrid predictive framework encompassing different meta-heuristic optimization and machine learning techniques to identify the regions susceptible to snow avalanches. To accomplish this aim, the present research sought to acquire the best-performed model among nine different hybrid scenarios encompassing three different meta-heuristics, namely particle swarm optimization (PSO), gravitational search algorithm (GSA), and Cuckoo Search (CS), and three different ML approaches, i.e., support vector classification (SVC), stochastic gradient boosting (SGB), and k-nearest neighbors (KNN), pertaining to different predictive families. According to diligent analysis performed with regard to the blinded testing set, the PSO-SGB illustrated the most satisfactory predictive performance with an accuracy of 0.815, while the precision and recall were found to be 0.824 and 0.821, respectively. The F1-score of the predictions was found to be 0.821, and the area under the receiver operating curve (AUC) was obtained to be 0.9. Despite attaining similar predictive success via the CS-SGB model, the time-efficiency analysis underscored the PSO-SGB, as the corresponding process consumed considerably less computational time compared to its counterpart. The SHapley Additive exPlanations (SHAP) implementation further informed that slope, elevation, and wind speed are the most contributing attributes to detecting snow avalanche susceptibility in the French Alps. Full article

This study compares bio-inspired optimization algorithms for enhancing an ANN-based Maximum Power Point Tracking (MPPT) forecast system under partial shading conditions in photovoltaic systems. Four algorithms—grey wolf optimizer (GWO), particle swarm optimization (PSO), squirrel search algorithm (SSA), and cuckoo search (CS)—were evaluated, with the dataset augmented by perturbations to simulate shading. The standard ANN performed poorly, with 64 neurons in Layer 1 and 32 in Layer 2 (MSE of 159.9437, MAE of 8.0781). Among the optimized approaches, GWO, with 66 neurons in Layer 1 and 100 in Layer 2, achieved the best prediction accuracy (MSE of 11.9487, MAE of 2.4552) and was computationally efficient (execution time of 1198.99 s). PSO, using 98 neurons in Layer 1 and 100 in Layer 2, minimized MAE (2.1679) but had a slightly longer execution time (1417.80 s). SSA, with the same neuron count as GWO, also performed well (MSE 12.1500, MAE 2.7003) and was the fastest (987.45 s). CS, with 84 neurons in Layer 1 and 74 in Layer 2, was less reliable (MSE 33.7767, MAE 3.8547) and slower (1904.01 s). GWO proved to be the best overall, balancing accuracy and speed. Future real-world applications of this methodology include improving energy efficiency in solar farms under variable weather conditions and optimizing the performance of residential solar panels to reduce energy costs. Further optimization developments could address more complex and larger-scale datasets in real-time, such as integrating renewable energy sources into smart grid systems for better energy distribution. Full article

This manuscript introduces an improved Cuckoo Search (CS) algorithm, known as BASCS, designed to address the inherent limitations of CS, including insufficient search space coverage, premature convergence, low search accuracy, and slow search speed. The proposed improvements encompass four main areas: the integration of tent chaotic mapping and random migration in population initialization to reduce the impact of random errors, the guidance of Levy flight by the directional determination strategy of the Beetle Antennae Search (BAS) algorithm during the global search phase to improve search accuracy and convergence speed, the adoption of the Sine Cosine Algorithm for local exploitation in later iterations to enhance local optimization and accuracy, and the adaptive adjustment of the step-size factor and elimination probability throughout the iterative process to convergence. The performance of BASCS is validated through ablation experiments on 10 benchmark functions, comparative experiments with the original CS and its four variants, and application to a robot path planning problem. The results demonstrate that BASCS achieves higher convergence accuracy and exhibits faster convergence speed and superior practical applicability compared to other algorithms. Full article

Background/Objectives: Photoplethysmography (PPG) signals, which measure blood volume changes through light absorption, are increasingly used for non-invasive cardiovascular disease (CVD) detection. Analyzing PPG signals can help identify irregular heart patterns and other indicators of CVD. Methods: This research involves a total of 41 subjects sourced from the CapnoBase database, consisting of 21 normal subjects and 20 CVD cases. In the initial stage, heuristic optimization algorithms, such as ABC-PSO, the Cuckoo Search algorithm (CSA), and the Dragonfly algorithm (DFA), were applied to reduce the dimension of the PPG data. Next, these Dimensionally Reduced (DR) PPG data are then fed into various classifiers such as Linear Regression (LR), Linear Regression with Bayesian Linear Discriminant Classifier (LR-BLDC), K-Nearest Neighbors (KNN), PCA-Firefly, Linear Discriminant Analysis (LDA), Kernel LDA (KLDA), Probabilistic LDA (ProbLDA), SVM-Linear, SVM-Polynomial, and SVM-RBF, to identify CVD. Classifier performance is evaluated using Accuracy, Kappa, MCC, F1 Score, Good Detection Rate (GDR), Error rate, and Jaccard Index (JI). Results: The SVM-RBF classifier for ABC PSO dimensionality reduced values outperforms other classifiers, achieving the highest accuracy of 95.12% along with the minimum error rate of 4.88%. In addition to that, it provides an MCC and kappa value of 0.90, a GDR and F1 score of 95%, and a Jaccard Index of 90.48%. Conclusions: This study demonstrated that heuristic-based optimization and machine learning classification of PPG signals are highly effective for the non-invasive detection of cardiovascular disease. Full article

Pipeline leakage, which leads to water wastage, financial losses, and contamination, is a significant challenge in urban water supply networks. Leak detection and prediction is urgent to secure the safety of the water supply system. Relaying on deep learning artificial neural networks and a specific optimization algorithm, an intelligential detection approach in identifying the pipeline leaks is proposed. A hydraulic model is initially constructed on the simplified Net2 benchmark pipe network. The District Metering Area (DMA) algorithm and the Cuckoo Search (CS) algorithm are integrated as the DMA-CS algorithm, which is employed for the hydraulic model optimization. Attributing to the suspected leak area identification and the exact leak location, the DMA-CS algorithm possess higher accuracy for pipeline leakage (97.43%) than that of the DMA algorithm (92.67%). The identification pattern of leakage nodes is correlated to the maximum number of leakage points set with the participation of the DMA-CS algorithm, which provide a more accurate pathway for identifying and predicting the specific pipeline leaks. Full article

Current shale gas well production capacity predictions primarily rely on analytical and numerical simulation methods, which necessitate extensive calculations and manual parameter tuning and produce lowly accurate predictions. Although employing neural networks yields highly accurate predictions, they can easily fall into local optima. This paper suggests a new way to use Cuckoo Search (CS)-optimized neural networks to make shale gas well production capacity predictions more accurate and to solve the problem of local optima. It aims to assist engineers in devising more effective development plans and production strategies, optimizing resource allocation, and reducing risk. The method first analyzes the factors influencing the production capacity of shale gas wells in a block located in western China through correlation coefficients. It identifies the main factors affecting the gas test absolute open flow as organic carbon content, small-layer passage rate, fracture pressure, acid volume, pump-in fluid volume, brittle mineral content in the rock, and rock density. Subsequently, we used the CS algorithm to conduct the global training of the neural network, avoiding the problem of local optima, and established a neural network model for predicting shale gas well production capacity optimized by the CS algorithm. A comparative analysis with other relevant methods demonstrates that the CS-optimized neural network model can accurately predict production capacity, enabling a more rational and effective exploitation of shale gas resources, which lower development costs and increase the economic returns of oil and gas fields. Compared to numerical simulation, SVM, and BP neural network algorithms, the CS-optimized BP neural network (CS-BP) exhibits significantly lower prediction error. Its correlation coefficient between predicted and actual values reaches as high as 0.9924. Verification experiments conducted on another shale gas well also demonstrate that, in comparison to the BP neural network algorithm, CS-BP offers superior prediction performance, with model validation showing a prediction error of only 0.05. This study can facilitate more rational and efficient exploitation of shale gas resources, reduce development costs, and enhance the economic benefits of oil and gas fields. Full article

Oilfield Sewage System Scheduling is a complicated, large-scale, nonlinear system problem with multiple variables. The complexity of the sewage system pipeline network connection grows along with the ongoing building of oilfield stations, and the shortcomings of the sewage system water quantity scheduling program based on human experience decision-making become increasingly apparent. The key to solving this problem is to realize the digital and intelligent scheduling of sewage systems. Taking the sewage system of an oil production plant in Daqing oilfield as the research object, the water scheduling model of the sewage system is established in this paper. Aiming at the complex nonlinear characteristics of the model, the Levy flight speed updating operator, the adaptive stochastic offset operator, and the Brownian motion selection optimization operator are established by taking advantage of the particle swarm optimization (PSO) and the cuckoo search (CS) algorithm. Based on these operators, a hybrid PSO-CS algorithm is proposed, which jumps out of the local optimum and has a strong global search capability. Comparing PSO-CS with other algorithms on the CEC2022 test set, it was found that the PSO-CS algorithm ranked first in all 12 test functions, proving the excellent solving performance of the PSO-CS algorithm. Finally, the PSO-CS is applied to solve a water scheduling model for the sewage system of an oil production plant in Daqing Oilfield. It is found that the scheduling plan optimized by PSO-CS has a 100% water supply rate to the downstream water injection station, and the total energy consumption of the scheduling plan on the same day is reduced from 879.95 × 10⁶ m⁵/d to 712.84 × 10⁶ m⁵/d, which is a 19% reduction in energy consumption. The number of water balance stations in the sewage station increased by 7, which effectively improved the water resource utilization rate of the sewage station. Full article

The significant increase in international seaborne trade volumes over the last several years is pushing port operators to improve the efficiency of terminal processes and reduce vessel turnaround time. Toward this direction, this study investigates and solves the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) in a multi-quay (MQ) setting using computational intelligence (CI) approaches. First, the study develops a mathematical model representing a real port environment and then adapts the cuckoo search algorithm (CSA) for the first time in this setup. The CSA is inspired by nature by following the basic rules of breeding parasitism of some cuckoo species that lay eggs in other birds’ nests. For comparison purposes, we implement two baseline approaches, first come first serve and exact MILP, and two CI approaches, particle swarm optimization (PSO) and genetic algorithm (GA), that are typically used to solve such complex or NP-hard problems. Performance assessment is carried out via a comprehensive series of experiments using real-world data. Experimental findings show that the MILP method can address the problems only when a small dataset is employed. In contrast, the newly adapted CSA can solve larger instances of MQ BAP and QCAP within significantly reduced computation times. Full article

The performance of the porous gas bearing depends on the geometric characteristics, material, fluid properties, and the properties of the porous media, which is a restrictor that controls the gas flow. Its application in industrial environments must support higher loads, higher supply pressure, and, consequently, higher pressure in the lubricant fluid film. Because porous media has a relatively low elastic modulus, it is necessary to consider its deformation when designing porous gas bearings. The design of porous gas bearings is a multi-objective problem in engineering because the optimization objectives commonly are to maximize the load capacity or static stiffness coefficient and minimize the airflow; these objectives conflict. This work presents a multi-objective optimization algorithm based on the nature-inspired Flower Pollination Algorithm enhanced with Non-Dominated Sorting Genetic Algorithm II. The algorithm is applied to optimize the design of a porous gas bearing, maximizing the resultant force and the static stiffness coefficient and minimizing the airflow. The results indicate a better performance of the Multi-Objective Flower Pollination Algorithm than the Multi-Objective Cuckoo Search. The results show a relatively short running time of 6 min for iterations and a low number of iterations of 50. Full article

Standard machine learning and deep learning architectures have been widely used in the field of sentiment analysis, but their performance is unsatisfactory if the input texts are short (e.g., social media posts). Specifically, the accuracy of standard machine learning methods crucially depends on the richness and completeness of the features used to represent the texts, and in the case of short messages, it is often difficult to obtain high-quality features. Conversely, methods based on deep learning can achieve better expressiveness, but these methods are computationally demanding and often suffer from over-fitting. This paper proposes a new adaptive evolutionary computational integrated learning model (AdaECELM) to overcome the problems encountered by traditional machine learning and deep learning models in sentiment analysis for short texts. AdaECELM consists of three phases: feature selection, sub classifier training, and global integration learning. First, a grid search is used for feature extraction and selection of term frequency-inverse document frequency (TF-IDF). Second, cuckoo search (CS) is introduced to optimize the combined hyperparameters in the sub-classifier support vector machine (SVM). Finally, the training set is divided into different feature subsets for sub-classifier training, and then the trained sub-classifiers are integrated and learned using the AdaBoost integrated soft voting method. Extensive experiments were conducted on six real polar sentiment analysis data sets. The results show that the AdaECELM model outperforms the traditional ML comparison methods according to evaluation metrics such as accuracy, precision, recall, and F1-score in all cases, and we report an improvement in accuracy exceeding 4.5%, the second-best competitor. Full article

The identification (and control) of nonlinear systems is one of the most important and actual research directions. Moreover, many systems are multivariable. Different from linear system identification (where only a few classes of models are available), in the case of nonlinear systems, the class set of models is quite diverse. One of the most appealing nonlinear models belongs to the nonlinear ARMAX (NARMAX) class. This article focusses on the identification of such a model, which can be compared with other models (such as nonlinear ARX (NARX) and linear ARMAX) in an application based on the didactical installation ASTANK2. The mathematical foundation of NARMAX models and their identification method are described at length within this article. One of the most interesting parts is concerned with the identification of optimal models not only in terms of numerical parameters but also as structure. A metaheuristic (namely, the Cuckoo Search Algorithm) is employed with the aim of finding the optimal structural indices based on a special cost function, referred to as fitness. In the end, the performances of all three models (NARMAX, NARX, and ARMAX) are compared after the identification of the ASTANK2 installation. Full article