Search Results (295)

For patients suffering from obstructive sleep apnea and sleep-related breathing disorders, snoring is quite common, and it greatly interferes with the quality of life for them and for the people surrounding them. For diagnosing obstructive sleep apnea, snoring is used as a screening parameter, so the exact detection and classification of snoring sounds are quite important. Therefore, automated and very high precision snoring analysis and classification algorithms are required. In this work, initially the features are extracted from six different domains, such as time domain, frequency domain, Discrete Wavelet Transform (DWT) domain, sparse domain, eigen value domain, and cepstral domain. The extracted features are then selected using three efficient feature selection techniques, such as Golden Eagle Optimization (GEO), Salp Swarm Algorithm (SSA), and Refined SSA. The selected features are finally classified with the help of eight traditional machine learning classifiers and two proposed classifiers, such as the Firefly Algorithm-Weighted Extreme Learning Machine hybrid with Adaboost model (FA-WELM-Adaboost) and the Capuchin Search Algorithm-Weighted Extreme Learning Machine hybrid with Adaboost model (CSA-WELM-Adaboost). The analysis is performed on the MPSSC Interspeech dataset, and the best results are obtained when the DWT features with the refined SSA feature selection technique and FA-WELM-Adaboost hybrid classifier are utilized, reporting an Unweighted Average Recall (UAR) of 74.23%. The second-best results are obtained when DWT features are selected with the GEO feature selection technique and a CSA-WELM-Adaboost hybrid classifier is utilized, reporting an UAR of 73.86%. Full article

To ensure the stable operation of a wind turbine generator system when the wind speed exceeds the rated value and address the issue of excessive rotor speed during high wind speeds, this paper proposes a novel variable pitch controller strategy based on a back-propagation neural network and optimal control theory to solve this problem. Firstly, a mathematical model for the wind turbine is established and linearized. Then, each optimal sub-controller is designed for different wind speed conditions by optimal theory. Subsequently, a back-propagation neural network is utilized to learn the variation pattern of controller parameters with respect to wind speed. Finally, real-time changes in wind speed are applied to evaluate and adjust controller parameters using the trained back-propagation neural network. The model is simulated in MATLAB 2019b, real-time data are observed, and the control effect is compared with that of a Takagi–Sugeno optimal controller, firefly algorithm optimal controller and fuzzy controller. The simulation results show that the rotor speed overshoot of the optimal controller under the step wind speed is the smallest, only 0.05 rad/s. Under other wind speed conditions, the rotor speed range fluctuates around 4.35 rad/s, and the fluctuation size is less than 0.2 rad/s, which is much smaller than the fluctuation range of other controllers. It can be seen that the back-propagation optimal controller can ensure the stability of the rotor speed above the rated wind speed. At the same time, it has better control accuracy compared to other controllers. Full article

Aiming at the problem that the Osprey Optimization Algorithm (OOA) does not have high optimization accuracy and is prone to falling into local optimum, an Improved Osprey Optimization Algorithm Based on a Two-Color Complementary Mechanism for Global Optimization (IOOA) is proposed. The core of the IOOA algorithm lies in its unique two-color complementary mechanism, which significantly improves the algorithm’s global search capability and optimization performance. Firstly, in the initialization stage, the population is created by combining logistic chaos mapping and the good point set method, and the population is divided into four different color groups by drawing on the four-color theory to enhance the population diversity. Secondly, a two-color complementary mechanism is introduced, where the blue population maintains the OOA core exploration strategy to ensure the stability and efficiency of the algorithm; the red population incorporates the Harris Hawk heuristic strategy in the development phase to strengthen the ability of local minima avoidance; the green group adopts the strolling and wandering strategy in the searching phase to add stochasticity and maintain the diversity; and the orange population implements the optimized spiral search and firefly perturbation strategies to deepen the exploration and effectively perturb the local optimums, respectively, to improve the overall population diversity, effectively perturbing the local optimum to improve the performance of the algorithm and the exploration ability of the solution space as a whole. Finally, to validate the performance of IOOA, classical benchmark functions and CEC2020 and CEC2022 test sets are selected for simulation, and ANOVA is used, as well as Wilcoxon and Friedman tests. The results show that IOOA significantly improves convergence accuracy and speed and demonstrates high practical value and advantages in engineering optimization applications. Full article

