{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:54:59Z","timestamp":1778662499465,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T00:00:00Z","timestamp":1481068800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M004252\/1"],"award-info":[{"award-number":["EP\/M004252\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"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-0262-4","type":"journal-article","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T08:29:11Z","timestamp":1481099351000},"page":"641-659","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization"],"prefix":"10.1007","volume":"78","author":[{"given":"Andrei","family":"Lissovoi","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":[[2016,12,7]]},"reference":[{"issue":"1","key":"262_CR1","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), 1\u201348 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"262_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30665-5","volume-title":"Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence","author":"E Alba","year":"2013","unstructured":"Alba, E., Nakib, A., Siarry, P.: Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence. Springer, Berlin (2013)"},{"key":"262_CR3","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":"262_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0187-y","author":"DC Dang","year":"2016","unstructured":"Dang, D.C., Jansen, T., Lehre, P.K.: Populations can be essential in tracking dynamic optima. Algorithmica (2016). doi:\n                        10.1007\/s00453-016-0187-y","journal-title":"Algorithmica"},{"issue":"1","key":"262_CR5","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":"262_CR6","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":"262_CR7","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 (1+\n                        $$\\lambda $$\n                        \n                            \n                                            \n                                \u03bb\n                            \n                        \n                    ) evolutionary algorithm - different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"262_CR8","doi-asserted-by":"publisher","unstructured":"Droste, S.: Analysis of the (1+1) EA for a dynamically bitwise changing OneMax. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201903), pp. 909\u2013921. Springer (2003)","DOI":"10.1007\/3-540-45105-6_103"},{"issue":"4","key":"262_CR9","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. Evolut. Comput. 13(4), 413\u2013440 (2005)","journal-title":"Evolut. Comput."},{"key":"262_CR10","doi-asserted-by":"publisher","unstructured":"Jansen, T., Schellbach, U.: Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201905), pp. 841\u2013848. ACM Press (2005)","DOI":"10.1145\/1068009.1068152"},{"key":"262_CR11","doi-asserted-by":"publisher","unstructured":"Jansen, T., Zarges, C.: Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201914), pp. 975\u2013982. ACM Press (2014)","DOI":"10.1145\/2576768.2598344"},{"key":"262_CR12","doi-asserted-by":"publisher","unstructured":"Khouadjia, M.R., Sarasola, B., Alba, E., Jourdan, L., Talbi, E.G.: Multi-environmental cooperative parallel metaheuristics for solving dynamic optimization problems. In: Proceedings of 2011 IEEE International Parallel & Distributed Processing Symposium, pp. 395\u2013403. IEEE Press (2011)","DOI":"10.1109\/IPDPS.2011.172"},{"key":"262_CR13","doi-asserted-by":"publisher","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Proceedings of Foundations of Genetic Algorithms Workshop (FOGA\u00a0\u201915), pp. 40\u201351. ACM Press (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"262_CR14","doi-asserted-by":"publisher","unstructured":"K\u00f6tzing, T., Molter, H.: ACO beats EA on a dynamic pseudo-boolean function. In: Procedings of Parallel Problem Solving from Nature (PPSN\u00a0XII), pp. 113\u2013122. Springer (2012)","DOI":"10.1007\/978-3-642-32937-1_12"},{"issue":"7","key":"262_CR15","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1007\/s00500-013-0991-0","volume":"17","author":"J L\u00e4ssig","year":"2013","unstructured":"L\u00e4ssig, J., Sudholt, D.: Design and analysis of migration in parallel evolutionary algorithms. Soft Comput. 17(7), 1121\u20131144 (2013)","journal-title":"Soft Comput."},{"issue":"3","key":"262_CR16","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. Evolut. Comput. 22(3), 405\u2013437 (2014)","journal-title":"Evolut. Comput."},{"key":"262_CR17","doi-asserted-by":"publisher","unstructured":"Lissovoi, A., Witt, C.: On the utility of island models in dynamic optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201915), pp. 1447\u20131454 (2015)","DOI":"10.1145\/2739480.2754734"},{"key":"262_CR18","doi-asserted-by":"publisher","unstructured":"Lissovoi, A., Witt, C.: The impact of migration topology on the runtime of island models in dynamic optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201916), pp. 1155\u20131162 (2016)","DOI":"10.1145\/2908812.2908843"},{"issue":"3","key":"262_CR19","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s00453-015-9975-z","volume":"75","author":"A Lissovoi","year":"2016","unstructured":"Lissovoi, A., Witt, C.: MMAS versus population-based EA on a family of dynamic fitness functions. Algorithmica 75(3), 554\u2013576 (2016)","journal-title":"Algorithmica"},{"key":"262_CR20","doi-asserted-by":"publisher","unstructured":"Mambrini, A., Sudholt, D.: Design and analysis of adaptive migration intervals in parallel evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201914), pp. 1047\u20131054. ACM Press (2014)","DOI":"10.1145\/2576768.2598347"},{"key":"262_CR21","doi-asserted-by":"publisher","unstructured":"Neumann, F., Oliveto, P.S., Rudolph, G., Sudholt, D.: On the effectiveness of crossover for migration in parallel evolutionary algorithms. In: Proc. of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO\u00a02011), pp. 1587\u20131594. ACM Press (2011)","DOI":"10.1145\/2001576.2001790"},{"key":"262_CR22","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Natural Computing Series","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Natural Computing Series. Springer, Berlin (2010)"},{"key":"262_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evolut. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evolut. Comput."},{"key":"262_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2014.10.028","volume":"561","author":"PS Oliveto","year":"2015","unstructured":"Oliveto, P.S., Zarges, C.: Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. Theor. Comput. Sci. 561, 37\u201356 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"262_CR25","doi-asserted-by":"publisher","unstructured":"Rohlfshagen, P., Lehre, P.K., Yao, X.: Dynamic evolutionary optimisation: An analysis of frequency and magnitude of change. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201909), pp. 1713\u20131720. ACM Press (2009)","DOI":"10.1145\/1569901.1570131"},{"key":"262_CR26","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Using markov-chain mixing time estimates for the analysis of ant colony optimization. In: Proceedings of Foundations of Genetic Algorithms Workshop (FOGA\u00a0\u201911), pp. 139\u2013150. ACM Press (2011)","DOI":"10.1145\/1967654.1967667"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0262-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0262-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0262-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T11:07:58Z","timestamp":1493377678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0262-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,7]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["262"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0262-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,7]]}}}