Search Results (289)

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

A bullet point cloud registration algorithm with a low overlap rate based on line feature detection was proposed to solve the problem of the difficulty and low efficiency of point cloud registration due to the low overlap rate among point clouds sampled by the bullet model. In this paper, voxel downsampling is used to remove some noise points and outliers from the bullet point cloud and applied to the specified resolution to reduce the calculation cost. The bullet point cloud is transformed to a better initial position by fitting the central axis with the geometrical features of the bullet. Then, the direction vector of the bullet linear features is obtained by using an icosahedral fitting discrete Hough transform to simplify the parameter space of the search transformation. Finally, the optimal rotation angle is searched for in the parameter space by using the improved Cuckoo algorithm to realize the registration of the bullet point cloud with a low overlap rate. Simulation and experimental results show that the proposed registration method can accurately register bullet point clouds of different densities with a low overlap rate. Compared with the commonly used ICP, GICP, and TRICP algorithms, the registration error of the proposed algorithm is reduced by 92.68% on average when the overlap rate is 52.85%. The registration error is reduced by 98.87% in the case of a 41.36% overlap rate, by 99.52% in the case of a 33.02% overlap rate, and by 98.89% in the case of a 22.75% overlap rate. Full article

To improve the torque performance of the axial-flux permanent-magnet motor (AFPMM), differential evolution (DE) and cuckoo search (CS) are proposed for optimizing the motor’s structural parameters. The object of this research is an AFPMM with a single-rotor and double-stator configuration. Firstly, finite element analysis (FEA) and BP neural network machine learning (ML) were combined to obtain an ML calculator. This calculator is about the relationships between five input structural parameters of the motor and two output torque parameters (i.e., average torque and cogging torque). Then, an optimization objective function was designed to reduce the cogging torque while increasing the average output torque. And motor structural parameters were optimized using the DE and CS algorithms, respectively. Finally, air-gap flux density, average torque, cogging torque, and ripple torque before and after the optimization of the motor structure parameters are compared by FEA. The results show that both algorithms achieved almost the same optimized structural parameters. And the optimized motor has reduced cogging torque while increasing the average output torque and reducing the ripple torque. Compared with the CS, the DE is more advantageous in terms of faster iteration speed, shorter time to obtain the optimal solution, and less resource consumption. Full article

