Extended Bat Algorithm (EBA) as an Improved Searching Optimization Algorithm

4Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new searching technique by using a new variant of Bat Algorithm (BA) known as Extended Bat Algorithm (EBA). EBA introduces the spiral searching method instead of randomly searching used in original BA. Spiral searching method taken from Spiral Dynamic Algorithm (SDA) is performed to improve the accuracy and efficiency of the original algorithm such as stabilizing the convergence when reaching ideal value. EBA conserves the robustness of BA and SDA and increases the performance of the proposed algorithm. The proposed algorithm is tested by using numerical experiments with three different objective functions. The results show that EBA outperforms original Bat Algorithm (BA) and Particle Swarm Optimization (PSO) in almost test functions and successfully optimizes the numerical problems.

Cite

CITATION STYLE

APA

Pebrianti, D., Ann, N. Q., Bayuaji, L., Abdullah, N. R. H., Zain, Z. M., & Riyanto, I. (2019). Extended Bat Algorithm (EBA) as an Improved Searching Optimization Algorithm. In Lecture Notes in Electrical Engineering (Vol. 538, pp. 229–237). Springer Verlag. https://doi.org/10.1007/978-981-13-3708-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free