Abstract
Randomized search heuristics like local search, tabu search, simulated annealing, or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific algorithms. This raises the question about the limits of general randomized search heuristics. Here a framework called black-box optimization is developed. The essential issue is that the problem but not the problem instance is knownto the algorithm which can collect information about the instance only by asking for the value of points in the search space. All known randomized search heuristics fit into this scenario. Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Droste, S., Jansen, T. & Wegener, I. Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput Syst 39, 525–544 (2006). https://doi.org/10.1007/s00224-004-1177-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1177-z