Search

A major issue while conceiving or parameterizing an optimization heuristic is to ensure an appropriate balance between exploitation and exploration of the search. Evolution strategies and neighborhood-based metaheuristics constitute relevant high-level frameworks, which ease the problem solving but are often complex to configure. Moreover, their effective behavior, according to the particularities of the search landscapes, remains difficult to grasp. In this paper, we deeply investigate the sampled walk search algorithm, which is a local search equivalent of the (1 , λ) -evolution strategy, considering that the neighborhood relation describes mutation possibilities. We specifically designed experiments to better understand the behavior of such a strategy offering a fine way to deal with the exploration versus exploitation dilemma. The main contribution is the analysis of search trajectories by evaluating and visualizing both their width (exploration) and their height (exploitation). More generally, we aim at bringing insights about the behavior of the (1 , λ) -ES in a discrete optimization context and within a fitness landscape perspective. [ABSTRACT FROM AUTHOR]