Towards a Theory of Randomized Search Heuristics
There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP≠P or NP≠RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain. Practitioners, however, prefer simple algorithms which are easy to implement and which can be used without many changes for different types of problems. They report surprisingly good results when applying randomized search heuristics like randomized local search, tabu search, simulated annealing, and evolutionary algorithms. Here a framework for a theory of randomized search heuristics is presented. It is discussed how randomized search heuristics can be delimited from other types of algorithms. This leads to the theory of black-box optimization. Lower bounds in this scenario can be proved without any complexity-theoretical assumption. Moreover, methods how to analyze randomized search heuristics, in particular, randomized local search and evolutionary algorithms are presented.
KeywordsLocal Search Evolutionary Algorithm Problem Instance Search Point Randomize Search Heuristic
Unable to display preview. Download preview PDF.
- 1.Dietzfelbinger, M., Naudts, B., van Hoyweghen, C., Wegener, I.: The analysis of a recombinative hill-climber on H-IFF. Submitted for publication in IEEE Trans. on Evolutionary Computation (2002) Google Scholar
- 2.Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Tech. Rep. Univ. Dortmund (2003) Google Scholar
- 5.Glover, F., Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70–150. Blackwell, Oxford (1993)Google Scholar
- 8.Jansen, T., Wegener, I.: Real royal road functions — where crossover provably is essential. In: Proc. of 3rd Genetic and Evolutionary Computation Conf. (GECCO), pp. 375–382 (2001a)Google Scholar
- 13.Lovász, L., Naor, M., Newman, I., Wigderson, A.: Search problems in the decision tree model. In: Proc. of 32nd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 576–585 (1991)Google Scholar
- 14.Papadimitriou, C.H., Schäffer, A.A., Yannakakis, M.: On the complexity of local search. In: Proc. of 22nd ACM Symp. on Theory of Computing (STOC), pp. 438–445 (1990)Google Scholar
- 20.Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing (2003) (to appear) Google Scholar
- 21.Yao, A.C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. of 17th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 222–227 (1977)Google Scholar