Bat algorithm with recollection

Authors:
Wen Wang;Yong Wang;Xiaowei Wang
Affiliations:
College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China;College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China;College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China
Venue:
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Year:
2013

Citing 4
Cited 0

A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search

Computers & Mathematics with Applications
A group search optimizer for neural network training

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A novel genetic algorithm based on immunity

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bat algorithm(BA) is a new swarm intelligence optimization algorithm. However, bat algorithm has the obvious phenomenon of the premature convergence problem and is easily trapped into local optimum. In order to overcome the shortcoming of the BA algorithm, we proposed an improved bat algorithm called bat algorithm with recollection(RBA). Experiment were conducted on some benchmark functions. The experimental results show that the RBA can effectively avoid the premature convergence problem and has a good performance of global convergence property.