{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:41:46Z","timestamp":1759178506330,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_39","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"555-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Runtime Analysis of\u00a0Unbalanced Block-Parallel Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Brahim","family":"Aboutaib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Alba, E., Troya, J.M.: A survey of parallel distributed genetic algorithms. Complex. 4(4), 31\u201352 (1999)","DOI":"10.1002\/(SICI)1099-0526(199903\/04)4:4<31::AID-CPLX5>3.3.CO;2-W"},{"key":"39_CR2","doi-asserted-by":"publisher","unstructured":"Cant\u00fa-Paz, E.: Master-slave parallel genetic algorithms. In: Efficient and Accurate Parallel Genetic Algorithms, pp. 33\u201348. Springer, Boston (2001). https:\/\/doi.org\/10.1007\/978-1-4615-4369-5_3","DOI":"10.1007\/978-1-4615-4369-5_3"},{"key":"39_CR3","doi-asserted-by":"publisher","unstructured":"Doerr, B., K\u00fcnnemann, M.: How the (1+$$\\lambda $$) evolutionary algorithm optimizes linear functions. In: Blum, C., Alba, E. (eds.) Genetic and Evolutionary Computation Conference, GECCO \u201913, Amsterdam, The Netherlands, 6\u201310 July 2013, pp. 1589\u20131596. ACM (2013). https:\/\/doi.org\/10.1145\/2463372.2463569","DOI":"10.1145\/2463372.2463569"},{"key":"39_CR4","doi-asserted-by":"publisher","unstructured":"Doerr, B., K\u00fcnnemann, M.: Royal road functions and the (1 + $$\\lambda $$) evolutionary algorithm: almost no speed-up from larger offspring populations. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, 20\u201323 June 2013, pp. 424\u2013431. IEEE (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557600","DOI":"10.1109\/CEC.2013.6557600"},{"key":"39_CR5","doi-asserted-by":"publisher","unstructured":"Dubreuil, M., Gagn\u00e9, C., Parizeau, M.: Analysis of a master-slave architecture for distributed evolutionary computations. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 36(1), 229\u2013235 (2006). https:\/\/doi.org\/10.1109\/TSMCB.2005.856724","DOI":"10.1109\/TSMCB.2005.856724"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00453-016-0214-z","volume":"78","author":"C Gie\u00dfen","year":"2016","unstructured":"Gie\u00dfen, C., Witt, C.: The interplay of population size and mutation probability in the ($$1+\\lambda $$) EA on OneMax. Algorithmica 78(2), 587\u2013609 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0214-z","journal-title":"Algorithmica"},{"issue":"5","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1007\/s00453-017-0360-y","volume":"80","author":"C Gie\u00dfen","year":"2017","unstructured":"Gie\u00dfen, C., Witt, C.: Optimal mutation rates for the (1+$$\\lambda $$) EA on OneMax through asymptotically tight drift analysis. Algorithmica 80(5), 1710\u20131731 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0360-y","journal-title":"Algorithmica"},{"key":"39_CR8","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing. Pearson Education Limited (2003)"},{"key":"39_CR9","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovi\u0107, N.: First vs. best improvement: an empirical study. Discr. Appl. Math. 154(5), 802\u2013817 (2006). https:\/\/doi.org\/10.1016\/j.dam.2005.05.020","DOI":"10.1016\/j.dam.2005.05.020"},{"issue":"4","key":"39_CR10","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. Evolution. Comput. 13(4), 413\u2013440 (2005). https:\/\/doi.org\/10.1162\/106365605774666921","journal-title":"Evolution. Comput."},{"key":"39_CR11","doi-asserted-by":"publisher","unstructured":"Ochoa, G., Verel, S., Tomassini, M.: First-improvement vs. best-improvement local optima networks of NK landscapes. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 104\u2013113. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_11","DOI":"10.1007\/978-3-642-15844-5_11"},{"issue":"8","key":"39_CR12","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1109\/43.57790","volume":"9","author":"P Roussel-Ragot","year":"1990","unstructured":"Roussel-Ragot, P., Dreyfus, G.: A problem independent parallel implementation of simulated annealing: models and experiments. IEEE Trans. Comput. Aided Design Integrat. Circuits Syst. 9(8), 827\u2013835 (1990). https:\/\/doi.org\/10.1109\/43.57790","journal-title":"IEEE Trans. Comput. Aided Design Integrat. Circuits Syst."},{"key":"39_CR13","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Parallel evolutionary algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 929\u2013959. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_46","DOI":"10.1007\/978-3-662-43505-2_46"},{"issue":"1","key":"39_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"MGA Verhoeven","year":"1995","unstructured":"Verhoeven, M.G.A., Aarts, E.H.L.: Parallel local search. J. Heurist. 1(1), 43\u201365 (1995). https:\/\/doi.org\/10.1007\/BF02430365","journal-title":"J. Heurist."}],"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_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:48Z","timestamp":1710259368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_39","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)"}}]}}