{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:46:07Z","timestamp":1761597967694},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T00:00:00Z","timestamp":1532563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00453-018-0488-4","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T13:25:01Z","timestamp":1532611501000},"page":"749-795","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise"],"prefix":"10.1007","volume":"81","author":[{"given":"Chao","family":"Qian","sequence":"first","affiliation":[]},{"given":"Chao","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Wu","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"issue":"2","key":"488_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1162\/evco.1994.2.2.97","volume":"2","author":"AN Aizawa","year":"1994","unstructured":"Aizawa, A.N., Wah, B.W.: Scheduling of genetic algorithms in a noisy environment. Evol. Comput. 2(2), 97\u2013122 (1994)","journal-title":"Evol. Comput."},{"key":"488_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2015.04.008","volume":"605","author":"Y Akimoto","year":"2015","unstructured":"Akimoto, Y., Astete-Morales, S., Teytaud, O.: Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theoret. Comput. Sci. 605, 42\u201350 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"488_CR3","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2005.859467","volume":"10","author":"DV Arnold","year":"2006","unstructured":"Arnold, D.V., Beyer, H.G.: A general noise model and its effects on evolution strategy performance. IEEE Trans. Evol. Comput. 10(4), 380\u2013391 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"488_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, Singapore (2011)"},{"key":"488_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming. Genetic Algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming. Genetic Algorithms. Oxford University Press, Oxford (1996)"},{"key":"488_CR6","doi-asserted-by":"crossref","unstructured":"Branke, J., Schmidt, C.: Selection in the presence of noise. In: Proceedings of the 5th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201903), pp. 766\u2013777. Chicago, IL (2003)","DOI":"10.1007\/3-540-45105-6_91"},{"issue":"5","key":"488_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/TEVC.2005.863130","volume":"10","author":"Y Chang","year":"2006","unstructured":"Chang, Y., Chen, S.: A new query reweighting method for document retrieval based on genetic algorithms. IEEE Trans. Evol. Comput. 10(5), 617\u2013622 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"488_CR8","doi-asserted-by":"crossref","unstructured":"Corus, D., Dang, D.C., Eremeev, A.V., Lehre, P.K.: Level-based analysis of genetic algorithms and other search processes. In: Proceedings of 13th International Conference on Parallel Problem Solving from Nature (PPSN\u201914), pp. 912\u2013921. Ljubljana, Slovenia (2014)","DOI":"10.1007\/978-3-319-10762-2_90"},{"key":"488_CR9","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K.: Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms. In: Proceedings of the 13th ACM Conference on Foundations of Genetic Algorithms (FOGA\u201915), pp. 62\u201368. Aberystwyth, UK (2015)","DOI":"10.1145\/2725494.2725508"},{"issue":"1","key":"488_CR10","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":"488_CR11","doi-asserted-by":"crossref","unstructured":"Doerr, B., Hota, A., K\u00f6tzing, T.: Ants easily solve stochastic shortest path problems. In: Proceedings of the 14th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201912), pp. 17\u201324. Philadelphia, PA (2012)","DOI":"10.1145\/2330163.2330167"},{"issue":"4","key":"488_CR12","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":"488_CR13","doi-asserted-by":"crossref","unstructured":"Droste, S.: Analysis of the (1 + 1) EA for a noisy OneMax. In: Proceedings of the 6th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201904), pp. 1088\u20131099. Seattle, WA (2004)","DOI":"10.1007\/978-3-540-24854-5_107"},{"issue":"1\u20132","key":"488_CR14","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(1\u20132), 51\u201381 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"488_CR15","doi-asserted-by":"crossref","unstructured":"Feldmann, M., K\u00f6tzing, T.: Optimizing expected path lengths with ant colony optimization using fitness proportional update. In: Proceedings of the 12th ACM Conference on Foundations of Genetic Algorithms (FOGA\u201913), pp. 65\u201374. Adelaide, Australia (2013)","DOI":"10.1145\/2460239.2460246"},{"issue":"2","key":"488_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/EVCO_a_00178","volume":"24","author":"T Friedrich","year":"2016","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M., Sutton, A.: Robustness of ant colony optimization to noise. Evol. Comput. 24(2), 237\u2013254 (2016)","journal-title":"Evol. Comput."},{"issue":"3","key":"488_CR17","first-page":"477","volume":"21","author":"T Friedrich","year":"2017","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M., Sutton, A.: The compact genetic algorithm is efficient under extreme gaussian noise. IEEE Trans. Evol. Comput. 21(3), 477\u2013490 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"488_CR18","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Quinzan, F., Sutton, A.: Resampling vs recombination: A statistical run time estimation. In: Proceedings of 14th ACM Conference on Foundations of Genetic Algorithms (FOGA\u201917), pp. 25\u201335. Copenhagen, Denmark (2017)","DOI":"10.1145\/3040718.3040723"},{"issue":"3","key":"488_CR19","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-015-0072-0","volume":"75","author":"C Gie\u00dfen","year":"2016","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. Algorithmica 75(3), 462\u2013489 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"488_CR20","doi-asserted-by":"publisher","first-page":"57","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(1), 57\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"3","key":"488_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans. Evol. Comput. 9(3), 303\u2013317 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"488_CR22","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/TEVC.2005.859371","volume":"10","author":"P Ma","year":"2006","unstructured":"Ma, P., Chan, K., Yao, X., Chiu, D.: An evolutionary clustering algorithm for gene expression microarray data analysis. IEEE Trans. Evol. Comput. 10(3), 296\u2013314 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"488_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer, Berlin (2010)"},{"issue":"3","key":"488_CR24","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00453-010-9387-z","volume":"59","author":"P Oliveto","year":"2011","unstructured":"Oliveto, P., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369\u2013386 (2011)","journal-title":"Algorithmica"},{"key":"488_CR25","unstructured":"Oliveto, P., Witt, C.: Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. CORR abs\/1211.7184 (2012)"},{"key":"488_CR26","doi-asserted-by":"crossref","unstructured":"Pr\u00fcgel-Bennett, A., Rowe, J., Shapiro, J.: Run-time analysis of population-based evolutionary algorithm in noisy environments. In: Proceedings of the 13th ACM Conference on Foundations of Genetic Algorithms (FOGA\u201915), pp. 69\u201375. Aberystwyth, UK (2015)","DOI":"10.1145\/2725494.2725498"},{"key":"488_CR27","doi-asserted-by":"crossref","unstructured":"Qian, C., Bian, C., Jiang, W., Tang, K.: Running time analysis of the (1+1)-EA for OneMax and LeadingOnes under bit-wise noise. In: Proceedings of the 19th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201917), pp. 1399\u20131406. Berlin, Germany (2017)","DOI":"10.1145\/3071178.3071347"},{"issue":"2","key":"488_CR28","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/evco_a_00201","volume":"26","author":"C Qian","year":"2018","unstructured":"Qian, C., Yu, Y., Tang, K., Jin, Y., Yao, X., Zhou, Z.H.: On the effectiveness of sampling for evolutionary optimization in noisy environments. Evol. Comput. 26(2), 237\u2013267 (2018)","journal-title":"Evol. Comput."},{"issue":"1","key":"488_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco_a_00170","volume":"26","author":"C Qian","year":"2018","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: Analyzing evolutionary optimization in noisy environments. Evol. Comput. 26(1), 1\u201341 (2018)","journal-title":"Evol. Comput."},{"key":"488_CR30","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 $$ \u03bb ) evolutionary algorithm. Theoret. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"488_CR31","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/S0040585X97982591","volume":"51","author":"IG Shevtsova","year":"2007","unstructured":"Shevtsova, I.G.: Sharpening of the upper bound of the absolute constant in the Berry\u2013Esseen inequality. Theory Probab. Appl. 51(3), 549\u2013553 (2007)","journal-title":"Theory Probab. Appl."},{"issue":"3","key":"488_CR32","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(3), 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"488_CR33","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00453-011-9606-2","volume":"64","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D., Thyssen, C.: A simple ant colony optimizer for stochastic shortest path problems. Algorithmica 64(4), 643\u2013672 (2012)","journal-title":"Algorithmica"},{"issue":"6","key":"488_CR34","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TEVC.2014.2378891","volume":"19","author":"Y Yu","year":"2015","unstructured":"Yu, Y., Qian, C., Zhou, Z.H.: Switch analysis for running time analysis of evolutionary algorithms. IEEE Trans. Evol. Comput. 19(6), 777\u2013792 (2015)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0488-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0488-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0488-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T06:25:40Z","timestamp":1661667940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0488-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,26]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0488-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,26]]},"assertion":[{"value":"30 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}