{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:45Z","timestamp":1759638765457,"version":"3.41.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774480"},{"type":"electronic","value":"9783319774497"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77449-7_1","type":"book-chapter","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T10:27:00Z","timestamp":1519986420000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Better Runtime Guarantees via Stochastic Domination"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,3]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","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, 51\u201381 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Jansen, T., Witt, C., Zarges, C.: A method to derive fixed budget results from expected optimisation times. In: Genetic and Evolutionary Computation Conference, GECCO 2013, pp. 1581\u20131588. ACM (2013)","DOI":"10.1145\/2463372.2463565"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_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 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2013.06.007","volume":"545","author":"T Jansen","year":"2014","unstructured":"Jansen, T., Zarges, C.: Performance analysis of randomised search heuristics operating with a fixed budget. Theoret. Comput. Sci. 545, 39\u201358 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2008.03.008","volume":"403","author":"PA Borisovsky","year":"2008","unstructured":"Borisovsky, P.A., Eremeev, A.V.: Comparing evolutionary algorithms to the (1+1)-EA. Theoret. Comput. Sci. 403, 33\u201341 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2012.01.010","volume":"436","author":"D Zhou","year":"2012","unstructured":"Zhou, D., Luo, D., Lu, R., Han, Z.: The use of tail inequalities on the probable computational time of randomized search heuristics. Theoret. Comput. Sci. 436, 106\u2013117 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR8","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 randomized search heuristics. Inf. Process. Lett. 114, 38\u201341 (2014)","journal-title":"Inf. Process. Lett."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: A tight runtime analysis of the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm on OneMax. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 1423\u20131430. ACM (2015)","DOI":"10.1145\/2739480.2754683"},{"key":"1_CR10","volume-title":"Comparison Methods for Stochastic Models and Risks","author":"A M\u00fcller","year":"2002","unstructured":"M\u00fcller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, Hoboken (2002)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2010.10.035","volume":"425","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theoret. Comput. Sci. 425, 17\u201333 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","first-page":"1","volume-title":"Theory of Randomized Search Heuristics","author":"B Doerr","year":"2011","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1\u201320. World Scientific, Singapore (2011)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-48224-5_6","volume-title":"Automata, Languages and Programming","author":"I Wegener","year":"2001","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 64\u201378. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_6"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Janson, S.: Tail bounds for sums of geometric and exponential variables. arXiv e-prints arXiv:1709.08157 (2017)","DOI":"10.1016\/j.spl.2017.11.017"},{"key":"1_CR15","unstructured":"Scheideler, C.: Probabilistic methods for coordination problems. University of Paderborn, Habilitation thesis (2000). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.70.1319"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/EVCO_a_00047","volume":"19","author":"B Doerr","year":"2011","unstructured":"Doerr, B., Happ, E., Klein, C.: Tight analysis of the (1+1)-EA for the single source shortest path problem. Evol. Comput. 19, 673\u2013691 (2011)","journal-title":"Evol. Comput."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00453-015-0019-5","volume":"75","author":"B Doerr","year":"2016","unstructured":"Doerr, B., Doerr, C.: The impact of random initialization on the runtime of randomized search heuristics. Algorithmica 75, 529\u2013553 (2016)","journal-title":"Algorithmica"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65, 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the (1+$$\\lambda $$) evolutionary algorithm\u2013different asymptotic runtimes for different instances. Theoret. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms 3, 349\u2013366 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2005.01.002","volume":"4","author":"T Jansen","year":"2006","unstructured":"Jansen, T., Wegener, I.: On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4, 181\u2013199 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Lehre, P.K., Neumann, F.: Theoretical analysis of rank-based mutation - combining exploration and exploitation. In: Congress on Evolutionary Computation, CEC 2009, pp. 1455\u20131462. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983114"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/978-3-319-10762-2_88","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"G Badkobeh","year":"2014","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 892\u2013901. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_88"},{"key":"1_CR25","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The (1+$$\\lambda $$) evolutionary algorithm with self-adjusting mutation rate. In: Genetic and Evolutionary Computation Conference, GECCO 2017. ACM (2017)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1007\/978-3-319-45823-6_77","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"B Doerr","year":"2016","unstructured":"Doerr, B., Doerr, C., Yang, J.: k-bit mutation with self-adjusting k outperforms standard bit mutation. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 824\u2013834. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_77"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 1123\u20131130. ACM (2016)","DOI":"10.1145\/2908812.2908950"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 849\u2013856. ACM (2017)","DOI":"10.1145\/3071178.3071288"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"de Perthuis de Laillevault, A., Doerr, B., Doerr, C.: Money for nothing: speeding up evolutionary algorithms through better initialization. In: Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 815\u2013822. ACM (2015)","DOI":"10.1145\/2739480.2754760"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Droste, S., Jansen, T., Wegener, I.: A natural and simple function which is hard for all evolutionary algorithms. In: IEEE International Conference on Industrial Electronics, Control, and Instrumentation, IECON 2000, pp. 2704\u20132709. IEEE (2000)","DOI":"10.1109\/IECON.2000.972425"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T Jansen","year":"2001","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evol. Comput. 5, 589\u2013599 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Comb. Probab. Comput. 14, 225\u2013247 (2005)","journal-title":"Comb. Probab. Comput."},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evol. Comput. 13, 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 51\u201381 (2001)","journal-title":"Artif. Intell."},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7, 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoret. Comput. Sci. 378, 32\u201340 (2007)","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-319-77449-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T07:43:17Z","timestamp":1751442197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77449-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774480","9783319774497"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77449-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 March 2018","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","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}