arXiv · math-ph/0106003
Lévy flights as an underlying mechanism for global optimization algorithms
Abstract
In this paper we propose and advocate the use of the so called Lévy flights as a driving mechanism for a class of stochastic optimization computations. This proposal, for some reasons overlooked until now, is - in author's opinion - very appropriate to satisfy the need for algorithm, which is capable of generating trial steps of very different length in the search space. The required balance between short and long steps can be easily and fully controlled. A simple example of approximated Lévy distribution, implemented in FORTRAN 77, is given. We also discuss the physical grounds of presented methods.
Explore related subjects
Keep this discovery
Marek Gutowski. 2001-06-04. Lévy flights as an underlying mechanism for global optimization algorithms. https://arxiv.org/abs/math-ph/0106003
Cite the original work for its findings. Save a collection to share your selection of sources.