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 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.

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

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.

Sign in / Sign up

Export Citation Format

Share Document