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.

[1]  Marc Lipsitch,et al.  Adaptation on Rugged Landscapes Generated by Iterated Local Interactions of Neighboring Genes , 1991, ICGA.

[2]  Xin Yao,et al.  A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability , 2007, Evolutionary Computation.

[3]  Marcus Gallagher,et al.  Length Scale for Characterising Continuous Optimization Problems , 2012, PPSN.

[4]  Sheng-You Huang,et al.  Directed random walks in continuous space. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[6]  Christian M. Reidys,et al.  Neutrality in fitness landscapes , 2001, Appl. Math. Comput..

[7]  Bernd Bischl,et al.  Algorithm selection based on exploratory landscape analysis and cost-sensitive learning , 2012, GECCO '12.

[8]  Andries Petrus Engelbrecht,et al.  Ruggedness, funnels and gradients in fitness landscapes and the effect on PSO performance , 2013, 2013 IEEE Congress on Evolutionary Computation.

[9]  Kate Smith-Miles,et al.  Measuring instance difficulty for combinatorial optimization problems , 2012, Comput. Oper. Res..

[10]  Julian Francis Miller,et al.  Information Characteristics and the Structure of Landscapes , 2000, Evolutionary Computation.

[11]  Richard J. Duro,et al.  Experimental analysis of the relevance of fitness landscape topographical characterization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[12]  Kate Smith-Miles,et al.  Towards insightful algorithm selection for optimisation using meta-learning concepts , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[13]  Bernd Bischl,et al.  Exploratory landscape analysis , 2011, GECCO '11.

[14]  Rayleigh.  The Problem of the Random Walk , 1905, Nature.

[15]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[16]  William H. Hsu,et al.  GA-Hardness Revisited , 2003, GECCO.

[17]  Tojo,et al.  Correlated random walk in continuous space. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[18]  Werner Ebeling,et al.  The Density of States - A Measure of the Difficulty of Optimisation Problems , 1996, PPSN.

[19]  Andries Petrus Engelbrecht,et al.  A survey of techniques for characterising fitness landscapes and some possible ways forward , 2013, Inf. Sci..

[20]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[21]  Sébastien Vérel,et al.  Where are bottlenecks in NK fitness landscapes? , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[22]  Xin Yao,et al.  Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms , 2011, EvoCOP.

[23]  Sébastien Vérel,et al.  Fitness Clouds and Problem Hardness in Genetic Programming , 2004, GECCO.

[24]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on Classifications of Fitness Functions on Classifications of Fitness Functions , 2022 .

[25]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[26]  Bart Naudts,et al.  A comparison of predictive measures of problem difficulty in evolutionary algorithms , 2000, IEEE Trans. Evol. Comput..

[27]  Andries Petrus Engelbrecht,et al.  Quantifying ruggedness of continuous landscapes using entropy , 2009, 2009 IEEE Congress on Evolutionary Computation.

[28]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[29]  L. Darrell Whitley,et al.  The dispersion metric and the CMA evolution strategy , 2006, GECCO.

[30]  Vesselin K. Vassilev,et al.  Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application , 2003 .

[31]  Mario A. Muñoz,et al.  Landscape characterization of numerical optimization problems using biased scattered data , 2012, 2012 IEEE Congress on Evolutionary Computation.

[32]  Andries Petrus Engelbrecht,et al.  Steep gradients as a predictor of PSO failure , 2013, GECCO '13 Companion.

[33]  Mario A. Muñoz,et al.  A Meta-learning Prediction Model of Algorithm Performance for Continuous Optimization Problems , 2012, PPSN.