Search Results (294)

Switched reluctance motors (SRMs) offer several advantages, including a magnet- and winding-free rotor, high mechanical strength, and exceptional output efficiency. However, the doubly salient pole structure and high-frequency switching power supply result in significant torque ripple and electromagnetic noise, which limit the application in the field of new energy vehicles. To address these issues, this paper proposes a direct instantaneous torque control (DITC) strategy based on an optimal switching angle torque sharing function (TSF). Firstly, an improved cosine TSF is designed to reasonably distribute the total reference torque among the phases, stabilizing the synthesized torque of SRM during the commutation interval. Subsequently, an improved artificial bee colony (ABC) algorithm is used to obtain the optimal switching angle data at various speeds, integrating these data into the torque distribution module to derive the optimal switching angle model. Finally, the effectiveness of the proposed control strategy is validated through simulations of an 8/6-pole SRM. Simulation results demonstrate that the proposed control strategy effectively suppresses torque ripple during commutation and reduces the peak current at the beginning of phase commutation. Full article

The utilization of contemporary technology enhances the efficiency of parking resource management, contributing to more liveable and sustainable cities. In response to the growing challenges of urbanization, intelligent parking systems have emerged as a crucial solution for optimizing parking management, reducing traffic congestion, and minimizing pollution. The primary aim of this study is to present the concept of the developed web application that supports finding available parking spaces, embodied in the SPARK system (Smart Parking Assistance and Resource Knowledge). The integration of the YOLOv9 (You Only Look Once) segmentation algorithm with Artificial Bee Colony (ABC) optimization, combined with the use of crowdsourced data and deep learning for image analysis, significantly enhances the SPARK system’s operational efficiency. It enables rapid and precise detection of available parking spaces while ensuring robustness and continuous improvement. The accuracy of detecting available parking spaces in the presented system, estimated at 87.33%, is satisfactory compared to similar studies worldwide. Full article

The voltage control of synchronous generators, particularly under varying load conditions, remains a significant and complex challenge in the field of engineering. Although various control methods have been implemented for automatic voltage regulator (AVR) systems to control the terminal voltage of synchronous generators, the PID-based control method continues to be one of the most basic and widely used approaches. Determining the optimal values for the Kp, Ki, and Kd values is essential to ensuring efficient and rapid performance in a PID controller. This study presents PLC-based PID controller tuning using an adaptive artificial bee colony–fuzzy logic (aABC-FL) approach for voltage control in a micro-hydro power plant installed as an experimental setup. The real-time control and monitoring of the system was conducted using an S7-1200 programmable logic controller (PLC) integrated with a totally integrated automation (TIA) portal interface and a SCADA screen. The aABC-Fuzzy design was developed using the MATLAB/Simulink platform, with PLC-MATLAB communication established through OPC UA and the KEPServerEX interface. The results obtained from experiments conducted under different load conditions showed that the proposed aABC-FL PID significantly minimized settling time and overshoot compared to the classical PLC-PID. Additionally, the proposed method not only provided a good dynamic response but also proved to be robust and reliable for real physical AVR systems. Full article

The artificial bee colony algorithm (ABC), as a classic swarm intelligence algorithm, has advantages such as fewer parameters and clear logic. However, ABC cannot balance the exploration and development stages well in the iterative process, and is easily affected by local optimal solutions in the final optimization stage, which affects the final optimal solution. To effectively compensate for the shortcomings of the algorithm, a neighbor learning artificial bee colony algorithm based on permutation solutions (CNABC) is proposed. In CNABC, a dynamic neighbor learning strategy is proposed to improve the search ability and optimal selection ability of the algorithm in the exploration phase. To solve the problem of lack of balance between exploration and development, the local optimal solution is used to guide the update of the surrounding difference. After the three stages of the algorithm are completed, a substitution mechanism is introduced, which replaces the worst solution by introducing external candidate solutions as feasible solutions, thereby improving the algorithm’s ability to escape from local optima. Finally, comparative algorithm experiments are conducted on the CEC2022 test set, and compared with the TOP algorithm in the CEC competition on the CEC2022 test set. According to the experimental results, CNABC has good competitiveness in the comparative algorithm, which verifies the novelty and optimization ability of CNABC. Full article

Accurate sales forecasting is essential for optimizing resource allocation, managing inventory, and maximizing profit in competitive markets. Machine learning models are being increasingly used to develop reliable sales-forecasting systems due to their advanced capabilities in handling complex data patterns. This study introduces a novel hybrid approach that combines the artificial bee colony (ABC) and fire hawk optimizer (FHO) algorithms, specifically designed to enhance hyperparameter optimization in machine learning-based forecasting models. By leveraging the strengths of these two metaheuristic algorithms, the hybrid method enhances the predictive accuracy and robustness of models, with a focus on optimizing the hyperparameters of XGBoost for forecasting tasks. Evaluations across three distinct datasets demonstrated that the hybrid model consistently outperformed standalone algorithms, including the genetic algorithm (GA), artificial rabbits optimization (ARO), the white shark optimizer (WSO), the ABC algorithm, and the FHO, with the latter being applied for the first time to hyperparameter optimization. The superior performance of the hybrid model was confirmed through the RMSE, the MAPE, and statistical tests, marking a significant advancement in sales forecasting and providing a reliable, effective solution for refining predictive models to support business decision-making. Full article

High-dimensional datasets, where the number of features far exceeds the number of observations, present significant challenges in feature selection and model performance. This study proposes a novel two-stage feature-selection approach that integrates Artificial Bee Colony (ABC) optimization with Adaptive Least Absolute Shrinkage and Selection Operator (AD_LASSO). The initial stage reduces dimensionality while effectively dealing with complex, high-dimensional search spaces by using ABC to conduct a global search for the ideal subset of features. The second stage applies AD_LASSO, refining the selected features by eliminating redundant features and enhancing model interpretability. The proposed ABC-ADLASSO method was compared with the AD_LASSO, LASSO, stepwise, and LARS methods under different simulation settings in high-dimensional data and various real datasets. According to the results obtained from simulations and applications on various real datasets, ABC-ADLASSO has shown significantly superior performance in terms of accuracy, precision, and overall model performance, particularly in scenarios with high correlation and a large number of features compared to the other methods evaluated. This two-stage approach offers robust feature selection and improves predictive accuracy, making it an effective tool for analyzing high-dimensional data. Full article

Compared to base aluminum alloys, the surface composites of aluminum alloys are more widely used in the automotive, aerospace, and other industries. The ability to yield enhanced physical properties and a smoother microstructure has made friction stir processing (FSP) the method of choice for developing aluminum-based surface composites in recent times. In this work, the Goal Programming (GP) approach is adopted for the Multi-Objective Optimization of FSP processes with three Artificial Intelligence (AI)-based metaheuristics, viz., Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), and Teaching–Learning-Based Optimization (TLBO). Three parameters, copper percentage (Cu%), graphite percentage (Gr%), and number of passes, are considered, and multi-factor non-linear regression prediction models are developed for the three responses, Tool Vibrations, Power Consumption, and Cutting Force. The TLBO algorithm outperformed the ABC and PSO algorithms in terms of solution quality and robustness, yielding significant improvements in tool life. The results with TLBO were improved by 20% and 14% compared to the PSO and ABC algorithms, respectively. This proves that the TLBO algorithm performed better compared with the ABC and PSO algorithms. However, the computation time required for the TLBO algorithm is higher compared to the ABC and PSO algorithms. This work has opened new avenues towards applying the GP approach for the Multi-Objective Optimization of FSP tools with composite parameters. This is a significant step towards toll life improvement for the FSP of composite alloys, contributing to sustainable manufacturing. Full article

