Non-Elitist Genetic Algorithm as a Local Search Method

This provides theoretical guarantees for a non-elitist genetic algorithm's performance on optimization problems, though it is incremental as it builds on existing runtime analysis methods.

The paper tackled the problem of analyzing the runtime of a non-elitist genetic algorithm with tournament selection, showing that it can find a local optimum in polynomially bounded average time under certain conditions, specifically on problems with guaranteed local optima when parameters are appropriately set.