Abstract: Bat algorithm (BA) is a population based stochastic search technique encouraged from the intrinsic manner of bee swarm seeking for their food source. BA has been mostly used to resolve diverse kind of optimization problems and one of major issue faced by BA is frequently captured in local optima meanwhile handling the complex real world problems. Many authors improved the standard BA with different mutation strategies but an exhausted comprehensive overview about mutation strategies is still lacking. This paper aims to furnish a concise and comprehensive study of problems and challenges that prevent the performance of BA. It has been tried to provide guidelines for the researchers who are active in the area of BA and its mutation strategies. The objective of this study is divided in two sections: primarily to display the improvement of BA with mutation strategies that may enhance the performance of standard BA up to great extent and secondly, to motivate the researchers and developers for using BA to solve the complex real world problems. This study presents a comprehensive survey of the various BA algorithms based on mutation strategies. It is anticipated that this survey would be helpful to study the BA algorithm in detail for the researcher.

Waqas Haider Bangyal, Jamil Ahmad, Hafiz Tayyab Rauf and Sobia Pervaiz, “An Overview of Mutation Strategies in Bat Algorithm ” International Journal of Advanced Computer Science and Applications(IJACSA), 9(8), 2018. http://dx.doi.org/10.14569/IJACSA.2018.090866

@article{Bangyal2018,
title = {An Overview of Mutation Strategies in Bat Algorithm },
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2018.090866},
url = {http://dx.doi.org/10.14569/IJACSA.2018.090866},
year = {2018},
publisher = {The Science and Information Organization},
volume = {9},
number = {8},
author = {Waqas Haider Bangyal and Jamil Ahmad and Hafiz Tayyab Rauf and Sobia Pervaiz}
}