Improved Artificial Bee Colony Using Sine-Cosine Algorithm for Multi-Level Thresholding Image Segmentation

Multilevel thresholding segmentation of color images is an important technology in various applications which has received more attention in recent years. The process of determining the optimal threshold values in the case of traditional methods is time-consuming. In order to mitigate the above problem, meta-heuristic algorithms have been employed in this field for searching the optima during the past few years. In this paper, an effective technique of Electromagnetic Field Optimization (EFO) algorithm based on a fuzzy entropy criterion is proposed, and in addition, a novel chaotic strategy is embedded into EFO to develop a new algorithm named CEFO. To evaluate the robustness of the proposed algorithm, other competitive algorithms such as Artificial Bee Colony (ABC), Bat Algorithm (BA), Wind Driven Optimization (WDO), and Bird Swarm Algorithm (BSA) are compared using fuzzy entropy as the fitness function. Furthermore, the proposed segmentation method is also compared with the most widely used approaches of Otsu’s variance and Kapur’s entropy to verify its segmentation accuracy and efficiency. Experiments are conducted on ten Berkeley benchmark images and the simulation results are presented in terms of peak signal to noise ratio (PSNR), mean structural similarity (MSSIM), feature similarity (FSIM), and computational time (CPU Time) at different threshold levels of 4, 6, 8, and 10 for each test image. A series of experiments can significantly demonstrate the superior performance of the proposed technique, which can deal with multilevel thresholding color image segmentation excellently.

Swarm intelligence is briefly defined as the collective behavior of decentralized and self-organized swarms. Self-organization and labor division are the two key components of swarm intelligence. Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence-based algorithms. The behavior of bees in ABC algorithm satisfies the self-organization features, but there is no specific labor division mechanism in ABC algorithm. In this work, we propose an improved ABC algorithm called labor division artificial bee colony (LDABC) algorithm by incorporating the labor division mechanism into ABC algorithm, which is achieved by individual specialization and role plasticity. We specify three different search methods for employed bees, onlooker bees and scout bees to realize individual specialization, these search methods are related to food source quality, enable bees to maximize exploitation of food source. Role plasticity is achieved by combining with cellular automata, where the roles of bees are not static but vary with their surrounding environment, enable bees not to limit to one search method. The different search modes and the flexibility of the search behaviors make our algorithm achieve a better balance between exploration and exploitation. The experimental results tested on 13 benchmark functions and CEC-2013 test functions demonstrate a competitive performance.

The artificial bee colony (ABC) algorithm is an important branch of evolutionary algorithms and has been shown to be competitive with other algorithms for solving optimisation problems. However, there are always some insufficiencies in ABC algorithm such as lower convergence speed and easily get trapped in the local optima. To increase depth search capabilities of onlooker bees and ensure scout bees do not discard the current optimal solution, we proposed a modified ABC algorithm (denoted as ORABC) based on the optimisation strategy and retained strategy of the best individual in this paper. Compared with ABC algorithm, ABC* (added retained strategy to ABC) and ORABC algorithm, experiments are conducted on a set of numerical benchmark functions. The numerical simulation results demonstrate that ORABC algorithm improves the convergence characteristics of ABC algorithm and provides very remarkable performance in solving complex numerical optimisation problems compared to original algorithm.

INTRODUCTION: The artificial bee colony (ABC) algorithm is a nature-inspired technique used for solving different optimization problems. This paper presents a multi-hive ABC algorithm for solving constrained benchmark functions of CEC2006. The CEC2006 data set contains the global benchmark functions with different design variables, number and type of constraints. OBJECTIVES: The objective of the proposed work is to design and apply the GPGPU based multi-hive ABC algorithm to solve constrained optimization problems. METHODS: The proposed approach is a multi-population coarse-grained system implemented using General Purpose Graphics Processing Unit (GPGPU). The performance of the proposed approach is compared with the serial ABC algorithm for eleven benchmark functions and results in the literature. The multi-hive ABC algorithm has multiple hives, each running separate ABC algorithm on different cores of GPGPU. RESULTS: The proposed approach provides global best solutions in significantly reduced time for all benchmark functions. The speed-up obtained is approximately 7X to 9X. The GPGPU device utilization is approximately 57% to 91%. CONCLUSION: The GPGPU based multi-hive ABC algorithm is a found good with respect to best results, speed up factor and GPU utilization to solve constrained optimization problems.