Accurate and reliable short-term runoff prediction plays a pivotal role in water resource management, agriculture, and flood control, enabling decision-makers to implement timely and effective measures to enhance water use efficiency and minimize losses. To further enhance the accuracy of runoff prediction, this study proposes a FA-LSTM model that integrates the Firefly algorithm (FA) with the long short-term memory neural network (LSTM). The research focuses on historical daily runoff data from the Dahuangjiangkou and Wuzhou Hydrology Stations in the Xijiang River Basin. The FA-LSTM model is compared with RNN, LSTM, GRU, SVM, and RF models. The FA-LSTM model was used to carry out the generalization experiment in Qianjiang, Wuxuan, and Guigang hydrology stations. Additionally, the study analyzes the performance of the FA-LSTM model across different forecasting horizons (1–5 days). Four quantitative evaluation metrics—mean absolute error (MAE), root mean square error (RMSE), coefficient of determination (R²), and Kling–Gupta efficiency coefficient (KGE)—are utilized in the evaluation process. The results indicate that: (1) Compared to RNN, LSTM, GRU, SVM, and RF models, the FA-LSTM model exhibits the best prediction performance, with daily runoff prediction determination coefficients (R²) reaching as high as 0.966 and 0.971 at the Dahuangjiangkou and Wuzhou Stations, respectively, and the KGE is as high as 0.965 and 0.960, respectively. (2) FA-LSTM model was used to conduct generalization tests at Qianjiang, Wuxuan and Guigang hydrology stations, and its R² and KGE are 0.96 or above, indicating that the model has good adaptability in different hydrology stations and strong robustness. (3) As the prediction period extends, the R² and KGE of the FA-LSTM model show a decreasing trend, but the whole model still showed feasible forecasting ability. The FA-LSTM model introduced in this study presents an effective new approach for daily runoff prediction. Full article

Cable-driven parallel robots (CDPRs) have been gaining much attention due to their many advantages over traditional parallel robots or serial robots, such as their markedly large workspace and lightweight design. However, one of the main issues that needs to be urgently solved is the tension in the distribution of CDPRs due to two reasons. The first is that a cable can only be stretched but not compressed, and the other is the redundancy of the parallel robot. To address the problem, an optimization method for tension distribution is proposed in the paper. The structural design of the parallel robot is first discussed. The dynamics model of the parallel robot is established by the Newton–Euler method. Based on the minimum variance of cables’ tension, an optimization method of tension distribution is presented for the parallel robot. Furthermore, the tension extreme average term is introduced in the optimization method, and the firefly algorithm is applied to obtain the optimal solution for tension distribution. Finally, the proposed approach is tested in the simulation case where the end-effector of the robot moves in a circular motion. Simulation results demonstrate that the uniformity and continuity of tension are both outstanding for the proposed method. In contrast with traditional solving methods, the efficiency of this method is largely improved. Full article

The challenges associated with conventional methods of COVID-19 detection have prompted the exploration of alternative approaches, including the analysis of lung X-ray images. This paper introduces a novel algorithm designed to identify abnormalities in X-ray images indicative of COVID-19 by combining the maximally stable extremal regions (MSER) method with metaheuristic algorithms. The MSER method is efficient and effective under various adverse conditions, utilizing symmetry as a key property to detect regions despite changes in scaling or lighting. However, calibrating the MSER method is challenging. Our approach transforms this calibration into an optimization task, employing metaheuristic algorithms such as Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Firefly (FF), and Genetic Algorithms (GA) to find the optimal parameters for MSER. By automating the calibration process through metaheuristic optimization, we overcome the primary disadvantage of the MSER method. This innovative combination enables precise detection of abnormal regions characteristic of COVID-19 without the need for extensive datasets of labeled training images, unlike deep learning methods. Our methodology was rigorously tested across multiple databases, and the detection quality was evaluated using various indices. The experimental results demonstrate the robust capability of our algorithm to support healthcare professionals in accurately detecting COVID-19, highlighting its significant potential and effectiveness as a practical and efficient alternative for medical diagnostics and precise image analysis. Full article

