{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T19:10:13Z","timestamp":1790709013478,"version":"4.1.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_75","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"803-813","source":"Crossref","is-referenced-by-count":51,"title":["Self-adaptation of Mutation Rates in Non-elitist Populations"],"prefix":"10.1007","author":[{"given":"Duc-Cuong","family":"Dang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Per Kristian","family":"Lehre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"75_CR1","unstructured":"B\u00e4ck, T.: Self-adaptation in genetic algorithms. In: Proceedings of ECAL 1992, pp. 263\u2013271 (1992)"},{"key":"75_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010)"},{"key":"75_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1007\/978-3-319-10762-2_90","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"D Corus","year":"2014","unstructured":"Corus, D., Dang, D.-C., Eremeev, A.V., Lehre, P.K.: Level-based analysis of genetic algorithms and other search processes. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 912\u2013921. Springer, Heidelberg (2014)"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Lehre, P.K.: Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels. In: Proceedings of GECCO 2014, pp. 1367\u20131374 (2014)","DOI":"10.1145\/2576768.2598374"},{"key":"75_CR5","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 GECCO 2015, pp. 1335\u20131342 (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"75_CR6","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at (almost) no extra cost. In: Proceedings of GECCO 2015, pp. 831\u2013838 (2015)","DOI":"10.1145\/2739480.2754681"},{"key":"75_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-69432-8_2","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"AE Eiben","year":"2007","unstructured":"Eiben, A.E., Michalewicz, Z., Schoenauer, M., Smith, J.E.: Parameter control in evolutionary algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms. SCI, vol. 54, pp. 19\u201346. Springer, Heidelberg (2007)"},{"issue":"15","key":"75_CR8","doi-asserted-by":"crossref","first-page":"6266","DOI":"10.1073\/pnas.0607280104","volume":"104","author":"PJ Gerrish","year":"2007","unstructured":"Gerrish, P.J., Colato, A., Perelson, A.S., Sniegowski, P.D.: Complete genetic linkage can subvert natural selection. PNAS 104(15), 6266\u20136271 (2007)","journal-title":"PNAS"},{"issue":"2","key":"75_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"75_CR10","series-title":"Lecture Notes in Computer Science","first-page":"244","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"PK Lehre","year":"2010","unstructured":"Lehre, P.K.: Negative drift in populations. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 244\u2013253. Springer, Heidelberg (2010)"},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., \u00d6zcan, E.: A runtime analysis of simple hyper-heuristics: to mix or not to mixoperators. In: Proceedings of FOGA 2013, pp. 97\u2013104 (2013)","DOI":"10.1145\/2460239.2460249"},{"issue":"2","key":"75_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2011.2112665","volume":"16","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Yao, X.: On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Trans. Evol. Comput. 16(2), 225\u2013241 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"75_CR13","doi-asserted-by":"crossref","unstructured":"van Rijn, S., Emmerich, M.T.M., Reehuis, E., B\u00e4ck, T.: Optimizing highly constrained truck loadings using a self-adaptive genetic algorithm. In: Proceedings of CEC 2015, pp. 227\u2013234 (2015)","DOI":"10.1109\/CEC.2015.7256896"},{"key":"75_CR14","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.jtbi.2014.09.017","volume":"364","author":"JZ Xue","year":"2015","unstructured":"Xue, J.Z., Kaznatcheev, A., Costopoulos, A., Guichard, F.: Fidelity drive: a mechanism for chaperone proteins to maintain stable mutation rates in prokaryotes over evolutionary time. J. Theor. Biol. 364, 162\u2013167 (2015)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}