Random walk is a fundamental concept with applications ranging from quantum physics to
econometrics. Remarkably, one specific model of random walks appears to be ubiquitous …

Nature-inspired metaheuristic algorithms, especially those based on swarm intelligence,
have attracted much attention in the last ten years. Firefly algorithm appeared in about five …

Mathematical modelling of the movement of animals, micro-organisms and cells is of great
relevance in the fields of biology, ecology and medicine. Movement models can take many …

This review examines intermittent target search strategies, which combine phases of slow
motion, allowing the searcher to detect the target, and phases of fast motion during which …

The study of animal foraging behaviour is of practical ecological importance, and
exemplifies the wider scientific problem of optimizing search strategies. Lévy flights are …

In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …

How long does it take a random walker to reach a given target point? This quantity, known
as a first-passage time (FPT), has led to a growing number of theoretical investigations over …

We review the general problem of random searches in the context of biological encounters.
We analyze deterministic and stochastic aspects of searching in general and address the …

We present a general theory which allows one to accurately evaluate the mean first-passage
time (FPT) for regular random walks in bounded domains, and its extensions to related first …

Lévy walks (LW) are superdiffusive and scale‐free random walks that have recently
emerged as a new conceptual tool for modeling animal search paths. They have been …