scholarly journals Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony Pheromone

2021 ◽  
Vol 15 (16) ◽  
pp. 172
Author(s):  
Abdul Hadi Alaidi ◽  
Chen S Soong Der ◽  
Yeng Weng Leong
Keyword(s):  
Systematic Review ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Function Optimization ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Start Date ◽  
Computing Machinery ◽  
Bee Colony ◽  
Future Work

The artificial bee colony (ABC) is a well-studied algorithm developed to solve continuous function optimization problems by Karboga and Akay in 2009. ABC has been proven to be more effective than other biological-inspired algorithms with good exploration. However, ABC suffers from low exploitation and slow convergence in some cases. The ABC algorithm study has risen significantly over the past decade, with many researchers trying to improve ABC performance and apply it to solve problems. One method to enhance ABC is to borrow exploration technique from other algorithms. Researchers use pheromone, which is a technique used by Ant Colony optimization algorithm, to enhance ABC and addressed several aspects of using a pheromone to enhance the ABC. This systematic review aims to review and analysis articles about using pheromone to enhance ABC. Articles on related topics were systematically searched in four major databases namely Scopus, Web of Science, Association for Computing Machinery ACM and Google Scholar. To ensure that all research articles were considered the start date is not restrictions the search carry out till February 2021.Five articles were selected based on our inclusion and exclusion criteria for the systematic review. The results show that the use Pheromone to enhance ABC can increase the ABC exploitation ability and overcoming the late convergence. This paper also illustrates several potential pheromone using for future work.

scholarly journals Particle Swarm and Bacterial Foraging Inspired Hybrid Artificial Bee Colony Algorithm for Numerical Function Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Li Mao ◽  
Yu Mao ◽  
Changxi Zhou ◽  
Chaofeng Li ◽  
Xiao Wei ◽  
...  
Keyword(s):  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Function Optimization ◽  
Local Optimum ◽  
Search Range ◽  
Bacterial Foraging Optimization ◽  
Numerical Function ◽  
Bacterial Foraging ◽  
Bee Colony

Artificial bee colony (ABC) algorithm has good performance in discovering the optimal solutions to difficult optimization problems, but it has weak local search ability and easily plunges into local optimum. In this paper, we introduce the chemotactic behavior of Bacterial Foraging Optimization into employed bees and adopt the principle of moving the particles toward the best solutions in the particle swarm optimization to improve the global search ability of onlooker bees and gain a hybrid artificial bee colony (HABC) algorithm. To obtain a global optimal solution efficiently, we make HABC algorithm converge rapidly in the early stages of the search process, and the search range contracts dynamically during the late stages. Our experimental results on 16 benchmark functions of CEC 2014 show that HABC achieves significant improvement at accuracy and convergence rate, compared with the standard ABC, best-so-far ABC, directed ABC, Gaussian ABC, improved ABC, and memetic ABC algorithms.

scholarly journals A Modification Artificial Bee Colony Algorithm for Optimization Problems

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Jun-Hao Liang ◽  
Ching-Hung Lee
Keyword(s):  
Mobile Robot ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Computational Effort ◽  
Function Optimization ◽  
Cooperative Strategy ◽  
Robot System ◽  
Bee Colony ◽  
And Performance

This paper presents a modified artificial bee colony algorithm (MABC) for solving function optimization problems and control of mobile robot system. Several strategies are adopted to enhance the performance and reduce the computational effort of traditional artificial bee colony algorithm, such as elite, solution sharing, instant update, cooperative strategy, and population manager. The elite individuals are selected as onlooker bees for preserving good evolution, and, then, onlooker bees, employed bees, and scout bees are operated. The solution sharing strategy provides a proper direction for searching, and the instant update strategy provides the newest information for other individuals; the cooperative strategy improves the performance for high-dimensional problems. In addition, the population manager is proposed to adjust population size adaptively according to the evolution situation. Finally, simulation results for optimization of test functions and tracking control of mobile robot system are introduced to show the effectiveness and performance of the proposed approach.

Research of Parallel Artificial Bee Colony Algorithm Based on MPI

2013 ◽  
Vol 380-384 ◽  
pp. 1430-1433 ◽  
Author(s):  
Ying Sen Hong ◽  
Zhen Zhou Ji ◽  
Chun Lei Liu
Keyword(s):  
Parallel Algorithm ◽  
Message Passing ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Complex Function ◽  
Function Optimization ◽  
Search Performance ◽  
Bee Colony ◽  
Long Time

Artificial bee colony algorithm is a smart optimization algorithm based on the bees acquisition model. A long time for the search of the artificial bee colony algorithm, in this paper we propose a parallel algorithm of artificial bee colony algorithm (MPI-ABC), with an application of a parallel programming environment MPI, using the programming mode of message passing rewriting the serial algorithm in parallel. Finally, this paper compare both serial and parallel algorithm with testing on complex function optimization problems. The experimental results show that the algorithm is effective to improve the search performance, especially for high-dimensional complex optimization problem.

scholarly journals An Adaptive Hybrid Ant Colony Optimization Algorithm for The Classification Problem

2019 ◽  
Vol 48 (4) ◽  
pp. 590-601
Author(s):  
Anxiang Ma ◽  
Xiaohong Zhang ◽  
Changsheng Zhang ◽  
Bin Zhang
Keyword(s):  
Artificial Bee Colony ◽  
Classification Problem ◽  
Ant Colony ◽  
Classification Rules ◽  
Optimization Strategy ◽  
Ant Colony Optimization Algorithm ◽  
Artificial Bee Colony Optimization ◽  
Bee Colony ◽  
Bee Colony Optimization ◽  
Rule Evaluation

Classification is an important data analysis and data mining technique. Taking into account the comprehensibility of the classifier generated, an adaptive hybrid ant colony optimization algorithm called A_HACO is proposed which can effectively solve classification problem and get the comprehensible classification rules at the same time. The algorithm incorporates the artificial bee colony optimization strategy into the ant colony algorithm. The ant colony global optimization process is used to adaptively select the appropriate rule evaluation function for the data set given. Based on the classification rules obtained, the artificial bee colony optimization strategy is used to tackle the continuous attributes for further optimization of classification rules. This approach is evaluated experimentally using different standard real datasets, and compared with some proposed related classification algorithms. It shows that A_HACO can adaptively select the appropriate rule evaluation function and has better accuracy compared with related works.

scholarly journals A Novel Artificial Bee Colony Algorithm for Function Optimization

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Song Zhang ◽  
Sanyang Liu
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Function Optimization ◽  
Experimental Results ◽  
Knapsack Problems ◽  
Search Process ◽  
Challenging Problem ◽  
Exploration And Exploitation ◽  
Bee Colony

It is known that both exploration and exploitation are important in the search equations of ABC algorithms. How to well balance the two abilities in the search process is still a challenging problem in ABC algorithms. In this paper, we propose a novel artificial bee algorithm named as “NABC,” by incorporating the information of the global best solution into the solution search equation of the onlookers stage to improve the exploitation. At the same time, we improve the search equation of the employed bees to keep the exploration. The experimental results of NABC tested on a set of 11 numerical benchmark functions show good performance and fast convergence in solving function optimization problems, compared with variant ABC, DE, and PSO algorithms. The application of NABC on solving five standard knapsack problems shows its effectiveness and practicability.

scholarly journals A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1211
Author(s):  
Ivona Brajević
Keyword(s):  
Integer Programming ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Minimax Problems ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Effective Performance ◽  
Complex Optimization ◽  
Overall Performance ◽  
Integer Programming Problems

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document