{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:55:56Z","timestamp":1759179356921,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T00:00:00Z","timestamp":1525046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006021","name":"Direction G\u00e9n\u00e9rale de l\u2019Armement","doi-asserted-by":"publisher","award":["X-DGA"],"award-info":[{"award-number":["X-DGA"]}],"id":[{"id":"10.13039\/501100006021","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FR2988"],"award-info":[{"award-number":["FR2988"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00453-018-0445-2","type":"journal-article","created":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T08:01:15Z","timestamp":1525075275000},"page":"886-915","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Island Models Meet Rumor Spreading"],"prefix":"10.1007","volume":"81","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4104-1840","authenticated-orcid":false,"given":"Philipp","family":"Fischbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Frahnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Schirneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,30]]},"reference":[{"key":"445_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00281-2","volume":"82","author":"E Alba","year":"2002","unstructured":"Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Inf. Process. Lett. 82, 7\u201313 (2002)","journal-title":"Inf. Process. Lett."},{"key":"445_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2012.00862.x","volume":"20","author":"E Alba","year":"2013","unstructured":"Alba, E., Luque, G., Nesmachnow, S.: Parallel metaheuristics: recent advances and new trends. Int. Trans. Oper. Res. 20, 1\u201348 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"445_CR3","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of the 13th International Conference on Parallel Problem Solving from Nature (PPSN), pp. 892\u2013901 (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"445_CR4","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Black-box complexity of parallel search with distributed populations. In: Proceedings of the 13th Workshop on the Foundations of Genetic Algorithms (FOGA), pp. 3\u201315 (2015)","DOI":"10.1145\/2725494.2725504"},{"key":"445_CR5","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 the 11th International Conference on Parallel Problem Solving from Nature (PPSN), pp. 1\u201310 (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"445_CR6","unstructured":"Cant\u00fa-Paz, E.: A survey of parallel genetic algorithms. IlliGAL Report 97003 (1997)"},{"key":"445_CR7","unstructured":"Doerr, B.: Optimal parameter settings for the \n                    \n                      \n                    \n                    $$(1+ (\\lambda ,\\lambda ))$$\n                    \n                      \n                        \n                          (\n                          1\n                          +\n                          (\n                          \u03bb\n                          ,\n                          \u03bb\n                          )\n                          )\n                        \n                      \n                    \n                   genetic algorithm. CoRR \n                    arxiv:1604.01088\n                    \n                   (2016)"},{"key":"445_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fischbeck, P., Frahnow, C., Friedrich, T., K\u00f6tzing, T., Schirneck, M.: Island models meet rumor spreading. In: Proceedings of the 2017 Genetic and Evolutionary Computation Conference (GECCO), pp. 1359\u20131366 (2017)","DOI":"10.1145\/3071178.3071206"},{"key":"445_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), pp. 502\u2013513 (2011)","DOI":"10.1007\/978-3-642-22012-8_40"},{"key":"445_CR10","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, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"445_CR11","doi-asserted-by":"crossref","unstructured":"Doerr, B., K\u00fcnnemann, M.: Tight analysis of randomized rumor spreading in complete graphs. In: Proceedings of the 2014 Meeting on Analytic Algorithmics and Combinatorics (ANALCO), pp. 82\u201391 (2014)","DOI":"10.1137\/1.9781611973204.8"},{"key":"445_CR12","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                    \n                      \n                    \n                    $$(1{+}\\lambda )$$\n                    \n                      \n                        \n                          (\n                          1\n                          +\n                          \u03bb\n                          )\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":"445_CR13","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 \n                    \n                      \n                    \n                    $$(1{+}1)$$\n                    \n                      \n                        \n                          (\n                          1\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                   evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"445_CR14","doi-asserted-by":"crossref","unstructured":"Gie\u00dfen, C., Witt, C.: Optimal mutation rates for the \n                    \n                      \n                    \n                    $$(1 + \\lambda )$$\n                    \n                      \n                        \n                          (\n                          1\n                          +\n                          \u03bb\n                          )\n                        \n                      \n                    \n                  \u00a0EA on OneMax. In: Proceedings of the 2016 Genetic and Evolutionary Computation Conference (GECCO), pp. 1147\u20131154 (2016)","DOI":"10.1145\/2908812.2908912"},{"key":"445_CR15","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. Nat. Comput. 3, 21\u201335 (2004)","journal-title":"Nat. Comput."},{"key":"445_CR16","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Universit\u00e4t des Saarlandes (2010)"},{"key":"445_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1162\/EVCO_a_00114","volume":"22","author":"J L\u00e4ssig","year":"2014","unstructured":"L\u00e4ssig, J., Sudholt, D.: General upper bounds on the runtime of parallel evolutionary algorithms. Evol. Comput. 22, 405\u2013437 (2014)","journal-title":"Evol. Comput."},{"key":"445_CR18","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"445_CR19","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Witt, C.: On the utility of island models in dynamic optimization. In: Proceedings of the 2015 Genetic and Evolutionary Computation Conference (GECCO), pp. 1447\u20131454 (2015)","DOI":"10.1145\/2739480.2754734"},{"key":"445_CR20","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1162\/EVCO_a_00153","volume":"23","author":"A Mambrini","year":"2015","unstructured":"Mambrini, A., Sudholt, D.: Design and analysis of schemes for adapting migration intervals in parallel evolutionary algorithms. Evol. Comput. 23, 559\u2013582 (2015)","journal-title":"Evol. Comput."},{"key":"445_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"445_CR22","doi-asserted-by":"crossref","unstructured":"Neumann, F., Oliveto, P.S., Rudolph, G., Sudholt, D.: On the effectiveness of crossover for migration in parallel evolutionary algorithms. In: Proceedings of the 2011 Genetic and Evolutionary Computation Conference (GECCO), pp. 1587\u20131594 (2011)","DOI":"10.1145\/2001576.2001790"},{"key":"445_CR23","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.parco.2010.04.002","volume":"36","author":"M Ruci\u0144ski","year":"2010","unstructured":"Ruci\u0144ski, M., Izzo, D., Biscani, F.: On the impact of the migration topology on the island model. Parallel Comput. 36, 555\u2013571 (2010)","journal-title":"Parallel Comput."},{"key":"445_CR24","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"G Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kova\u010d, Hamburg (1997)"},{"key":"445_CR25","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Parallel evolutionary algorithms. In: Springer Handbook of Computational Intelligence, pp. 929\u2013959. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-43505-2_46"},{"key":"445_CR26","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 64\u201378 (2001)","DOI":"10.1007\/3-540-48224-5_6"},{"key":"445_CR27","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. Comb. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0445-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0445-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0445-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T08:43:55Z","timestamp":1556613835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0445-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,30]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["445"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0445-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,4,30]]},"assertion":[{"value":"31 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}