High-dimensional datasets often harbor redundant, irrelevant, and noisy features that detrimentally impact classification algorithm performance. Feature selection (FS) aims to mitigate this issue by identifying and retaining only the most pertinent features, thus reducing dataset dimensions. In this study, we propose an FS approach based on black hole algorithms (BHOs) augmented with a mutation technique termed MBHO. BHO typically comprises two primary phases. During the exploration phase, a set of stars is iteratively modified based on existing solutions, with the best star selected as the “black hole”. In the exploration phase, stars nearing the event horizon are replaced, preventing the algorithm from being trapped in local optima. To address the potential randomness-induced challenges, we introduce inversion mutation. Moreover, we enhance a widely used objective function for wrapper feature selection by integrating two new terms based on the correlation among selected features and between features and classification labels. Additionally, we employ a transfer function, the V2 transfer function, to convert continuous values into discrete ones, thereby enhancing the search process. Our approach undergoes rigorous evaluation experiments using fourteen benchmark datasets, and it is compared favorably against Binary Cuckoo Search (BCS), Mutual Information Maximization (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Eelevance (mRMR), approaches. The results demonstrate the efficacy of our proposed model in selecting superior features that enhance classifier performance metrics. Thus, MBHO is presented as a viable alternative to the existing state-of-the-art approaches. We make our implementation source code available for community use and further development. Full article

In today’s perishable products industry, the importance of sustainability as a critical consideration has significantly increased. This study focuses on the design of a sustainable perishable product supply chain network (SPPSCN), considering the factors of economics cost, environmental impacts, and social responsibility. The proposed model is a comprehensive production–location–inventory problem optimization framework that addresses multiple objectives, echelons, products, and periods. To solve this complex problem, we introduce three hybrid metaheuristic algorithms: bat algorithm (BA), shuffled frog leaping algorithm (SFLA), and cuckoo search (CS) algorithm, all hybrid with variable neighbourhood search (VNS). Sensitivity to input parameters is accounted for using the Taguchi method to tune these parameters. Additionally, we evaluate and compare these approaches among themselves and benchmark their results against a reference method, a hybrid genetic algorithm (GA) with VNS. The quality of the Pareto frontier is evaluated by six metrics for test problems. The results highlight the superior performance of the bat algorithm with variable neighbourhood search. Furthermore, a sensitivity analysis is conducted to evaluate the impact of key model parameters on the optimal objectives. It is observed that an increase in demand has a nearly linear effect on the corresponding objectives. Moreover, the impact of extending raw material shelf life and product shelf life on these objectives is limited to a certain range. Beyond a certain threshold, the influence becomes insignificant. Full article

Glaucoma is a chronic eye condition that seriously impairs vision and requires early diagnosis and treatment. Automated detection techniques are essential for obtaining a timely diagnosis. In this paper, we propose a novel method for feature selection that integrates the cuckoo search algorithm with Caputo fractional order (CFO-CS) to enhance the performance of glaucoma classification. However, when using the infinite series, the Caputo definition has memory length truncation issues. Therefore, we suggest a fixed memory step and an adjustable term count for optimization. We conducted experiments integrating various feature extraction techniques, including histograms of oriented gradients (HOGs), local binary patterns (LBPs), and deep features from MobileNet and VGG19, to create a unified vector. We evaluate the informative features selected from the proposed method using the k-nearest neighbor. Furthermore, we use data augmentation to enhance the diversity and quantity of the training set. The proposed method enhances convergence speed and the attainment of optimal solutions during training. The results demonstrate superior performance on the test set, achieving 92.62% accuracy, 94.70% precision, 93.52% F1-Score, 92.98% specificity, 92.36% sensitivity, and 85.00% Matthew’s correlation coefficient. The results confirm the efficiency of the proposed method, rendering it a generalizable and applicable technique in ophthalmology. Full article

Green supply chain management is critical for driving sustainable development and addressing escalating environmental challenges faced by companies. However, due to the multidimensionality of cost–benefit analysis and the intricacies of supply chain operations, strategic decision-making regarding green supply chains is inherently complex. This paper proposes a green supply chain optimization framework based on a two-stage heuristic algorithm. First, anchored in the interests of intermediary core enterprises, this work integrates upstream procurement and transportation of products with downstream logistics and distribution. In this aspect, a three-tier green complex supply chain model incorporating economic and environmental factors is developed to consider carbon emissions, product non-conformance rates, delay rates, and transportation costs. The overarching goal is to comprehensively optimize the trade-off between supply chain costs and carbon emissions. Subsequently, a two-stage heuristic algorithm is devised to solve the model by combining the cuckoo search algorithm with the brainstorming optimization algorithm. Specifically, an adaptive crossover–mutation operator is introduced to enhance the search performance of the brainstorming optimization algorithm, which caters to both global and local search perspectives. Experimental results and comparison studies demonstrate that the proposed method performs well within the modeling and optimization of the green supply chain. The proposed method facilitates the efficient determination of ordering strategies and transportation plans within tight deadlines, thereby offering valuable support to decision-makers in central enterprises for supply chain management, ultimately maximizing their benefits. Full article

This paper aims to discuss the implementation of data analysis and information management for elderly nursing care from a data-driven perspective. It addresses the current challenges of in-home caregivers, providing a basis for decision making in analyzing nursing service content and evaluating job performance. The characteristics of caregivers’ activities were analyzed during the design of a wearable device-wearing scheme and a sensor data collection system. XGBoost, SVM, and Random Forest models were used in the experiments, with the Cuckoo search algorithm employed to optimize the XGBoost model parameters. Based on the control group experiment, it was confirmed that the XGBoost model, after adjusting the parameters using the Cuckoo search algorithm, exhibited better recognition performance than the SVM and RandomForest models, and the accuracy reached 0.9438. Wearable devices present high recognition accuracy in caregiver activity recognition research, which greatly improves the inspection of caregivers’ work and further promotes the completion of services. This study actively explores the applications of information technology and artificial intelligence theory to address practical problems and effectively promote the digitalization and intelligent development of the elderly nursing care industry. Full article

Nowadays, cluster analyses are widely used in mental health research to categorize student stress levels. However, conventional clustering methods experience challenges with large datasets and complex issues, such as converging to local optima and sensitivity to initial random states. To address these limitations, this research work introduces an Improved Grey Wolf Clustering Algorithm (iGWCA). This improved approach aims to adjust the convergence rate and mitigate the risk of being trapped in local optima. The iGWCA algorithm provides a balanced technique for exploration and exploitation phases, alongside a local search mechanism around the optimal solution. To assess its efficiency, the proposed algorithm is verified on two different datasets. The dataset-I comprises 1100 individuals obtained from the Kaggle database, while dataset-II is based on 824 individuals obtained from the Mendeley database. The results demonstrate the competence of iGWCA in classifying student stress levels. The algorithm outperforms other methods in terms of lower intra-cluster distances, obtaining a reduction rate of 1.48% compared to Grey Wolf Optimization (GWO), 8.69% compared to Mayfly Optimization (MOA), 8.45% compared to the Firefly Algorithm (FFO), 2.45% Particle Swarm Optimization (PSO), 3.65%, Hybrid Sine Cosine with Cuckoo search (HSCCS), 8.20%, Hybrid Firefly and Genetic Algorithm (FAGA) and 8.68% Gravitational Search Algorithm (GSA). This demonstrates the effectiveness of the proposed algorithm in minimizing intra-cluster distances, making it a better choice for student stress classification. This research contributes to the advancement of understanding and managing student well-being within academic communities by providing a robust tool for stress level classification. Full article

Vector quantization (VQ) is a block coding method that is famous for its high compression ratio and simple encoder and decoder implementation. Linde–Buzo–Gray (LBG) is a renowned technique for VQ that uses a clustering-based approach for finding the optimum codebook. Numerous algorithms, such as Particle Swarm Optimization (PSO), the Cuckoo search algorithm (CS), bat algorithm, and firefly algorithm (FA), are used for codebook design. These algorithms are primarily focused on improving the image quality in terms of the PSNR and SSIM but use exhaustive searching to find the optimum codebook, which causes the computational time to be very high. In our study, our algorithm enhances LBG by minimizing the computational complexity by reducing the total number of comparisons among the codebook and training vectors using a match function. The input image is taken as a training vector at the encoder side, which is initialized with the random selection of the vectors from the input image. Rescaling using bilinear interpolation through the nearest neighborhood method is performed to reduce the comparison of the codebook with the training vector. The compressed image is first downsized by the encoder, which is then upscaled at the decoder side during decompression. Based on the results, it is demonstrated that the proposed method reduces the computational complexity by 50.2% compared to LBG and above 97% compared to the other LBG-based algorithms. Moreover, a 20% reduction in the memory size is also obtained, with no significant loss in the image quality compared to the LBG algorithm. Full article