A new modification approach on bat algorithm for solving optimization problems


YILMAZ S., KÜÇÜKSİLLE E. U.

APPLIED SOFT COMPUTING, cilt.28, ss.259-275, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 28
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1016/j.asoc.2014.11.029
  • Dergi Adı: APPLIED SOFT COMPUTING
  • Sayfa Sayıları: ss.259-275

Özet

Optimization can be defined as an effort of generating solutions to a problem under bounded circumstances. Optimization methods have arisen from a desire to utilize existing resources in the best possible way. An important class of optimization methods is heuristic algorithms. Heuristic algorithms have generally been proposed by inspiration from the nature. For instance, Particle Swarm Optimization has been inspired by social behavior patterns of fish schooling or bird flocking. Bat algorithm is a heuristic algorithm proposed by Yang in 2010 and has been inspired by a property, named as echolocation, which guides the bats' movements during their flight and hunting even in complete darkness. In this work, local and global search characteristics of bat algorithm have been enhanced through three different methods. To validate the performance of the Enhanced Bat Algorithm (EBA), standard test functions and constrained real-world problems have been employed. The results obtained by these test sets have proven EBA superior to the standard one. Furthermore, the method proposed in this study is compared with recently published studies in the literature on real-world problems and it is proven that this method is more effective than the studies belonging to other literature on this sort of problems. (C) 2014 Elsevier B.V. All rights reserved.