{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:48:06Z","timestamp":1773798486482,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031868481","type":"print"},{"value":"9783031868498","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86849-8_1","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:43:33Z","timestamp":1743335013000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Runtime Analysis of\u00a0the\u00a0Multi-valued Compact Genetic Algorithm on\u00a0Generalized LeadingOnes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1814-7612","authenticated-orcid":false,"given":"Sumit","family":"Adak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-7700","authenticated-orcid":false,"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Adak, S., Witt, C.: Runtime analysis of a multi-valued compact genetic algorithm on generalized OneMax. In: Parallel Problem Solving from Nature \u2013 PPSN XVIII, pp. 53\u201369. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-70071-2_4"},{"key":"1_CR2","unstructured":"Adak, S., Witt, C.: A runtime analysis of the multi-valued compact genetic algorithm on generalized LeadingOnes (2025). https:\/\/arxiv.org\/abs\/2501.09514"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K.G., Mehlhorn, K.: The query complexity of finding a hidden permutation. Space-efficient data structures, streams, and algorithms: Papers in honor of J. Ian Munro on the occasion of his 66th birthday, pp. 1\u201311 (2013)","DOI":"10.1007\/978-3-642-40273-9_1"},{"key":"1_CR4","unstructured":"Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Carnegie Mellon University Pittsburgh, PA, School of Computer Science (1994)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ben Jedidia, F., Doerr, B., Krejca, M.S.: Estimation-of-distribution algorithms for multi-valued decision variables. Theor. Comput. Sci. 1003, 114622 (2024). Preliminary version in GECCO\u00a0\u201923","DOI":"10.1016\/j.tcs.2024.114622"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Benbaki, R., Benomar, Z., Doerr, B.: A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 4\u201313 (2021)","DOI":"10.1145\/3449639.3459350"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chen, T., Tang, K., Chen, G., Yao, X.: Rigorous time complexity analysis of univariate marginal distribution algorithm with margins. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation, CEC 2009, pp. 2157\u20132164. IEEE Press (2009)","DOI":"10.1109\/CEC.2009.4983208"},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TEVC.2009.2040019","volume":"14","author":"T Chen","year":"2010","unstructured":"Chen, T., Tang, K., Chen, G., Yao, X.: Analysis of computational time of simple estimation of distribution algorithms. IEEE Trans. Evol. Comput. 14(1), 1\u201322 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR9","unstructured":"De\u00a0Bonet, J., Isbell, C., Viola, P.: Mimic: finding optima by estimating probability densities. In: Advances in Neural Information Processing Systems, vol. 9 (1996)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on jump functions. Algorithmica 83, 3059\u20133107 (2021)","journal-title":"Algorithmica"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Doerr, B., Krejca, M.S.: The univariate marginal distribution algorithm copes well with deception and epistasis. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 17\u201318 (2020)","DOI":"10.1145\/3377929.3397487"},{"key":"1_CR12","doi-asserted-by":"crossref","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)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"1_CR13","doi-asserted-by":"crossref","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(6), 1140\u20131149 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Droste, S.: Not all linear functions are equally difficult for the compact genetic algorithm. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 679\u2013686 (2005)","DOI":"10.1145\/1068009.1068124"},{"key":"1_CR15","doi-asserted-by":"crossref","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)","journal-title":"Nat. Comput."},{"issue":"1","key":"1_CR16","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 276(1), 51\u201381 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hamano, R., Uchida, K., Shirakawa, S., Morinaga, D., Akimoto, Y.: Tail bounds on the runtime of categorical compact genetic algorithm. Evol. Comput. 1\u201352 (2024)","DOI":"10.1162\/evco_a_00361"},{"issue":"4","key":"1_CR18","doi-asserted-by":"crossref","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(4), 287\u2013297 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Harik, G.R., Lobo, F.G., Sastry, K.: Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA). In: Scalable Optimization via Probabilistic Modeling, pp. 39\u201361. Springer (2006)","DOI":"10.1007\/978-3-540-34954-9_3"},{"key":"1_CR20","doi-asserted-by":"crossref","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, 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Proceedings of FOGA 2015, pp. 40\u201351. ACM Press (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-030-29414-4_9","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","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: Recent Developments in Discrete Optimization, pp. 405\u2013442. Springer, Cham (2020)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, vol.\u00a02. Springer (2001)","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer, Cham (2020)"},{"key":"1_CR25","doi-asserted-by":"crossref","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, 1096\u20131137 (2021)","journal-title":"Algorithmica"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: Concentration. In: Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer (1998)","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"1_CR28","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, PPSN-II, pp. 15\u201326. Elsevier (1992)"},{"issue":"4","key":"1_CR29","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., Mahnig, T.: FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol. Comput. 7(4), 353\u2013376 (1999)","journal-title":"Evol. Comput."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H., Paass, G.: From recombination of genes to the estimation of distributions i. binary parameters. In: International Conference on Parallel Problem Solving from Nature, pp. 178\u2013187. Springer (1996)","DOI":"10.1007\/3-540-61723-X_982"},{"key":"1_CR31","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E.: BOA: the Bayesian optimization algorithm. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, pp. 525\u2013532 (1999)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Hauschild, M.W., Lobo, F.G.: Estimation of distribution algorithms. In: Springer Handbook of Computational Intelligence, pp. 899\u2013928 (2015)","DOI":"10.1007\/978-3-662-43505-2_45"},{"key":"1_CR33","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/978-1-4471-0819-1_39","volume-title":"Advances in Soft Computing","author":"M Pelikan","year":"1999","unstructured":"Pelikan, M., Muehlenbein, H.: The bivariate marginal distribution algorithm. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing, pp. 521\u2013535. Springer, London (1999)"},{"key":"1_CR34","volume-title":"Convergence properties of evolutionary algorithms","author":"G Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence properties of evolutionary algorithms. Verlag Dr, Kova\u010d (1997)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Santana, R., Larra\u00f1aga, P., Lozano, J.A.: Protein folding in simplified models with estimation of distribution algorithms. IEEE Trans. Evol. Comput. 12(4), 418\u2013438 (2008)","DOI":"10.1109\/TEVC.2007.906095"},{"key":"1_CR36","unstructured":"Shapiro, J.L.: The sensitivity of PBIL to its learning rate, and how detailed balance can remove it. In: FOGA, pp. 115\u2013132 (2002)"},{"issue":"1","key":"1_CR37","doi-asserted-by":"crossref","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(1), 99\u2013123 (2005)","journal-title":"Evol. Comput."},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Shapiro, J.L.: Diversity loss in general estimation of distribution algorithms. In: International Conference on Parallel Problem Solving from Nature, pp. 92\u2013101. Springer (2006)","DOI":"10.1007\/11844297_10"},{"key":"1_CR39","doi-asserted-by":"crossref","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)","journal-title":"Algorithmica"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Witt, C.: Domino convergence: why one should hill-climb on linear functions. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1539\u20131546 (2018)","DOI":"10.1145\/3205455.3205581"},{"key":"1_CR41","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1007\/s00453-018-0463-0","volume":"81","author":"C Witt","year":"2019","unstructured":"Witt, C.: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica 81, 632\u2013667 (2019)","journal-title":"Algorithmica"},{"key":"1_CR42","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2022.08.014","volume":"940","author":"C Witt","year":"2023","unstructured":"Witt, C.: How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theoret. Comput. Sci. 940, 18\u201342 (2023)","journal-title":"Theoret. Comput. Sci."}],"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-86849-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:44:42Z","timestamp":1743335082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86849-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031868481","9783031868498"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86849-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","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":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2025a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}