- Conference Paper
Dynamic linear functions on the boolean hypercube are functions which assign to each bit a positive weight, but the weights change over time. Throughout optimization, these functions maintain the same global optimum, and never have defecting local optima. Nevertheless, it was recently shown [Lengler, Schaller, FOCI 2019] that the (1+1)-Evolutionary Algorithm needs exponential time to find or approximate the optimum for some algorithm configurations. In this experimental paper, we study the effect of larger population sizes for Dynamic BinVal, the extremal form of dynamic linear functions. We find that moderately increased population sizes extend the range of efficient algorithm configurations, and that crossover boosts this positive effect substantially. Remarkably, similar to the static setting of monotone functions in [Lengler, Zou, FOGA 2019], the hardest region of optimization for (μ+1)-EA is not close the optimum, but far away from it. In contrast, for the (μ+1)-GA, the region around the optimum is the hardest region in all studied cases (Extended Abstract. A full version is available on arxiv at ). Show more
Book titleParallel Problem Solving from Nature – PPSN XVI
Journal / seriesLecture Notes in Computer Science
Pages / Article No.
Organisational unit03672 - Steger, Angelika / Steger, Angelika
MoreShow all metadata