{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:30:38Z","timestamp":1774456238490,"version":"3.50.1"},"reference-count":33,"publisher":"Wiley","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["14YJCZH216"],"award-info":[{"award-number":["14YJCZH216"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["61370177"],"award-info":[{"award-number":["61370177"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["14YJCZH216"],"award-info":[{"award-number":["14YJCZH216"]}],"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Although there have been many studies on the runtime of evolutionary algorithms in discrete optimization, relatively few theoretical results have been proposed on continuous optimization, such as evolutionary programming (EP). This paper proposes an analysis of the runtime of two EP algorithms based on Gaussian and Cauchy mutations, using an absorbing Markov chain. Given a constant variation, we calculate the runtime upper bound of special Gaussian mutation EP and Cauchy mutation EP. Our analysis reveals that the upper bounds are impacted by individual number, problem dimension number<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mi>n<\/mml:mi><\/mml:mrow><\/mml:math>, searching range, and the Lebesgue measure of the optimal neighborhood. Furthermore, we provide conditions whereby the average runtime of the considered EP can be no more than a polynomial of<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mi>n<\/mml:mi><\/mml:mrow><\/mml:math>. The condition is that the Lebesgue measure of the optimal neighborhood is larger than a combinatorial calculation of an exponential and the given polynomial of<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mrow><mml:mi>n<\/mml:mi><\/mml:mrow><\/mml:math>.<\/jats:p>","DOI":"10.1155\/2015\/485215","type":"journal-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T17:05:18Z","timestamp":1439399118000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms"],"prefix":"10.1155","volume":"2015","author":[{"given":"Yushan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Guangdong University of Finance and Economics, Guangzhou 510320, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiwu","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Guangdong University of Finance and Economics, Guangzhou 510320, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","year":"1966"},{"key":"2","year":"1991"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1080\/01969729308961697"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.1.1"},{"key":"6","series-title":"Sixth-Generation Computer Technology Series","year":"1995"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2003.816583"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/4235.942534"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-3975(01)00182-7"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/s0004-3702(01)00058-3"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2004.823470"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.005"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.07.001"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.016"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2011.2112665"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.011"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2012167"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.01.001"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.11.002"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2009.2014362"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.01.031"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2013.2291790"},{"key":"27","first-page":"1","year":"2014","journal-title":"Algorithmica"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2014.2354343"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1017\/s0963548312000600"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.09.013"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2012.2202241"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.042"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.10.003"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2011.605963"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2013.2257748"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1080\/00207160903477167"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2015\/485215.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2015\/485215.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2015\/485215.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T15:06:13Z","timestamp":1469631973000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/cin\/2015\/485215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":33,"alternative-id":["485215","485215"],"URL":"https:\/\/doi.org\/10.1155\/2015\/485215","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}