Finding the best configuration of a neural network’s hyper-parameters may take too long to be feasible using an exhaustive search, especially when the cardinality of the search space has a big combinatorial number of possible solutions with various hyper-parameters. This problem is aggravated when we also need to optimize the parameters of the neural network, such as the weight of the hidden neurons and biases. Extreme learning machines (ELMs) are part of the random weights neural network family, in which parameters are randomly initialized, and the solution, unlike gradient-descent-based algorithms, can be found analytically. This ability is especially useful for metaheuristic analysis due to its reduced training times allowing a faster optimization process, but the problem of finding the best hyper-parameter configuration is still remaining. In this paper, we propose a modification of the artificial bee colony (ABC) metaheuristic to act as parameterizers for a regularized ELM, incorporating three methods: an adaptive mechanism for ABC to balance exploration (global search) and exploitation (local search), an adaptation of the opposition-based learning technique called opposition local-based learning (OLBL) to strengthen exploitation, and a record of access to the search space called forbidden redundant indexes (FRI) that allow us to avoid redundant calculations and track the explored percentage of the search space. We set ten parameterizations applying different combinations of the proposed methods, limiting them to explore up to approximately 10% of the search space, with results over 98% compared to the maximum performance obtained in the exhaustive search in binary and multiclass datasets. The results demonstrate a promising use of these parameterizations to optimize the hyper-parameters of the R-ELM in datasets with different characteristics in cases where computational efficiency is required, with the possibility of extending its use to other problems with similar characteristics with minor modifications, such as the parameterization of support vector machines, digital image filters, and other neural networks, among others. Full article

The Grey Wolf Optimizer (GWO) algorithm is recognized for its simplicity and ease of implementation, and has become a preferred method for solving global optimization problems due to its adaptability and search capabilities. Despite these advantages, existing Unmanned Aerial Vehicle (UAV) path planning algorithms are often hindered by slow convergence rates, susceptibility to local optima, and limited robustness. To surpass these limitations, we enhance the application of GWO in UAV path planning by improving its trajectory evaluation function, convergence factor, and position update method. We propose a collaborative UAV path planning model that includes constraint analysis and an evaluation function. Subsequently, an Enhanced Grey Wolf Optimizer model (NI–GWO) is introduced, which optimizes the convergence coefficient using a nonlinear function and integrates the Dynamic Window Approach (DWA) algorithm into the model based on the fitness of individual wolves, enabling it to perform dynamic obstacle avoidance tasks. In the final stage, a UAV path planning simulation platform is employed to evaluate and compare the effectiveness of the original and improved algorithms. Simulation results demonstrate that the proposed NI–GWO algorithm can effectively solve the path planning problem for UAVs in uncertain environments. Compared to Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), GWO, and MP–GWO algorithms, the NI–GWO algorithm can achieve the optimal fitness value and has significant advantages in terms of average path length, time, number of collisions, and obstacle avoidance capabilities. Full article

This study presents the complex transfer matrix method (CTMM) as an advanced mathematical model, providing significant advantages over the finite element method (FEM) by yielding rapid solutions for complex optimization problems. In order to design a more efficient structure of a three-stage turbomachine rotor, we integrated this method with various optimization algorithms, including genetic algorithm (GA), differential evolution (DE), simulated annealing (SA), gravitational search algorithm (GSA), black hole (BH), particle swarm optimization (PSO), Harris hawk optimization (HHO), artificial bee colony (ABC), and non-metaheuristic pattern search (PS). Thus, the best rotor geometry can be obtained fast with minimum bearing forces and disk deflections within design limits. In the results, the efficiency of the CTMM for achieving optimized designs is demonstrated. The CTMM outperformed the FEM in both speed and applicability for complex rotordynamic problems. The CTMM was found to deliver results of comparable quality much faster than the FEM, especially with higher element quality. The use of the CTMM in the iterative optimization process is shown to be highly advantageous. Furthermore, it is noted that among the different optimization algorithms, ABC provided the best results for this multi-objective optimization problem. Full article

The artificial bee colony (ABC) algorithm is a famous swarm intelligence method utilized across various disciplines due to its robustness. However, it exhibits limitations in exploration mechanisms, particularly in high-dimensional or complex landscapes. This article introduces the adaptive exploration artificial bee colony (AEABC), a novel variant that reinspires the ABC algorithm based on real-world phenomena. AEABC incorporates new distance-based parameters and mechanisms to correct the original design, enhancing its robustness. The performance of AEABC was evaluated against 33 state-of-the-art metaheuristics across twenty-five benchmark functions and an engineering application. AEABC consistently outperformed its counterparts, demonstrating superior efficiency and accuracy. In a variable-sized problem (n = 10), the traditional ABC algorithm converged to 3.086 × 10⁶, while AEABC achieved a convergence of 2.0596 × 10⁻²⁵⁵, highlighting its robust performance. By addressing the shortcomings of the traditional ABC algorithm, AEABC significantly advances mathematical optimization, especially in engineering applications. This work underscores the significance of the inspiration of the traditional ABC algorithm in enhancing the capabilities of swarm intelligence. Full article

