Learn More
Many experimental results are reported on all types of Evolutionary Algorithms but only few results have been proved. A step towards a theory on Evolutionary Algorithms , in particular, the so-called (1 + 1) Evolutionary Algorithm, is performed. Linear functions are proved to be optimized in expected time O(n ln n) but only mutation rates of size Θ(1/n) can(More)
The most simple evolutionary algorithm, the so-called (1+1)EA accepts a child if its fitness is at least as large (in the case of maximization) as the fitness of its parent. The variant (1 + 1) * EA only accepts a child if its fitness is strictly larger than the fitness of its parent. Here two functions related to the class of long path functions are(More)
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(More)
Evolutionary algorithms (EAs) generally come with a large number of parameters that have to be set before the algorithm can be used. Finding appropriate settings is a difficult task. The influence of these parameters on the efficiency of the search performed by an evolutionary algorithm can be very high. But there is still a lack of theoretically justified(More)
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it has been suggested that crossover in GAs can assemble short low-order schemata of above average fitness (building blocks) to create higher-order higher-fitness schemata. However,(More)
Evolutionary algorithms are general, randomized search heuristics that are influenced by many parameters. Though evolutionary algorithms are assumed to be robust, it is well-known that choosing the parameters appropriately is crucial for success and efficiency of the search. It has been shown in many experiments, that non-static parameter settings can be by(More)