Journal
MATHEMATICAL PROBLEMS IN ENGINEERING
Volume 2021, Issue -, Pages -Publisher
HINDAWI LTD
DOI: 10.1155/2021/6636918
Keywords
-
Funding
- Research Intensified Grant Scheme (RIGS), Universiti Malaysia Terengganu [Fasa 1/2019, 55192/7]
Ask authors/readers for more resources
The paper introduces the Bat algorithm (BA) and the modified Bat algorithm (MBA) in swarm intelligence, where BA utilizes echolocation behavior of bats for search and MBA aims to enhance search capabilities. The study evaluates the performance of MBA using benchmark functions from the 2005 IEEE Congress on Evolutionary Computation, analyzing the impact of different temperature values on the algorithm.
In the last two decades, the field of global optimization has become very active, and, in this regard, many deterministic and stochastic algorithms were developed for solving various optimization problems. Among them, swarm intelligence (SI) is a stochastic algorithm that is more flexible and robust and has had the ability to find an optimum solution for high-dimensional optimization and search problems. SI-based algorithms are mainly inspired by the social behavior of fish schooling or bird flocking. Among the SI-based algorithms, Bat algorithm (BA) is one of the recently developed evolutionary algorithms. It employs an echolocation behavior of microbats by varying pulse rates of emission and loudness to perform their search process. In this paper, a modified Bat algorithm (MBA) is developed. The main focus of the MBA is to further enhance the exploration and exploitation search abilities of the original Bat algorithm. The performance of the modified Bat algorithm (MBA) is examined over the benchmark functions designed for evolutionary algorithms competition in the special session of 2005 IEEE Congress on Evolutionary Computation. The used benchmark functions include the unimodal, multimodal, and hybrid benchmark functions with high dimensionality. Furthermore, the impact analysis with respect to different values of temperatures is conducted by executing the proposed algorithm twenty-five times independently by using each benchmark function with different random seeds.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available