{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:31Z","timestamp":1759638991352},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734796"},{"type":"electronic","value":"9783540734826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73482-6_4","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T13:41:51Z","timestamp":1187098911000},"page":"54-69","source":"Crossref","is-referenced-by-count":18,"title":["On the Brittleness of Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"4_CR2","first-page":"253","volume-title":"Foundations of Genetic Algorithms 7 (FOGA 2002)","author":"S. Droste","year":"2003","unstructured":"Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: De Jong, K.A., Poli, R., Rowe, J.E. (eds.) Foundations of Genetic Algorithms 7 (FOGA 2002), pp. 253\u2013270. Morgan Kaufmann, San Francisco (2003)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1162\/evco.1998.6.2.185","volume":"6","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation\u00a06(2), 185\u2013196 (1998)","journal-title":"Evolutionary Computation"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science\u00a0276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(02)00094-4","volume":"287","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: Optimization with randomized search heuristics \u2014 the (A)NFL theorem, realistic scenarios, and difficult functions. Theoretical Computer Science\u00a0287(1), 131\u2013144 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR6","volume-title":"Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1966","unstructured":"Feller, W.: Introduction to Probability Theory and Its Applications, vol.\u00a02. Wiley, Chichester (1966)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence\u00a0127(1), 57\u201385 (2001)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"4_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms: Artificial Intelligence 127, 57\u201385 (2001) Artificial Intelligence 140(1), 245\u2013248 (2002)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing\u00a03(1), 21\u201335 (2004)","journal-title":"Natural Computing"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T. Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation\u00a013(4), 413\u2013440 (2005)","journal-title":"Evolutionary Computation"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-45356-3_9","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"T. Jansen","year":"2000","unstructured":"Jansen, T., Wegener, I.: On the choice of the mutation probability for the (1+1) EA. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) Parallel Problem Solving from Nature-PPSN VI. LNCS, vol.\u00a01917, pp. 89\u201398. Springer, Heidelberg (2000)"},{"issue":"6","key":"4_CR12","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T. Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms \u2014 how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation\u00a05(6), 589\u2013599 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M. Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"key":"4_CR14","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature (PPSN II). North-Holland, pp. 15\u201326 (1992)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/978-3-540-24854-5_76","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"T. Storch","year":"2004","unstructured":"Storch, T.: On the choice of the population size. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 748\u2013760. Springer, Heidelberg (2004)"},{"key":"4_CR16","unstructured":"Witt, C.: Personal communication (2007)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Genetic Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73482-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T18:45:33Z","timestamp":1629571533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73482-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734796","9783540734826"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73482-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}