Open AccessExtension of Bat Algorithm on Standard Benchmark Functions
Author(s) -
ANJALI ANJALI,
Deepak Garg,
Abhishek Singh
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.e5889.018520
Subject(s) - benchmark (surveying) , generality , heuristics , local optimum , mathematical optimization , bat algorithm , computer science , heuristic , algorithm , mathematics , particle swarm optimization , psychology , geodesy , psychotherapist , geography
Meta heuristics are superior methods of finding, producing and even modifying heuristics that are able to solve various optimization problems. All Meta-heuristic algorithms are influenced by the nature. These types of algorithms tend to mimic the behaviour of biotic components in nature and are emerging as an effective way of solving global optimization algorithms. We have reviewed that no any algorithm is best for all applications due to lack of generality (no. of parameters), non-dynamic input values. So, this paper studied BAT algorithm deeply and found weakness in terms of non-dynamic pulse rate and loudness. In order to avoid being trapped into local optima these inputs are made dynamic with inclusion of levy Flight too. Performance of this proposed Modified BAT approach is evaluated using few standard benchmark functions. For justifying the superiority of Modified BAT, its performance has been compared with standard Bat algorithm too. From simulation it is found that dynamic pulse rate and dynamic loudness improve the performance of Bat algorithm in terms of results without being stuck at local optima and is more general.