{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:24:17Z","timestamp":1760646257387,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_54","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"686-697","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift"],"prefix":"10.1007","author":[{"given":"Per Kristian","family":"Lehre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"3","key":"54_CR1","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/aop\/1176989707","volume":"20","author":"R Arratia","year":"1992","unstructured":"Arratia, R., Tavare, S.: The cycle structure of random permutations. The Annals of Probability 20(3), 1567\u20131591 (1992)","journal-title":"The Annals of Probability"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B., (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing (2011)","DOI":"10.1142\/7438"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 2083\u20132090. ACM Press (2011)","DOI":"10.1145\/2001576.2001856"},{"issue":"1","key":"54_CR4","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(1), 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"54_CR5","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: Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 1581\u20131588. ACM Press (2013)","DOI":"10.1145\/2463372.2463565"},{"issue":"4","key":"54_CR6","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(4), 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"54_CR7","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. Theoretical Computer Science 276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Feldmann, M., K\u00f6tzing, T.: Optimizing expected path lengths with ant colony optimization using fitness proportional update. In: Proc. of Foundations of Genetic Algorithms (FOGA 2013), pp. 65\u201374. ACM Press (2013)","DOI":"10.1145\/2460239.2460246"},{"key":"54_CR9","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting and occupation time bounds implied by drift analysis with applications. Advances in Applied Probability 14, 502\u2013525 (1982)","journal-title":"Advances in Applied Probability"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence. Artif. Intell. 127(1), 57\u201385 (2001), Erratum in Artif. Intell. 140(1\/2), 245\u2013248 (2002)","DOI":"10.1016\/S0004-3702(02)00260-6"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer (2013)","DOI":"10.1007\/978-3-642-17339-4"},{"key":"54_CR12","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. PhD thesis, Universit\u00e4t des Saarlandes, Germany (2010)"},{"issue":"6","key":"54_CR13","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1145\/195613.195632","volume":"41","author":"RM Karp","year":"1994","unstructured":"Karp, R.M.: Probabilistic recurrence relations. Journal of the ACM 41(6), 1136\u20131150 (1994)","journal-title":"Journal of the ACM"},{"key":"54_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15844-5_25","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":"54_CR15","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Drift analysis (tutorial). In: Companion to GECCO 2012, pp. 1239\u20131258. ACM Press (2012)","DOI":"10.1145\/2330784.2330939"},{"key":"54_CR16","unstructured":"Lehre, P.K., Witt, C.: General drift analysis with tail bounds. Technical report (2013). http:\/\/arxiv.org\/abs\/1307.2559"},{"issue":"2","key":"54_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1108\/17563780910959893","volume":"2","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy, B., Rowe, J.E., Cannings, C.: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. International Journal of Intelligent Computing and Cybernetics 2(2), 243\u2013284 (2009)","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"key":"54_CR18","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Natural Computing Series. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"issue":"3","key":"54_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00453-010-9387-z","volume":"59","author":"PS Oliveto","year":"2011","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369\u2013386 (2011)","journal-title":"Algorithmica"},{"key":"54_CR20","unstructured":"Oliveto, P.S., Witt, C.: Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. Technical report (2012). http:\/\/arxiv.org\/abs\/1211.7184"},{"key":"54_CR21","doi-asserted-by":"crossref","unstructured":"Rowe, J.E. Sudholt, D.: The choice of the offspring population size in the (1,$$\\lambda $$) EA. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2012), pp. 1349\u20131356. ACM Press (2012)","DOI":"10.1145\/2330163.2330350"},{"key":"54_CR22","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/42282.46160","volume":"35","author":"GH Sasak","year":"1988","unstructured":"Sasak, G.H., Hajek, B.: The time complexity of maximum matching by simulated annealing. Journal of the ACM 35, 387\u2013403 (1988)","journal-title":"Journal of the ACM"},{"issue":"3","key":"54_CR23","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. on Evolutionary Computation 17(3), 418\u2013435 (2013)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"54_CR24","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)"},{"key":"54_CR25","doi-asserted-by":"crossref","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combinatorics, Probability & Computing 22(2), 294\u2013318 (2013), Preliminary version in STACS 2012","DOI":"10.1017\/S0963548312000600"},{"issue":"1\u20132","key":"54_CR26","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. Information Processing Letters 114(1\u20132), 38\u201341 (2014)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T05:20:35Z","timestamp":1675833635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}