标题： 跳跃过程作为全局优化算法的潜在机制 显示英文标题

标题： Lévy flights as an underlying mechanism for global optimization algorithms

摘要： 本文提出并倡导将所谓的Lévy飞行用作一类随机优化计算的驱动力机制。由于某些原因，这一提议之前被忽略了，但在作者看来，它非常适合满足生成搜索空间中步长差异极大的试验步骤的需求。短步长和长步长之间的所需平衡可以轻松且完全地控制。文中给出了一个使用FORTRAN 77实现的近似Lévy分布的简单示例。我们还讨论了所提出方法的物理基础。 显示英文摘要

摘要： In this paper we propose and advocate the use of the so called L\'evy 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\'evy distribution, implemented in FORTRAN 77, is given. We also discuss the physical grounds of presented methods.