Abstract
Many experiments have shown that evolutionary algorithms are useful randomized search heuristics for optimization problems. In order to learn more about the reasons for their efficiency and in order to obtain proven results on evolutionary algorithms it is necessary to develop a theory of evolutionary algorithms. Such a theory is still in its infancy. A major part of a theory is the analysis of different variants of evolutionary algorithms on selected functions. Several results of this kind have been obtained during the last years. Here important analytical tools are presented, discussed, and applied to well-chosen example functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäck, T. (1993). Optimal mutation rates in genetic search. Proc. of 5th ICG A (Int. Conf. on Genetic Algorithms), 2–8.
Bäck, T. (1998). An overview of parameter control methods by selfadaptation in evolutionary algorithms. Fundamenta Informaticae 35, 51–66.
Bäck, T., Fogel, D. B., and Michalewicz, Z. (Eds). (1997). Handbook of Evolutionary Computation. Oxford Univ. Press.
Beyer, H.-G. (1996). Toward a theory of evolution strategies: Selfadaptation. Evolutionary Computation 3, 311–347.
Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. MIT Press.
Droste, S., Jansen, T., and Wegener, I. (1998a). A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6, 185–196.
Droste, S., Jansen, T., and Wegener, I. (1998b). On the optimization of unimodal functions with the (1+1) evolutionary algorithm. Proc. of PPSN V (Parallel Problem Solving from Nature), LNCS 1498, 13–22.
Fogel, D. B. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press.
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley.
Hochbaum, D. S. (1997). Approximation Algorithms for NP-Hard Problems. PWS Publ. Co., Boston.
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press.
Horn, J., Goldberg, D. E., and Deb, K. (1994). Long path problems. Proc. of PPSN III (Parallel Problem Solving from Nature), LNCS 866, 149–158.
Jansen, T., and Wegener, I. (1999). On the analysis of evolutionary algorithms — a proof that crossover really can help. Proc. of ESA’ 99 (European Symp. on Algorithms), LNCS 1643, 184–193.
Jansen, T., and Wegener, I. (2000a). On the choice of the mutation probability for the (1+1)EA. Proc. of PPSN VI (Parallel Problem Solving from Nature), LNCS 1917, 89–98.
Jansen, T., and Wegener, I. (2000b). Evolutionary algorithms — how to cope with plateaus of constant fitness and when to reject strings of the same fitness. Submitted to IEEE Trans. on Evolutionary Computation.
Motwani, R., and Raghavan, P. (1995). Randomized Algorithms. Cambridge Univ. Press.
Mühlenbein, H. (1992). How genetic algorithms really work. I. Mutation and hillclimbing. Proc. of PPSN II (Parallel Problem Solving from Nature), 15–25.
Rabani, Y., Rabinovich, Y., and Sinclair, A. (1998). A computational view of population genetics. Random Structures and Algorithms 12, 314–334.
Rudolph, G. (1997). How mutations and selection solve long path problems in polynomial expected time. Evolutionary Computation 4, 195–205.
Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Wiley.
Wegener, I., and Witt, C. (2000). On the behavior of the (1+1) evolutionary algorithm on quadratic pseudo-boolean functions. Submitted to Evolutionary Computation.
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Wegener, I. (2003). Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions. In: Evolutionary Optimization. International Series in Operations Research & Management Science, vol 48. Springer, Boston, MA. https://doi.org/10.1007/0-306-48041-7_14
Download citation
DOI: https://doi.org/10.1007/0-306-48041-7_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7654-5
Online ISBN: 978-0-306-48041-6
eBook Packages: Springer Book Archive