{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:07Z","timestamp":1759638187996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030436797"},{"type":"electronic","value":"9783030436803"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-43680-3_4","type":"book-chapter","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:04:05Z","timestamp":1586387045000},"page":"51-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin S.","family":"Krejca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Chen, T., Lehre, P.K., Tang, K., Yao, X.: When is an estimation of distribution algorithm better than an evolutionary algorithm? In: Proceedings of CEC 2009, pp. 1470\u20131477 (2009). https:\/\/doi.org\/10.1109\/CEC.2009.4983116","DOI":"10.1109\/CEC.2009.4983116"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Dang, D., et al.: Escaping local optima with diversity mechanisms and crossover. In: Proceedings of GECCO 2016, pp. 645\u2013652 (2016). https:\/\/doi.org\/10.1145\/2908812.2908956","DOI":"10.1145\/2908812.2908956"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D Dang","year":"2018","unstructured":"Dang, D., et al.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22(3), 484\u2013497 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2724201","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Dang, D., Lehre, P.K.: Simplified runtime analysis of estimation of distribution algorithms. In: Proceedings of GECCO 2015, pp. 513\u2013518 (2015). https:\/\/doi.org\/10.1145\/2739480.2754814","DOI":"10.1145\/2739480.2754814"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. 773, 115\u2013137 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.09.024","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B.: A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. In: Proceedings of GECCO 2019, pp. 1488\u20131496 (2019). https:\/\/doi.org\/10.1145\/3321707.3321747","DOI":"10.1145\/3321707.3321747"},{"key":"4_CR7","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-29414-4_1","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation. NCS, pp. 1\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_1. https:\/\/arxiv.org\/abs\/1801.06733"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Doerr, B., Krejca, M.S.: Significance-based estimation-of-distribution algorithms. In: Proceedings of GECCO 2018, pp. 1483\u20131490 (2018). https:\/\/doi.org\/10.1145\/3205455.3205553","DOI":"10.1145\/3205455.3205553"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the (1+$$\\lambda $$) evolutionary algorithm - different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.03.015","journal-title":"Theor. Comput. Sci."},{"key":"4_CR10","unstructured":"Doerr, B., Zheng, W.: Sharp bounds for genetic drift in EDAs. CoRR abs\/1910.14389 (2019). https:\/\/arxiv.org\/abs\/1910.14389"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-006-9001-0","volume":"5","author":"S Droste","year":"2006","unstructured":"Droste, S.: A rigorous analysis of the compact genetic algorithm for linear functions. Nat. Comput. 5(3), 257\u2013283 (2006). https:\/\/doi.org\/10.1007\/s11047-006-9001-0","journal-title":"Nat. Comput."},{"issue":"1\u20132","key":"4_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00182-7","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Hasen\u00f6hrl, V., Sutton, A.M.: On the runtime dynamics of the compact genetic algorithm on jump functions. In: Proceedings of GECCO 2018, pp. 967\u2013974 (2018). https:\/\/doi.org\/10.1145\/3205455.3205608","DOI":"10.1145\/3205455.3205608"},{"issue":"301","key":"4_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963). https:\/\/doi.org\/10.2307\/2282952","journal-title":"J. Am. Stat. Assoc."},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Krejca, M.S., Witt, C.: Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax. In: Proceedings of FOGA 2017, pp. 65\u201379 (2017). https:\/\/doi.org\/10.1145\/3040718.3040724","DOI":"10.1145\/3040718.3040724"},{"key":"4_CR16","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-29414-4_9","volume-title":"Theory of Evolutionary Computation","author":"MS Krejca","year":"2020","unstructured":"Krejca, M.S., Witt, C.: Theory of estimation-of-distribution algorithms. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation. NCS, pp. 405\u2013442. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_9"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Nguyen, P.T.H.: Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. In: Proceedings of GECCO 2017, pp. 1383\u20131390 (2017). https:\/\/doi.org\/10.1145\/3071178.3071317","DOI":"10.1145\/3071178.3071317"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Nguyen, P.T.H.: On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. In: Proceedings of FOGA 2019, pp. 154\u2013168 (2019). https:\/\/doi.org\/10.1145\/3299904.3340316","DOI":"10.1145\/3299904.3340316"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Lengler, J., Sudholt, D., Witt, C.: Medium step sizes are harmful for the compact genetic algorithm. In: Proceedings of GECCO 2018, pp. 1499\u20131506 (2018). https:\/\/doi.org\/10.1145\/3205455.3205576","DOI":"10.1145\/3205455.3205576"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Proceedings of PPSN 1996, pp. 178\u2013187 (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_982","DOI":"10.1007\/3-540-61723-X_982"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/978-3-662-43505-2_45","volume-title":"Springer Handbook of Computational Intelligence","author":"M Pelikan","year":"2015","unstructured":"Pelikan, M., Hauschild, M.W., Lobo, F.G.: Estimation of distribution algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 899\u2013928. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_45"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1007\/s00453-018-0480-z","volume":"81","author":"D Sudholt","year":"2018","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 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0480-z","journal-title":"Algorithmica"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Witt, C.: Domino convergence: why one should hill-climb on linear functions. In: Proceedings of GECCO 2018, pp. 1539\u20131546 (2018). https:\/\/doi.org\/10.1145\/3205455.3205581","DOI":"10.1145\/3205455.3205581"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s00453-018-0463-0","volume":"81","author":"C Witt","year":"2018","unstructured":"Witt, C.: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica 81(2), 632\u2013667 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0463-0","journal-title":"Algorithmica"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Zheng, W., Yang, G., Doerr, B.: Working principles of binary differential evolution. In: Proceedings of GECCO 2018, pp. 1103\u20131110 (2018). https:\/\/doi.org\/10.1145\/3205455.3205623","DOI":"10.1145\/3205455.3205623"}],"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-43680-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T19:03:01Z","timestamp":1614884581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43680-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030436797","9783030436803"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43680-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 April 2020","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":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2020\/","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":"37","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":"14","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":"38% - 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.68","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.88","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)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}