{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:57:51Z","timestamp":1743105471883,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031577116"},{"type":"electronic","value":"9783031577123"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-57712-3_11","type":"book-chapter","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T18:02:14Z","timestamp":1713463334000},"page":"162-176","source":"Crossref","is-referenced-by-count":1,"title":["A Theoretical Investigation of\u00a0Termination Criteria for\u00a0Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Jonathan E.","family":"Rowe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2023.113757","volume":"950","author":"J Bossek","year":"2023","unstructured":"Bossek, J., Sudholt, D.: Do additional target points speed up evolutionary algorithms? Theor. Comput. Sci. 950, 20\u201338 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths. In: FOGA 2011: Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms. ACM (2011)","DOI":"10.1145\/1967654.1967670"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00453-018-0477-7","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at almost no extra cost. Algorithmica 81, 703\u2013748 (2019)","journal-title":"Algorithmica"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s00453-023-01135-x","volume":"86","author":"B Doerr","year":"2023","unstructured":"Doerr, B., Rajabi, A., Witt, C.: Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. Algorithmica 86, 64\u201389 (2023)","journal-title":"Algorithmica"},{"key":"11_CR5","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"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-15844-5_18","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 174\u2013183. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_18"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2019.05.021","volume":"785","author":"H Einarsson","year":"2019","unstructured":"Einarsson, H., et al.: The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. Theor. Comput. Sci. 785, 150\u2013170 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ghoreishi, S., Clausen, A., Joergensen, B.: Termination criteria in evolutionary algorithms: a survey. In: 9th International Joint Conference on Computational Intelligence, pp. 373\u2013384 (2017)","DOI":"10.5220\/0006577903730384"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhou, A., Zhang, H.: Termination detection strategies in evolutionary algorithms: a survey. In: GECCO 2018: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1063\u20131070. ACM (2018)","DOI":"10.1145\/3205455.3205466"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ejor.2020.03.027","volume":"286","author":"FG Lobo","year":"2020","unstructured":"Lobo, F.G., Bazargani, M., Burke, E.K.: A cutoff time strategy based on the coupon collector\u2019s problem. Eur. J. Oper. Res. 286, 101\u2013114 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the $$(1, \\lambda )$$ evolutionary algorithm. Theor. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ipl.2013.09.013","volume":"114","author":"C Witt","year":"2014","unstructured":"Witt, C.: Fitness levels with tail bounds for the analysis of randomised search heuristics. Inf. Process. Lett. 114, 38\u201341 (2014)","journal-title":"Inf. Process. Lett."}],"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-57712-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T18:03:13Z","timestamp":1713463393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57712-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577116","9783031577123"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57712-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]}}}