Artificial Bee Colony Algorithm Research Articles

An artificial bee colony algorithm with an adaptive search strategy selection mechanism and its application on workload prediction

As one category of evolutionary algorithms, artificial bee colony (ABC) algorithms have many advantages such as few control parameters, simple structures and competitive performance. However, most ABC algorithms suffer from slow convergence and poor performance on optimization problems with strong correlations. To overcome these limitations, we propose a novel ABC with an Adaptive Search Strategy Selection (AS3) mechanism, called ABC-AS3. The basic idea of ABC-AS3 is to adaptively adjust search strategies between a one-dimensional search strategy and an all-dimensional search strategy based on probabilities that they are selected respectively within the most recent generations. We prove the rotation-variant and rotation-invariant properties of the one-dimensional and all-dimensional search strategies applied in the ABC-AS3 algorithm, respectively. The one-dimensional search strategy is used to maintain superiority on optimization with weak correlations. The all-dimensional one aims to accelerate the convergence speed and improve the performance on optimization with strong correlations. Simulation results show that ABC-AS3 outperforms state-of-the-art ABC variants and evolutionary algorithms in terms of solution quality, convergence speed, and numerical stability. In addition, we apply ABC-AS3 to optimize parameters of a multi-layer perceptron for workload prediction in data centers, which achieves better prediction accuracy and stability than baseline methods.

Cost optimization and machine learning-based prediction of waiting time for fault-tolerance machining system with general vacation and F-policy

This study focuses on the queueing management, performance analysis, and cost optimization of a fault tolerance machining system (FTMS) that incorporates the multiple vacations of repairman and admission control F-policy (ACFP). The ACFP is an effective tool for managing the congestion problem that arises due to the arrival of failed machines for repair jobs in a system. This effectively controls the influx of failed machines and enhances the efficiency of the repair process. Furthermore, when there are no failed machines available in the system (i.e., the system is empty), the repairman may choose to take a vacation. After returning from vacation, if there are no failed machines available for repair, the repairman can take another vacation. For the mathematical analysis of the proposed model, the Chapman–Kolmogorov (C-K) steady-state equations are constructed and solved. This is achieved by introducing supplementary variables corresponding to vacation times, followed by using the Laplace-Stieltjes transform (LST) and recursive method to establish probability distributions. Furthermore, using the established probability distributions, various performance measures are developed to gain insights into the system’s behavior. These performance measures include the expected number of failed machines in the system, waiting time, machine availability, and other relevant metrics. Numerical simulation is carried out to assess the influence of input parameters on performance measures. Moreover, a machine learning approach employing regression methods is employed to predict the waiting time for failed machines to initiate their repair within the system. This combination of numerical simulation and machine learning analysis provides a comprehensive understanding of the system’s performance and enables accurate predictions of waiting times. Cost optimization is also performed for the FTMS using trapezoidal fuzzy numbers as cost elements by employing meta-heuristic techniques based on particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms.

Gene selection for high dimensional biological datasets using hybrid island binary artificial bee colony with chaos game optimization

Microarray technology, as applied to the fields of bioinformatics, biotechnology, and bioengineering, has made remarkable progress in both the treatment and prediction of many biological problems. However, this technology presents a critical challenge due to the size of the numerous genes present in the high-dimensional biological datasets associated with an experiment, which leads to a curse of dimensionality on biological data. Such high dimensionality of real biological data sets not only increases memory requirements and training costs, but also reduces the ability of learning algorithms to generalise. Consequently, multiple feature selection (FS) methods have been proposed by researchers to choose the most significant and precise subset of classified genes from gene expression datasets while maintaining high classification accuracy. In this research work, a novel binary method called iBABC-CGO based on the island model of the artificial bee colony algorithm, combined with the chaos game optimization algorithm and SVM classifier, is suggested for FS problems using gene expression data. Due to the binary nature of FS problems, two distinct transfer functions are employed for converting the continuous search space into a binary one, thus improving the efficiency of the exploration and exploitation phases. The suggested strategy is tested on a variety of biological datasets with different scales and compared to popular metaheuristic-based, filter-based, and hybrid FS methods. Experimental results supplemented with the statistical measures, box plots, Wilcoxon tests, Friedman tests, and radar plots demonstrate that compared to prior methods, the proposed iBABC-CGO exhibit competitive performance in terms of classification accuracy, selection of the most relevant subset of genes, data variability, and convergence rate. The suggested method is also proven to identify unique sets of informative, relevant genes successfully with the highest overall average accuracy in 15 tested biological datasets. Additionally, the biological interpretations of the selected genes by the proposed method are also provided in our research work.

