{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T19:25:21Z","timestamp":1750361121182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031300349"},{"type":"electronic","value":"9783031300356"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30035-6_12","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T06:05:48Z","timestamp":1680156348000},"page":"179-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Cost of\u00a0Randomness in\u00a0Evolutionary Algorithms: Crossover can Save Random Bits"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Kneissl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-39206-1_23","volume-title":"Automata, Languages, and Programming","author":"K Bringmann","year":"2013","unstructured":"Bringmann, K., Friedrich, T.: Exact and efficient generation of geometric random variates and random graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 267\u2013278. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_23"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/3427474","volume":"1","author":"D Corus","year":"2021","unstructured":"Corus, D., Lissovoi, A., Oliveto, P.S., Witt, C.: On steady-state evolutionary algorithms and selective pressure: why inverse rank-based allocation of reproductive trials is best. ACM Trans. Evol. Learn. Optim. 1(1), 2:1-2:38 (2021)","journal-title":"ACM Trans. Evol. Learn. Optim."},{"issue":"5","key":"12_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2017.2745715","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Oliveto, P.S.: Standard steady state genetic algorithms can hill climb faster than mutation-only evolutionary algorithms. IEEE Trans. Evol. Comput. 22(5), 720\u2013732 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"12_CR5","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1007\/s00453-020-00743-1","volume":"82","author":"D Corus","year":"2020","unstructured":"Corus, D., Oliveto, P.S.: On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica 82(12), 3676\u20133706 (2020)","journal-title":"Algorithmica"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/TEVC.2021.3068574","volume":"25","author":"D Corus","year":"2021","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast immune system-inspired hypermutation operators for combinatorial optimization. IEEE Trans. Evol. Comput. 25(5), 956\u2013970 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D-C Dang","year":"2018","unstructured":"Dang, D.-C., et al.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22(3), 484\u2013497 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr and Neumann [13], pp. 1\u201387","key":"12_CR8","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theoret. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 2083\u20132090. ACM Press (2011)","key":"12_CR10","DOI":"10.1145\/2001576.2001856"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The (1+$$\\lambda $$) evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81(2), 593\u2013631 (2019)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Phuoc Le, H., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 777\u2013784. ACM (2017)","key":"12_CR12","DOI":"10.1145\/3071178.3071301"},{"key":"12_CR13","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation - Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Natural Computing Series, Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3472304","volume":"1","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Neumann, F.: A survey on recent progress in the theory of evolutionary algorithms for discrete optimization. ACM Trans. Evol. Learn. Optim. 1(4), 1\u201343 (2021)","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"12_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, 1st edn. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8","edition":"1"},{"key":"12_CR16","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1971","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 2. Wiley, New York (1971)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-662-48971-0_13","volume-title":"Algorithms and Computation","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The benefit of recombination in noisy evolutionary search. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 140\u2013150. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_13"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-015-0072-0","volume":"75","author":"C Gie\u00dfen","year":"2016","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. Algorithmica 75(3), 462\u2013489 (2016)","journal-title":"Algorithmica"},{"unstructured":"Grefenstette, J.: Efficient implementation of algorithms. In: Handbook of Evolutionary Computation, pp. E2.1:1\u2013E2.1:6. IOP Publishing Ltd., 1st edn. (1997)","key":"12_CR19"},{"doi-asserted-by":"crossref","unstructured":"Thomas Jansen. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer, 2013","key":"12_CR20","DOI":"10.1007\/978-3-642-17339-4"},{"doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. In: Proceedings of the 11th Workshop on Foundations of Genetic Algorithms (FOGA 2011), pp. 1\u201314. ACM (2011)","key":"12_CR21","DOI":"10.1145\/1967654.1967656"},{"issue":"6","key":"12_CR22","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2010.09.027","volume":"412","author":"T Jansen","year":"2011","unstructured":"Jansen, T., Zarges, C.: Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoret. Comput. Sci. 412(6), 517\u2013533 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"12_CR23","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 running time of parallel evolutionary algorithms. Evol. Comput. 22(3), 405\u2013437 (2014)","journal-title":"Evol. Comput."},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1162\/EVCO_a_00153","volume":"23","author":"A Mambrini","year":"2015","unstructured":"Mambrini, A., Sudholt, D.: Design and analysis of schemes for adapting migration intervals in parallel evolutionary algorithms. Evol. Comput. 23(4), 559\u2013582 (2015)","journal-title":"Evol. Comput."},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"12_CR26","series-title":"NCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. NCS, 1st edn. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3","edition":"1"},{"key":"12_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103345","volume":"287","author":"PTH Nguyen","year":"2020","unstructured":"Nguyen, P.T.H., Sudholt, D.: Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. 287, 103345 (2020)","journal-title":"Artif. Intell."},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1007\/s00453-021-00893-w","volume":"84","author":"PS Oliveto","year":"2022","unstructured":"Oliveto, P.S., Sudholt, D., Witt, C.: Tight bounds on the expected runtime of a standard steady state genetic algorithm. Algorithmica 84(6), 1603\u20131658 (2022)","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR29","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1007\/s00453-019-00666-6","volume":"83","author":"C Qian","year":"2021","unstructured":"Qian, C., Bian, C., Yang, Yu., Tang, K., Yao, X.: Analysis of noisy evolutionary optimization when sampling fails. Algorithmica 83(4), 940\u2013975 (2021)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"66","DOI":"10.3847\/1538-4357\/aa7ede","volume":"845","author":"M Route","year":"2017","unstructured":"Route, M.: Radio-flaring ultracool dwarf population synthesis. Astrophys. J. 845(1), 66 (2017)","journal-title":"Astrophys. J."},{"unstructured":"Rudolph, G., Ziegenhirt, J.: Computation time of evolutionary operators. In: Handbook of Evolutionary Computation, pp. E2.2:1\u2013E2.2:4. IOP Publishing Ltd. 1st edn. (1997)","key":"12_CR31"},{"issue":"3","key":"12_CR32","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17(3), 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"12_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/EVCO_a_00171","volume":"25","author":"D Sudholt","year":"2017","unstructured":"Sudholt, D.: How crossover speeds up building-block assembly in genetic algorithms. Evol. Comput. 25(2), 237\u2013274 (2017)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30035-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T23:15:20Z","timestamp":1680650120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30035-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300349","9783031300356"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30035-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","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":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evocop\/","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":"32","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":"15","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":"47% - 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":"4","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":"1.7","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)"}}]}}