A Modified Bat Algorithm for Solving Large-Scale Bound Constrained Global Optimization Problems. (28th February 2021)

• Record Type: Journal Article
• Authors: Mashwani, Wali Khan; Mehmood, Ihsan; Abu Bakar, Maharani; Koçcak, Ismail
• Other Names: Gritli Hassène Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-02-28
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/6636918
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : 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.