A New Integrated Approach for Cloud Service Composition and Sharing Using a Hybrid Algorithm

The concept of a “Smart City” emphasizes the need to employ information and communication technologies to strengthen the quality, connectivity, and efficiency of various municipal services. Cloud computing and the Internet of Things are shaping future tech. Both ideas greatly impact smart city application and solution development. Cloud computing is amazing at managing and storing remote service access. Several companies have switched to cloud leasing to reduce local resource burden. Due to the intricacy and flexibility of cloud-maintained services, selecting jobs that best suit client needs should be optimized. Quality of service criteria for each cloud service are the best tools for choosing and optimizing cloud carriers. Genetic algorithms (GAs) and ant colony optimization (ACO) are combined to make cloud computing. It is discovered that the recommended ACO + GA obtains an accuracy of 82% when compared to existing methods of energy- and reliability-aware multiobjective optimization method and the hybrid cuckoo particles swarm, artificial bee colony optimization (CPS + ABCO) where accuracy is 68% and 75%, respectively.

Solving line balancing and AGV scheduling problems for intelligent decisions using a Genetic-Artificial bee colony algorithm

Due to the rapid advancement of technology, the demand for electronic devices in various sectors such as consumer electronics, automotive, telecommunications, healthcare, and industrial applications, as well as customized printed circuit board (PCB) products, has significantly increased. Balancing the PCB assembly line is crucial for improving productivity to meet market demand, which means balancing the workload distributed among various assembly stations on the assembly line. However, the workload balancing depends on material-handling systems in production environments that facilitate the transportation of raw materials to the buffer storage of the assembly stations. In the PCB assembly system, the material handling is carried out using automated guided vehicles (AGVs). This paper studies the assembly line balancing and AGV scheduling collectively because of their dependency on each other. A mixed integer linear programming (MILP) model is formulated to balance the workload distribution among stations and schedule the AGVs. An existing intelligent platform of the real-life PCB industry is considered to solve this integrated problem with intelligent decisions. The platform includes three layers modules: physical layer, data management layer and application service layer. A novel genetic artificial bee colony (GABC) algorithm is proposed and embedded with an application service layer to optimize the current problem and give optimum solutions for the real-life physical layer. The proposed GABC algorithm incorporates the operators of the genetic algorithm (GA) i.e., crossover and mutation into the search process of the ABC algorithm. Additionally, the greedy selection feature is employed in GABC which significantly enhances the exploitation capabilities, leading to faster convergence, higher-quality solutions, and improved robustness. The performance of the proposed GABC algorithm is tested based on different parameters by comparing the results with GA, ABC and PSO algorithms. Experimental analysis indicates that the proposed GABC algorithm outperforms the compared algorithms. Therefore, the yielded solutions in terms of prompt responses help managers to expedite the production through intelligent decision-making based on customer demands.

Bio inspired Boolean artificial bee colony based feature selection algorithm for sentiment classification

Over the past few years, sentiment analysis has become most predominant aspect to be extracted in the modern digital era. Due to digitization all over the world, the number of existing digital documents increasing exponentially day by day. Analyzing such documents to extract the exact meaning itself becomes a tedious task. And analyzing those documents in sentimental point of view has increased the modality of difficultness to another level. In this research work, an effective bio-inspired filter-based feature selection algorithm is proposed to effectively handle the documents from sentiment point of view. A popular bio inspired algorithm called Artificial Bee Colony algorithm is modified using Boolean operators to effectively handle feature selection problem in classifying the documents from sentimental aspect. A total of 9 different documents instances are taken for evaluating the performance of proposed model. A total of 5 different filter-based measures are used to quantify the working model of the algorithm. The outputs are analyzed to state-of-the-art algorithms, and the comparative results demonstrate a substantial improvement over the existing models.

Directions for modifying the artificial bee colony algorithm to optimize control parameters for complex systems

