{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T18:27:32Z","timestamp":1719167252775},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T00:00:00Z","timestamp":1438905600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00500-015-1805-3","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T05:31:43Z","timestamp":1438839103000},"page":"501-513","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Finite life span for improving the selection scheme in evolution strategies"],"prefix":"10.1007","volume":"21","author":[{"given":"Ali","family":"Ahrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,7]]},"reference":[{"key":"1805_CR1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10898-006-9099-8","volume":"38","author":"B Addis","year":"2007","unstructured":"Addis B, Locatelli M (2007) A new class of test functions for global optimization. J Glob Optim 38:479\u2013501","journal-title":"J Glob Optim"},{"key":"1805_CR2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s11590-010-0181-2","volume":"4","author":"A Ahrari","year":"2010","unstructured":"Ahrari A, Ahrari R (2010) On the utility of randomly generated functions for performance evaluation of evolutionary algorithms. Optim Lett 4:531\u2013541","journal-title":"Optim Lett"},{"issue":"9","key":"1805_CR3","doi-asserted-by":"crossref","first-page":"3222","DOI":"10.1016\/j.amc.2009.10.009","volume":"215","author":"A Ahrari","year":"2010","unstructured":"Ahrari A, Saadatmand MR, Shariat-Panahi M, Atai AA (2010) On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms. Appl Math Comput 215(9):3222\u20133229","journal-title":"Appl Math Comput"},{"key":"1805_CR4","doi-asserted-by":"publisher","unstructured":"Ahrari A, Shariat-Panahi M (2013) An improved evolution strategy with adaptive population size. Optimization. doi: 10.1080\/02331934.2013.836651","DOI":"10.1080\/02331934.2013.836651"},{"key":"1805_CR5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2006.04.003","volume":"361","author":"DV Arnold","year":"2006","unstructured":"Arnold DV (2006) Weighted multirecombination evolution strategies. Theor Comput Sci 361:18\u201337","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1805_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1021810301763","volume":"24","author":"DV Arnold","year":"2003","unstructured":"Arnold DV, Beyer HG (2003) A comparison of evolution strategies with other direct search methods in the presence of noise. Comput Optim Appl 24(1):135\u2013159","journal-title":"Comput Optim Appl"},{"issue":"4","key":"1805_CR7","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/TAC.2004.825637","volume":"49","author":"DV Arnold","year":"2004","unstructured":"Arnold DV, Beyer H-G (2004) Performance analysis of evolutionary optimization with cumulative step length adaptation. Autom Control IEEE Trans 49(4):617\u2013622","journal-title":"Autom Control IEEE Trans"},{"issue":"4","key":"1805_CR8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s11047-006-9025-5","volume":"7","author":"DV Arnold","year":"2008","unstructured":"Arnold DV, Beyer H-G (2008) Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge. Nat Comput 7(4):555\u2013587","journal-title":"Nat Comput"},{"key":"1805_CR9","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1162\/EVCO_a_00023","volume":"18","author":"DV Arnold","year":"2010","unstructured":"Arnold DV, Beyer H-G (2010) On the behaviour of evolution strategies optimising cigar functions. Evol Comput 18:661\u2013682","journal-title":"Evol Comput"},{"key":"1805_CR10","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In: Proceedings of the IEEE Congress on Evolutionary Computation, IEEE, pp 1769\u20131776","DOI":"10.1109\/CEC.2005.1554902"},{"key":"1805_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-40137-4","volume-title":"Contemporary evolution strategies","author":"T B\u00e4ck","year":"2013","unstructured":"B\u00e4ck T, Foussette C, Krause P (2013) Contemporary evolution strategies. Springer, Berlin"},{"key":"1805_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/4235.585888","volume":"1","author":"T B\u00e4ck","year":"1997","unstructured":"B\u00e4ck T, Hammel U, Schwefel H-P (1997) Evolutionary computation: comments on the history and current state. Evol Comput IEEE Trans 1:3\u201317","journal-title":"Evol Comput IEEE Trans"},{"key":"1805_CR13","unstructured":"B\u00e4ck T, Schwefel H-P (1995) Evolution strategies I: variants and their computational implementation. In: Winter G, P\u00e9riaux J, Gal\u00e1n M, Cuesta P (eds) Genetic algorithms in engineering and computer science, Wiley, London, pp 111\u2013126"},{"issue":"5","key":"1805_CR14","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/TEVC.2013.2283968","volume":"18","author":"H Beyer","year":"2014","unstructured":"Beyer H, Melkozerov A (2014) The dynamics of self-adaptive multirecombinant evolution strategies on the general ellipsoid model. Evol Comput IEEE Trans 18(5):764\u2013778","journal-title":"Evol Comput IEEE Trans"},{"issue":"4","key":"1805_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10710-006-9017-3","volume":"7","author":"H-G Beyer","year":"2006","unstructured":"Beyer H-G, Meyer-Nieberg S (2006) Self-adaptation of evolution strategies under noisy fitness evaluations. Genet Progr Evol Mach 7(4):295\u2013328","journal-title":"Genet Progr Evol Mach"},{"issue":"1","key":"1805_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1(1):3\u201352","journal-title":"Nat Comput"},{"key":"1805_CR17","doi-asserted-by":"crossref","unstructured":"Beyer H-G, Sendhoff B (2008) Covariance matrix adaptation revisited-the CMSA evolution strategy-. In: Rudolph G, Jansen T, Beume N, Lucas S, Poloni C (eds) Parallel problem solving from nature-PPSN X. Springer, Berlin, pp 123\u2013132","DOI":"10.1007\/978-3-540-87700-4_13"},{"key":"1805_CR18","first-page":"223","volume-title":"Proc IWINAC \u201909","author":"J Chen","year":"2009","unstructured":"Chen J, Emmerich M, Li R, Kok J, B\u00e4ck T (2009) How to do recombination in evolution strategies: an empirical study. Proc IWINAC \u201909. Springer, Berlin, pp 223\u2013232"},{"key":"1805_CR19","doi-asserted-by":"crossref","unstructured":"D\u0119bski R, Drezewski R, Kisiel-Dorohinicki M (2008) Maintaining population diversity in evolution strategy for engineering problems. In: Nguyen N et al (eds) New frontiers in applied artificial intelligence. Springer, Berlin, pp 379\u2013387","DOI":"10.1007\/978-3-540-69052-8_40"},{"issue":"5","key":"1805_CR20","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/TEVC.2005.863628","volume":"10","author":"M Gallagher","year":"2006","unstructured":"Gallagher M, Yuan B (2006) A general-purpose tunable landscape generator. Evol Comput IEEE Trans 10(5):590\u2013603","journal-title":"Evol Comput IEEE Trans"},{"key":"1805_CR21","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u0131a","year":"2009","unstructured":"Garc\u0131a S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"key":"1805_CR22","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/962437.962444","volume":"29","author":"M Gaviano","year":"2003","unstructured":"Gaviano M, Kvasov DE, Lera D, Sergeyev YD (2003) Algorithm 829: software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans Math Softw (TOMS) 29:469\u2013480","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"1805_CR23","doi-asserted-by":"crossref","unstructured":"Hansen N (2009) Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: Workshop proceedings of the GECCO genetic and evolutionary computation conference, ACM, pp 2389\u20132396","DOI":"10.1145\/1570256.1570333"},{"key":"1805_CR24","unstructured":"Hansen N, Auger A, Finck S, Ros R (2010a) Real-parameter black-box optimization benchmarking 2009: experimental setup. Research report RR-7215, INRIA"},{"key":"1805_CR25","doi-asserted-by":"crossref","unstructured":"Hansen N, Auger A, Ros R, Finck S, Po\u0161\u00edk P (2010b) Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In: Proceedings of the 12th annual conference companion on Genetic and evolutionary computation, ACM, pp 1689\u20131696","DOI":"10.1145\/1830761.1830790"},{"key":"1805_CR26","doi-asserted-by":"crossref","unstructured":"Hansen N, Kern S (2004) Evaluating the CMA evolution strategy on multimodal test functions. In: Yao X, Burke EK, Lozano JA, Smith J, Merelo-Guerv\u00f3s JJ, Bullinaria JA et al (eds) Parallel problem solving from nature-PPSN VIII, Springer, Berlin, pp 282\u2013291","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"1805_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9:159\u2013195","journal-title":"Evol Comput"},{"key":"1805_CR28","doi-asserted-by":"crossref","first-page":"5755","DOI":"10.1016\/j.asoc.2011.03.001","volume":"11","author":"N Hansen","year":"2011","unstructured":"Hansen N, Ros R, Mauny N, Schoenauer M, Auger A (2011) Impacts of invariance in search: when CMA-ES and PSO faceill-conditioned and non-separable problems. Appl Soft Comput 11:5755\u20135769","journal-title":"Appl Soft Comput"},{"key":"1805_CR29","doi-asserted-by":"crossref","unstructured":"Horoba C, Jansen T, Zarges C (2009) Maximal age in randomized search heuristics with aging. In: Rothlauf F (ed) Proceedings of the 11th annual conference on genetic and evolutionary computation. ACM, NY, pp 803\u2013810","DOI":"10.1145\/1569901.1570012"},{"key":"1805_CR30","doi-asserted-by":"crossref","unstructured":"Jansen T, Zarges C (2009) Comparing different aging operators. In: Andrews PS et al. (eds) Artificial immune systems. Springer, Berlin, pp 95\u2013108","DOI":"10.1007\/978-3-642-03246-2_13"},{"key":"1805_CR31","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.tcs.2010.03.032","volume":"412","author":"T Jansen","year":"2011","unstructured":"Jansen T, Zarges C (2011a) On benefits and drawbacks of aging strategies for randomized search heuristics. Theor Comput Sci 412:543\u2013559","journal-title":"Theor Comput Sci"},{"key":"1805_CR32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s12065-011-0051-6","volume":"4","author":"T Jansen","year":"2011","unstructured":"Jansen T, Zarges C (2011b) On the role of age diversity for effective aging operators. Evol Intell 4:99\u2013125","journal-title":"Evol Intell"},{"key":"1805_CR33","doi-asserted-by":"crossref","unstructured":"Jastrebski GA, Arnold DV (2006) Improving evolution strategies through active covariance matrix adaptation. In: Evolutionary computation, CEC 2006. IEEE Congress on, IEEE, pp 2814\u20132821","DOI":"10.1109\/CEC.2006.1688662"},{"key":"1805_CR34","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-87700-4_7","volume-title":"Parallel problem solving from nature-PPSN X","author":"O Kramer","year":"2008","unstructured":"Kramer O (2008) Premature convergence in constrained continuous search spaces. In: Rudolph G et al (eds) Parallel problem solving from nature-PPSN X. Springer, Heidelberg, pp 62\u201371"},{"key":"1805_CR35","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s12065-010-0035-y","volume":"3","author":"O Kramer","year":"2010","unstructured":"Kramer O (2010a) Evolutionary self-adaptation: a survey of operators and strategy parameters. Evol Intell 3:51\u201365","journal-title":"Evol Intell"},{"key":"1805_CR36","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/185063","author":"O Kramer","year":"2010","unstructured":"Kramer O (2010) A review of constraint-handling techniques for evolution strategies. Appl Comput Intell Soft Comput. doi: 10.1155\/2010\/185063","journal-title":"Appl Comput Intell Soft Comput"},{"issue":"6","key":"1805_CR37","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1007\/s00500-012-0946-x","volume":"17","author":"T Liao","year":"2013","unstructured":"Liao T, de Oca MAM, St\u00fctzle T (2013) Computational results for an automatically tuned CMA-ES with increasing population size on the CEC\u201905 benchmark set. Soft Comput 17(6):1031\u20131046","journal-title":"Soft Comput"},{"key":"1805_CR38","doi-asserted-by":"crossref","unstructured":"Lobo FG, Lima CF (2006) On the utility of the multimodal problem generator for assessing the performance of evolutionary algorithms. In: Proceedings of GECCO\u201906, ACM, NY, pp 1233\u20131240","DOI":"10.1145\/1143997.1144191"},{"key":"1805_CR39","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10589-005-4561-y","volume":"30","author":"M Locatelli","year":"2005","unstructured":"Locatelli M (2005) On the multilevel structure of global optimization problems. Comput Optim Appl 30:5\u201322","journal-title":"Comput Optim Appl"},{"issue":"4","key":"1805_CR40","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00500-011-0781-5","volume":"16","author":"J Mar\u00edn","year":"2012","unstructured":"Mar\u00edn J (2012) How landscape ruggedness influences the performance of real-coded algorithms: a comparative study. Soft Comput 16(4):683\u2013698","journal-title":"Soft Comput"},{"key":"1805_CR41","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1080\/03081070701303470","volume":"37","author":"E Mezura-Montes","year":"2008","unstructured":"Mezura-Montes E, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37:443\u2013473","journal-title":"Int J Gen Syst"},{"key":"1805_CR42","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1007\/s00500-010-0611-1","volume":"15","author":"J R\u00f6nkk\u00f6nen","year":"2011","unstructured":"R\u00f6nkk\u00f6nen J, Li X, Kyrki V, Lampinen J (2011) A framework for generating tunable test functions for multimodal optimization. Soft Comput 15:1689\u20131706","journal-title":"Soft Comput"},{"key":"1805_CR43","doi-asserted-by":"crossref","unstructured":"Schwefel H-P, Rudolph G, B\u00e4ck T (1995) Contemporary evolution strategies. In: Mor\u00e1n F, Moreno A, Merelo JJ, Chac\u00f3n P (eds) Advances in artificial life. Springer, Berlin, pp 891\u2013907","DOI":"10.1007\/3-540-59496-5_351"},{"key":"1805_CR44","doi-asserted-by":"crossref","unstructured":"Shir O, Siedschlag C, B\u00e4ck T, Vrakking M (2006) Niching in evolution strategies and its application to laser pulse shaping. In: Proceedings of artificial evolution. Springer, Lille, France, pp 85\u201396","DOI":"10.1007\/11740698_8"},{"key":"1805_CR45","doi-asserted-by":"crossref","unstructured":"Wessing S, Preuss M, Rudolph G (2011) When parameter tuning actually is parameter control. In: Krasnogor N et al (eds) Proceedings of the 13th annual conference on genetic and evolutionary computation (GECCO\u201911). ACM, NY, pp 821\u2013828","DOI":"10.1145\/2001576.2001689"},{"key":"1805_CR46","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","author":"D Whitley","year":"1996","unstructured":"Whitley D, Rana S, Dzubera J, Mathias KE (1996) Evaluating evolutionary algorithms. Artif Intell 85:245\u2013276","journal-title":"Artif Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1805-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1805-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1805-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1805-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:49:48Z","timestamp":1653007788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1805-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,7]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1805"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1805-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,7]]}}}