Abstract
Stochastic operators are the backbone of many stochastic optimization algorithms. Besides the existing theoretical analysis that analyzes the asymptotic runtime of such algorithms, characterizing their performances using fitness landscapes analysis is far away. The fitness landscape approach proceeds by considering multiple characteristics to understand and explain an optimization algorithm’s performance or the difficulty of an optimization problem, and hence would provide a richer explanation.
This paper analyzes the fitness landscapes of stochastic operators by focusing on the number of local optima and their relation to the optimization performance. The search spaces of two combinatorial problems are studied, the NK-landscape and the Quadratic Assignment Problem, using binary string-based and permutation-based stochastic operators. The classical bit-flip search operator is considered for binary strings, and a generalization of the deterministic exchange operator for permutation representations is devised. We study small instances, ranging from randomly generated to real-like instances, and large instances from the NK-landscapes. For large instances, we propose using an adaptive walk process to estimate the number of locally optimal solutions. Given that stochastic operators are usually used within the population and single solution-based evolutionary optimization algorithms, we contrasted the performances of the (μ + λ)-EA, and an Iterated Local Search, versus the landscape properties of large size instances of the NK-landscapes. Our analysis shows that characterizing the fitness landscapes induced by stochastic search operators can effectively explain the optimization performances of the algorithms we considered.
