{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:14Z","timestamp":1759638674701,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030729035"},{"type":"electronic","value":"9783030729042"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_6","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"84-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Runtime Analysis of the $$(\\mu + 1)$$-EA on the Dynamic BinVal Function"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Lengler","sequence":"first","affiliation":[]},{"given":"Simone","family":"Riedi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Colin, S., Doerr, B., F\u00e9rey, G.: Monotonic functions in EC: anything but monotone! In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760. ACM (2014)","DOI":"10.1145\/2576768.2598338"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Dang-Nhu, R., Dardinier, T., Doerr, B., Izacard, G., Nogneng, D.: A new analysis method for evolutionary optimization of dynamic and noisy objective functions. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1467\u20131474. ACM (2018)","DOI":"10.1145\/3205455.3205563"},{"issue":"1","key":"6_CR3","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). https:\/\/doi.org\/10.1007\/s00453-011-9585-3","journal-title":"Algorithmica"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Doerr, B., Hota, A., K\u00f6tzing, T.: Ants easily solve stochastic shortest path problems. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 17\u201324. ACM (2012)","DOI":"10.1145\/2330163.2330167"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotonic functions. Evol. Comput. 21(1), 1\u201327 (2013)","journal-title":"Evol. Comput."},{"issue":"4","key":"6_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). https:\/\/doi.org\/10.1007\/s00453-012-9622-x","journal-title":"Algorithmica"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Droste, S.: Analysis of the $$(1+ 1)$$ EA for a dynamically changing OneMax-variant. In: Congress on Evolutionary Computation (CEC), vol. 1, pp. 55\u201360. IEEE (2002)","DOI":"10.1007\/3-540-45105-6_103"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Horoba, C., Sudholt, D.: Ant colony optimization for stochastic shortest path problems. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1465\u20131472. ACM (2010)","DOI":"10.1145\/1830483.1830750"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms","author":"T Jansen","year":"2007","unstructured":"Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 54\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73482-6_4"},{"key":"6_CR10","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Foundations of Genetic Algorithms (FOGA), pp. 40\u201351. Springer (2015). https:\/\/dblp.org\/rec\/conf\/foga\/KotzingLW15.html?view=bibtex"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-32937-1_12","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing, T., Molter, H.: ACO beats EA on a dynamic pseudo-Boolean function. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 113\u2013122. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_12"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1017\/S0963548318000275","volume":"27","author":"J Lengler","year":"2018","unstructured":"Lengler, J., Steger, A.: Drift analysis and evolutionary algorithms revisited. Comb. Probab. Comput. 27(4), 643\u2013666 (2018)","journal-title":"Comb. Probab. Comput."},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TEVC.2019.2917014","volume":"24","author":"J Lengler","year":"2019","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6), 995\u20131009 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR14","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-030-58112-1_42","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"J Lengler","year":"2020","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 610\u2013622. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_42"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments, full version. arXiv preprint. http:\/\/arxiv.org\/abs\/2004.09949 (2020)","DOI":"10.1007\/978-3-030-58112-1_42"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the $$(\\mu +1)$$-EA on the dynamic BinVal function, full version. arXiv preprint. http:\/\/arxiv.org\/abs\/2010.13428 (2020)","DOI":"10.1007\/978-3-030-72904-2_6"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lengler, J., Schaller, U.: The (1+1)-EA on noisy linear functions with random positive weights. In: Symposium Series on Computational Intelligence (SSCI), pp. 712\u2013719. IEEE (2018)","DOI":"10.1109\/SSCI.2018.8628785"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Lengler, J., Zou, X.: Exponential slowdown for larger populations: the ($$\\mu $$+1)-EA on monotone functions. In: Foundations of Genetic Algorithms (FOGA), pp. 87\u2013101. ACM (2019)","DOI":"10.1145\/3299904.3340309"},{"issue":"3","key":"6_CR20","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). https:\/\/doi.org\/10.1007\/s00453-015-9975-z","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-016-0262-4","volume":"78","author":"A Lissovoi","year":"2016","unstructured":"Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78(2), 641\u2013659 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0262-4","journal-title":"Algorithmica"},{"issue":"5","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1007\/s00453-017-0377-2","volume":"80","author":"A Lissovoi","year":"2018","unstructured":"Lissovoi, A., Witt, C.: The impact of a sparse migration topology on the runtime of island models in dynamic optimization. Algorithmica 80(5), 1634\u20131657 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0377-2","journal-title":"Algorithmica"},{"key":"6_CR23","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-29414-4_7","volume-title":"Theory of Evolutionary Computation","author":"F Neumann","year":"2020","unstructured":"Neumann, F., Pourhassan, M., Roostapour, V.: Analysis of evolutionary algorithms in dynamic and stochastic environments. Theory of Evolutionary Computation. NCS, pp. 323\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_7"},{"key":"6_CR24","unstructured":"Neumann, F., Witt, C.: On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 3742\u20133748. AAAI Press (2015)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Gao, W., Neumann, F.: Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 903\u2013910. ACM (2015)","DOI":"10.1145\/2739480.2754700"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00453-018-0451-4","volume":"81","author":"F Shi","year":"2019","unstructured":"Shi, F., Schirneck, M., Friedrich, T., K\u00f6tzing, T., Neumann, F.: Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints. Algorithmica 81(2), 828\u2013857 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0451-4","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T14:44:22Z","timestamp":1671720262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}