{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T09:07:31Z","timestamp":1775380051660,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"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_33","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"470-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["General Univariate Estimation-of-Distribution Algorithms"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Dufay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing (2011). https:\/\/doi.org\/10.1142\/7438","DOI":"10.1142\/7438"},{"key":"33_CR2","unstructured":"Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. rep., Carnegie Mellon University (1994)"},{"key":"33_CR3","doi-asserted-by":"publisher","unstructured":"Benbaki, R., Benomar, Z., Doerr, B.: A rigorous runtime analysis of the 2-MMAS$$_{\\rm ib}$$ on jump functions: ant colony optimizers can cope well with local optima. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 4\u201313. ACM (2021). https:\/\/doi.org\/10.1145\/3449639.3459350","DOI":"10.1145\/3449639.3459350"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s00453-018-0507-5","volume":"81","author":"D-C Dang","year":"2018","unstructured":"Dang, D.-C., Lehre, P.K., Nguyen, P.T.H.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81(2), 668\u2013702 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0507-5","journal-title":"Algorithmica"},{"issue":"10","key":"33_CR5","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on jump functions. Algorithmica 83(10), 3059\u20133107 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00780-w","journal-title":"Algorithmica"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Doerr, B., Dufay, M.: General univariate estimation-of-distribution algorithms (2022). CoRR abs\/2206.11198","DOI":"10.1007\/978-3-031-14721-0_33"},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Doerr, B., Krejca, M.S.: Bivariate estimation-of-distribution algorithms can find an exponential number of optima. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 796\u2013804. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390177","DOI":"10.1145\/3377930.3390177"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2020.11.028","volume":"851","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theoret. Comput. Sci. 851, 121\u2013128 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.11.028","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/evco\\_a_00293","volume":"29","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: The univariate marginal distribution algorithm copes well with deception and epistasis. Evol. Comput. 29, 543\u2013563 (2021). https:\/\/doi.org\/10.1162\/evco_a_00293","journal-title":"Evol. Comput."},{"key":"33_CR10","doi-asserted-by":"publisher","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation-Recent Developments in Discrete Optimization. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4, http:\/\/www.lix.polytechnique.fr\/Labo\/Benjamin.Doerr\/doerr_neumann_book.html","DOI":"10.1007\/978-3-030-29414-4"},{"key":"33_CR11","doi-asserted-by":"publisher","unstructured":"Doerr, B., Zheng, W.: From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 805\u2013813. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390163","DOI":"10.1145\/3377930.3390163"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/TEVC.2020.2987361","volume":"24","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Sharp bounds for genetic drift in estimation-of-distribution algorithms. IEEE Trans. Evol. Comput. 24, 1140\u20131149 (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2987361","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR13","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, 257\u2013283 (2006). https:\/\/doi.org\/10.1007\/s11047-006-9001-0","journal-title":"Nat. Comput."},{"key":"33_CR14","doi-asserted-by":"publisher","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S.: EDAs cannot be balanced and stable. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 1139\u20131146. ACM (2016). https:\/\/doi.org\/10.1145\/2908812.2908895","DOI":"10.1145\/2908812.2908895"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/EVCO\\_a\\_00178","volume":"24","author":"T Friedrich","year":"2016","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: Robustness of ant colony optimization to noise. Evol. Comput. 24, 237\u2013254 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00178","journal-title":"Evol. Comput."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2016.2613739","volume":"21","author":"T Friedrich","year":"2017","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Trans. Evol. Comput. 21, 477\u2013490 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2613739","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3, 287\u2013297 (1999). https:\/\/doi.org\/10.1109\/4235.797971","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR18","doi-asserted-by":"publisher","unstructured":"Hasen\u00f6hrl, V., Sutton, A.M.: On the runtime dynamics of the compact genetic algorithm on jump functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 967\u2013974. ACM (2018). https:\/\/doi.org\/10.1145\/3205455.3205608","DOI":"10.1145\/3205455.3205608"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput. 1, 111\u2013128 (2011) https:\/\/doi.org\/10.1016\/j.swevo.2011.08.003","DOI":"10.1016\/j.swevo.2011.08.003"},{"key":"33_CR20","doi-asserted-by":"publisher","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-17339-4","DOI":"10.1007\/978-3-642-17339-4"},{"key":"33_CR21","unstructured":"Juels, A., Baluja, S., Sinclair, A.: The equilibrium genetic algorithm and the role of crossover (1993), (Unpublished)"},{"key":"33_CR22","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: Theory of Evolutionary Computation. LNCS, pp. 405\u2013442. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_9"},{"key":"33_CR23","unstructured":"Krejca, M.S.: Theoretical Analyses of Univariate Estimation-of-Distribution Algorithms. Ph.D. thesis, Universit\u00e4t Potsdam (2019)"},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2018.06.004","volume":"832","author":"MS Krejca","year":"2020","unstructured":"Krejca, M.S., Witt, C.: Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax. Theoret. Comput. Sci. 832, 143\u2013165 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2018.06.004","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR25","doi-asserted-by":"publisher","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1539-5","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"33_CR26","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: Foundations of Genetic Algorithms, FOGA 2019, pp. 154\u2013168. ACM (2019). https:\/\/doi.org\/10.1145\/3299904.3340316","DOI":"10.1145\/3299904.3340316"},{"issue":"4","key":"33_CR27","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s00453-020-00778-4","volume":"83","author":"J Lengler","year":"2020","unstructured":"Lengler, J., Sudholt, D., Witt, C.: The complex parameter landscape of the compact\u00a0genetic\u00a0algorithm. Algorithmica 83(4), 1096\u20131137 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00778-4","journal-title":"Algorithmica"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178\u2013187. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_982"},{"key":"33_CR29","doi-asserted-by":"publisher","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3","DOI":"10.1007\/978-3-642-16544-3"},{"key":"33_CR30","first-page":"1","volume":"18","author":"Y Ollivier","year":"2017","unstructured":"Ollivier, Y., Arnold, L., Auger, A., Hansen, N.: Information-geometric optimization algorithms: a unifying picture via invariance principles. J. Mach. Learn. Res. 18, 1\u201365 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"33_CR31","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"},{"key":"33_CR32","unstructured":"Shapiro, J.L.: The sensitivity of PBIL to its learning rate, and how detailed balance can remove it. In: Foundations of Genetic Algorithms, FOGA 2002, pp. 115\u2013132. Morgan Kaufmann (2002)"},{"key":"33_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/1063656053583414","volume":"13","author":"JL Shapiro","year":"2005","unstructured":"Shapiro, J.L.: Drift and scaling in estimation of distribution algorithms. Evol. Comput. 13, 99\u2013123 (2005). https:\/\/doi.org\/10.1162\/1063656053583414","journal-title":"Evol. Comput."},{"key":"33_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11844297_10","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"JL Shapiro","year":"2006","unstructured":"Shapiro, J.L.: Diversity loss in general estimation of distribution algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 92\u2013101. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_10"},{"key":"33_CR35","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN ant system. Futur. Gener. Comput. Syst. 16, 889\u2013914 (2000). https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Futur. Gener. Comput. Syst."},{"key":"33_CR36","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, 1450\u20131489 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0480-z","journal-title":"Algorithmica"},{"issue":"2","key":"33_CR37","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":"33_CR38","doi-asserted-by":"publisher","unstructured":"Witt, C.: On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 2:1\u20132:15. ACM (2021). https:\/\/doi.org\/10.1145\/3450218.3477303","DOI":"10.1145\/3450218.3477303"},{"key":"33_CR39","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/B:ANOR.0000039526.52305.af","volume":"131","author":"M Zlochin","year":"2004","unstructured":"Zlochin, M., Birattari, M., Meuleau, N., Dorigo, M.: Model-based search for combinatorial optimization: a critical survey. Ann. Oper. Res. 131, 373\u2013395 (2004). https:\/\/doi.org\/10.1023\/B:ANOR.0000039526.52305.af","journal-title":"Ann. Oper. Res."}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:24Z","timestamp":1710259344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}