{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:55:57Z","timestamp":1743141357994,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_43","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"612-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Dimensional Drift Analysis:"],"prefix":"10.1007","author":[{"given":"Duri","family":"Janett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Yang, Q.: The efficiency threshold for the offspring population size of the $$(\\mu , \\lambda )$$ EA. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1461\u20131469 (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"43_CR2","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 (2014)","DOI":"10.1145\/2576768.2598338"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Eremeev, A., Lehre, P.K.: Escaping local optima with non-elitist evolutionary algorithms. In: AAAI Conference on Artificial Intelligence, vol. 35, pp. 12275\u201312283 (2021)","DOI":"10.1609\/aaai.v35i14.17457"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Eremeev, A., Lehre, P.K.: Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1133\u20131141 (2021)","DOI":"10.1145\/3449639.3459398"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-3-319-45823-6_75","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"D-C Dang","year":"2016","unstructured":"Dang, D.-C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 803\u2013813. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_75"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1162\/evco_a_00283","volume":"29","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift. Evol. Comput. 29(2), 305\u2013329 (2021)","journal-title":"Evol. Comput."},{"issue":"1","key":"43_CR7","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."},{"key":"43_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, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1151\u20131159 (2021)","DOI":"10.1145\/3449639.3459338"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J., Storch, T.: When the plus strategy outperforms the comma strategyand when not. In: Foundations of Computational Intelligence (FOCI), pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Janett, D., Lengler, J.: Two-dimensional drift analysis: optimizing two functions simultaneously can be hard (2022). https:\/\/arxiv.org\/abs\/2203.14547","DOI":"10.2139\/ssrn.4250784"},{"key":"43_CR12","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":"43_CR13","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: OneMax is not the easiest function for fitness improvements (2022). https:\/\/arxiv.org\/abs\/2204.07017"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the $$(1, \\lambda )$$-EA on monotone functions. In: Parallel Problem Solving from Nature (PPSN). Springer (2022)","DOI":"10.1007\/978-3-031-14721-0_40"},{"issue":"3","key":"43_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75(3), 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"43_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15844-5_25","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"PK Lehre","year":"2010","unstructured":"Lehre, P.K.: Negative drift in populations. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 244\u2013253. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_25"},{"issue":"6","key":"43_CR17","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":"43_CR18","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. In: Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Lengler, J., Martinsson, A., Steger, A.: When does hillclimbing fail on monotone functions: An entropy compression argument. In: Analytic Algorithmics and Combinatorics (ANALCO), pp. 94\u2013102. SIAM (2019)","DOI":"10.1137\/1.9781611975505.10"},{"key":"43_CR20","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":"43_CR21","doi-asserted-by":"crossref","unstructured":"Lengler, J., Riedi, S.: Runtime Analysis of the $$(\\mu + 1)$$-EA on the Dynamic BinVal Function. In: Evolutionary Computation in Combinatorial Optimization (EvoCom). pp. 84\u201399. Springer, Heidelberg (2021)","DOI":"10.1007\/978-3-030-72904-2_6"},{"key":"43_CR22","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"},{"issue":"4","key":"43_CR23","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":"4","key":"43_CR24","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s00453-020-00778-4","volume":"83","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Sudholt, D., Witt, C.: The complex parameter landscape of the compact genetic algorithm. Algorithmica 83(4), 1096\u20131137 (2021)","journal-title":"Algorithmica"},{"key":"43_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2021.03.025","volume":"875","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Zou, X.: Exponential slowdown for larger populations: the $$(\\mu + 1)$$-EA on monotone functions. Theoret. Comput. Sci. 875, 28\u201351 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"Neumann, F., Sudholt, D., Witt, C.: A few ants are enough: ACO with iteration-best update. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 63\u201370 (2010)","DOI":"10.1145\/1830483.1830493"},{"key":"43_CR27","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2015.01.002","volume":"605","author":"PS Oliveto","year":"2015","unstructured":"Oliveto, P.S., Witt, C.: Improved time complexity analysis of the simple genetic algorithm. Theoret. Comput. Sci. 605, 21\u201341 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2018.02.011","volume":"736","author":"JE Rowe","year":"2018","unstructured":"Rowe, J.E.: Linear multi-objective drift analysis. Theoret. Comput. Sci. 736, 25\u201340 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR29","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$) evolutionary algorithm. Theoret. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"43_CR30","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1007\/s00453-018-0480-z","volume":"81","author":"D Sudholt","year":"2019","unstructured":"Sudholt, D., Witt, C.: On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica 81(4), 1450\u20131489 (2019)","journal-title":"Algorithmica"},{"key":"43_CR31","doi-asserted-by":"crossref","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22(2), 294\u2013318 (2013)","DOI":"10.1017\/S0963548312000600"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:03:07Z","timestamp":1710259387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_43"}},"subtitle":["Optimizing Two Functions Simultaneously Can Be Hard"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}