In recent years, bioinspired algorithms based on the use of a population approach and a probabilistic search strategy have become especially popular among researchers involved in multidimensional and multicriteria optimization. Such algorithms are based on the principles of cooperative behavior of a decentralized self-organizing colony of living organisms (bees, ants, birds, etc.) to achieve certain goals (for example, to meet nutritional needs). However, their practical application encounters a number of difficulties leading to a decrease in convergence. This article discusses the possibility of modifying the artificial bee colony algorithm by using a hybridization strategy with various data mining methods. One of these difficulties is the lack of a reasonable approach to determining initial search positions. As a solution, it is proposed to divide the population into clusters, the centers of which will be the initial positions. The need for interaction between individuals makes it advisable to use fuzzy clustering, which allows the formation of intersecting clusters. Another difficulty is associated with the choice of “free” parameters, for which the authors have not developed recommendations for choosing their optimal values. To solve this problem, it is proposed to use the idea of coevolution, which consists in the parallel launch of several interacting subpopulations, for each of which different “settings” are applied. The proposed algorithm is applicable to multidimensional optimization tasks, in which it is necessary to find such a combination of different types of elements belonging to some “large” population that will ensure the achievement of the maximum effect under given restrictions. Examples of such tasks are determining the species and quantitative composition of plants to form the terrestrial ecosystem of a carbon farm or mass recruiting, which consists of selecting a large number of personnel for the same positions.

Exploring low-carbon and sustainable urban transformation design using ChatGPT and artificial bee colony algorithm

The aim of this study is to provide effective solutions to promote the transition of resource-based cities to low carbon and sustainable development. Firstly, this study investigates the background of low-carbon transformation of resource-based cities. Secondly, it introduces the application method of Chat Generative Pre-trained Transformer (ChatGPT) in detail. Finally, this study proposes a comprehensive application of ChatGPT and artificial bee colony (ABC) algorithm. The results show that the average energy utilization efficiency improvement index of the group using ChatGPT is 0.11. The average energy efficiency improvement index of the group using ABC algorithm is 0.02 higher than that of the control group. The integrated application of ChatGPT and ABC algorithm can further improve the low-carbon transformation effect of resource-based cities and achieve the goal of green development.

Optimizing LQR controllers: A comparative study

Linear Quadratic Regulator is one of the most common ways to control a linear system. Despite Linear Quadratic Regulator’s (LQR) strong performance and solid resilience, developing these controllers have been challenging, largely because there is no reliable way to choose the Q and R weighing matrices. In this regard a deterministic method is used for choosing them in this paper, providing the designers a precise control over performance variables. An Artificial Bee Colony (ABC) optimisation is also used to find the sub-optimal gain matrices along with an analytical approach based on neural networks. A comparative study of the three approaches is performed using MATLAB simulations. These three approaches are applied on an inverted pendulum–cart system due to its complexity and dexterity. The results show that all the three methods show comparable performances with the proposed analytical method being slightly better in terms of transient characteristics.

Ensembled CNN with artificial bee colony optimization method for esophageal cancer stage classification using SVM classifier.

Esophageal cancer (EC) is aggressive cancer with a high fatality rate and a rapid rise of the incidence globally. However, early diagnosis of EC remains a challenging task for clinicians. To help address and overcome this challenge, this study aims to develop and test a new computer-aided diagnosis (CAD) network that combines several machine learning models and optimization methods to detect EC and classify cancer stages. The study develops a new deep learning network for the classification of the various stages of EC and the premalignant stage, Barrett's Esophagus from endoscopic images. The proposed model uses a multi-convolution neural network (CNN) model combined with Xception, Mobilenetv2, GoogLeNet, and Darknet53 for feature extraction. The extracted features are blended and are then applied on to wrapper based Artificial Bee Colony (ABC) optimization technique to grade the most accurate and relevant attributes. A multi-class support vector machine (SVM) classifies the selected feature set into the various stages. A study dataset involving 523 Barrett's Esophagus images, 217 ESCC images and 288 EAC images is used to train the proposed network and test its classification performance. The proposed network combining Xception, mobilenetv2, GoogLeNet, and Darknet53 outperforms all the existing methods with an overall classification accuracy of 97.76% using a 3-fold cross-validation method. This study demonstrates that a new deep learning network that combines a multi-CNN model with ABC and a multi-SVM is more efficient than those with individual pre-trained networks for the EC analysis and stage classification.

No-Wait Open-Shop Scheduling Problems with Reverse Flows

Open shop scheduling has a special place in both production and optimization problems. This study investigates an assembly (direct flow) and disassembly (reverse flow) scheduling problem in an open shop environment where both are processed on the same machine, but only one is a no-wait operation. The objective is to minimize makespan of jobs on all machines. A mixed-integer linear program is developed. GAMS 25.1.1.2 is used to solve small size test problems. Differential Evolution (DE) Algorithm is applied to large-scale problems. A comparison of the computing results of this algorithm and the Genetic algorithm (GA), Whale Optimization Algorithm (WOA), Bat algorithm (BA), Artificial bee colony algorithm (ABC), and vibration damping optimization algorithm (VDO) is presented. Based on the results obtained, it has been found that there are no obvious differences between the performance of the algorithms, but the DE algorithm produces better solutions.

