Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/CEC.2014.6900576 | IEEE Congress on Evolutionary Computation |
Keywords | Field | DocType |
evolutionary computation,random processes,continuous fitness landscape sampling,continuous multidimensional spaces,discrete search spaces,neighbourhood structure sampling,progressive random walk algorithm,search space coverage | Discrete search,Mathematical optimization,Fitness landscape,Random walk,Computer science,Neighbourhood (mathematics),Sampling (statistics) | Conference |
Citations | PageRank | References |
11 | 0.62 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katherine Malan | 1 | 162 | 12.77 |
| Andries P. Engelbrecht | 2 | 660 | 61.64 |