In: Computer Science
Question about bat algorithm
What are the main heuristics (or principles, or strategies) of the bat algorithm that make it works as the optimal heuristic search?
thanks
Here are the main heuristics of Bat Algorithm:-
1. All bats use echolocation to sense distance, and they also know the difference between prey and background barriers in some magical way
2. Bats fly randomly with velocity 'Vi' at position 'Xi' with different frequency ranges f[min,max], varying wavelength 'A' and loudness 'A0' to search for prey.
3. Although the loudness can vary in many ways, we assume that the loudness varies from a large (positive) “A0” to a minimum constant value “A min” .
4. Every bat is associated with velocity 'Vi' and position 'Xi' in search space at each iteration 't', with respect to frequency 'fi'. Hence at each iteration we need to update fi, Vi and Xi as per the following equation :
, where B lies between [0, 1]
, where
is the current
best