Joint Resource Allocation of UAV Aided Communication System Based on Multi-coding Artificial Bee Colony Algorithm

Joint Resource Allocation of UAV Aided Communication System Based on Multi-coding Artificial Bee Colony Algorithm

Multi-Objective Home Health Care Routing and Scheduling With Sharing Service via a Problem-Specific Knowledge-Based Artificial Bee Colony Algorithm

Multi-Objective Home Health Care Routing and Scheduling With Sharing Service via a Problem-Specific Knowledge-Based Artificial Bee Colony Algorithm

Land scene classification from remote sensing images using improved artificial bee colony optimization algorithm

The images obtained from remote sensing consist of background complexities and similarities among the objects that act as challenge during the classification of land scenes. Land scenes are utilized in various fields such as agriculture, urbanization, and disaster management, to detect the condition of land surfaces and help to identify the suitability of the land surfaces for planting crops, and building construction. The existing methods help in the classification of land scenes through the images obtained from remote sensing technology, but the background complexities and presence of similar objects act as a barricade against providing better results. To overcome these issues, an improved artificial bee colony optimization algorithm with convolutional neural network (IABC-CNN) model is proposed to achieve better results in classifying the land scenes. The images are collected from aerial image dataset (AID), Northwestern Polytechnical University-Remote Sensing Image Scene 45 (NWPU-RESIS45), and University of California Merced (UCM) datasets. IABC effectively selects the best features from the extracted features using visual geometry group-16 (VGG-16). The selected features from the IABC are provided for the classification process using multiclass-support vector machine (MSVM). Results obtained from the proposed IABC-CNN achieves a better classification accuracy of 96.40% with an error rate 3.6%.

Modeling and Forecasting of Water Demand in the City of Istanbul Using Artificial Neural Networks Optimized with Rao Algorithms

In this study, a hybrid artificial neural network (ANN)-Rao series (Rao_1, Rao_2, and Rao_3) algorithm model was developed to analyze water consumption in Istanbul province, Turkey. A multiple linear regression (MLR) model was developed and an ANN was also trained with back-propagation (BP) artificial bee colony (ABC) algorithms for comparison. Gross domestic product and population data were treated as independent variables. To test the accuracy of the presently developed hybrid model, its outputs were compared with those of ANN-BP, ANN-ABC, and MLR models. Error values calculated for the test set indicated that the ANN-Rao_3 algorithm outperformed the MLR, ANN-BP, and ANN-ABC reference models as well as ANN-Rao_1 and ANN-Rao_2 algorithms. Therefore, using the ANN-Rao_3 model, water consumption forecasts for Istanbul province were generated out to 2035 for low-, expected-, and high-water demand conditions. The model-generated forecasts indicate that the water requirements of Istanbul in 2035 will be between 1182.95 and 1399.54 million m3, with the upper-range estimates outpacing supplies. According to low and expected scenarios, there will be no problem in providing the water needs of Istanbul until 2035. However, according to high scenario, water needs of Istanbul will not be provided as of 2033.Therefore, water conservation policies should be enacted to ensure provision of the water needs of Istanbul province from 2033 onward.

Artificial Bee Colony Algorithm with Adaptive Parameter Space Dimension: A Promising Tool for Geophysical Electromagnetic Induction Inversion

Frequency-domain electromagnetic induction (FDEMI) methods are frequently used in non-invasive, area-wise mapping of the subsurface electromagnetic soil properties. A crucial part of data analysis is the geophysical inversion of the data, resulting in either conductivity and/or magnetic susceptibility subsurface distributions. We present a novel 1D stochastic optimization approach that combines dimension-adapting reversible jump Markov chain Monte Carlo (MCMC) with artificial bee colony (ABC) optimization for geophysical inversion, with specific application to frequency-domain electromagnetic induction (FDEMI) data. Several solution models of simplified model geometry and a variable number of model knots, which are found by the inversion method, are used to create re-sampled resulting average models. We present synthetic test inversions using conductivity models based on 14 direct-push (DP) EC logs from Greece, Italy, and Germany, as well as field data applications using multi-coil FDEMI devices from three sites in Azerbaijan and Germany. These examples show that the method can effectively lead to solutions that resemble the known DP input models or image reasonable stratigraphic and archaeological features in the field data. Neighboring 1D solutions on field data examples show high coherence along profiles even though each 1D inversion is independently handled. The computational effort for one 1D inversion is less than 120,000 forward calculations, which is much less than usually needed in MCMC inversions, whereas the resulting models show more plausible solutions due to the dimension-adapting properties of the inversion method.

