{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:56:45Z","timestamp":1783749405472,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_6","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"64-78","source":"Crossref","is-referenced-by-count":49,"title":["Theoretical Aspects of Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1998-35123404","volume":"32","author":"T. B\u00e4ck","year":"1998","unstructured":"B\u00e4ck, T. (1998). An overview of parameter control methods by self-adaptation in evolutionary algorithms. Fundamenta Informaticae 32, 51\u201366.","journal-title":"Fundamenta Informaticae"},{"key":"6_CR2","volume-title":"Handbook of Evolutionary Computation","year":"1997","unstructured":"B\u00e4ck, T., Fogel, D. B., and Michalewicz, Z. (Eds.) (1997). Handbook of Evolutionary Computation. Oxford Univ. Press, Oxford."},{"key":"6_CR3","unstructured":"Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. MIT Press."},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"Proc. of PPSN V (Parallel Problem Solving from Nature)","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., and Wegener, I. (1998). On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. Proc. of PPSN V (Parallel Problem Solving from Nature), LNCS 1648, 13\u201322."},{"key":"6_CR5","unstructured":"Droste, S., Jansen, T., and Wegener, I. (2001). On the analysis of the (1 + 1) evolutionary algorithm. To appear: Theoretical Computer Science."},{"key":"6_CR6","unstructured":"Fogel, D. B. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Forrest, S., and Mitchell, M. (1993). Relative building-block fitness and the building-block hypothesis. Proc. of FOGA\u2019 1993 (2nd Workshop Foundations of Genetic Algorithms), Morgan Kaufmann.","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., and Schoenauer, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Computation 7, 173\u2013203.","journal-title":"Evolutionary Computation"},{"key":"6_CR9","unstructured":"Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley."},{"key":"6_CR10","unstructured":"Hochbaum, D. S. (Ed.) (1997). Approxiamtion Algorithms for NP-Hard Problems. PWS Publ. Co."},{"key":"6_CR11","unstructured":"Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press."},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-48481-7_17","volume-title":"Proc. of ESA\u201999 (European Symp. On Algorithms)","author":"T. Jansen","year":"1999","unstructured":"Jansen, T., and Wegener, I. (1999). On the analysis of evolutionary algorithms-a proof that crossover really can help. Proc. of ESA\u201999 (European Symp. On Algorithms), LNCS 1643, 184\u2013193."},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-45356-3_9","volume-title":"Proc. of PPSN VI (Parallel Problem Solving from Nature)","author":"T. Jansen","year":"2000","unstructured":"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\u201398."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"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. To appear: IEEE Trans. on Evolutionary Computation.","DOI":"10.1109\/4235.974841"},{"key":"6_CR15","unstructured":"Jansen, T., and Wegener, I. (2001a). Real royal road functions-where crossover provably is essential. To appear: GECCO\u20192001."},{"key":"6_CR16","unstructured":"Jansen, T., and Wegener, I. (2001b). On the analysis of a dynamic evolutionary algorithm. Submitted: ESA\u20192001."},{"key":"6_CR17","unstructured":"Mitchell, M., Forrest, S., and Holland, J. H. (1992). The Royal Road function for genetic algorithms: Fitness landscapes and GA performance. Proc. of 1st European Conf. on Artificial Life, 245\u2013254, MIT Press."},{"key":"6_CR18","unstructured":"Mitchell, M., Holland, J. H., and Forrest, S. (1994). When will a genetic algorithm outperform hill climbing. In J. Cowan, G. Tesauro, and J. Alspector (Eds.): Advances in Neural Information Processing Systems. Morgan Kaufman."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Motwani, R., and Raghavan, P. (1995). Randomized Algorithms. Cambridge Univ. Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<313::AID-RSA1>3.0.CO;2-W","volume":"12","author":"Y. Rabani","year":"1998","unstructured":"Rabani, Y., Rabinovich, Y., and Sinclair, A. (1998). A computational view of population genetics. Random Structures and Algorithms 12, 314\u2013334.","journal-title":"Random Structures and Algorithms"},{"key":"6_CR21","unstructured":"Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Wiley."},{"key":"6_CR22","unstructured":"Watson, R. A. (2000). Analysis of recombinative algorithms on a non-separable building-block problem. Proc. of FOGA\u20192000 (6.Workshop Foundations of Genetic Algorithms), to appear."},{"key":"6_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-40064-8_1","volume-title":"Proc. ofWG\u20192000 (26.Workshop on Graph-Theoretic Concepts in Computer Science)","author":"I. Wegener","year":"2000","unstructured":"Wegener, I. (2000). On the expected runtime and the success probability of evolutionary algorithms. Proc. ofWG\u20192000 (26.Workshop on Graph-Theoretic Concepts in Computer Science), LNCS 1928, 1\u201310."},{"key":"6_CR24","unstructured":"Wegener, I., and Witt, C. (2001). On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Submitted: Journal of Discrete Algorithms."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T17:33:25Z","timestamp":1588008805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}