{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:50:36Z","timestamp":1764053436056,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,19]],"date-time":"2016-11-19T00:00:00Z","timestamp":1479513600000},"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","61370177"],"award-info":[{"award-number":["61370102","61370177"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Natural Science Funds for Distinguished Young Scholar","award":["2014A030306050"],"award-info":[{"award-number":["2014A030306050"]}]},{"name":"Fundamental Research Funds for the Central Universities, SCUT","award":["2015PT022"],"award-info":[{"award-number":["2015PT022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00521-016-2651-7","type":"journal-article","created":{"date-parts":[[2016,11,19]],"date-time":"2016-11-19T17:17:20Z","timestamp":1479575840000},"page":"617-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Running-time analysis of evolutionary programming based on Lebesgue measure of searching space"],"prefix":"10.1007","volume":"30","author":[{"given":"Yushan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Han","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Guiwu","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,19]]},"reference":[{"key":"2651_CR1","volume-title":"Artificial intelligence through simulated evolution","author":"LJ Fogel","year":"1996","unstructured":"Fogel LJ, Owens AJ, Walsh MJ (1996) Artificial intelligence through simulated evolution. Wiley, New York"},{"key":"2651_CR2","volume-title":"System identification through simulated evolution: a machine learning approach to modeling","author":"DB Fogel","year":"1991","unstructured":"Fogel DB (1991) System identification through simulated evolution: a machine learning approach to modeling. Ginn Press, Washington"},{"key":"2651_CR3","unstructured":"Fogel DB (1992) Evolving artificial intelligence. Dissertation, University of California at San Diego"},{"issue":"1","key":"2651_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/01969729308961697","volume":"24","author":"DB Fogel","year":"1993","unstructured":"Fogel DB (1993) Applying evolutionary programming to selected traveling salesman problems. Cybern Syst 24(1):27\u201336","journal-title":"Cybern Syst"},{"issue":"1","key":"2651_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck T, Schwefel HP (1993) An overview of evolutionary algorithms for parameter optimization. Evol Comput 1(1):1\u201323","journal-title":"Evol Comput"},{"key":"2651_CR6","volume-title":"Evolution and optimum seeking","author":"HP Schwefel","year":"1995","unstructured":"Schwefel HP (1995) Evolution and optimum seeking. Wiley, New York"},{"issue":"2","key":"2651_CR7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"2651_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TEVC.2003.816583","volume":"8","author":"CY Lee","year":"2004","unstructured":"Lee CY, Yao X (2004) Evolutionary programming using mutations based on the Lvy probability distribution. IEEE Trans Evol Comput 8(1):1\u201313","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"2651_CR9","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/4235.942534","volume":"5","author":"G Rudolph","year":"2001","unstructured":"Rudolph G (2001) Self-adaptive mutations may lead to premature convergence. IEEE Trans Evol Comput 5(4):410\u2013414","journal-title":"IEEE Trans Evol Comput"},{"key":"2651_CR10","first-page":"63","volume":"600","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) Convergence of non-elitist strategies. Proceedings of the first IEEE conference on evolutionary computation 600:63\u201366","journal-title":"Proceedings of the first IEEE conference on evolutionary computation"},{"key":"2651_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/ICEC.1996.542332","volume":"180","author":"G Rudolph","year":"1996","unstructured":"Rudolph G (1996) Convergence of evolutionary algorithms in general search spaces. Proceedings of IEEE international conference on evolutionary computation 180:50\u201354","journal-title":"Proceedings of IEEE international conference on evolutionary computation"},{"issue":"1","key":"2651_CR12","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 (2002) On the analysis of the (1 + 1) evolutionary algorithm. Theor Comput Sci 276(1):51\u201381","journal-title":"Theor Comput Sci"},{"issue":"1","key":"2651_CR13","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 (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"issue":"2","key":"2651_CR14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns M, Thiele L, Zitzler E (2004) Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Trans Evolut Comput 8(2):170\u2013182","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"2651_CR15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2006.03.007","volume":"358","author":"R Kumar","year":"2006","unstructured":"Kumar R, Banerjee N (2006) Analysis of a multiobjective evolutionary algorithm on the 0C1 knapsack problem. Theor Comput Sci 358(1):104\u2013120","journal-title":"Theor Comput Sci"},{"issue":"3","key":"2651_CR16","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1016\/j.ejor.2006.08.005","volume":"181","author":"F Neumann","year":"2007","unstructured":"Neumann F (2007) Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. Eur J Oper Res 181(3):1620\u20131629","journal-title":"Eur J Oper Res"},{"issue":"15","key":"2651_CR17","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 ZH (2008) A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif Intell 172(15):1809\u20131832","journal-title":"Artif Intell"},{"key":"2651_CR18","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2011.02.016","volume":"436","author":"T Chen","year":"2012","unstructured":"Chen T, Tang K, Chen G et al (2012) A large population size can be unhelpful in evolutionary algorithms. Theor Comput Sci 436:54\u201370","journal-title":"Theor Comput Sci"},{"issue":"2","key":"2651_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2011.2112665","volume":"16","author":"PK Lehre","year":"2012","unstructured":"Lehre PK, Yao X (2012) On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Trans Evolut Comput 16(2):225\u2013241","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"2651_CR20","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt C (2008) Population size versus runtime of a simple evolutionary algorithm. Theor Comput Sci 403(1):104\u2013120","journal-title":"Theor Comput Sci"},{"issue":"5","key":"2651_CR21","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TSMCB.2008.2012167","volume":"39","author":"T Chen","year":"2009","unstructured":"Chen T, He J, Sun G et al (2009) A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans Syst Man Cybern Part B Cybern 39(5):1092\u20131106","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"2651_CR22","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","volume":"180","author":"Y Yu","year":"2012","unstructured":"Yu Y, Yao X, Zhou ZH (2012) On the approximation ability of evolutionary optimization with application to minimum set cover. Artif Intell 180:20\u201333","journal-title":"Artif Intell"},{"issue":"2","key":"2651_CR23","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.artint.2008.11.002","volume":"173","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, He J, Nie Q (2009) A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artif Intell 173(2):240\u2013257","journal-title":"Artif Intell"},{"issue":"5","key":"2651_CR24","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto PS, He J, Yao X (2009) Analysis of the-EA for finding approximate solutions to vertex cover problems. IEEE Trans Evol Comput 13(5):1006\u20131029","journal-title":"IEEE Trans Evol Comput"},{"key":"2651_CR25","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ins.2010.01.031","volume":"259","author":"PK Lehre","year":"2014","unstructured":"Lehre PK, Yao X (2014) Runtime analysis of the (1 + 1) EA on computing unique input output sequences. Inf Sci Int J 259:510\u2013531","journal-title":"Inf Sci Int J"},{"issue":"6","key":"2651_CR26","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"X Lai","year":"2014","unstructured":"Lai X, Zhou Y, He J et al (2014) Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans Evolut Comput 18(6):860\u2013872","journal-title":"IEEE Trans Evolut Comput"},{"key":"2651_CR27","first-page":"1","volume":"5","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Zhang J, Wang Y (2014) Performance analysis of the $$(1+ 1)$$ ( 1 + 1 ) Evolutionary Algorithm for the multiprocessor scheduling problem. Algorithmica 5:1\u201321","journal-title":"Algorithmica"},{"key":"2651_CR28","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2014.2354343","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Lai X, Li K (2014) Approximation and parameterized runtime analysis of Evolutionary Algorithms for the maximum cut problem. IEEE Trans Cybern. doi: 10.1109\/tcyb.2014.2354343","journal-title":"IEEE Trans Cybern"},{"issue":"02","key":"2651_CR29","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt C (2013) Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combin Probab Comput 22(02):294\u2013318","journal-title":"Combin Probab Comput"},{"issue":"1","key":"2651_CR30","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 (2014) Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf Process Lett 114(1):38\u201341","journal-title":"Inf Process Lett"},{"issue":"3","key":"2651_CR31","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt D (2013) A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans Evolut Comput 17(3):418\u2013435","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"2651_CR32","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.tcs.2007.02.042","volume":"379","author":"J J\u00e4gerskpper","year":"2007","unstructured":"J\u00e4gerskpper J (2007) Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor Comput Sci 379(3):329\u2013347","journal-title":"Theor Comput Sci"},{"issue":"3","key":"2651_CR33","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.orl.2007.10.003","volume":"36","author":"J J\u00e4gerskpper","year":"2008","unstructured":"J\u00e4gerskpper J (2008) Lower bounds for randomized direct search with isotropic sampling. Oper Res Lett 36(3):327\u2013332","journal-title":"Oper Res Lett"},{"issue":"3","key":"2651_CR34","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 (2013) Evolutionary algorithms for continuous-space optimisation. Int J Syst Sci 44(3):502\u2013512","journal-title":"Int J Syst Sci"},{"issue":"5","key":"2651_CR35","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1109\/TCYB.2013.2257748","volume":"43","author":"A Agapie","year":"2013","unstructured":"Agapie A, Agapie M, Rudolph G, Zbaganu G (2013) Convergence of evolutionary algorithms on the n-dimensional continuous space. IEEE Trans Cybern 43(5):1462\u20131472","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"2651_CR36","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207160903477167","volume":"88","author":"Y Chen","year":"2011","unstructured":"Chen Y, Zou X, He J (2011) Drift conditions for estimating the first hitting times of evolutionary algorithms. Int J Comput Math 88(1):37\u201350","journal-title":"Int J Comput Math"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2651-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2651-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2651-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T19:22:03Z","timestamp":1749756123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2651-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,19]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["2651"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2651-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,11,19]]}}}