Predicting mechanical properties lower upper bound for cold-rolling strip by machine learning-based artificial intelligence

The mechanical properties serve as crucial quality indicators for cold-rolled strips. For a long time, the mechanical properties mechanism and data-driven models can't comprehensively consider sufficient factors to achieve high-accuracy prediction due to the "data-isolated island" between production lines. In this research, we introduce a multi-process collaborative platform based on the industrial internet system. This platform is designed to enable real-time collection of diverse and heterogeneous data from both upstream and downstream processes of cold rolling. On this basis, a novel mechanical properties interval prediction model is proposed using the sparrow search algorithm to optimize fast learning network under the LUBE framework. We trained the model by using a dataset collected from a large steel plant. Based on the rolling theory and Pearson correlation coefficient, 25 features are selected as the inputs of the prediction model. The experimental results and comparison show that the proposed model is feasible and outperforms other machine learning models, such as the artificial bee colony algorithm optimized extreme learning machine and back propagation neural network model.

A novel optimal allocation of STATCOM to enhance voltage stability in power networks

Utilizing a static synchronous compensator (STATCOM) in the electrical power grid greatly improves the grid's voltage profile by enhancing voltage stability. This article proposes a novel approach based on Mixed Integer Distributed Ant Colony Optimization (MIDACO) to determine the optimal STATCOM installation in the electrical power grid. This approach has two control variables to optimize: the STATCOM size and location. This optimization aims to enhance voltage stability with minimum cost by minimizing two objectives: the voltage deviation index and the STATCOM cost. Also, this article presents a sensitivity analysis to show the stochastic nature of MIDACO and to explain the effect of MIDACO parameters on the optimization approach and the process of reaching the optimal solution. The proposed method has been evaluated on three standard test systems: IEEE 14-bus, IEEE 57-bus, and IEEE 118-bus. In addition, the MIDACO results are compared to those of the artificial bee colony algorithm, the genetic algorithm, and particle swarm optimization.

Query Optimization in Distributed Database Based on Improved Artificial Bee Colony Algorithm

Query optimization is one of the key factors affecting the performance of database systems that aim to enact the query execution plan with minimum cost. Particularly in distributed database systems, due to the multiple copies of the data that are stored in different data nodes, resulting in the dramatic increase in the feasible query execution plans for a query statement. Because of the increasing volume of stored data, the cluster size of distributed databases also increases, resulting in poor performance of current query optimization algorithms. In this case, a dynamic perturbation-based artificial bee colony algorithm is proposed to solve the query optimization problem in distributed database systems. The improved artificial bee colony algorithm improves the global search capability by combining the selection, crossover, and mutation operators of the genetic algorithm to overcome the problem of falling into the local optimal solution easily. At the same time, the dynamic perturbation factor is introduced so that the algorithm parameters can be dynamically varied along with the process of iteration as well as the convergence degree of the whole population to improve the convergence efficiency of the algorithm. Finally, comparative experiments conducted to assess the average execution cost of Top-k query plans generated by the algorithms and the convergence speed of algorithms under the conditions of query statements in six different dimension sets. The results demonstrate that the Top-k query plans generated by the proposed method have a lower execution cost and a faster convergence speed, which can effectively improve the query efficiency. However, this method requires more execution time.

Assessment of Landslide Susceptibility Using the PCA and ANFIS with Various Metaheuristic Algorithms

It is very important for the susceptibility assessment and disaster prediction of the region to effectively evaluate the landslide susceptibility. In this study, Particle Swarm Optimization (PSO), Artificial Bee Colony algorithm (ABC), Shuffled Frog Leaping Algorithm (SFLA) and Bat algorithm (BAT) are used to optimize Adaptive Neuro-Fuzzy Inference System (ANFIS) to evaluate the landslide susceptibility. 811 sample points were collected through remote sensing analysis and field investigation for susceptibility analysis. Fifteen landslide evaluation factors were quantified and normalized, and the Principal Component Analysis (PCA) method was used to compress them into 6 main factors. The accuracy analysis results of the area under the curve (AUC), Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) evaluation models show that the AUC values of PSO, ABC, SFLA and BAT are 93.6%, 96.2%, 90.8% and 86.1%, respectively. Among them, the accuracy of ABC is the highest. This study effectively evaluates the landslide susceptibility through a new neural network hybrid method, which provides a theoretical basis for landslide disaster susceptibility management.