In this article, a new contrast enhancement approach is presented for quality enhancement of low-contrast satellite images. The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). The method employs the ABC technique to learn the parameters of the adaptive thresholding function required for optimum enhancement. In this approach, the input image is primarily decomposed into four sub-bands through DWT, and then each sub-band of DWT is optimized through the ABC algorithm. After that, a singular value matrix of the low–low thresholded sub-band image is estimated and, finally, the enhanced image is constructed by applying inverse DWT. The results obtained through this method reveal that the proposed methodology gives better performance in terms of peak signal-to-noise ratio (PSNR), mean square error (MSE), and mean and standard deviation as compared to General Histogram Equalization (GHE), Discrete Cosine Transform and Singular Value Decomposition (DCT-SVD), DWT-SVD, Particle Swarm Optimization (PSO), and modified versions of the PSO-based enhancement approach.

As a popular evolutionary algorithm, artificial bee colony (ABC) algorithm has been successfully applied into the threshold-based image segmentation problem. Based on our analysis, we find that the Otsu segmentation function is separable which means each variable is independent. Due to its one-dimensional search strategy and relative power global but poorer local search abilities, ABC could find an acceptable but not precise segmentation results. For making more precise search and further enhancing the achievements on image segmentation, we propose an Otsu segmentation method based on a new ABC algorithm with an improved scout bee strategy. Different from the traditional scout bee strategy, we use a local search strategy when a bee stagnates for a defined value. The experimental results on Berkeley segmentation database demonstrate the effectiveness of our algorithm.

In this paper, the controller design for DC servomotor is proposed using sine cosine algorithm (SCA). The proportional-integral-derivative (PID) controller is designed to control the DC servo-motor. The tuning of PID controller is completed using SCA algorithm by minimizing the integral-square-error (ISE). The SCA algorithm is utilized due to its efficacy. The step and impulse responses are plotted for the controller designed. Additionally, the time domain specifications are listed for the designed controller. The results tabulated are showing that SCA is a good choice for designing the controller for DC servo- motor.

A self adaptive hybrid enhanced artificial bee colony algorithm for continuous optimization problems

Nature is a great source of inspiration for solving complex problems in real-world. In this paper, a hybrid nature-inspired algorithm is proposed for feature selection problem. Traditionally, the real-world datasets contain all kinds of features informative as well as non-informative. These features not only increase computational complexity of the underlying algorithm but also deteriorate its performance. Hence, there an urgent need of feature selection method that select an informative subset of features from high dimensional without compromising the performance of the underlying algorithm. In this paper, we select an informative subset of features and perform cluster analysis by employing a cross breed approach of binary particle swarm optimization (BPSO) and sine cosine algorithm (SCA) named as hybrid binary particle swarm optimization and sine cosine algorithm (HBPSOSCA). Here, we employ a V-shaped transfer function to compute the likelihood of changing position for all particles. First, the effectiveness of the proposed method is tested on ten benchmark test functions. Second, the HBPSOSCA is used for data clustering problem on seven real-life datasets taken from the UCI machine learning store and gene expression model selector. The performance of proposed method is tested in comparison to original BPSO, modified BPSO with chaotic inertia weight (C-BPSO), binary moth flame optimization algorithm, binary dragonfly algorithm, binary whale optimization algorithm, SCA, and binary artificial bee colony algorithm. The conducted analysis demonstrates that the proposed method HBPSOSCA attain better performance in comparison to the competitive methods in most of the cases.

