Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

• Published in: Combinatorics, probability & computing Vol. 22; no. 2; pp. 294 - 318
• Main Author: WITT, CARSTEN
• Format: Journal Article
• Language: English
• Published: Cambridge, UK Cambridge University Press 01.03.2013
• Subjects: Algorithms; Combinatorial analysis; Heuristic; Mathematical analysis; Mathematical models; Mutations; Optimization; Searching; Primary 68W20; Secondary 68Q25

The analysis of randomized search heuristics on classes of functions is fundamental to the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of a simple evolution...