{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:59:05Z","timestamp":1783749545978,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"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":[[2017,6]]},"DOI":"10.1007\/s00453-016-0214-z","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T09:41:26Z","timestamp":1473932486000},"page":"587-609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["The Interplay of Population Size and Mutation Probability in the (\n                $$1+\\lambda $$\n                \n                    \n                                    \n                        \n                            1\n                            +\n                            \u03bb\n                        \n                    \n                \n            ) EA on OneMax"],"prefix":"10.1007","volume":"78","author":[{"given":"Christian","family":"Gie\u00dfen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"214_CR1","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","year":"2011","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing, Singapore (2011)"},{"key":"214_CR2","doi-asserted-by":"publisher","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 2010), vol. 6238, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"214_CR3","doi-asserted-by":"publisher","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of Parallel Problem Solving from Nature (PPSN 2014), vol. 8672 of Lecture Notes in Computer Science, pp. 892\u2013901 (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"issue":"2","key":"214_CR4","doi-asserted-by":"publisher","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":"214_CR5","doi-asserted-by":"publisher","unstructured":"Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), pp. 1457\u20131464. ACM Press (2010)","DOI":"10.1145\/1830483.1830749"},{"key":"214_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a02011), pp. 2083\u20132090. ACM Press (2011)","DOI":"10.1145\/2001576.2001856"},{"issue":"1","key":"214_CR7","doi-asserted-by":"publisher","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"},{"issue":"4","key":"214_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"214_CR9","doi-asserted-by":"publisher","unstructured":"Doerr, B, K\u00fcnnemann, M.: Royal road functions and the (\n                        $$1+\\lambda $$\n                        \n                            \n                                            \n                                \n                                    1\n                                    +\n                                    \u03bb\n                                \n                            \n                        \n                    ) 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":"214_CR10","doi-asserted-by":"publisher","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 (\n                        $$1+\\lambda $$\n                        \n                            \n                                            \n                                \n                                    1\n                                    +\n                                    \u03bb\n                                \n                            \n                        \n                    ) evolutionary algorithm\u2014different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"214_CR11","doi-asserted-by":"publisher","unstructured":"Gie\u00dfen, C., Witt, C.: Population size vs. mutation strength for the (\n                        $$1+\\lambda $$\n                        \n                            \n                                            \n                                \n                                    1\n                                    +\n                                    \u03bb\n                                \n                            \n                        \n                    ) EA on OneMax. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u00a02015), pp. 1439\u20131446. ACM Press (2015)","DOI":"10.1145\/2739480.2754738"},{"issue":"3","key":"214_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00453-010-9396-y","volume":"59","author":"J J\u00e4gersk\u00fcpper","year":"2011","unstructured":"J\u00e4gersk\u00fcpper, J.: Combining Markov-chain analysis and drift analysis\u2014the (1 \n                        $$+$$\n                        \n                            \n                                            \n                                +\n                            \n                        \n                     1) evolutionary algorithm on linear functions reloaded. Algorithmica 59(3), 409\u2013424 (2011). (Preliminary version in Proc. of PPSN\u201908)","journal-title":"Algorithmica"},{"key":"214_CR13","volume-title":"Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Natural Computing Series","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Natural Computing Series. Springer, Berlin (2013)"},{"issue":"4","key":"214_CR14","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. Evol. Comput. 13(4), 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"key":"214_CR15","unstructured":"Johannsen, D.: Random Combinatorial Structures and Randomized Search Heuristics. PhD thesis, Universit\u00e4t des Saarlandes, Germany (2010)"},{"key":"214_CR16","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Proceedings of ISAAC\u201914, vol. 8889 of Lecture Notes in Computer Science, pp. 686\u2013697. Springer (2014). Full technical report at \n                        arxiv:1307.2559"},{"issue":"2","key":"214_CR17","doi-asserted-by":"publisher","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":"214_CR18","volume-title":"Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Natural Computing Series","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":"214_CR19","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, \n                        $$\\lambda $$\n                        \n                            \n                                            \n                                \u03bb\n                            \n                        \n                    ) evolutionary algorithm. Theor. Comput. Sci. 545, 20\u201338 (2014). (Preliminary version in Proc. of GECCO 2012)"},{"key":"214_CR20","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Crossover speeds up building-block assembly. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a02012), pp. 689\u2013702. ACM Press (2012)","DOI":"10.1145\/2330163.2330260"},{"issue":"3","key":"214_CR21","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17(3), 418\u2013435 (2013). (Preliminary version in Proc. of PPSN\u201910)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"214_CR22","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the (\n                        $$\\mu + 1$$\n                        \n                            \n                                            \n                                \n                                    \u03bc\n                                    +\n                                    1\n                                \n                            \n                        \n                    ) EA on simple pseudo-Boolean functions. Evol. Comput. 14(1), 65\u201386 (2006)","journal-title":"Evol. Comput."},{"issue":"2","key":"214_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combin. Probab. Comput. 22(2), 294\u2013318 (2013). (Preliminary version in Proc. of STACS\u201912)","journal-title":"Combin. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0214-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0214-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0214-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T11:07:40Z","timestamp":1493377660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0214-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0214-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}