{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:28:32Z","timestamp":1772497712418,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","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":[[2021,4]]},"DOI":"10.1007\/s00453-019-00666-6","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T11:03:09Z","timestamp":1579518189000},"page":"940-975","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Analysis of Noisy Evolutionary Optimization When Sampling Fails"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6011-2512","authenticated-orcid":false,"given":"Chao","family":"Qian","sequence":"first","affiliation":[]},{"given":"Chao","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,20]]},"reference":[{"key":"666_CR1","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."},{"key":"666_CR2","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":"666_CR3","doi-asserted-by":"crossref","unstructured":"Bian, C., Qian, C., Tang, K.: Towards a running time analysis of the (1+1)-EA for OneMax and LeadingOnes under general bit-wise noise. In: Proceedings of the 15th International Conference on Parallel Problem Solving from Nature (PPSN\u201918), pp. 165\u2013177. Coimbra, Portugal (2018)","DOI":"10.1007\/978-3-319-99259-4_14"},{"key":"666_CR4","doi-asserted-by":"crossref","unstructured":"Branke, J., Schmidt, C.: Sequential sampling in noisy environments. In: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN\u201904), pp. 202\u2013211. Birmingham, UK (2004)","DOI":"10.1007\/978-3-540-30217-9_21"},{"key":"666_CR5","doi-asserted-by":"crossref","unstructured":"Cant\u00fa-Paz, E.: Adaptive sampling for noisy problems. In: Proceedings of the 6th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201904), pp. 947\u2013958. Seattle, WA (2004)","DOI":"10.1007\/978-3-540-24854-5_95"},{"key":"666_CR6","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"},{"key":"666_CR7","doi-asserted-by":"crossref","unstructured":"Dang-Nhu, R., Dardinier, T., Doerr, B., Izacard, G., Nogneng, D.: A new analysis method for evolutionary optimization of dynamic and noisy objective functions. In: Proceedings of the 20th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201918), pp. 1467\u20131474. Kyoto, Japan (2018)","DOI":"10.1145\/3205455.3205563"},{"key":"666_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0125-7","volume-title":"Combinatorial Methods in Density Estimation","author":"L Devroye","year":"2001","unstructured":"Devroye, L., Lugosi, G.: Combinatorial Methods in Density Estimation. Springer, New York (2001)"},{"key":"666_CR9","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":"666_CR10","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":"666_CR11","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"},{"key":"666_CR12","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":"666_CR13","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":"666_CR14","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."},{"issue":"3","key":"666_CR15","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":"3","key":"666_CR16","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 14(3), 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"666_CR17","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":"5","key":"666_CR18","doi-asserted-by":"publisher","first-page":"052204","DOI":"10.1007\/s11432-016-9115-2","volume":"61","author":"G Li","year":"2018","unstructured":"Li, G., Chou, W.: Path planning for mobile robot using self-adaptive learning particle swarm optimization. Sci. China Inf. Sci. 61(5), 052204 (2018)","journal-title":"Sci. China Inf. Sci."},{"issue":"1","key":"666_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2013.2290086","volume":"18","author":"A Mukhopadhyay","year":"2013","unstructured":"Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello Coello, C.A.: A survey of multiobjective evolutionary algorithms for data mining: Part I. IEEE Trans. Evol. Comput. 18(1), 4\u201319 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"666_CR20","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":"666_CR21","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":"666_CR22","unstructured":"Oliveto, P., Witt, C.: Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 (2012)"},{"key":"666_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2013.06.015","volume":"545","author":"P Oliveto","year":"2014","unstructured":"Oliveto, P., Witt, C.: On the runtime analysis of the simple genetic algorithm. Theoret. Comput. Sci. 545, 2\u201319 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"666_CR24","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":"666_CR25","doi-asserted-by":"crossref","unstructured":"Qian, C.: Distributed Pareto optimization for large-scale noisy subset selection. IEEE Trans. Evol. Comput. (2020)","DOI":"10.1109\/TEVC.2019.2929555"},{"issue":"2","key":"666_CR26","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00453-018-0488-4","volume":"81","author":"C Qian","year":"2019","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. Algorithmica 81(2), 749\u2013795 (2019)","journal-title":"Algorithmica"},{"key":"666_CR27","doi-asserted-by":"crossref","unstructured":"Qian, C., Bian, C., Yu, Y., Tang, K., Yao, X.: Analysis of noisy evolutionary optimization when sampling fails. In: Proceedings of the 20th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201918), pp. 1507\u20131514. Kyoto, Japan (2018)","DOI":"10.1145\/3205455.3205643"},{"key":"666_CR28","unstructured":"Qian, C., Shi, J.C., Yu, Y., Tang, K., Zhou, Z.H.: Subset selection under noise. In: Advances in Neural Information Processing Systems 30 (NIPS\u201917), pp. 3562\u20133572. Long Beach, CA (2017)"},{"issue":"2","key":"666_CR29","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":"666_CR30","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":"666_CR31","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: On the robustness of evolutionary algorithms to noise: Refined results and an example where noise helps. In: Proceedings of the 20th ACM Conference on Genetic and Evolutionary Computation (GECCO\u201918), pp. 1523\u20131530. Kyoto, Japan (2018)","DOI":"10.1145\/3205455.3205595"},{"issue":"4","key":"666_CR32","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":"3","key":"666_CR33","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ejor.2009.11.003","volume":"204","author":"A Syberfeldt","year":"2010","unstructured":"Syberfeldt, A., Ng, A., John, R., Moore, P.: Evolutionary optimisation of noisy multi-objective problems using confidence-based dynamic resampling. Eur. J. Oper. Res. 204(3), 533\u2013544 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"666_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1070\/RM2010v065n03ABEH004688","volume":"65","author":"IS Tyurin","year":"2010","unstructured":"Tyurin, I.S.: An improvement of upper estimates of the constants in the Lyapunov theorem. Russ. Math. Surv. 65(3), 201\u2013202 (2010)","journal-title":"Russ. Math. Surv."},{"issue":"1","key":"666_CR35","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the ($$\\mu$$+1) EA on simple pseudo-Boolean functions. Evol. Comput. 14(1), 65\u201386 (2006)","journal-title":"Evol. Comput."},{"issue":"2","key":"666_CR36","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/s11704-019-8084-6","volume":"13","author":"P Xu","year":"2019","unstructured":"Xu, P., Liu, X., Cao, H., Zhang, Z.: An efficient energy aware virtual network migration based on genetic algorithm. Front. Comput. Sci. 13(2), 440\u2013442 (2019)","journal-title":"Front. Comput. Sci."},{"issue":"6","key":"666_CR37","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."},{"issue":"4","key":"666_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCI.2007.906681","volume":"2","author":"Z Zhang","year":"2007","unstructured":"Zhang, Z., Xin, T.: Immune algorithm with adaptive sampling in noisy environments and its application to stochastic optimization problems. IEEE Comput. Intell. Mag. 2(4), 29\u201340 (2007)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"666_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"ZH Zhou","year":"2019","unstructured":"Zhou, Z.H., Yu, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore (2019)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00666-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00666-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00666-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T07:02:27Z","timestamp":1616310147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00666-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00666-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"8 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}