Differential Operators Embedded Artificial Bee Colony Algorithm

2011 ◽  
Vol 2 (3) ◽  
pp. 1-14 ◽  
Author(s):  
Tarun Kumar Sharma ◽  
Millie Pant
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Differential Operators ◽  
Optimization Problems ◽  
Numerical Results ◽  
Benchmark Problems ◽  
Continuous Space ◽  
Abc Algorithm ◽  
Bee Colony

Artificial Bee Colony (ABC) is one of the most recent nature inspired (NIA) algorithms based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuous space. However, it has been observed that the structure of ABC is such that it supports exploration more in comparison to exploitation. In order to maintain a balance between these two antagonist factors, this paper suggests incorporation of differential evolution (DE) operators in the structure of basic ABC algorithm. The proposed algorithm called DE-ABC is validated on a set of 10 benchmark problems and the numerical results are compared with basic DE and basic ABC algorithm. The numerical results indicate that the presence of DE operators help in a significant improvement in the performance of ABC algorithm.

Differential Operators Embedded Artificial Bee Colony Algorithm

2013 ◽  
pp. 149-163
Author(s):  
Tarun Kumar Sharma ◽  
Millie Pant
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Differential Operators ◽  
Optimization Problems ◽  
Numerical Results ◽  
Benchmark Problems ◽  
Continuous Space ◽  
Abc Algorithm ◽  
Bee Colony

Artificial Bee Colony (ABC) is one of the most recent nature inspired (NIA) algorithms based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuous space. However, it has been observed that the structure of ABC is such that it supports exploration more in comparison to exploitation. In order to maintain a balance between these two antagonist factors, this paper suggests incorporation of differential evolution (DE) operators in the structure of basic ABC algorithm. The proposed algorithm called DE-ABC is validated on a set of 10 benchmark problems and the numerical results are compared with basic DE and basic ABC algorithm. The numerical results indicate that the presence of DE operators help in a significant improvement in the performance of ABC algorithm.

scholarly journals A Novel Optimization Algorithm Combing Gbest-Guided Artificial Bee Colony Algorithm with Variable Gradients

2020 ◽  
Vol 10 (10) ◽  
pp. 3352
Author(s):  
Xiaodong Ruan ◽  
Jiaming Wang ◽  
Xu Zhang ◽  
Weiting Liu ◽  
Xin Fu
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Numerical Test ◽  
Stochastic Algorithm ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Novel Algorithm

The artificial bee colony (ABC) algorithm, which has been widely studied for years, is a stochastic algorithm for solving global optimization problems. Taking advantage of the information of a global best solution, the Gbest-guided artificial bee colony (GABC) algorithm goes further by modifying the solution search equation. However, the coefficient in its equation is based only on a numerical test and is not suitable for all problems. Therefore, we propose a novel algorithm named the Gbest-guided ABC algorithm with gradient information (GABCG) to make up for its weakness. Without coefficient factors, a new solution search equation based on variable gradients is established. Besides, the gradients are also applied to differentiate the priority of different variables and enhance the judgment of abandoned solutions. Extensive experiments are conducted on a set of benchmark functions with the GABCG algorithm. The results demonstrate that the GABCG algorithm is more effective than the traditional ABC algorithm and the GABC algorithm, especially in the latter stages of the evolution.

Hybrid Artificial Bee Colony Algorithm with Differential Evolution and Free Search for Numerical Function Optimization

2016 ◽  
Vol 25 (04) ◽  
pp. 1650020 ◽  
Author(s):  
Lian Lian ◽  
Fu Zaifeng ◽  
Yang Guangfei ◽  
Huang Yi
Keyword(s):  
Differential Evolution ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Robustness Analysis ◽  
Selection Strategy ◽  
Local Optimum ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Free Search

Artificial bee colony (ABC) algorithm invented by Karaboga has been proved to be an efficient technique compared with other biological-inspired algorithms for solving numerical optimization problems. Unfortunately, convergence speed of ABC is slow when working with certain optimization problems and some complex multimodal problems. Aiming at the shortcomings, a hybrid artificial bee colony algorithm is proposed in this paper. In the hybrid ABC, an improved search operator learned from Differential Evolution (DE) is applied to enhance search process, and a not-so-good solutions selection strategy inspired by free search algorithm (FS) is introduced to avoid local optimum. Especially, a reverse selection strategy is also employed to do improvement in onlooker bee phase. In addition, chaotic systems based on the tent map are executed in population initialization and scout bee's phase. The proposed algorithm is conducted on a set of 40 optimization test functions with different mathematical characteristics. The numerical results of the data analysis, statistical analysis, robustness analysis and the comparisons with other state-of-the-art-algorithms demonstrate that the proposed hybrid ABC algorithm provides excellent convergence and global search ability.

