Micro Bat Algorithm for High Dimensional Optimization Problems

Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at explo...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2015-01, Vol.122 (12), p.1-10
Main Authors: Topal, Ali Osman, Altun, Oguz, Yildiz, Yunus Emre
Format: Article
Language:English
Subjects:
Algorithms
Balancing
Dynamics
Exploitation
Exploration
Optimization
Searching
Swarming
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at exploration. Dynamic Virtual Bats Algorithm (DVBA) is another bat inspired algorithm, which is proposed lately. Although the algorithm is fundamentally inspired from BA, it is conceptually very different. DVBA employs just two bats and uses role based search mechanism. It is very efficient in exploration but relatively poor in exploitation, when it comes to high dimensional problems. In this paper, a novel micro-bat algorithm ( BA) is proposed which possess the advantages of both algorithms. BA employs a very small population compared to its classical version. It combines the swarming technique of bats in Bat Algorithm with the role based search in Dynamic Virtual Bats Algorithm. Our empirical results demonstrate that the proposed BA achieves a good balance between exploration and exploitation. And it exhibits a better overall performance than the standard BA with larger and smaller populations on high dimensional problems.
ISSN:0975-8887
0975-8887
DOI:10.5120/21749-5015