A progressive random walk algorithm for sampling continuous fitness landscapes

A number of fitness landscape analysis approaches are based on random walks through discrete search spaces. Applying these approaches to real-encoded problems requires the notion of a random walk in continuous space. This paper proposes a progressive random walk algorithm and the use of multiple walks to sample neighbourhood structure in continuous multi-dimensional spaces. It is shown that better coverage of a search space is provided by progressive random walks than simple unbiased random walks.