Content deleted Content added
No edit summary |
|||
Line 3:
== Algorithm Description ==
The idealization of the [[echolocation]] of microbats can be summarized as follows: Each virtual bat flies randomly with a velocity <math>v_i</math> at position (solution) <math>x_i</math> with a varying frequency or wavelength and loudness <math>A_i</math>. As it searches and finds its prey, it changes frequency, loudness and pulse emission rate <math>r</math>. Search is intensified by a local [[random walk]]. Selection of the best continues until certain stop criteria are met. This essentially uses a frequnecy-tuning technique to control the dynamic behaviour of a swarm of bats, and the balance between exploration and exploitation can be controlled by tuning algorithm-dependent parameters in bat algorithm.
A detailed introduction of metaheuristic algorithms including the bat algorithm is given by Yang <ref>Yang, X. S., Nature-Inspired Metaheuristic Algoirthms, 2nd Edition, Luniver Press, (2010).</ref> where a demo program in Matlab/Octave is available, while a comprehensive review is carried out by Parpinelli and Lopes.<ref>Parpinelli, R. S., and Lopes, H. S., New inspirations in swarm intelligence: a survey,Int. J. Bio-Inspired Computation, Vol. 3, 1-16 (2011).</ref> A further improvement is the development of an evolving bat algorithm (EBA) with better efficiency.<ref>P. W. Tsai, J. S. Pan, B. Y. Liao, M. J. Tsai, V. Istanda, Bat algorithm inspired algorithm for solving numerical optimization problems, Applied Mechanics and Materials, Vo.. 148-149, pp.134-137 (2012).</ref>
| |||