{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:41:46Z","timestamp":1777596106735,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T00:00:00Z","timestamp":1502928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["4002-00542"],"award-info":[{"award-number":["4002-00542"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00453-017-0360-y","type":"journal-article","created":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T10:10:02Z","timestamp":1502964602000},"page":"1710-1731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Optimal Mutation Rates for the (1+ $$\\lambda $$ \u03bb ) EA on OneMax Through Asymptotically Tight Drift Analysis"],"prefix":"10.1007","volume":"80","author":[{"given":"Christian","family":"Gie\u00dfen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"360_CR1","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (ed.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing, (2011)","DOI":"10.1142\/7438"},{"key":"360_CR2","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables","author":"M Abramowitz","year":"1964","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. National Bureau of Standards, Gaithersburg (1964)"},{"key":"360_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem. In Proceedings of Parallel Problem Solving from Nature (PPSN\u00a02010), vol. 6238, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"360_CR4","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Parallel Problem Solving from Nature\u2014PPSN XIII\u201413th International Conference, Ljubljana, Slovenia, September 13\u201317, 2014. Proceedings, pp. 892\u2013901. (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"issue":"2","key":"360_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1162\/EVCO_a_00130","volume":"23","author":"F Chicano","year":"2015","unstructured":"Chicano, F., Sutton, A.M., Whitley, L.D., Alba, E.: Fitness probability distribution of bit-flip mutation. Evolut. Comput. 23(2), 217\u2013248 (2015)","journal-title":"Evolut. Comput."},{"key":"360_CR6","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J .: Optimal parameter choices via precise black-box analysis. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20\u201324, 2016, pp. 1123\u20131130. (2016)","DOI":"10.1145\/2908812.2908950"},{"key":"360_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Procedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a02011), pp. 2083\u20132090. ACM Press (2011)","DOI":"10.1145\/2001576.2001856"},{"issue":"1","key":"360_CR8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65(1), 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"360_CR9","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"360_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., K\u00fcnnemann, M.: Royal road functions and the (1+ $$\\lambda $$ \u03bb ) evolutionary algorithm: almost no speed-up from larger offspring populations. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u00a02013), pp. 424\u2013431. IEEE Press, (2013)","DOI":"10.1109\/CEC.2013.6557600"},{"key":"360_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the (1+ $$\\lambda $$ \u03bb ) evolutionary algorithm - different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"360_CR12","doi-asserted-by":"crossref","unstructured":"Gie\u00dfen, C., Witt, C.: Population size versus mutation strength for the (1+ $$\\lambda $$ \u03bb ) EA on OneMax. In: Proceedings of GECCO\u00a0\u201915, pp. 1439\u20131446. ACM Press, (2015)","DOI":"10.1145\/2739480.2754738"},{"key":"360_CR13","unstructured":"Gie\u00dfen, C., Witt, C.: Optimal mutation rates for the (1+ $$\\lambda $$ \u03bb ) EA on onemax. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20\u201324, 2016, pp. 1147\u20131154, (2016)"},{"key":"360_CR14","doi-asserted-by":"publisher","unstructured":"Hwang, H.-K., Panholzer, A., Rolin, N., Tsai, T.-H., Chen, W.-M.: Probabilistic analysis of the (1+1)-evolutionary algorithm. Evol. Comput. (2017). doi: 10.1162\/EVCO_a_00212","DOI":"10.1162\/EVCO_a_00212"},{"key":"360_CR15","series-title":"Natural Computing Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Natural Computing Series. Springer, Berlin (2013)"},{"issue":"4","key":"360_CR16","doi-asserted-by":"crossref","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. Evolut. Comput. 13(4), 413\u2013440 (2005)","journal-title":"Evolut. Comput."},{"key":"360_CR17","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Universit\u00e4t des Saarlandes, Germany, (2010)"},{"key":"360_CR18","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Proceedings of ISAAC\u00a0\u201914, Volume 8889 of Lecture Notes in Computer Science, pp. 686\u2013697. Springer, 2014. Full technical report at http:\/\/arxiv.org\/abs\/1307.2559","DOI":"10.1007\/978-3-319-13075-0_54"},{"issue":"2","key":"360_CR19","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1108\/17563780910959893","volume":"2","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy, B., Rowe, J.E., Cannings, C.: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. Int. J. Intell. Comput. Cybern. 2(2), 243\u2013284 (2009)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"360_CR20","series-title":"Natural Computing Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Natural Computing Series. Springer, Berlin (2010)"},{"key":"360_CR21","doi-asserted-by":"crossref","unstructured":"Jonathan, E.: Rowe and Dirk Sudholt. The choice of the offspring population size in the (1, $$\\lambda $$ \u03bb ) evolutionary algorithm. Theoretical Computer Science, 545:20\u201338, 2014. Preliminary version in Proceedings of GECCO\u00a02012","DOI":"10.1016\/j.tcs.2013.09.036"},{"issue":"3","key":"360_CR22","doi-asserted-by":"crossref","first-page":"296","DOI":"10.2307\/2981372","volume":"109","author":"JG Skellam","year":"1946","unstructured":"Skellam, J.G.: The frequency distribution of the difference between two poisson variates belonging to different populations. J. R. Stat. Soc. 109(3), 296\u2013296 (1946)","journal-title":"J. R. Stat. Soc."},{"issue":"4","key":"360_CR23","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.stamet.2006.11.005","volume":"4","author":"K Teerapabolarn","year":"2007","unstructured":"Teerapabolarn, K.: A bound on the poisson-binomial relative error. Stat. Methodol. 4(4), 407\u2013415 (2007)","journal-title":"Stat. Methodol."},{"key":"360_CR24","doi-asserted-by":"crossref","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb Prob. Comput. 22(2):294\u2013318, 2013. Preliminary version in Proceedings of STACS \u201912","DOI":"10.1017\/S0963548312000600"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0360-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0360-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0360-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:16:00Z","timestamp":1570011360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0360-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,17]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0360-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,17]]}}}