Population Diversity Guided Dimension Perturbation for Artificial Bee Colony Algorithm

2021 ◽  
pp. 473-485
Author(s):  
Tao Zeng ◽  
Tingyu Ye ◽  
Luqi Zhang ◽  
Minyang Xu ◽  
Hui Wang ◽  
...  
2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Lijun Sun ◽  
Tianfei Chen ◽  
Qiuwen Zhang

As a novel swarm intelligence algorithm, artificial bee colony (ABC) algorithm inspired by individual division of labor and information exchange during the process of honey collection has advantage of simple structure, less control parameters, and excellent performance characteristics and can be applied to neural network, parameter optimization, and so on. In order to further improve the exploration ability of ABC, an artificial bee colony algorithm with random location updating (RABC) is proposed in this paper, and the modified search equation takes a random location in swarm as a search center, which can expand the search range of new solution. In addition, the chaos is used to initialize the swarm population, and diversity of initial population is improved. Then, the tournament selection strategy is adopted to maintain the population diversity in the evolutionary process. Through the simulation experiment on a suite of unconstrained benchmark functions, the results show that the proposed algorithm not only has stronger exploration ability but also has better effect on convergence speed and optimization precision, and it can keep good robustness and validity with the increase of dimension.


2021 ◽  
Vol 2083 (3) ◽  
pp. 032064
Author(s):  
Wenlong Hao ◽  
Bo Luo ◽  
Zhiyuan Zhang

Abstract In this paper, aiming at the shortcomings of slow convergence speed and weak local search ability of traditional artificial bee colony algorithm in path planning, an artificial bee colony algorithm based on balanced search factor is proposed for UAV path planning. Using a search strategy based on balanced search factor, the depth search is carried out while maintaining a certain population diversity. The global search ability and local development ability are balanced, the average accuracy of path planning is improved, the robustness of path planning is enhanced, and the ability to obtain better path solutions is improved.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wen Liu

Being prone to the shortcomings of premature and slow convergence rate of artificial bee colony algorithm, an improved algorithm was proposed. Chaotic reverse learning strategies were used to initialize swarm in order to improve the global search ability of the algorithm and keep the diversity of the algorithm; the similarity degree of individuals of the population was used to characterize the diversity of population; population diversity measure was set as an indicator to dynamically and adaptively adjust the nectar position; the premature and local convergence were avoided effectively; dual population search mechanism was introduced to the search stage of algorithm; the parallel search of dual population considerably improved the convergence rate. Through simulation experiments of 10 standard testing functions and compared with other algorithms, the results showed that the improved algorithm had faster convergence rate and the capacity of jumping out of local optimum faster.


2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Wei Mao ◽  
Heng-you Lan ◽  
Hao-ru Li

As one of the most recent popular swarm intelligence techniques, artificial bee colony algorithm is poor at exploitation and has some defects such as slow search speed, poor population diversity, the stagnation in the working process, and being trapped into the local optimal solution. The purpose of this paper is to develop a new modified artificial bee colony algorithm in view of the initial population structure, subpopulation groups, step updating, and population elimination. Further, depending on opposition-based learning theory and the new modified algorithms, an improvedS-type grouping method is proposed and the original way of roulette wheel selection is substituted through sensitivity-pheromone way. Then, an adaptive step with exponential functions is designed for replacing the original random step. Finally, based on the new test function versions CEC13, six benchmark functions with the dimensionsD=20andD=40are chosen and applied in the experiments for analyzing and comparing the iteration speed and accuracy of the new modified algorithms. The experimental results show that the new modified algorithm has faster and more stable searching and can quickly increase poor population diversity and bring out the global optimal solutions.


2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi

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


2013 ◽  
Vol 32 (12) ◽  
pp. 3326-3330
Author(s):  
Yin-xue ZHANG ◽  
Xue-min TIAN ◽  
Yu-ping CAO

Sign in / Sign up

Export Citation Format

Share Document