# Maximizing Drift is Not Optimal for Solving OneMax

16 Apr 2019Nathan BuskulicCarola Doerr

It seems very intuitive that for the maximization of the OneMax problem $f(x):=\sum_{i=1}^n{x_i}$ the best that an elitist unary unbiased search algorithm can do is to store a best so far solution, and to modify it with the operator that yields the best possible expected progress in function value. This assumption has been implicitly used in several empirical works... (read more)

PDF Abstract

No code implementations yet. Submit your code now