Efficient line-search modified bat algorithm for solving large-scale global optimisation problems Online publication date: Wed, 12-Jun-2024
by Enas O. Suhail; Ahmed S. Zekri; Mahmoud M. El-Alem
International Journal of Computing Science and Mathematics (IJCSM), Vol. 19, No. 4, 2024
Abstract: An efficient line-search modified bat algorithm (EMBA) is proposed to solve large-scale global optimisation problems. A balance between exploration and exploitation abilities is achieved. Firstly, a line search to an accurate step size of a particle towards the global optimum is presented. The generated step size depends on the proximity of the particle to the global optimum and it is directly proportional to the dimension of a problem. This proportion makes EMBA capable to handle the high probability of an explosion in the initial values of objective functions in large-scale optimisation problems. Secondly, the velocity of a particle is clamped within pre-defined boundaries and penalised, if necessary, to ensure that both the velocity and position of a particle are within their boundaries. These modifications combined make EMBA able to converge to the global optimum in a few iterations. The experimental results show the efficiency of EMBA when comparing with well-established algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook