{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:55:14Z","timestamp":1772553314086,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T00:00:00Z","timestamp":1505865600000},"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":["DFF-FNU 4002-00542"],"award-info":[{"award-number":["DFF-FNU 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-0377-2","type":"journal-article","created":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T09:40:07Z","timestamp":1505900407000},"page":"1634-1657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization"],"prefix":"10.1007","volume":"80","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":[[2017,9,20]]},"reference":[{"key":"377_CR1","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"377_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-0526(199903\/04)4:4<31::AID-CPLX5>3.0.CO;2-4","volume":"4","author":"E Alba","year":"1999","unstructured":"Alba, E., Troya, J.M.: A survey of parallel distributed genetic algorithms. Complexity 4(4), 31\u201352 (1999)","journal-title":"Complexity"},{"key":"377_CR3","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Jansen, T., Lehre, P.K.: Populations can be essential in dynamic optimisation. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201915), pp. 1407\u20131414 (2015)","DOI":"10.1145\/2739480.2754808"},{"key":"377_CR4","volume-title":"Theory of Randomized Search Heuristics","author":"B Doerr","year":"2011","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics. World Scientific, Singapore (2011)"},{"key":"377_CR5","doi-asserted-by":"crossref","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, Berlin (2003)","DOI":"10.1007\/3-540-45105-6_103"},{"key":"377_CR6","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn. Wiley, New York (1968)","edition":"3"},{"key":"377_CR7","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 57\u201385 (2001). Erratum in Artif. Intell. 140(1\/2), 245\u2013248 (2002)"},{"key":"377_CR8","doi-asserted-by":"crossref","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, New York (2005)","DOI":"10.1145\/1068009.1068152"},{"key":"377_CR9","doi-asserted-by":"crossref","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, New York (2014)","DOI":"10.1145\/2576768.2598344"},{"key":"377_CR10","doi-asserted-by":"crossref","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, New York (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"377_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Molter, H.: ACO beats EA on a dynamic pseudo-boolean function. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u00a0XII), pp. 113\u2013122. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32937-1_12"},{"issue":"7","key":"377_CR12","doi-asserted-by":"crossref","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."},{"key":"377_CR13","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC\u201914), Lecture Notes in Computer Science, vol. 8889, pp. 686\u2013697. Springer, Berlin (2014). Extended version at arXiv:1307.2559"},{"key":"377_CR14","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2008","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2008)"},{"issue":"3","key":"377_CR15","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s00453-015-9975-z","volume":"75","author":"A Lissovoi","year":"2015","unstructured":"Lissovoi, A., Witt, C.: MMAS versus population-based EA on a family of dynamic fitness functions. Algorithmica 75(3), 554\u2013576 (2015)","journal-title":"Algorithmica"},{"key":"377_CR16","doi-asserted-by":"crossref","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":"2","key":"377_CR17","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00453-016-0262-4","volume":"78","author":"A Lissovoi","year":"2017","unstructured":"Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78(2), 641\u2013659 (2017)","journal-title":"Algorithmica"},{"key":"377_CR18","doi-asserted-by":"crossref","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 (2014)","DOI":"10.1145\/2576768.2598347"},{"key":"377_CR19","doi-asserted-by":"crossref","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 Evol. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"377_CR20","doi-asserted-by":"crossref","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, New York (2009)","DOI":"10.1145\/1569901.1570131"},{"issue":"10\u201311","key":"377_CR21","doi-asserted-by":"crossref","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(10\u201311), 555\u2013571 (2010)","journal-title":"Parallel Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0377-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0377-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0377-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T15:01:06Z","timestamp":1570114866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0377-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,20]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["377"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0377-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,20]]}}}