A landslide susceptibility assessment is one of the critical steps in planning for landslide disaster prevention. Advanced machine learning methods can be used as data-driven approaches for landslide susceptibility zonation with several landslide conditioning factors. Despite there being a number of studies on landslide susceptibility assessment, the literature is limited in several contexts, such as parameter optimization, an examination of the factors in detail, and study area. This study addresses these lacks in the literature and aims to develop a landslide susceptibility map of Kentucky, US. Four machine learning methods, namely artificial neural network (ANN), k-nearest neighbor (KNN), support vector machine (SVM), and stochastic gradient boosting (SGB), were used to train the dataset comprising sixteen landslide conditioning factors after pre-processing the data in terms of data encoding, data scaling, and dimension reduction. The hyperparameters of the machine learning methods were optimized using a state-of-the-art artificial bee colony (ABC) algorithm. The permutation importance and Shapley additive explanations (SHAP) methods were employed to reduce the dimension of the dataset and examine the contributions of each landslide conditioning factor to the output variable, respectively. The findings show that the ABC-SGB hybrid model achieved the highest prediction performance. The SHAP summary plot developed using the ABC-SGB model shows that intense precipitation, distance to faults, and slope were the most significant factors affecting landslide susceptibility. The SHAP analysis further underlines that increases in intense precipitation, distance to faults, and slope are associated with an increase in the probability of landslide incidents. The findings attained in this study can be used by decision makers to develop the most effective resource allocation plan for preventing landslides and minimizing related damages. Full article

In the rapidly evolving landscape of the Internet of Things (IoT), cybersecurity remains a critical challenge due to the diverse and complex nature of network traffic and the increasing sophistication of cyber threats. This study investigates the application of the Artificial Bee Colony (ABC) algorithm for hyperparameter optimization (HPO) in machine learning classifiers, specifically focusing on Decision Trees, Support Vector Machines (SVM), and K-Nearest Neighbors (KNN) for IoT network traffic analysis and malware detection. Initially, the basic machine learning models demonstrated accuracies ranging from 69.68% to 99.07%, reflecting their limitations in fully adapting to the varied IoT environments. Through the employment of the ABC algorithm for HPO, significant improvements were achieved, with optimized classifiers reaching up to 100% accuracy, precision, recall, and F1-scores in both training and testing stages. These results highlight the profound impact of HPO in refining model decision boundaries, reducing overfitting, and enhancing generalization capabilities, thereby contributing to the development of more robust and adaptive security frameworks for IoT environments. This study further demonstrates the ABC algorithm’s generalizability across different IoT networks and threats, positioning it as a valuable tool for advancing cybersecurity in increasingly complex IoT ecosystems. Full article

This study addresses the route scheduling problem for the heterogeneous robotic delivery system (HRDS) that perform delivery tasks in an urban environment. The HRDS comprises two distinct types of vehicles: an unmanned ground vehicle (UGV), which is constrained by road networks, and an unmanned aerial vehicle (UAV), which is capable of traversing terrain but has limitations in terms of energy and payload. The problem is formulated as an optimal route scheduling problem in a road network, where the goal is to find the route with minimum delivery cost and maximum customer satisfaction (CS) enabling the UAV to deliver packages to customers. We propose a new method of route scheduling based on an improved artificial bee colony algorithm (ABC) and the non-dominated sorting genetic algorithm II (NSGA-II) that provides the optimal delivery route. The effectiveness and superiority of the method we proposed are demonstrated by comparison in simulations. Moreover, the physical experiments further validate the practicality of the model and method. Full article

In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach, namely integrating vehicle and unmanned aerial vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework which employs the density-based spatial clustering of applications with noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm’s tendency toward early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach which successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system’s logistics during critical situations. Full article