The Economic Load Dispatch (ELD) is considered to minimize the only fuel cost in power system planning and operation. Due to environmental issues, the emission amount released by thermal power generation should be considered in minimizing the total cost generation as well. This make the power dispatch problem become multi-objective problem that called Economic and Emission Load Dispatch (EELD). This paper investigates the performances of Artificial Bee colony (ABC) algorithm for determining optimal solution for EELD problem. In this paper, the EELD problem is formulated as a single objective problem by taking minimization of total cost and emission level as separated objective. The cost characteristic of thermal generator considered the effect of opening and closing of the valve for practical application. The ABC algorithm has been tested on standard test systems which is 10-generating unit test system in order to validate the effectiveness of proposed ABC algorithm. The results obtained have been compared with reported result by other methods in literature. From the result, it found that ABC algorithm is better than other methods for minimizing fuel cost of thermal power generation and obtained comparative results in reducing the emission level.

Introduction:Reliability analysis is a good tool to deal with the uncertainty and has been widely used in the engineering system. The first order reliability method (FORM) is generally used to calculate the reliability index but FORM is time-consuming and requires derivative computing.Methods:Artificial Bee Colony (ABC) algorithm is a very simple, robust and population-based stochastic optimization algorithm. In this study, an ABC-based reliability analysis was proposed to calculate the reliability index of engineering system through combining Artificial Bee Colony (ABC) algorithm with FORM. FORM was adopted to calculate the reliability index and design point. ABC is used to solve the constrained optimization about FORM. The procedure of ABC-based reliability analysis was presented in detail.Results and Conclusion:The proposed method was verified by two classic examples and then applied to geotechnical engineering. The results show that the ABC algorithm can effectively solve the global optimization problem in FORM. Results demonstrate that ABC-based reliability analysis is a good approach to obtain the reliability index and design point with a good accuracy so that it can be applied to analyze the reliability of a complex engineering system.

Archive-based multi-criteria Artificial Bee Colony algorithm for whole test suite generation

Artificial bee colony algorithm with gene recombination for numerical function optimization

Artificial Bee Colony (ABC) algorithm is the most popular add-on to class of swarm intelligence based meta-heuristic which is evolved to resolve the complex real world optimization problems. Most of the swarm intelligence based algorithms face the problem of stagnation, and premature convergence and ABC is not an exception. To reduce the chance of these problems as well as to control equilibrium between intensification and diversification capabilities of ABC, a unique variant of ABC is intended. In this intended variant, the employed bee stage, as well as onlooker bee stage of ABC algorithm is modified by taking inspiration from a local best candidate as well as the global best candidate. The intended ABC variant is named as Lbest Gbest ABC (LGABC) algorithm. The accuracy and efficiency of LGABC have examined over 12 benchmark functions and evaluated with the basic ABC, best so far ABC, Gbest ABC and Modified ABC and found that it may be an efficient contender in the field of swarm intelligence based algorithms.

Multilevel image thresholding presents a computational challenge as the number of thresholds increases, requiring efficient optimization techniques. The artificial bee colony (ABC) algorithm is a widely used metaheuristic for addressing this problem. Despite the good performance of the ABC algorithm, it struggles with an inadequate balance between discovering new solutions and refining existing ones. This paper presents the globally informed artificial bee colony (giABC), an enhanced ABC variant, proposed for multilevel color image thresholding. To overcome the limitations of the ABC algorithm, giABC introduces two novel mutation operators. In the employed phase, solutions are dynamically guided toward the mean of the current better solutions, ensuring a sustained balance between global exploration and local enhancement. In the onlooker phase, solutions are further refined by combining attraction to the global best solution with adaptation to promising solutions, significantly enhancing both convergence speed and solution quality. The proposed giABC, along with the ABC, its two variants and the chaotically-enhanced Rao algorithm, were tested on twelve color images from the Berkeley dataset using Otsu’s objective function. Experimental results show that giABC outperforms the other metaheuristics in accuracy, robustness, peak signal-to-noise ratio and structural similarity index, with Wilcoxon signed-rank tests confirming its statistical significance.