Modified progressive random walk with chaotic PRNG

Abstract

In this paper, two modifications are proposed to the Progressive Random Walk (PRW) algorithm in order to address its potentially insufficient search space coverage. The first modification replaces the Pseudo-Random Number Generator (PRNG) with the uniform distribution by the chaotic map based PRNG for generating of the offset values and the second modification is called direction switching and is based on experiment observation. The modifications are implemented into the PRW and the resulting algorithm is called modified Progressive Random Walk. The search space coverage of the two algorithms is compared. Both algorithms are used in macro ruggedness estimation of the CEC2015 benchmark set and the results are discussed.

Search space coverage of progressive random walk improved by chaotic sequences used as pseudo-random number generators for step size.

Keywords:

• Random walk
• chaos
• fitness landscape analysis
• ruggedness

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by Grant Agency of the Czech Republic - GACR [grant number P103/15/06700S]; the Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [grant number LO1303 (MSMT-7778/2014)]; the European Regional Development Fund - CEBIA-Tech [grant number CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [grant number IGA/CebiaTech/2017/004].