The integrated energy system at the park level, renowned for its diverse energy complementarity and environmentally friendly attributes, serves as a crucial platform for incorporating novel energy consumption methods. Nevertheless, distributed energy generation, characterized by randomness, fluctuations, and intermittency, is significantly influenced by the surrounding environment. Within the park, the output of multiple devices frequently diverges significantly from the actual demand, potentially resulting in energy waste phenomena, such as the curtailment of wind and solar power. To tackle the dual challenges of balancing energy supply and demand while reducing carbon emissions in the industrial park, this paper introduces a low-carbon integrated energy system that incorporates distributed renewable and clean energy sources. Mathematical models are formulated for the source–grid–load–storage components of this low-carbon integrated energy system. Furthermore, various operational scenarios for the park-level integrated energy system are analyzed. The ultimate goal is to devise an economically viable, low-carbon, and efficient operational strategy for the integrated energy system, aiming to satisfy the diverse objectives of various stakeholders. Full article

This study introduces a novel adjustment to the firefly algorithm (FA) through the integration of rare instances of cannibalism among fireflies, culminating in the development of the honeybee mating-based firefly algorithm (HBMFA). The IEEE Congress on Evolutionary Computation (CEC) 2005 benchmark functions served as a rigorous testing ground to evaluate the efficacy of the new algorithm in diverse optimization scenarios. Moreover, thorough statistical analyses, including two-sample t-tests and fitness function evaluation analysis, the algorithm’s optimization capabilities were robustly validated. Additionally, the coefficient of determination, used as an objective function, was utilized with real-world wind speed data from the SR-25 station in Brazil to assess the algorithm’s applicability in modeling wind speed parameters. Notably, HBMFA achieved superior solution accuracy, with enhancements averaging 0.025% compared to conventional FA, despite a moderate increase in execution time of approximately 18.74%. Furthermore, this dominance persisted when the algorithm’s performance was compared with other common optimization algorithms. However, some limitations exist, including the longer execution time of HBMFA, raising concerns about its practical applicability in scenarios where computational efficiency is critical. Additionally, while the new algorithm demonstrates improvements in fitness values, establishing the statistical significance of these differences compared to FA is not consistently achieved, which warrants further investigation. Nevertheless, the added value of this work lies in advancing the state-of-the-art in optimization algorithms, particularly in enhancing solution accuracy for critical engineering applications. 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

The electrochemical proton exchange membrane fuel cell (PEMFC) is an electrical generator that utilizes a chemical reaction mechanism to produce electricity, serving as a sustainable and environmentally friendly energy source. To thoroughly analyze and develop the features and performance of a PEMFC, it is essential to use a precise model that incorporates exact parameters to effectively suit the polarization curve. In addition, parameter extraction plays a crucial role in the simulation analysis, evaluation, optimum control, and fault detection of the proton exchange membrane fuel cell (PEMFC) system. Despite the development of many algorithms for parameter extraction in PEMFC, obtaining accurate and trustworthy results rapidly remains a challenge. This study presents a hybridized algorithm, namely differential evolution ameliorated (DEA) for reliably estimating PEMFC model parameters. To evaluate the proposed DEA-based parameter identification, a comparison analysis with previously published methods is conducted using MATLAB/Simulink^TM (R2016b, MathWorks, Natick, MA, USA) in terms of system correctness and convergence process. The proposed DEA algorithm is tested to extract the parameters of two PEMFC models: SR-12 500 W and 250 W. The sum of the squared errors (SSE) between the experimental and the obtained voltage data is defined as an objective function. The simulation results prove that the suggested DEA algorithm is capable of identifying the optimal PEMFC parameters rapidly and accurately in comparison with other optimization algorithms. Full article

