{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T03:26:30Z","timestamp":1769743590301,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Humanity and Social Science Youth Foundation of Ministry of Education of China","award":["14YJCZH216"],"award-info":[{"award-number":["14YJCZH216"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370102"],"award-info":[{"award-number":["61370102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370177"],"award-info":[{"award-number":["61370177"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Guangdong Natural Science Foundation","doi-asserted-by":"crossref","award":["2014A030306050"],"award-info":[{"award-number":["2014A030306050"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Guangdong Natural Science Foundation","doi-asserted-by":"crossref","award":["2015A030310304"],"award-info":[{"award-number":["2015A030310304"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2015PT022"],"award-info":[{"award-number":["2015PT022"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10586-016-0587-4","type":"journal-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T01:45:10Z","timestamp":1469583910000},"page":"1323-1332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["First hitting time analysis of continuous evolutionary algorithms based on average gain"],"prefix":"10.1007","volume":"19","author":[{"given":"Zhang","family":"Yushan","sequence":"first","affiliation":[]},{"given":"Huang","family":"Han","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Zhifeng","sequence":"additional","affiliation":[]},{"given":"Hu","family":"Guiwu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,27]]},"reference":[{"issue":"3","key":"587_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"PS Oliveto","year":"2007","unstructured":"Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results. Int. J. Autom. Comput. 4(3), 281\u2013293 (2007)","journal-title":"Int. J. Autom. Comput."},{"key":"587_CR2","doi-asserted-by":"crossref","unstructured":"Yao, X.: Unpacking and understanding evolutionary algorithms. In: Proceedings of WCCI 2012, pp. 60\u201376. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-30687-7_4"},{"issue":"4","key":"587_CR3","doi-asserted-by":"crossref","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"},{"issue":"1\u20132","key":"587_CR4","doi-asserted-by":"crossref","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$$ 1 + 1 ) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"587_CR5","first-page":"349","volume-title":"Evolutionary Optimization","author":"I Wegener","year":"2002","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization, pp. 349\u2013369. Kluwer Academic Publishers, Norwell, MA (2002)"},{"issue":"1","key":"587_CR6","doi-asserted-by":"crossref","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":"587_CR7","doi-asserted-by":"crossref","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$$ 1 + 1 )EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evolut. Comput. 13(5), 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"1","key":"587_CR8","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ins.2010.01.031","volume":"259","author":"PK Lehre","year":"2014","unstructured":"Lehre, P.K., Yao, X.: Runtime analysis of the ( $$1+1$$ 1 + 1 ) EA on computing unique input output sequences. Inf. Sci. 259(1), 510\u2013531 (2014)","journal-title":"Inf. Sci."},{"issue":"6","key":"587_CR9","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"XS Lai","year":"2014","unstructured":"Lai, X.S., Zhou, Y.R., He, J., et al.: Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans. Evolut. Comput. 18(6), 860\u2013872 (2014)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"1","key":"587_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00453-014-9898-0","volume":"73","author":"YR Zhou","year":"2015","unstructured":"Zhou, Y.R., Zhang, J., Wang, Y.: Performance analysis of the ( $$1+1$$ 1 + 1 ) evolutionary algorithm for the multiprocessor scheduling problem. Algorithmica 73(1), 21\u201341 (2015)","journal-title":"Algorithmica"},{"issue":"8","key":"587_CR11","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TCYB.2014.2354343","volume":"45","author":"YR Zhou","year":"2015","unstructured":"Zhou, Y.R., Lai, X.S., Li, K.: Approximation and parameterized runtime analysis of evolutionary algorithms for the maximum cut problem. IEEE Trans. Cybern. 45(8), 1491\u20131498 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"10","key":"587_CR12","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1080\/00207160.2014.964695","volume":"92","author":"X Xia","year":"2015","unstructured":"Xia, X., Zhou, Y.R., Lai, X.S.: On the analysis of the ( $$1+ 1$$ 1 + 1 ) evolutionary algorithm for the maximum leaf spanning tree problem. Int. J. Comput. Math. 92(10), 2023\u20132035 (2015)","journal-title":"Int. J. Comput. Math."},{"issue":"1\u20132","key":"587_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0004-3702(02)00381-8","volume":"145","author":"J He","year":"2003","unstructured":"He, J., Yao, X.: Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif. Intell. 145(1\u20132), 59\u201397 (2003)","journal-title":"Artif. Intell."},{"issue":"15","key":"587_CR14","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1016\/j.artint.2008.07.001","volume":"172","author":"Y Yu","year":"2008","unstructured":"Yu, Y., Zhou, Z.H.: A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif. Intell. 172(15), 1809\u20131832 (2008)","journal-title":"Artif. Intell."},{"issue":"6","key":"587_CR15","doi-asserted-by":"crossref","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. Evolut. Comput. 19(6), 777\u2013792 (2015)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"3","key":"587_CR16","doi-asserted-by":"crossref","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. Evolut. Comput. 17(3), 418\u2013435 (2013)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"1\u20132","key":"587_CR17","doi-asserted-by":"crossref","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(1\u20132), 38\u201341 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"587_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00453-010-9396-y","volume":"59","author":"J J\u00e4gersk\u00fcpper","year":"2011","unstructured":"J\u00e4gersk\u00fcpper, J.: Combining markov-chain analysis and drift analysis: the ( $$1+1$$ 1 + 1 ) evolutionary algorithm on linear functions reloaded. Algorithmica 59(3), 409\u2013424 (2011)","journal-title":"Algorithmica"},{"issue":"5","key":"587_CR19","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TSMCB.2008.2012167","volume":"39","author":"TS Chen","year":"2009","unstructured":"Chen, T.S., He, J., Sun, G., et al.: A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans. Syst. Man Cybern. B 39(5), 1092\u20131106 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"issue":"3","key":"587_CR20","doi-asserted-by":"crossref","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":"587_CR21","doi-asserted-by":"crossref","unstructured":"Rowe, J., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda )$$ \u03bb ) EA. In: Proceedings of GECCO \u201912, pp. 1349\u20131356. ACM Press, New York (2012)","DOI":"10.1145\/2330163.2330350"},{"issue":"02","key":"587_CR22","doi-asserted-by":"crossref","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(02), 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"587_CR23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.tcs.2007.02.042","volume":"379","author":"J J\u00e4gersk\u00fcpper","year":"2007","unstructured":"J\u00e4gersk\u00fcpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci. 379(3), 329\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"587_CR24","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.orl.2007.10.003","volume":"36","author":"J J\u00e4gersk\u00fcpper","year":"2008","unstructured":"J\u00e4gersk\u00fcpper, J.: Lower bounds for randomized direct search with isotropic sampling. Oper. Res. Lett. 36(3), 327\u2013332 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"587_CR25","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1080\/00207721.2011.605963","volume":"44","author":"A Agapie","year":"2013","unstructured":"Agapie, A., Agapie, M., Baganu, G.: Evolutionary algorithms for continuous-space optimisation. Int. J. Syst. Sci. 44(3), 502\u2013512 (2013)","journal-title":"Int. J. Syst. Sci."},{"issue":"1","key":"587_CR26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207160903477167","volume":"88","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Zou, X.F., He, J.: Drift conditions for estimating the first hitting times of evolutionary algorithms. Int. J. Comput. Math. 88(1), 37\u201350 (2011)","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"587_CR27","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1360\/112013-3","volume":"44","author":"H Huang","year":"2014","unstructured":"Huang, H., Xu, W.D., Zhang, Y.S., et al.: Runtime analysis for continuous ( $$1+1$$ 1 + 1 ) evolutionary algorithm based on average gain model. Sci. Sin. Inf. 44(6), 811\u2013824 (2014)","journal-title":"Sci. Sin. Inf."},{"issue":"6","key":"587_CR28","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TSMC.2015.2470645","volume":"46","author":"J Xuan","year":"2016","unstructured":"Xuan, J., Luo, X., Zhang, G., Lu, J., Xu, Z.: Uncertainty analysis for the keyword system of web events. IEEE Trans. Syst. Man Cybern. 46(6), 829\u2013842 (2016)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"587_CR29","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/TFUZZ.2015.2390226","volume":"23","author":"X Wei","year":"2015","unstructured":"Wei, X., Luo, X., Li, Q., Zhang, J., Xu, Z.: Online comment-based hotel quality automatic assessment using improved Fuzzy comprehensive evaluation and Fuzzy cognitive map. IEEE Trans. Fuzzy Syst. 23(1), 72\u201384 (2015)","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"3","key":"587_CR30","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TASE.2010.2094608","volume":"8","author":"X Luo","year":"2011","unstructured":"Luo, X., Xu, Z., Yu, J., Chen, X.: Building association link network for semantic linkon web resources. IEEE Trans. Autom. Sci. Eng. 8(3), 482\u2013494 (2011)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"587_CR31","volume-title":"Applied Stochastic Processes","author":"B Zhang","year":"2004","unstructured":"Zhang, B., Zhang, J.X.: Applied Stochastic Processes. Tsinghua University Press, Beijing (2004)"},{"key":"587_CR32","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"MA Schumer","year":"1968","unstructured":"Schumer, M.A., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13, 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0587-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-016-0587-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0587-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T02:07:44Z","timestamp":1589681264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-016-0587-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,27]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["587"],"URL":"https:\/\/doi.org\/10.1007\/s10586-016-0587-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,27]]}}}