scholarly journals A Modified Artificial Bee Colony Algorithm forp-Center Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Alkın Yurtkuran ◽  
Erdal Emel
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
State Of The Art ◽  
Benchmark Problems ◽  
Center Problem ◽  
Exploration And Exploitation ◽  
Abc Algorithm ◽  
Coding Schemes ◽  
Bee Colony ◽  
Bee Colonies

The objective of thep-center problem is to locatep-centers on a network such that the maximum of the distances from each node to its nearest center is minimized. The artificial bee colony algorithm is a swarm-based meta-heuristic algorithm that mimics the foraging behavior of honey bee colonies. This study proposes a modified ABC algorithm that benefits from a variety of search strategies to balance exploration and exploitation. Moreover, random key-based coding schemes are used to solve thep-center problem effectively. The proposed algorithm is compared to state-of-the-art techniques using different benchmark problems, and computational results reveal that the proposed approach is very efficient.

An artificial bee colony algorithm with adaptive heterogeneous competition for global optimization problems

2020 ◽  
Vol 93 ◽  
pp. 106391
Author(s):  
Xianghua Chu ◽  
Fulin Cai ◽  
Da Gao ◽  
Li Li ◽  
Jianshuang Cui ◽  
...  
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Bee Colony

scholarly journals Artificial bee colony algorithm variants on constrained optimization

2017 ◽  
Vol 7 (1) ◽  
pp. 98-111 ◽  
Author(s):  
Bahriye Basturk Akay ◽  
Dervis Karaboga
Keyword(s):  
Constrained Optimization ◽  
Optimization Algorithm ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Abc Algorithm ◽  
Constrained Problems ◽  
Bee Colony ◽  
The Stability ◽  
Feasible Space

Optimization problems are generally classified into two main groups:unconstrained and constrained. In the case of constrainedoptimization, special techniques are required to handle withconstraints and produce solutions in the feasible space. Intelligentoptimization techniques that do not make assumptions on the problemcharacteristics are preferred to produce acceptable solutions to theconstrained optimization problems. In this study, the performance ofartificial bee colony algorithm (ABC), one of the intelligentoptimization techniques, is investigated on constrained problems andthe effect of some modifications on the performance of the algorithmis examined. Different variants of the algorithm have been proposedand compared in terms of efficiency and stability. Depending on theresults, when DE operators were integrated into ABC algorithm'sonlooker phase while the employed bee phase is retained as in ABCalgorithm, an improvement in the performance was gained in terms ofthe best solution in addition to preserving the stability of thebasic ABC. The ABC algorithm is a simple optimization algorithm thatcan be used for constrained optimization without requiring a prioriknowledge.

Dynamic Swarm Artificial Bee Colony Algorithm

2012 ◽  
Vol 3 (4) ◽  
pp. 19-33 ◽  
Author(s):  
Harish Sharma ◽  
Jagdish Chand Bansal ◽  
K. V. Arya ◽  
Kusum Deep
Keyword(s):  
Global Optimization ◽  
Real World ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Probabilistic Approach ◽  
Population Based ◽  
Test Problems ◽  
Local Optima ◽  
Bee Colony

Artificial Bee Colony (ABC) optimization algorithm is relatively a simple and recent population based probabilistic approach for global optimization. ABC has been outperformed over some Nature Inspired Algorithms (NIAs) when tested over test problems as well as real world optimization problems. This paper presents an attempt to modify ABC to make it less susceptible to stick at local optima and computationally efficient. In the case of local convergence, addition of some external potential solutions may help the swarm to get out of the local valley and if the algorithm is taking too much time to converge then deletion of some swarm members may help to speed up the convergence. Therefore, in this paper a dynamic swarm size strategy in ABC is proposed. The proposed strategy is named as Dynamic Swarm Artificial Bee Colony algorithm (DSABC). To show the performance of DSABC, it is tested over 16 global optimization problems of different complexities and a popular real world optimization problem namely Lennard-Jones potential energy minimization problem. The simulation results show that the proposed strategies outperformed than the basic ABC and three recent variants of ABC, namely, the Gbest-Guided ABC, Best-So-Far ABC and Modified ABC.

Sign in / Sign up

Export Citation Format

Share Document