Maximizing Drift Is Not Optimal for Solving OneMax.

Abstract excerpt

It seems very intuitive that for the maximization of the OneMax problem Om(x):=∑i=1nxi 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. In Doerr et al. (2020), it was formally proven that this...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Computer Simulation