{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:48:55Z","timestamp":1774910935028,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-20537-7_1","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:31:28Z","timestamp":1773757888000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Self-adjusting Compact Genetic Algorithm"],"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":[[2026,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: Proceedings of the International Conference on Parallel Problem Solving from Nature, Part III, PPSN 2024, pp. 53\u201369. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-70071-2_4"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adak, S., Witt, C.: Improved runtime analysis of a multi-valued compact genetic algorithm on two generalized onemax problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025, pp. 1585\u20131593. ACM Press (2025)","DOI":"10.1145\/3712256.3726353"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Adak, S., Witt, C.: Runtime analysis of a compact genetic algorithm with high selection pressure. In: Proceedings of the 18th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2025, pp. 14\u201324. ACM Press (2025)","DOI":"10.1145\/3729878.3746630"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Adak, S., Witt, C.: A runtime analysis of the multi-valued compact genetic algorithm on generalized LeadingOnes. In: Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2025, pp. 1\u201317. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-86849-8_1"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Aleti, A., Moser, I.: A systematic literature review of adaptive parameter control methods for evolutionary algorithms. ACM Comput. Surv. 49(3) (2016)","DOI":"10.1145\/2996355"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Ayodele, M., McCall, J., Regnier-Coudert, O.: Estimation of distribution algorithms for the multi-mode resource constrained project scheduling problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC 2017), pp. 1579\u20131586 (2017)","DOI":"10.1109\/CEC.2017.7969491"},{"key":"1_CR7","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 2023","DOI":"10.1016\/j.tcs.2024.114622"},{"key":"1_CR8","unstructured":"Devroye, L.: The compound random search. Ph.D. thesis, Purdue Univ., West Lafayette, IN (1972)"},{"key":"1_CR9","doi-asserted-by":"publisher","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_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO 2015, pp. 1335\u20131342. ACM Press (2015)","DOI":"10.1145\/2739480.2754684"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm. Algorithmica 80(5), 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 271\u2013321. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-29414-4_6"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Provably optimal self-adjusting step sizes for multi-valued decision variables. In: Parallel Problem Solving from Nature - PPSN XIV, PPSN 2016, pp. 782\u2013791. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-45823-6_73"},{"issue":"10","key":"1_CR14","doi-asserted-by":"publisher","first-page":"3108","DOI":"10.1007\/s00453-021-00854-3","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Doerr, C., Lengler, J.: Self-adjusting mutation rates with provably optimal success rules. Algorithmica 83(10), 3108\u20133147 (2021)","journal-title":"Algorithmica"},{"issue":"2","key":"1_CR15","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"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83(4), 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"1_CR17","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)","journal-title":"Nat. Comput."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Fang, C., Kolisch, R., Wang, L., Mu, C.: An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem. Flex. Serv. Manuf. J. 27(4), 585\u2013605 (2015)","DOI":"10.1007\/s10696-015-9210-x"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Fischer, P., Larsen, E.L., Witt, C.: First steps towards a runtime analysis of neuroevolution. In: Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2023, pp. 61\u201372. ACM Press (2023)","DOI":"10.1145\/3594805.3607125"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Fischer, P., Warwicker, J.A., Witt, C.: A runtime analysis of bias-invariant neuroevolution and dynamic fitness evaluation. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, pp. 1560\u20131568. ACM Press (2024)","DOI":"10.1145\/3638529.3654044"},{"key":"1_CR21","unstructured":"Hamano, R., Uchida, K., Shirakawa, S., Morinaga, D., Akimoto, Y.: Tail bounds on the runtime of categorical compact genetic algorithm. Evol. Comput. 1\u201349 (2024)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Hard problems are easier for success-based parameter control. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 796\u2013804. ACM Press (2022)","DOI":"10.1145\/3512290.3528781"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Holker, G., dos Santos, M.V.: Toward an estimation of distribution algorithm for the evolution of artificial neural networks. In: Proceedings of the Third C* Conference on Computer Science and Software Engineering, C3S2E 2010, pp. 17\u201322. ACM (2010)","DOI":"10.1145\/1822327.1822330"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.E.: Parameter control in evolutionary algorithms: trends and challenges. Trans. Evol. Comput. 19(2), 167\u2013187 (2015)","journal-title":"Trans. Evol. Comput."},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/TEVC.2013.2281524","volume":"18","author":"H Karshenas","year":"2014","unstructured":"Karshenas, H., Santana, R., Bielza, C., Larra\u00f1aga, P.: Multiobjective estimation of distribution algorithm based on joint modeling of objectives and variables. IEEE Trans. Evol. Comput. 18(4), 519\u2013542 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, vol. 2. Springer, Cham (2002)","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"1_CR27","doi-asserted-by":"publisher","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_CR28","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Sastry, K., Cantu-Paz, E.: Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, vol. 33. Springer, Cham (2006)","DOI":"10.1007\/978-3-540-34954-9"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"292","key":"1_CR30","first-page":"1","volume":"24","author":"W Zheng","year":"2023","unstructured":"Zheng, W., Doerr, B.: From understanding genetic drift to a smart-restart mechanism for estimation-of-distribution algorithms. J. Mach. Learn. Res. 24(292), 1\u201340 (2023)","journal-title":"J. Mach. Learn. Res."}],"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-032-20537-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:01:58Z","timestamp":1774908118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","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":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}