Vector Quantization (VQ) is a technique with a wide range of applications. For example, it can be used for image compression. The codebook design for VQ has great significance in the quality of the quantized signals and can benefit from the use of swarm intelligence. Initialization of the Linde–Buzo–Gray (LBG) algorithm, which is the most popular VQ codebook design algorithm, is a step that directly influences VQ performance, as the convergence speed and codebook quality depend on the initial codebook. A widely used initialization alternative is random initialization, in which the initial set of codevectors is drawn randomly from the training set. Other initialization methods can lead to a better quality of the designed codebooks. The present work evaluates the impacts of initialization strategies on swarm intelligence algorithms for codebook design in terms of the quality of the designed codebooks, assessed by the quality of the reconstructed images, and in terms of the convergence speed, evaluated by the number of iterations. Initialization strategies consist of a combination of codebooks obtained by initialization algorithms from the literature with codebooks composed of vectors randomly selected from the training set. The possibility of combining different initialization techniques provides new perspectives in the search for the quality of the VQ codebooks. Nine initialization strategies are presented, which are compared with random initialization. Initialization strategies are evaluated on the following algorithms for codebook design based on swarm clustering: modified firefly algorithm—Linde–Buzo–Gray (M-FA-LBG), modified particle swarm optimization—Linde–Buzo–Gray (M-PSO-LBG), modified fish school search—Linde–Buzo–Gray (M-FSS-LBG) and their accelerated versions (M-FA-LBGa, M-PSO-LBGa and M-FSS-LBGa) which are obtained by replacing the LBG with the accelerated LBG algorithm. The simulation results point out to the benefits of the proposed initialization strategies. The results show gains up to 4.43 dB in terms of PSNR for image Clock with M-PSO-LBG codebooks of size 512 and codebook design time savings up to 67.05% for image Clock, with M-FF-LBGa codebooks with size $N=512$, by using initialization strategies in substitution to Random initialization. Full article

The physical and mechanical properties of heat-treated wood are essential factors in assessing its appropriateness for different applications. While back-propagation (BP) neural networks are widely used for predicting wood properties, their accuracy often falls short of expectations. This paper introduces an improved Beluga Whale Optimisation (IBWO)-BP model as a solution to this challenge. We improved the standard Beluga Whale Optimisation (BWO) algorithm in three ways: (1) use Bernoulli chaos mapping to explore the entire search space during population initialization; (2) incorporate the position update formula of the Firefly Algorithm (FA) to improve the position update strategy and convergence speed; (3) apply the opposition-based learning based on the lens imaging (lensOBL) mechanism to the optimal individual, which prevents the algorithm from getting stuck in local optima during each iteration. Subsequently, we adjusted the weights and thresholds of the BP model, deploying the IBWO approach. Ultimately, we employ the IBWO-BP model to predict the swelling and shrinkage ratio of air-dry volume, as well as the modulus of elasticity (MOE) and bending strength (MOR) of heat-treated wood. The benefit of IBWO is demonstrated through comparison with other meta-heuristic algorithms (MHAs). When compared to earlier prediction models, the results revealed that the mean square error (MSE) decreased by 39.7%, the root mean square error (RMSE) by 22.4%, the mean absolute percentage error (MAPE) by 9.8%, the mean absolute error (MAE) by 31.5%, and the standard deviation (STD) by 18.9%. Therefore, this model has excellent generalisation ability and relatively good prediction accuracy. Full article

This study introduces an improved quantum-behavior particle swarm optimization (IQPSO), tailored for the task of maximum power point tracking (MPPT) within photovoltaic generation systems (PGSs). The power stage of the MPPT system comprises a series of buck-boost converters, while the control stage contains a microprocessor executing the biomimetic algorithm. Leveraging the series buck-boost converter, the MPPT system achieves optimal operation at the maximum power point under both ideal ambient conditions and partial shade conditions (PSCs). The proposed IQPSO addresses the premature convergence issue of QPSO, enhancing tracking accuracy and reducing tracking time by estimating the maximum power point and adjusting the probability distribution. Employing exponential decay, IQPSO facilitates a reduction in tracking time, consequently enhancing convergence efficiency and search capability. Through single-peak experiments, multi-peak experiments, irradiance-changing experiments, and full-day experiments, it is demonstrated that the tracking accuracy and tracking time of IQPSO outperform existing biomimetic algorithms, such as the QPSO, firefly algorithm (FA), and PSO. Full article

This paper presents the author’s approaches based on computational intelligence methods for application in the Autonomous Navigation System (ANS) of a smart ship. The considered task is collision avoidance, which is one of the vital functions of the ANS. The proposed methods, applying the Ant Colony Optimization and the Firefly Algorithm, were compared with other artificial intelligence approaches introduced in the recent literature, e.g., evolutionary algorithms and machine learning. The advantages and disadvantages of different algorithms are formulated. Results of simulation experiments carried out with the use of the developed algorithms are presented and discussed. Future trends and challenges of presented smart technologies are also stated. Full article