TY - GEN
T1 - Random walks, Lévy flights, Markov chains and metaheuristic optimization
AU - Yang, Xin She
AU - Ting, T. O.
AU - Karamanoglu, Mehmet
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Lévy flights
KW - Markov chains
KW - Metaheuristic and random walks
UR - http://www.scopus.com/inward/record.url?scp=84880719413&partnerID=8YFLogxK
U2 - 10.1007/978-94-007-6516-0_116
DO - 10.1007/978-94-007-6516-0_116
M3 - Conference Proceeding
AN - SCOPUS:84880719413
SN - 9789400765153
T3 - Lecture Notes in Electrical Engineering
SP - 1055
EP - 1064
BT - Future Information Communication Technology and Applications, ICFICE 2013
T2 - 2013 International Conference on Future Information and Communication Engineering, ICFICE 2013
Y2 - 24 June 2013 through 26 June 2013
ER -