Bat algorithm: Difference between revisions

Revision as of 12:35, 19 January 2012

Revision as of 12:36, 19 January 2012

Line 3:

== Algorithm Description ==

The idealization of kumar[[echolocation]] 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.