Stochastic components such as random walks have become an intrinsic part of modern metaheursitic algorithms. The efficiency of a metaheuristic algorithm may implicitly depend on the appropriate use of such randomization. In this paper, we provide some basic analysis and observations about random walks, Lévy flights, step sizes and efficiency using Markov theory. We show that the reason why Lévy flights are more efficient than Gaussian random walks, and the good performance of Eagle Strategy. Finally, we use bat algorithm to design a PID controller and have achieved equally good results as the classic Ziegler-Nichols tuning scheme. © 2013 Springer Science+Business Media Dordrecht.
CITATION STYLE
Yang, X. S., Ting, T. O., & Karamanoglu, M. (2013). Random walks, Lévy flights, Markov chains and metaheuristic optimization. In Lecture Notes in Electrical Engineering (Vol. 235 LNEE, pp. 1055–1064). https://doi.org/10.1007/978-94-007-6516-0_116
Mendeley helps you to discover research relevant for your work.